/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:46:21,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:46:21,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:46:21,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:46:21,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:46:21,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:46:21,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:46:21,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:46:21,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:46:21,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:46:21,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:46:21,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:46:21,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:46:21,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:46:21,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:46:21,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:46:21,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:46:21,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:46:21,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:46:21,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:46:21,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:46:21,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:46:21,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:46:21,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:46:21,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:46:21,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:46:21,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:46:21,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:46:21,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:46:21,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:46:21,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:46:21,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:46:21,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:46:21,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:46:21,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:46:21,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:46:21,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:46:21,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:46:21,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:46:21,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:46:21,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:46:21,989 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:46:22,003 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:46:22,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:46:22,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:46:22,005 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:46:22,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:46:22,005 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:46:22,005 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:46:22,006 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:46:22,006 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:46:22,006 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:46:22,006 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:46:22,006 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:46:22,006 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:46:22,007 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:46:22,007 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:46:22,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:46:22,007 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:46:22,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:46:22,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:46:22,008 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:46:22,008 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:46:22,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:46:22,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:46:22,008 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:46:22,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:46:22,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:46:22,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:46:22,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:46:22,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:46:22,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:46:22,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:46:22,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:46:22,194 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:46:22,195 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:46:22,196 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:46:22,259 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_oZBKDu/tmp/8c1175a9708447c0a80d75f94f0ff2ae/FLAG5282df9d9 [2020-07-01 12:46:22,600 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:46:22,601 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:46:22,601 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:46:22,607 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_oZBKDu/tmp/8c1175a9708447c0a80d75f94f0ff2ae/FLAG5282df9d9 [2020-07-01 12:46:23,019 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_oZBKDu/tmp/8c1175a9708447c0a80d75f94f0ff2ae [2020-07-01 12:46:23,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:46:23,032 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:46:23,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:46:23,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:46:23,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:46:23,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466a3f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23, skipping insertion in model container [2020-07-01 12:46:23,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:46:23,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:46:23,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:46:23,302 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:46:23,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:46:23,336 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:46:23,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23 WrapperNode [2020-07-01 12:46:23,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:46:23,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:46:23,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:46:23,338 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:46:23,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:46:23,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:46:23,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:46:23,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:46:23,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:46:23,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:46:23,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:46:23,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:46:23,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:46:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:46:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:46:23,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:46:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:46:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:46:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:46:23,909 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:46:23,909 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:46:23,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:46:23 BoogieIcfgContainer [2020-07-01 12:46:23,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:46:23,915 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:46:23,915 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:46:23,917 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:46:23,918 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,936 INFO L313 BlockEncoder]: Initial Icfg 98 locations, 103 edges [2020-07-01 12:46:23,938 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:46:23,938 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:46:23,939 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:46:23,939 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:46:23,941 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:46:23,942 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:46:23,942 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:46:23,976 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:46:24,023 INFO L200 BlockEncoder]: SBE split 56 edges [2020-07-01 12:46:24,029 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:46:24,031 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:46:24,054 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 12:46:24,056 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 12:46:24,058 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:46:24,059 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:46:24,062 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 12:46:24,063 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:46:24,064 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:46:24,064 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:46:24,064 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:46:24,065 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:46:24,065 INFO L313 BlockEncoder]: Encoded RCFG 87 locations, 159 edges [2020-07-01 12:46:24,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:46:24 BasicIcfg [2020-07-01 12:46:24,066 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:46:24,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:46:24,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:46:24,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:46:24,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:46:23" (1/4) ... [2020-07-01 12:46:24,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a0ee2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:46:24, skipping insertion in model container [2020-07-01 12:46:24,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (2/4) ... [2020-07-01 12:46:24,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a0ee2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:46:24, skipping insertion in model container [2020-07-01 12:46:24,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:46:23" (3/4) ... [2020-07-01 12:46:24,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a0ee2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:46:24, skipping insertion in model container [2020-07-01 12:46:24,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:46:24" (4/4) ... [2020-07-01 12:46:24,075 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:46:24,086 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:46:24,093 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 54 error locations. [2020-07-01 12:46:24,107 INFO L251 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2020-07-01 12:46:24,131 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:46:24,131 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:46:24,131 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:46:24,131 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:46:24,131 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:46:24,132 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:46:24,132 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:46:24,132 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:46:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-07-01 12:46:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:46:24,154 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:24,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:46:24,155 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:46:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash 245702, now seen corresponding path program 1 times [2020-07-01 12:46:24,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:24,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664933522] [2020-07-01 12:46:24,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:24,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664933522] [2020-07-01 12:46:24,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:24,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:24,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212333471] [2020-07-01 12:46:24,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:24,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:24,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:24,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,355 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2020-07-01 12:46:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:24,635 INFO L93 Difference]: Finished difference Result 172 states and 301 transitions. [2020-07-01 12:46:24,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:24,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:46:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:24,650 INFO L225 Difference]: With dead ends: 172 [2020-07-01 12:46:24,650 INFO L226 Difference]: Without dead ends: 87 [2020-07-01 12:46:24,654 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-01 12:46:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-07-01 12:46:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-01 12:46:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 144 transitions. [2020-07-01 12:46:24,697 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 144 transitions. Word has length 3 [2020-07-01 12:46:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:24,697 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 144 transitions. [2020-07-01 12:46:24,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 144 transitions. [2020-07-01 12:46:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:46:24,698 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:24,698 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:46:24,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:46:24,700 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:46:24,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:24,700 INFO L82 PathProgramCache]: Analyzing trace with hash 246012, now seen corresponding path program 1 times [2020-07-01 12:46:24,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:24,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420772874] [2020-07-01 12:46:24,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:24,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420772874] [2020-07-01 12:46:24,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:24,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:24,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661456208] [2020-07-01 12:46:24,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:24,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:24,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:24,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,767 INFO L87 Difference]: Start difference. First operand 87 states and 144 transitions. Second operand 3 states. [2020-07-01 12:46:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:25,024 INFO L93 Difference]: Finished difference Result 87 states and 144 transitions. [2020-07-01 12:46:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:25,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:46:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:25,027 INFO L225 Difference]: With dead ends: 87 [2020-07-01 12:46:25,027 INFO L226 Difference]: Without dead ends: 83 [2020-07-01 12:46:25,028 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:25,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-01 12:46:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-07-01 12:46:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-01 12:46:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 136 transitions. [2020-07-01 12:46:25,037 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 136 transitions. Word has length 3 [2020-07-01 12:46:25,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:25,037 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 136 transitions. [2020-07-01 12:46:25,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 136 transitions. [2020-07-01 12:46:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:46:25,038 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:25,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:46:25,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:46:25,038 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:46:25,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash 246014, now seen corresponding path program 1 times [2020-07-01 12:46:25,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:25,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329955772] [2020-07-01 12:46:25,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:25,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329955772] [2020-07-01 12:46:25,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:25,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:25,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725980745] [2020-07-01 12:46:25,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:25,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:25,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:25,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:25,092 INFO L87 Difference]: Start difference. First operand 83 states and 136 transitions. Second operand 3 states. [2020-07-01 12:46:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:25,297 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2020-07-01 12:46:25,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:25,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:46:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:25,299 INFO L225 Difference]: With dead ends: 83 [2020-07-01 12:46:25,299 INFO L226 Difference]: Without dead ends: 79 [2020-07-01 12:46:25,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-01 12:46:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-07-01 12:46:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-01 12:46:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 128 transitions. [2020-07-01 12:46:25,306 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 128 transitions. Word has length 3 [2020-07-01 12:46:25,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:25,306 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 128 transitions. [2020-07-01 12:46:25,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 128 transitions. [2020-07-01 12:46:25,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:46:25,307 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:25,307 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:46:25,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:46:25,308 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:46:25,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:25,308 INFO L82 PathProgramCache]: Analyzing trace with hash 7622001, now seen corresponding path program 1 times [2020-07-01 12:46:25,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:25,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644362725] [2020-07-01 12:46:25,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:25,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644362725] [2020-07-01 12:46:25,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:25,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:25,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931190901] [2020-07-01 12:46:25,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:25,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:25,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:25,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:25,349 INFO L87 Difference]: Start difference. First operand 79 states and 128 transitions. Second operand 3 states. [2020-07-01 12:46:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:25,503 INFO L93 Difference]: Finished difference Result 79 states and 128 transitions. [2020-07-01 12:46:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:25,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:46:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:25,505 INFO L225 Difference]: With dead ends: 79 [2020-07-01 12:46:25,505 INFO L226 Difference]: Without dead ends: 71 [2020-07-01 12:46:25,505 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-01 12:46:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-07-01 12:46:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-01 12:46:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 112 transitions. [2020-07-01 12:46:25,511 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 112 transitions. Word has length 4 [2020-07-01 12:46:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:25,511 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 112 transitions. [2020-07-01 12:46:25,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 112 transitions. [2020-07-01 12:46:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:46:25,512 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:25,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:46:25,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:46:25,513 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:46:25,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:25,513 INFO L82 PathProgramCache]: Analyzing trace with hash 7622003, now seen corresponding path program 1 times [2020-07-01 12:46:25,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:25,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182843121] [2020-07-01 12:46:25,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:25,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182843121] [2020-07-01 12:46:25,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:25,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:25,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526104594] [2020-07-01 12:46:25,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:25,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:25,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:25,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:25,552 INFO L87 Difference]: Start difference. First operand 71 states and 112 transitions. Second operand 3 states. [2020-07-01 12:46:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:25,698 INFO L93 Difference]: Finished difference Result 71 states and 112 transitions. [2020-07-01 12:46:25,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:25,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:46:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:25,699 INFO L225 Difference]: With dead ends: 71 [2020-07-01 12:46:25,699 INFO L226 Difference]: Without dead ends: 63 [2020-07-01 12:46:25,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:25,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-01 12:46:25,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-07-01 12:46:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-01 12:46:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2020-07-01 12:46:25,705 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 4 [2020-07-01 12:46:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:25,705 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2020-07-01 12:46:25,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2020-07-01 12:46:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:46:25,706 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:25,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:46:25,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:46:25,707 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:46:25,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:25,707 INFO L82 PathProgramCache]: Analyzing trace with hash 236277354, now seen corresponding path program 1 times [2020-07-01 12:46:25,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:25,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742164860] [2020-07-01 12:46:25,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:25,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742164860] [2020-07-01 12:46:25,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:25,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:25,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091534673] [2020-07-01 12:46:25,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:25,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:25,743 INFO L87 Difference]: Start difference. First operand 63 states and 96 transitions. Second operand 3 states. [2020-07-01 12:46:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:25,866 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2020-07-01 12:46:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:25,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:46:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:25,867 INFO L225 Difference]: With dead ends: 63 [2020-07-01 12:46:25,867 INFO L226 Difference]: Without dead ends: 55 [2020-07-01 12:46:25,868 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-01 12:46:25,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-01 12:46:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-01 12:46:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2020-07-01 12:46:25,872 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 5 [2020-07-01 12:46:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:25,873 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2020-07-01 12:46:25,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2020-07-01 12:46:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:46:25,873 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:25,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:46:25,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:46:25,874 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:46:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash 236277356, now seen corresponding path program 1 times [2020-07-01 12:46:25,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:25,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731070124] [2020-07-01 12:46:25,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:25,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731070124] [2020-07-01 12:46:25,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:25,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:25,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85805572] [2020-07-01 12:46:25,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:25,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:25,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:25,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:25,915 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 3 states. [2020-07-01 12:46:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:26,029 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2020-07-01 12:46:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:26,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:46:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:26,031 INFO L225 Difference]: With dead ends: 55 [2020-07-01 12:46:26,031 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 12:46:26,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 12:46:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-01 12:46:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 12:46:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2020-07-01 12:46:26,035 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 5 [2020-07-01 12:46:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:26,036 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2020-07-01 12:46:26,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2020-07-01 12:46:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:46:26,036 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:26,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:46:26,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:46:26,037 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:46:26,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:26,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1265341785, now seen corresponding path program 1 times [2020-07-01 12:46:26,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:26,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430913693] [2020-07-01 12:46:26,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:26,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430913693] [2020-07-01 12:46:26,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:26,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:26,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182778622] [2020-07-01 12:46:26,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:26,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:26,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:26,067 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 3 states. [2020-07-01 12:46:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:26,122 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2020-07-01 12:46:26,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:26,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:46:26,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:26,123 INFO L225 Difference]: With dead ends: 54 [2020-07-01 12:46:26,123 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 12:46:26,123 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:26,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 12:46:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-01 12:46:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 12:46:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2020-07-01 12:46:26,128 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 6 [2020-07-01 12:46:26,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:26,129 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2020-07-01 12:46:26,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2020-07-01 12:46:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:46:26,130 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:26,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:46:26,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:46:26,130 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:46:26,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:26,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1265341784, now seen corresponding path program 1 times [2020-07-01 12:46:26,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:26,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443682618] [2020-07-01 12:46:26,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:26,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443682618] [2020-07-01 12:46:26,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:26,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:26,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360303522] [2020-07-01 12:46:26,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:26,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:26,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:26,163 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 3 states. [2020-07-01 12:46:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:26,240 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2020-07-01 12:46:26,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:26,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:46:26,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:26,241 INFO L225 Difference]: With dead ends: 47 [2020-07-01 12:46:26,241 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:46:26,242 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:46:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 12:46:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:46:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2020-07-01 12:46:26,245 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 6 [2020-07-01 12:46:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:26,245 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2020-07-01 12:46:26,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2020-07-01 12:46:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:46:26,246 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:26,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:46:26,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:46:26,246 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:46:26,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:26,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1265341787, now seen corresponding path program 1 times [2020-07-01 12:46:26,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:26,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222335031] [2020-07-01 12:46:26,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:26,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222335031] [2020-07-01 12:46:26,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:26,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:26,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57117590] [2020-07-01 12:46:26,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:26,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:26,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:26,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:26,275 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 3 states. [2020-07-01 12:46:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:26,346 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2020-07-01 12:46:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:26,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:46:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:26,347 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:46:26,347 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:46:26,348 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:46:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:46:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:46:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:46:26,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-07-01 12:46:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:26,349 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:46:26,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:46:26,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:46:26,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:46:26,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:46:26,393 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr51REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-07-01 12:46:26,393 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:46:26,393 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-01 12:46:26,393 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr47REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:46:26,393 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr43REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:46:26,393 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:46:26,393 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr39REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:46:26,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:46:26,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:46:26,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:46:26,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:46:26,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,394 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-01 12:46:26,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,395 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:46:26,395 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:46:26,395 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr52REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-07-01 12:46:26,395 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr48REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:46:26,395 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr44REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:46:26,396 INFO L264 CegarLoopResult]: At program point L13-1(lines 12 29) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~b~0.base)) (= 0 ULTIMATE.start_main_~b~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~a~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~b~0.base)) (<= 1 |#StackHeapBarrier|) (= 0 ULTIMATE.start_main_~c~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~MAX~0.base)) (= 0 ULTIMATE.start_main_~MAX~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~MAX~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~a~0.base))) [2020-07-01 12:46:26,396 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr40REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:46:26,396 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:46:26,396 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:46:26,396 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:46:26,396 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,396 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,396 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-01 12:46:26,396 INFO L268 CegarLoopResult]: For program point L22-1(lines 22 25) no Hoare annotation was computed. [2020-07-01 12:46:26,397 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,397 INFO L268 CegarLoopResult]: For program point L22-3(lines 22 25) no Hoare annotation was computed. [2020-07-01 12:46:26,397 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,397 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,397 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,397 INFO L268 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,397 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,397 INFO L268 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,397 INFO L268 CegarLoopResult]: For program point L14-4(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,398 INFO L268 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,398 INFO L268 CegarLoopResult]: For program point L14-6(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,398 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:46:26,398 INFO L268 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,398 INFO L268 CegarLoopResult]: For program point L14-8(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,398 INFO L268 CegarLoopResult]: For program point L14-9(lines 14 16) no Hoare annotation was computed. [2020-07-01 12:46:26,398 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:46:26,398 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr53REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-07-01 12:46:26,398 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr49REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:46:26,399 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-01 12:46:26,399 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-01 12:46:26,399 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr45REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:46:26,399 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr41REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:46:26,399 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:46:26,399 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:46:26,399 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:46:26,399 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,399 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:46:26,400 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,400 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,400 INFO L268 CegarLoopResult]: For program point L24-1(line 24) no Hoare annotation was computed. [2020-07-01 12:46:26,400 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,400 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,400 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:46:26,400 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:46:26,400 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr50REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-07-01 12:46:26,400 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr46REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:46:26,401 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:46:26,401 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr42REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:46:26,401 INFO L268 CegarLoopResult]: For program point L17-2(line 17) no Hoare annotation was computed. [2020-07-01 12:46:26,401 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr38REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:46:26,401 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 12:46:26,401 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:46:26,401 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 12:46:26,401 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:46:26,401 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:46:26,401 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,402 INFO L268 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2020-07-01 12:46:26,402 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,402 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,402 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:46:26,402 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:26,402 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 12:46:26,402 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 21) no Hoare annotation was computed. [2020-07-01 12:46:26,402 INFO L268 CegarLoopResult]: For program point L18-4(lines 18 21) no Hoare annotation was computed. [2020-07-01 12:46:26,403 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:46:26,403 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:46:26,403 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:46:26,406 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:46:26,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:26,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:26,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:46:26,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:26,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:26,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:26,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:26,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:46:26,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:26,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:26,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:46:26 BasicIcfg [2020-07-01 12:46:26,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:46:26,429 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:46:26,429 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:46:26,434 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:46:26,435 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:46:26,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:46:23" (1/5) ... [2020-07-01 12:46:26,436 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15d47842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:46:26, skipping insertion in model container [2020-07-01 12:46:26,436 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:46:26,436 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (2/5) ... [2020-07-01 12:46:26,436 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15d47842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:46:26, skipping insertion in model container [2020-07-01 12:46:26,436 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:46:26,436 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:46:23" (3/5) ... [2020-07-01 12:46:26,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15d47842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:46:26, skipping insertion in model container [2020-07-01 12:46:26,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:46:26,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:46:24" (4/5) ... [2020-07-01 12:46:26,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15d47842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:46:26, skipping insertion in model container [2020-07-01 12:46:26,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:46:26,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:46:26" (5/5) ... [2020-07-01 12:46:26,439 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:46:26,462 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:46:26,462 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:46:26,462 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:46:26,462 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:46:26,463 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:46:26,463 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:46:26,463 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:46:26,463 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:46:26,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states. [2020-07-01 12:46:26,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-07-01 12:46:26,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:46:26,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:46:26,481 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:46:26,481 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:46:26,481 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:46:26,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states. [2020-07-01 12:46:26,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-07-01 12:46:26,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:46:26,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:46:26,486 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:46:26,486 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:46:26,492 INFO L794 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue [215] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 14#L-1true [305] L-1-->L9: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (and (= v_ULTIMATE.start_main_~MAX~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~MAX~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~a~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1) |v_#valid_3|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4)) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~b~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~b~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~a~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc3.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_#t~post22=|v_ULTIMATE.start_main_#t~post22_1|, ULTIMATE.start_main_#t~mem21=|v_ULTIMATE.start_main_#t~mem21_1|, ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_1|, ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_1|, ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_1|, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_1|, #length=|v_#length_1|, ULTIMATE.start_main_~MAX~0.base=v_ULTIMATE.start_main_~MAX~0.base_1, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem17=|v_ULTIMATE.start_main_#t~mem17_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_1|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_1|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_1, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_1, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_1, ULTIMATE.start_main_~MAX~0.offset=v_ULTIMATE.start_main_~MAX~0.offset_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_#t~post22, ULTIMATE.start_main_#t~mem21, ULTIMATE.start_main_#t~mem24, ULTIMATE.start_main_#t~mem23, ULTIMATE.start_main_#t~mem20, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~mem19, #length, ULTIMATE.start_main_~MAX~0.base, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem17, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~b~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_~b~0.base, ULTIMATE.start_main_~MAX~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 56#L9true [155] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~MAX~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~MAX~0.base_4)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~MAX~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~MAX~0.base_4) v_ULTIMATE.start_main_~MAX~0.offset_4 1000))) (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~MAX~0.base_4)) (<= 0 v_ULTIMATE.start_main_~MAX~0.offset_4)) InVars {#memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_main_~MAX~0.base=v_ULTIMATE.start_main_~MAX~0.base_4, ULTIMATE.start_main_~MAX~0.offset=v_ULTIMATE.start_main_~MAX~0.offset_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_main_~MAX~0.base=v_ULTIMATE.start_main_~MAX~0.base_4, ULTIMATE.start_main_~MAX~0.offset=v_ULTIMATE.start_main_~MAX~0.offset_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 54#L9-1true [149] L9-1-->L10: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~a~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~a~0.base_4) v_ULTIMATE.start_main_~a~0.offset_4 1))) (<= (+ v_ULTIMATE.start_main_~a~0.offset_4 4) (select |v_#length_8| v_ULTIMATE.start_main_~a~0.base_4)) (<= 0 v_ULTIMATE.start_main_~a~0.offset_4) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~a~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_4, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_4, #valid=|v_#valid_10|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_4, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_4, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#memory_int] 16#L10true [137] L10-->L11: Formula: (and (<= (+ v_ULTIMATE.start_main_~b~0.offset_4 4) (select |v_#length_10| v_ULTIMATE.start_main_~b~0.base_4)) (<= 0 v_ULTIMATE.start_main_~b~0.offset_4) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~b~0.base_4)) (= (store |v_#memory_int_6| v_ULTIMATE.start_main_~b~0.base_4 (store (select |v_#memory_int_6| v_ULTIMATE.start_main_~b~0.base_4) v_ULTIMATE.start_main_~b~0.offset_4 1)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_4, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_4, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_4, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_4, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 40#L11true [216] L11-->L13-1: Formula: (and (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~c~0.base_4)) (= (store |v_#memory_int_8| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 1)) |v_#memory_int_7|) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4) (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_12| v_ULTIMATE.start_main_~c~0.base_4))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 86#L13-1true [2020-07-01 12:46:26,493 INFO L796 eck$LassoCheckResult]: Loop: 86#L13-1true [226] L13-1-->L14: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 27#L14true [203] L14-->L14-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~a~0.base_7) v_ULTIMATE.start_main_~a~0.offset_6)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_main_~a~0.base_7)) (<= (+ v_ULTIMATE.start_main_~a~0.offset_6 4) (select |v_#length_14| v_ULTIMATE.start_main_~a~0.base_7)) (<= 0 v_ULTIMATE.start_main_~a~0.offset_6)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_6, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_7, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_7, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 24#L14-1true [199] L14-1-->L14-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~a~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~a~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~a~0.base_10) v_ULTIMATE.start_main_~a~0.offset_8)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~a~0.base_10)) (<= 0 v_ULTIMATE.start_main_~a~0.offset_8)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_8, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_10, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_8, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 22#L14-2true [196] L14-2-->L14-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~a~0.offset_10) (= (select |v_#valid_20| v_ULTIMATE.start_main_~a~0.base_13) 1) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~a~0.base_13) v_ULTIMATE.start_main_~a~0.offset_10)) (<= (+ v_ULTIMATE.start_main_~a~0.offset_10 4) (select |v_#length_18| v_ULTIMATE.start_main_~a~0.base_13))) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_10, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_13, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_10, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 19#L14-3true [193] L14-3-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~b~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~b~0.base_7)) (<= 0 v_ULTIMATE.start_main_~b~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~b~0.base_7) v_ULTIMATE.start_main_~b~0.offset_6)) (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~b~0.base_7))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_7, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_6, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_7, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 17#L14-4true [190] L14-4-->L14-5: Formula: (and (<= 0 v_ULTIMATE.start_main_~b~0.offset_8) (<= (+ v_ULTIMATE.start_main_~b~0.offset_8 4) (select |v_#length_22| v_ULTIMATE.start_main_~b~0.base_10)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~b~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~b~0.base_10) v_ULTIMATE.start_main_~b~0.offset_8))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_10, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_8, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_10, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_8, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 83#L14-5true [183] L14-5-->L14-6: Formula: (and (<= 0 v_ULTIMATE.start_main_~b~0.offset_10) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~b~0.base_13)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~b~0.base_13) v_ULTIMATE.start_main_~b~0.offset_10)) (<= (+ v_ULTIMATE.start_main_~b~0.offset_10 4) (select |v_#length_24| v_ULTIMATE.start_main_~b~0.base_13))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_13, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_10, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_13, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_10, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 81#L14-6true [180] L14-6-->L14-7: Formula: (and (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~c~0.base_7) v_ULTIMATE.start_main_~c~0.offset_6)) (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~c~0.base_7)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_6) (<= (+ v_ULTIMATE.start_main_~c~0.offset_6 4) (select |v_#length_26| v_ULTIMATE.start_main_~c~0.base_7))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #memory_int=|v_#memory_int_15|, #length=|v_#length_26|, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_15|, #length=|v_#length_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 78#L14-7true [177] L14-7-->L14-8: Formula: (and (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_main_~c~0.base_10) v_ULTIMATE.start_main_~c~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~c~0.offset_8 4) (select |v_#length_28| v_ULTIMATE.start_main_~c~0.base_10)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_8) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~c~0.base_10))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_10, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_8, #memory_int=|v_#memory_int_16|, #length=|v_#length_28|, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_10, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_8, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_16|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 74#L14-8true [171] L14-8-->L14-9: Formula: (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_main_~c~0.base_13)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_10) (<= (+ v_ULTIMATE.start_main_~c~0.offset_10 4) (select |v_#length_30| v_ULTIMATE.start_main_~c~0.base_13)) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~c~0.base_13) v_ULTIMATE.start_main_~c~0.offset_10))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, #memory_int=|v_#memory_int_17|, #length=|v_#length_30|, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_17|, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 72#L14-9true [358] L14-9-->L17: Formula: (> (+ (* (* |v_ULTIMATE.start_main_#t~mem7_6| |v_ULTIMATE.start_main_#t~mem8_6|) |v_ULTIMATE.start_main_#t~mem9_6|) (* (* |v_ULTIMATE.start_main_#t~mem10_6| |v_ULTIMATE.start_main_#t~mem11_6|) |v_ULTIMATE.start_main_#t~mem12_6|)) (* (* |v_ULTIMATE.start_main_#t~mem4_6| |v_ULTIMATE.start_main_#t~mem5_6|) |v_ULTIMATE.start_main_#t~mem6_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 75#L17true [417] L17-->L17-2: Formula: (and (= 1 (select |v_#valid_72| v_ULTIMATE.start_main_~a~0.base_28)) (<= 0 v_ULTIMATE.start_main_~a~0.offset_20) (= |v_ULTIMATE.start_main_#t~mem13_5| |v_ULTIMATE.start_main_#t~post14_5|) (= (select (select |v_#memory_int_37| v_ULTIMATE.start_main_~a~0.base_28) v_ULTIMATE.start_main_~a~0.offset_20) |v_ULTIMATE.start_main_#t~mem13_5|) (<= (+ v_ULTIMATE.start_main_~a~0.offset_20 4) (select |v_#length_60| v_ULTIMATE.start_main_~a~0.base_28))) InVars {ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_20, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_60|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_28} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_20, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_37|, #length=|v_#length_60|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_5|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~post14] 70#L17-2true [418] L17-2-->L18: Formula: (and (<= 0 v_ULTIMATE.start_main_~a~0.offset_21) (= (select |v_#valid_73| v_ULTIMATE.start_main_~a~0.base_29) 1) (= (store |v_#memory_int_39| v_ULTIMATE.start_main_~a~0.base_29 (store (select |v_#memory_int_39| v_ULTIMATE.start_main_~a~0.base_29) v_ULTIMATE.start_main_~a~0.offset_21 (+ |v_ULTIMATE.start_main_#t~post14_7| 1))) |v_#memory_int_38|) (<= (+ v_ULTIMATE.start_main_~a~0.offset_21 4) (select |v_#length_61| v_ULTIMATE.start_main_~a~0.base_29))) InVars {ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_21, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_39|, #length=|v_#length_61|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_7|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_29} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_21, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_38|, #length=|v_#length_61|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_29} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int, ULTIMATE.start_main_#t~post14] 10#L18true [133] L18-->L18-1: Formula: (and (= (select (select |v_#memory_int_21| v_ULTIMATE.start_main_~a~0.base_22) v_ULTIMATE.start_main_~a~0.offset_16) |v_ULTIMATE.start_main_#t~mem15_2|) (<= (+ v_ULTIMATE.start_main_~a~0.offset_16 4) (select |v_#length_36| v_ULTIMATE.start_main_~a~0.base_22)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~a~0.base_22)) (<= 0 v_ULTIMATE.start_main_~a~0.offset_16)) InVars {#memory_int=|v_#memory_int_21|, #length=|v_#length_36|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_16, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_22, #valid=|v_#valid_43|} OutVars{ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_16, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_21|, #length=|v_#length_36|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 8#L18-1true [130] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~MAX~0.offset_6 4) (select |v_#length_38| v_ULTIMATE.start_main_~MAX~0.base_7)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~MAX~0.base_7)) (<= 0 v_ULTIMATE.start_main_~MAX~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_22| v_ULTIMATE.start_main_~MAX~0.base_7) v_ULTIMATE.start_main_~MAX~0.offset_6))) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_38|, ULTIMATE.start_main_~MAX~0.base=v_ULTIMATE.start_main_~MAX~0.base_7, ULTIMATE.start_main_~MAX~0.offset=v_ULTIMATE.start_main_~MAX~0.offset_6, #valid=|v_#valid_45|} OutVars{ULTIMATE.start_main_~MAX~0.offset=v_ULTIMATE.start_main_~MAX~0.offset_6, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_38|, ULTIMATE.start_main_~MAX~0.base=v_ULTIMATE.start_main_~MAX~0.base_7, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 7#L18-2true [267] L18-2-->L18-4: Formula: (>= |v_ULTIMATE.start_main_#t~mem16_6| |v_ULTIMATE.start_main_#t~mem15_6|) InVars {ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16] 28#L18-4true [140] L18-4-->L22: Formula: (and (= (select (select |v_#memory_int_28| v_ULTIMATE.start_main_~b~0.base_22) v_ULTIMATE.start_main_~b~0.offset_16) |v_ULTIMATE.start_main_#t~mem19_2|) (= 1 (select |v_#valid_53| v_ULTIMATE.start_main_~b~0.base_22)) (<= (+ v_ULTIMATE.start_main_~b~0.offset_16 4) (select |v_#length_46| v_ULTIMATE.start_main_~b~0.base_22)) (<= 0 v_ULTIMATE.start_main_~b~0.offset_16)) InVars {#memory_int=|v_#memory_int_28|, #length=|v_#length_46|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_22, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_16, #valid=|v_#valid_53|} OutVars{ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_22, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_16, #valid=|v_#valid_53|, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_2|, #memory_int=|v_#memory_int_28|, #length=|v_#length_46|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19] 42#L22true [219] L22-->L22-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem20_2| (select (select |v_#memory_int_29| v_ULTIMATE.start_main_~MAX~0.base_10) v_ULTIMATE.start_main_~MAX~0.offset_8)) (= 1 (select |v_#valid_55| v_ULTIMATE.start_main_~MAX~0.base_10)) (<= 0 v_ULTIMATE.start_main_~MAX~0.offset_8) (<= (+ v_ULTIMATE.start_main_~MAX~0.offset_8 4) (select |v_#length_48| v_ULTIMATE.start_main_~MAX~0.base_10))) InVars {#memory_int=|v_#memory_int_29|, #length=|v_#length_48|, ULTIMATE.start_main_~MAX~0.base=v_ULTIMATE.start_main_~MAX~0.base_10, ULTIMATE.start_main_~MAX~0.offset=v_ULTIMATE.start_main_~MAX~0.offset_8, #valid=|v_#valid_55|} OutVars{ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_2|, ULTIMATE.start_main_~MAX~0.offset=v_ULTIMATE.start_main_~MAX~0.offset_8, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_29|, #length=|v_#length_48|, ULTIMATE.start_main_~MAX~0.base=v_ULTIMATE.start_main_~MAX~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20] 38#L22-1true [276] L22-1-->L22-3: Formula: (>= |v_ULTIMATE.start_main_#t~mem20_6| |v_ULTIMATE.start_main_#t~mem19_6|) InVars {ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_6|, ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_6|} OutVars{ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_5|, ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20, ULTIMATE.start_main_#t~mem19] 13#L22-3true [187] L22-3-->L26: Formula: (and (= |v_ULTIMATE.start_main_#t~mem23_2| (select (select |v_#memory_int_35| v_ULTIMATE.start_main_~c~0.base_22) v_ULTIMATE.start_main_~c~0.offset_16)) (<= (+ v_ULTIMATE.start_main_~c~0.offset_16 4) (select |v_#length_56| v_ULTIMATE.start_main_~c~0.base_22)) (= 1 (select |v_#valid_63| v_ULTIMATE.start_main_~c~0.base_22)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_16)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_22, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_16, #memory_int=|v_#memory_int_35|, #length=|v_#length_56|, #valid=|v_#valid_63|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_22, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_16, ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_2|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_35|, #length=|v_#length_56|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem23] 31#L26true [424] L26-->L13-1: Formula: (and (= 1 (select |v_#valid_80| v_ULTIMATE.start_main_~MAX~0.base_16)) (<= 0 v_ULTIMATE.start_main_~MAX~0.offset_12) (<= (+ v_ULTIMATE.start_main_~MAX~0.offset_12 4) (select |v_#length_66| v_ULTIMATE.start_main_~MAX~0.base_16)) (<= |v_ULTIMATE.start_main_#t~mem23_10| (select (select |v_#memory_int_46| v_ULTIMATE.start_main_~MAX~0.base_16) v_ULTIMATE.start_main_~MAX~0.offset_12))) InVars {ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_10|, ULTIMATE.start_main_~MAX~0.offset=v_ULTIMATE.start_main_~MAX~0.offset_12, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_46|, #length=|v_#length_66|, ULTIMATE.start_main_~MAX~0.base=v_ULTIMATE.start_main_~MAX~0.base_16} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_9|, ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_9|, ULTIMATE.start_main_~MAX~0.offset=v_ULTIMATE.start_main_~MAX~0.offset_12, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_46|, #length=|v_#length_66|, ULTIMATE.start_main_~MAX~0.base=v_ULTIMATE.start_main_~MAX~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24, ULTIMATE.start_main_#t~mem23] 86#L13-1true [2020-07-01 12:46:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:26,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1260724284, now seen corresponding path program 1 times [2020-07-01 12:46:26,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:26,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550771850] [2020-07-01 12:46:26,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:26,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550771850] [2020-07-01 12:46:26,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:26,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:26,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746202586] [2020-07-01 12:46:26,520 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:46:26,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:26,521 INFO L82 PathProgramCache]: Analyzing trace with hash -466180432, now seen corresponding path program 1 times [2020-07-01 12:46:26,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:26,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208777947] [2020-07-01 12:46:26,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:26,530 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-01 12:46:26,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [179716485] [2020-07-01 12:46:26,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:46:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:46:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:46:26,624 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:46:27,001 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-07-01 12:46:27,343 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-07-01 12:46:27,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:27,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:27,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:27,345 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2020-07-01 12:46:27,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:27,498 INFO L93 Difference]: Finished difference Result 87 states and 144 transitions. [2020-07-01 12:46:27,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:27,501 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:46:27,504 INFO L168 Benchmark]: Toolchain (without parser) took 4473.03 ms. Allocated memory was 514.9 MB in the beginning and 591.9 MB in the end (delta: 77.1 MB). Free memory was 438.5 MB in the beginning and 399.0 MB in the end (delta: 39.5 MB). Peak memory consumption was 116.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:27,505 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.0 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:46:27,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.58 ms. Allocated memory was 514.9 MB in the beginning and 553.6 MB in the end (delta: 38.8 MB). Free memory was 437.8 MB in the beginning and 519.9 MB in the end (delta: -82.0 MB). Peak memory consumption was 27.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:27,506 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.01 ms. Allocated memory is still 553.6 MB. Free memory was 519.9 MB in the beginning and 517.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:27,507 INFO L168 Benchmark]: Boogie Preprocessor took 27.25 ms. Allocated memory is still 553.6 MB. Free memory was 517.2 MB in the beginning and 515.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:27,507 INFO L168 Benchmark]: RCFGBuilder took 505.04 ms. Allocated memory is still 553.6 MB. Free memory was 515.8 MB in the beginning and 480.1 MB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:27,508 INFO L168 Benchmark]: BlockEncodingV2 took 151.37 ms. Allocated memory is still 553.6 MB. Free memory was 480.1 MB in the beginning and 461.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:27,508 INFO L168 Benchmark]: TraceAbstraction took 2361.27 ms. Allocated memory was 553.6 MB in the beginning and 591.9 MB in the end (delta: 38.3 MB). Free memory was 460.5 MB in the beginning and 492.5 MB in the end (delta: -32.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:27,509 INFO L168 Benchmark]: BuchiAutomizer took 1073.88 ms. Allocated memory is still 591.9 MB. Free memory was 492.5 MB in the beginning and 399.0 MB in the end (delta: 93.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:27,512 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 98 locations, 103 edges - StatisticsResult: Encoded RCFG 87 locations, 159 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.0 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 304.58 ms. Allocated memory was 514.9 MB in the beginning and 553.6 MB in the end (delta: 38.8 MB). Free memory was 437.8 MB in the beginning and 519.9 MB in the end (delta: -82.0 MB). Peak memory consumption was 27.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 44.01 ms. Allocated memory is still 553.6 MB. Free memory was 519.9 MB in the beginning and 517.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.25 ms. Allocated memory is still 553.6 MB. Free memory was 517.2 MB in the beginning and 515.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 505.04 ms. Allocated memory is still 553.6 MB. Free memory was 515.8 MB in the beginning and 480.1 MB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 151.37 ms. Allocated memory is still 553.6 MB. Free memory was 480.1 MB in the beginning and 461.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2361.27 ms. Allocated memory was 553.6 MB in the beginning and 591.9 MB in the end (delta: 38.3 MB). Free memory was 460.5 MB in the beginning and 492.5 MB in the end (delta: -32.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1073.88 ms. Allocated memory is still 591.9 MB. Free memory was 492.5 MB in the beginning and 399.0 MB in the end (delta: 93.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 54 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 12:46:27,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:27,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:27,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:46:27,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:27,525 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:27,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:27,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:27,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:46:27,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:27,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((1 == \valid[b] && 0 == b) && 4 == unknown-#length-unknown[c]) && 1 == \valid[a]) && 4 == unknown-#length-unknown[b]) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == c) && 0 == a) && 1 == \valid[MAX]) && 0 == MAX) && 1 == \valid[c]) && 4 == unknown-#length-unknown[MAX]) && 4 == unknown-#length-unknown[a] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 87 locations, 54 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.2s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 87 SDtfs, 869 SDslu, 5 SDs, 0 SdLazy, 820 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 56 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:46:19.768 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_oZBKDu/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:46:27.954 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check