/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test24-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:02:30,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:02:30,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:02:30,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:02:30,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:02:30,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:02:30,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:02:30,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:02:30,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:02:30,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:02:30,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:02:30,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:02:30,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:02:30,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:02:30,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:02:30,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:02:30,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:02:30,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:02:30,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:02:30,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:02:30,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:02:30,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:02:30,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:02:30,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:02:30,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:02:30,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:02:30,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:02:30,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:02:30,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:02:30,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:02:30,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:02:30,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:02:30,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:02:30,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:02:30,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:02:30,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:02:30,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:02:30,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:02:30,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:02:30,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:02:30,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:02:30,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:02:30,731 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:02:30,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:02:30,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:02:30,737 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:02:30,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:02:30,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:02:30,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:02:30,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:02:30,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:02:30,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:02:30,739 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:02:30,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:02:30,739 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:02:30,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:02:30,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:02:30,740 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:02:30,740 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:02:30,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:02:30,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:02:30,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:02:30,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:02:30,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:02:30,744 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:02:31,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:02:31,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:02:31,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:02:31,058 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:02:31,058 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:02:31,059 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test24-1.c [2020-07-10 19:02:31,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f019f086/412e96f139514139bc4d531364ab9928/FLAG0a3f287db [2020-07-10 19:02:31,600 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:02:31,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test24-1.c [2020-07-10 19:02:31,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f019f086/412e96f139514139bc4d531364ab9928/FLAG0a3f287db [2020-07-10 19:02:31,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f019f086/412e96f139514139bc4d531364ab9928 [2020-07-10 19:02:31,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:02:31,986 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:02:31,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:02:31,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:02:31,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:02:31,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:02:31" (1/1) ... [2020-07-10 19:02:31,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a58874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:31, skipping insertion in model container [2020-07-10 19:02:31,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:02:31" (1/1) ... [2020-07-10 19:02:32,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:02:32,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:02:32,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:02:32,323 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:02:32,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:02:32,373 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:02:32,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:32 WrapperNode [2020-07-10 19:02:32,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:02:32,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:02:32,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:02:32,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:02:32,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:32" (1/1) ... [2020-07-10 19:02:32,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:32" (1/1) ... [2020-07-10 19:02:32,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:32" (1/1) ... [2020-07-10 19:02:32,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:32" (1/1) ... [2020-07-10 19:02:32,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:32" (1/1) ... [2020-07-10 19:02:32,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:32" (1/1) ... [2020-07-10 19:02:32,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:32" (1/1) ... [2020-07-10 19:02:32,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:02:32,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:02:32,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:02:32,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:02:32,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:02:32,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:02:32,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:02:32,571 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-10 19:02:32,571 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:02:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:02:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 19:02:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-10 19:02:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:02:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:02:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 19:02:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:02:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:02:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:02:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:02:32,945 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:02:32,945 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 19:02:32,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:02:32 BoogieIcfgContainer [2020-07-10 19:02:32,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:02:32,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:02:32,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:02:32,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:02:32,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:02:31" (1/3) ... [2020-07-10 19:02:32,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfa7391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:02:32, skipping insertion in model container [2020-07-10 19:02:32,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:32" (2/3) ... [2020-07-10 19:02:32,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfa7391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:02:32, skipping insertion in model container [2020-07-10 19:02:32,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:02:32" (3/3) ... [2020-07-10 19:02:32,964 INFO L109 eAbstractionObserver]: Analyzing ICFG test24-1.c [2020-07-10 19:02:32,975 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:02:32,983 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 19:02:33,000 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 19:02:33,026 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:02:33,026 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:02:33,026 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:02:33,026 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:02:33,027 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:02:33,027 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:02:33,027 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:02:33,027 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:02:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-07-10 19:02:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 19:02:33,053 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:33,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:02:33,055 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:33,060 INFO L82 PathProgramCache]: Analyzing trace with hash 606292035, now seen corresponding path program 1 times [2020-07-10 19:02:33,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:33,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1054806706] [2020-07-10 19:02:33,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:33,323 INFO L280 TraceCheckUtils]: 0: Hoare triple {69#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {55#true} is VALID [2020-07-10 19:02:33,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#true} #valid := #valid[0 := 0]; {55#true} is VALID [2020-07-10 19:02:33,324 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#true} assume 0 < #StackHeapBarrier; {55#true} is VALID [2020-07-10 19:02:33,325 INFO L280 TraceCheckUtils]: 3: Hoare triple {55#true} assume true; {55#true} is VALID [2020-07-10 19:02:33,326 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {55#true} {55#true} #69#return; {55#true} is VALID [2020-07-10 19:02:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:33,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {55#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; {55#true} is VALID [2020-07-10 19:02:33,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#true} ~b := #in~b; {55#true} is VALID [2020-07-10 19:02:33,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#true} SUMMARY for call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); srcloc: L11 {55#true} is VALID [2020-07-10 19:02:33,350 INFO L280 TraceCheckUtils]: 3: Hoare triple {55#true} #res := (if #t~mem0 == ~b then 1 else 0); {55#true} is VALID [2020-07-10 19:02:33,350 INFO L280 TraceCheckUtils]: 4: Hoare triple {55#true} havoc #t~mem0; {55#true} is VALID [2020-07-10 19:02:33,351 INFO L280 TraceCheckUtils]: 5: Hoare triple {55#true} assume true; {55#true} is VALID [2020-07-10 19:02:33,351 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {55#true} {56#false} #73#return; {56#false} is VALID [2020-07-10 19:02:33,354 INFO L263 TraceCheckUtils]: 0: Hoare triple {55#true} call ULTIMATE.init(); {69#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:02:33,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {69#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {55#true} is VALID [2020-07-10 19:02:33,355 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#true} #valid := #valid[0 := 0]; {55#true} is VALID [2020-07-10 19:02:33,356 INFO L280 TraceCheckUtils]: 3: Hoare triple {55#true} assume 0 < #StackHeapBarrier; {55#true} is VALID [2020-07-10 19:02:33,356 INFO L280 TraceCheckUtils]: 4: Hoare triple {55#true} assume true; {55#true} is VALID [2020-07-10 19:02:33,356 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {55#true} {55#true} #69#return; {55#true} is VALID [2020-07-10 19:02:33,357 INFO L263 TraceCheckUtils]: 6: Hoare triple {55#true} call #t~ret6 := main(); {55#true} is VALID [2020-07-10 19:02:33,357 INFO L280 TraceCheckUtils]: 7: Hoare triple {55#true} SUMMARY for call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(80); srcloc: mainENTRY {55#true} is VALID [2020-07-10 19:02:33,358 INFO L280 TraceCheckUtils]: 8: Hoare triple {55#true} havoc ~ad2~0.base, ~ad2~0.offset; {55#true} is VALID [2020-07-10 19:02:33,358 INFO L280 TraceCheckUtils]: 9: Hoare triple {55#true} havoc ~i~0; {55#true} is VALID [2020-07-10 19:02:33,359 INFO L280 TraceCheckUtils]: 10: Hoare triple {55#true} havoc ~pa~0.base, ~pa~0.offset; {55#true} is VALID [2020-07-10 19:02:33,359 INFO L280 TraceCheckUtils]: 11: Hoare triple {55#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {55#true} is VALID [2020-07-10 19:02:33,360 INFO L280 TraceCheckUtils]: 12: Hoare triple {55#true} ~i~0 := #t~nondet1; {55#true} is VALID [2020-07-10 19:02:33,360 INFO L280 TraceCheckUtils]: 13: Hoare triple {55#true} havoc #t~nondet1; {55#true} is VALID [2020-07-10 19:02:33,360 INFO L280 TraceCheckUtils]: 14: Hoare triple {55#true} assume ~i~0 >= 0 && ~i~0 < 10; {55#true} is VALID [2020-07-10 19:02:33,361 INFO L280 TraceCheckUtils]: 15: Hoare triple {55#true} ~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset; {55#true} is VALID [2020-07-10 19:02:33,361 INFO L280 TraceCheckUtils]: 16: Hoare triple {55#true} SUMMARY for call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4); srcloc: L23 {55#true} is VALID [2020-07-10 19:02:33,362 INFO L280 TraceCheckUtils]: 17: Hoare triple {55#true} ~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0; {55#true} is VALID [2020-07-10 19:02:33,362 INFO L280 TraceCheckUtils]: 18: Hoare triple {55#true} SUMMARY for call #t~mem2 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4); srcloc: L25 {55#true} is VALID [2020-07-10 19:02:33,363 INFO L280 TraceCheckUtils]: 19: Hoare triple {55#true} ~i~0 := #t~mem2 - 10; {55#true} is VALID [2020-07-10 19:02:33,363 INFO L280 TraceCheckUtils]: 20: Hoare triple {55#true} havoc #t~mem2; {55#true} is VALID [2020-07-10 19:02:33,365 INFO L280 TraceCheckUtils]: 21: Hoare triple {55#true} assume !true; {56#false} is VALID [2020-07-10 19:02:33,366 INFO L263 TraceCheckUtils]: 22: Hoare triple {56#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {55#true} is VALID [2020-07-10 19:02:33,366 INFO L280 TraceCheckUtils]: 23: Hoare triple {55#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; {55#true} is VALID [2020-07-10 19:02:33,367 INFO L280 TraceCheckUtils]: 24: Hoare triple {55#true} ~b := #in~b; {55#true} is VALID [2020-07-10 19:02:33,367 INFO L280 TraceCheckUtils]: 25: Hoare triple {55#true} SUMMARY for call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); srcloc: L11 {55#true} is VALID [2020-07-10 19:02:33,368 INFO L280 TraceCheckUtils]: 26: Hoare triple {55#true} #res := (if #t~mem0 == ~b then 1 else 0); {55#true} is VALID [2020-07-10 19:02:33,368 INFO L280 TraceCheckUtils]: 27: Hoare triple {55#true} havoc #t~mem0; {55#true} is VALID [2020-07-10 19:02:33,369 INFO L280 TraceCheckUtils]: 28: Hoare triple {55#true} assume true; {55#true} is VALID [2020-07-10 19:02:33,369 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {55#true} {56#false} #73#return; {56#false} is VALID [2020-07-10 19:02:33,369 INFO L280 TraceCheckUtils]: 30: Hoare triple {56#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {56#false} is VALID [2020-07-10 19:02:33,370 INFO L280 TraceCheckUtils]: 31: Hoare triple {56#false} assume 0 == #t~ret5; {56#false} is VALID [2020-07-10 19:02:33,370 INFO L280 TraceCheckUtils]: 32: Hoare triple {56#false} havoc #t~ret5; {56#false} is VALID [2020-07-10 19:02:33,371 INFO L280 TraceCheckUtils]: 33: Hoare triple {56#false} assume !false; {56#false} is VALID [2020-07-10 19:02:33,379 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-10 19:02:33,380 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:33,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1054806706] [2020-07-10 19:02:33,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:33,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 19:02:33,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064413346] [2020-07-10 19:02:33,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-07-10 19:02:33,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:33,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 19:02:33,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:33,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 19:02:33,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:33,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 19:02:33,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 19:02:33,492 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2020-07-10 19:02:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:33,808 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2020-07-10 19:02:33,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 19:02:33,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-07-10 19:02:33,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 19:02:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-07-10 19:02:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 19:02:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-07-10 19:02:33,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2020-07-10 19:02:33,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:33,978 INFO L225 Difference]: With dead ends: 73 [2020-07-10 19:02:33,978 INFO L226 Difference]: Without dead ends: 41 [2020-07-10 19:02:33,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10 19:02:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-10 19:02:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-10 19:02:34,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:34,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2020-07-10 19:02:34,063 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-10 19:02:34,063 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-10 19:02:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:34,069 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-10 19:02:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-10 19:02:34,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:34,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:34,070 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-10 19:02:34,070 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-10 19:02:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:34,075 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-10 19:02:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-10 19:02:34,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:34,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:34,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:34,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 19:02:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-07-10 19:02:34,082 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 34 [2020-07-10 19:02:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:34,083 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-07-10 19:02:34,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 19:02:34,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2020-07-10 19:02:34,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-10 19:02:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 19:02:34,143 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:34,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:02:34,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:02:34,144 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:34,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:34,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1986388344, now seen corresponding path program 1 times [2020-07-10 19:02:34,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:34,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2016040238] [2020-07-10 19:02:34,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:34,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {402#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {382#true} is VALID [2020-07-10 19:02:34,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {382#true} #valid := #valid[0 := 0]; {382#true} is VALID [2020-07-10 19:02:34,456 INFO L280 TraceCheckUtils]: 2: Hoare triple {382#true} assume 0 < #StackHeapBarrier; {382#true} is VALID [2020-07-10 19:02:34,456 INFO L280 TraceCheckUtils]: 3: Hoare triple {382#true} assume true; {382#true} is VALID [2020-07-10 19:02:34,456 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {382#true} {382#true} #69#return; {382#true} is VALID [2020-07-10 19:02:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:34,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {382#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; {382#true} is VALID [2020-07-10 19:02:34,475 INFO L280 TraceCheckUtils]: 1: Hoare triple {382#true} ~b := #in~b; {382#true} is VALID [2020-07-10 19:02:34,476 INFO L280 TraceCheckUtils]: 2: Hoare triple {382#true} SUMMARY for call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); srcloc: L11 {382#true} is VALID [2020-07-10 19:02:34,476 INFO L280 TraceCheckUtils]: 3: Hoare triple {382#true} #res := (if #t~mem0 == ~b then 1 else 0); {382#true} is VALID [2020-07-10 19:02:34,476 INFO L280 TraceCheckUtils]: 4: Hoare triple {382#true} havoc #t~mem0; {382#true} is VALID [2020-07-10 19:02:34,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {382#true} assume true; {382#true} is VALID [2020-07-10 19:02:34,477 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {382#true} {383#false} #73#return; {383#false} is VALID [2020-07-10 19:02:34,478 INFO L263 TraceCheckUtils]: 0: Hoare triple {382#true} call ULTIMATE.init(); {402#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:02:34,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {402#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {382#true} is VALID [2020-07-10 19:02:34,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {382#true} #valid := #valid[0 := 0]; {382#true} is VALID [2020-07-10 19:02:34,479 INFO L280 TraceCheckUtils]: 3: Hoare triple {382#true} assume 0 < #StackHeapBarrier; {382#true} is VALID [2020-07-10 19:02:34,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {382#true} assume true; {382#true} is VALID [2020-07-10 19:02:34,480 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {382#true} {382#true} #69#return; {382#true} is VALID [2020-07-10 19:02:34,480 INFO L263 TraceCheckUtils]: 6: Hoare triple {382#true} call #t~ret6 := main(); {382#true} is VALID [2020-07-10 19:02:34,481 INFO L280 TraceCheckUtils]: 7: Hoare triple {382#true} SUMMARY for call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(80); srcloc: mainENTRY {382#true} is VALID [2020-07-10 19:02:34,481 INFO L280 TraceCheckUtils]: 8: Hoare triple {382#true} havoc ~ad2~0.base, ~ad2~0.offset; {382#true} is VALID [2020-07-10 19:02:34,481 INFO L280 TraceCheckUtils]: 9: Hoare triple {382#true} havoc ~i~0; {382#true} is VALID [2020-07-10 19:02:34,482 INFO L280 TraceCheckUtils]: 10: Hoare triple {382#true} havoc ~pa~0.base, ~pa~0.offset; {382#true} is VALID [2020-07-10 19:02:34,482 INFO L280 TraceCheckUtils]: 11: Hoare triple {382#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {382#true} is VALID [2020-07-10 19:02:34,482 INFO L280 TraceCheckUtils]: 12: Hoare triple {382#true} ~i~0 := #t~nondet1; {382#true} is VALID [2020-07-10 19:02:34,483 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#true} havoc #t~nondet1; {382#true} is VALID [2020-07-10 19:02:34,483 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#true} assume ~i~0 >= 0 && ~i~0 < 10; {382#true} is VALID [2020-07-10 19:02:34,484 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#true} ~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset; {389#(and (= main_~ad2~0.offset |main_~#ad1~0.offset|) (= |main_~#ad1~0.base| main_~ad2~0.base))} is VALID [2020-07-10 19:02:34,485 INFO L280 TraceCheckUtils]: 16: Hoare triple {389#(and (= main_~ad2~0.offset |main_~#ad1~0.offset|) (= |main_~#ad1~0.base| main_~ad2~0.base))} SUMMARY for call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4); srcloc: L23 {390#(and (= |main_~#ad1~0.offset| main_~ad2~0.offset) (= main_~i~0 (select (select |#memory_int| main_~ad2~0.base) (+ (* main_~i~0 8) main_~ad2~0.offset))) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))))} is VALID [2020-07-10 19:02:34,487 INFO L280 TraceCheckUtils]: 17: Hoare triple {390#(and (= |main_~#ad1~0.offset| main_~ad2~0.offset) (= main_~i~0 (select (select |#memory_int| main_~ad2~0.base) (+ (* main_~i~0 8) main_~ad2~0.offset))) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))))} ~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0; {391#(and (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (= main_~i~0 (select (select |#memory_int| main_~ad2~0.base) (+ (* main_~i~0 8) main_~ad2~0.offset))))} is VALID [2020-07-10 19:02:34,489 INFO L280 TraceCheckUtils]: 18: Hoare triple {391#(and (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (= main_~i~0 (select (select |#memory_int| main_~ad2~0.base) (+ (* main_~i~0 8) main_~ad2~0.offset))))} SUMMARY for call #t~mem2 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4); srcloc: L25 {392#(<= |main_#t~mem2| (+ (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 9))} is VALID [2020-07-10 19:02:34,490 INFO L280 TraceCheckUtils]: 19: Hoare triple {392#(<= |main_#t~mem2| (+ (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 9))} ~i~0 := #t~mem2 - 10; {393#(<= (+ main_~i~0 1) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2020-07-10 19:02:34,491 INFO L280 TraceCheckUtils]: 20: Hoare triple {393#(<= (+ main_~i~0 1) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} havoc #t~mem2; {393#(<= (+ main_~i~0 1) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2020-07-10 19:02:34,492 INFO L280 TraceCheckUtils]: 21: Hoare triple {393#(<= (+ main_~i~0 1) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} SUMMARY for call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L26-5 {394#(<= (+ main_~i~0 1) |main_#t~mem3|)} is VALID [2020-07-10 19:02:34,493 INFO L280 TraceCheckUtils]: 22: Hoare triple {394#(<= (+ main_~i~0 1) |main_#t~mem3|)} assume !(~i~0 < #t~mem3); {383#false} is VALID [2020-07-10 19:02:34,494 INFO L280 TraceCheckUtils]: 23: Hoare triple {383#false} havoc #t~mem3; {383#false} is VALID [2020-07-10 19:02:34,494 INFO L263 TraceCheckUtils]: 24: Hoare triple {383#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {382#true} is VALID [2020-07-10 19:02:34,494 INFO L280 TraceCheckUtils]: 25: Hoare triple {382#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; {382#true} is VALID [2020-07-10 19:02:34,495 INFO L280 TraceCheckUtils]: 26: Hoare triple {382#true} ~b := #in~b; {382#true} is VALID [2020-07-10 19:02:34,495 INFO L280 TraceCheckUtils]: 27: Hoare triple {382#true} SUMMARY for call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); srcloc: L11 {382#true} is VALID [2020-07-10 19:02:34,495 INFO L280 TraceCheckUtils]: 28: Hoare triple {382#true} #res := (if #t~mem0 == ~b then 1 else 0); {382#true} is VALID [2020-07-10 19:02:34,496 INFO L280 TraceCheckUtils]: 29: Hoare triple {382#true} havoc #t~mem0; {382#true} is VALID [2020-07-10 19:02:34,496 INFO L280 TraceCheckUtils]: 30: Hoare triple {382#true} assume true; {382#true} is VALID [2020-07-10 19:02:34,496 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {382#true} {383#false} #73#return; {383#false} is VALID [2020-07-10 19:02:34,497 INFO L280 TraceCheckUtils]: 32: Hoare triple {383#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {383#false} is VALID [2020-07-10 19:02:34,497 INFO L280 TraceCheckUtils]: 33: Hoare triple {383#false} assume 0 == #t~ret5; {383#false} is VALID [2020-07-10 19:02:34,497 INFO L280 TraceCheckUtils]: 34: Hoare triple {383#false} havoc #t~ret5; {383#false} is VALID [2020-07-10 19:02:34,498 INFO L280 TraceCheckUtils]: 35: Hoare triple {383#false} assume !false; {383#false} is VALID [2020-07-10 19:02:34,502 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-10 19:02:34,502 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:34,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2016040238] [2020-07-10 19:02:34,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:34,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 19:02:34,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719599382] [2020-07-10 19:02:34,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2020-07-10 19:02:34,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:34,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 19:02:34,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:34,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 19:02:34,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:34,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 19:02:34,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-10 19:02:34,554 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 9 states. [2020-07-10 19:02:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:35,410 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2020-07-10 19:02:35,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 19:02:35,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2020-07-10 19:02:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 19:02:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2020-07-10 19:02:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 19:02:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2020-07-10 19:02:35,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 60 transitions. [2020-07-10 19:02:35,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:35,495 INFO L225 Difference]: With dead ends: 60 [2020-07-10 19:02:35,495 INFO L226 Difference]: Without dead ends: 46 [2020-07-10 19:02:35,497 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-07-10 19:02:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-10 19:02:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2020-07-10 19:02:35,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:35,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 43 states. [2020-07-10 19:02:35,592 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 43 states. [2020-07-10 19:02:35,593 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 43 states. [2020-07-10 19:02:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:35,596 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-10 19:02:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-10 19:02:35,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:35,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:35,598 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 46 states. [2020-07-10 19:02:35,598 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 46 states. [2020-07-10 19:02:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:35,602 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-10 19:02:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-10 19:02:35,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:35,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:35,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:35,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 19:02:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2020-07-10 19:02:35,606 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 36 [2020-07-10 19:02:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:35,607 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2020-07-10 19:02:35,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 19:02:35,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2020-07-10 19:02:35,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-10 19:02:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 19:02:35,661 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:35,661 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:02:35,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:02:35,661 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:35,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1471095088, now seen corresponding path program 1 times [2020-07-10 19:02:35,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:35,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812767495] [2020-07-10 19:02:35,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:36,184 INFO L280 TraceCheckUtils]: 0: Hoare triple {739#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {717#true} is VALID [2020-07-10 19:02:36,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {717#true} #valid := #valid[0 := 0]; {717#true} is VALID [2020-07-10 19:02:36,185 INFO L280 TraceCheckUtils]: 2: Hoare triple {717#true} assume 0 < #StackHeapBarrier; {717#true} is VALID [2020-07-10 19:02:36,185 INFO L280 TraceCheckUtils]: 3: Hoare triple {717#true} assume true; {717#true} is VALID [2020-07-10 19:02:36,185 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {717#true} {717#true} #69#return; {717#true} is VALID [2020-07-10 19:02:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:36,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {717#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; {740#(and (= check_~ad1.offset |check_#in~ad1.offset|) (= check_~ad1.base |check_#in~ad1.base|))} is VALID [2020-07-10 19:02:36,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {740#(and (= check_~ad1.offset |check_#in~ad1.offset|) (= check_~ad1.base |check_#in~ad1.base|))} ~b := #in~b; {741#(and (= check_~ad1.offset |check_#in~ad1.offset|) (= |check_#in~b| check_~b) (= check_~ad1.base |check_#in~ad1.base|))} is VALID [2020-07-10 19:02:36,355 INFO L280 TraceCheckUtils]: 2: Hoare triple {741#(and (= check_~ad1.offset |check_#in~ad1.offset|) (= |check_#in~b| check_~b) (= check_~ad1.base |check_#in~ad1.base|))} SUMMARY for call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); srcloc: L11 {742#(and (= |check_#t~mem0| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* check_~b 8)))) (= |check_#in~b| check_~b))} is VALID [2020-07-10 19:02:36,356 INFO L280 TraceCheckUtils]: 3: Hoare triple {742#(and (= |check_#t~mem0| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* check_~b 8)))) (= |check_#in~b| check_~b))} #res := (if #t~mem0 == ~b then 1 else 0); {743#(or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))} is VALID [2020-07-10 19:02:36,356 INFO L280 TraceCheckUtils]: 4: Hoare triple {743#(or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))} havoc #t~mem0; {743#(or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))} is VALID [2020-07-10 19:02:36,357 INFO L280 TraceCheckUtils]: 5: Hoare triple {743#(or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))} assume true; {743#(or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))} is VALID [2020-07-10 19:02:36,363 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {743#(or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))} {725#(and (= 0 |main_~#ad1~0.offset|) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))))} #73#return; {738#(<= 1 |main_#t~ret5|)} is VALID [2020-07-10 19:02:36,365 INFO L263 TraceCheckUtils]: 0: Hoare triple {717#true} call ULTIMATE.init(); {739#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:02:36,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {739#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {717#true} is VALID [2020-07-10 19:02:36,365 INFO L280 TraceCheckUtils]: 2: Hoare triple {717#true} #valid := #valid[0 := 0]; {717#true} is VALID [2020-07-10 19:02:36,366 INFO L280 TraceCheckUtils]: 3: Hoare triple {717#true} assume 0 < #StackHeapBarrier; {717#true} is VALID [2020-07-10 19:02:36,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {717#true} assume true; {717#true} is VALID [2020-07-10 19:02:36,366 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {717#true} {717#true} #69#return; {717#true} is VALID [2020-07-10 19:02:36,366 INFO L263 TraceCheckUtils]: 6: Hoare triple {717#true} call #t~ret6 := main(); {717#true} is VALID [2020-07-10 19:02:36,367 INFO L280 TraceCheckUtils]: 7: Hoare triple {717#true} SUMMARY for call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(80); srcloc: mainENTRY {724#(= 0 |main_~#ad1~0.offset|)} is VALID [2020-07-10 19:02:36,368 INFO L280 TraceCheckUtils]: 8: Hoare triple {724#(= 0 |main_~#ad1~0.offset|)} havoc ~ad2~0.base, ~ad2~0.offset; {724#(= 0 |main_~#ad1~0.offset|)} is VALID [2020-07-10 19:02:36,368 INFO L280 TraceCheckUtils]: 9: Hoare triple {724#(= 0 |main_~#ad1~0.offset|)} havoc ~i~0; {724#(= 0 |main_~#ad1~0.offset|)} is VALID [2020-07-10 19:02:36,369 INFO L280 TraceCheckUtils]: 10: Hoare triple {724#(= 0 |main_~#ad1~0.offset|)} havoc ~pa~0.base, ~pa~0.offset; {724#(= 0 |main_~#ad1~0.offset|)} is VALID [2020-07-10 19:02:36,369 INFO L280 TraceCheckUtils]: 11: Hoare triple {724#(= 0 |main_~#ad1~0.offset|)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {724#(= 0 |main_~#ad1~0.offset|)} is VALID [2020-07-10 19:02:36,369 INFO L280 TraceCheckUtils]: 12: Hoare triple {724#(= 0 |main_~#ad1~0.offset|)} ~i~0 := #t~nondet1; {724#(= 0 |main_~#ad1~0.offset|)} is VALID [2020-07-10 19:02:36,370 INFO L280 TraceCheckUtils]: 13: Hoare triple {724#(= 0 |main_~#ad1~0.offset|)} havoc #t~nondet1; {724#(= 0 |main_~#ad1~0.offset|)} is VALID [2020-07-10 19:02:36,371 INFO L280 TraceCheckUtils]: 14: Hoare triple {724#(= 0 |main_~#ad1~0.offset|)} assume ~i~0 >= 0 && ~i~0 < 10; {724#(= 0 |main_~#ad1~0.offset|)} is VALID [2020-07-10 19:02:36,373 INFO L280 TraceCheckUtils]: 15: Hoare triple {724#(= 0 |main_~#ad1~0.offset|)} ~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset; {724#(= 0 |main_~#ad1~0.offset|)} is VALID [2020-07-10 19:02:36,374 INFO L280 TraceCheckUtils]: 16: Hoare triple {724#(= 0 |main_~#ad1~0.offset|)} SUMMARY for call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4); srcloc: L23 {725#(and (= 0 |main_~#ad1~0.offset|) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))))} is VALID [2020-07-10 19:02:36,384 INFO L280 TraceCheckUtils]: 17: Hoare triple {725#(and (= 0 |main_~#ad1~0.offset|) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))))} ~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0; {726#(and (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (= 0 |main_~#ad1~0.offset|))} is VALID [2020-07-10 19:02:36,387 INFO L280 TraceCheckUtils]: 18: Hoare triple {726#(and (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (= 0 |main_~#ad1~0.offset|))} SUMMARY for call #t~mem2 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4); srcloc: L25 {726#(and (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (= 0 |main_~#ad1~0.offset|))} is VALID [2020-07-10 19:02:36,390 INFO L280 TraceCheckUtils]: 19: Hoare triple {726#(and (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (= 0 |main_~#ad1~0.offset|))} ~i~0 := #t~mem2 - 10; {726#(and (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (= 0 |main_~#ad1~0.offset|))} is VALID [2020-07-10 19:02:36,391 INFO L280 TraceCheckUtils]: 20: Hoare triple {726#(and (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (= 0 |main_~#ad1~0.offset|))} havoc #t~mem2; {726#(and (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (= 0 |main_~#ad1~0.offset|))} is VALID [2020-07-10 19:02:36,392 INFO L280 TraceCheckUtils]: 21: Hoare triple {726#(and (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (= 0 |main_~#ad1~0.offset|))} SUMMARY for call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L26-5 {727#(and (= 0 |main_~#ad1~0.offset|) (or (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (< |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (<= |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} is VALID [2020-07-10 19:02:36,395 INFO L280 TraceCheckUtils]: 22: Hoare triple {727#(and (= 0 |main_~#ad1~0.offset|) (or (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (< |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (<= |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} assume !!(~i~0 < #t~mem3); {728#(and (= 0 |main_~#ad1~0.offset|) (or (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (< (+ (* 8 main_~i~0) 8) (* 8 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))) (<= (+ (* 8 main_~i~0) 8) (* 8 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2020-07-10 19:02:36,396 INFO L280 TraceCheckUtils]: 23: Hoare triple {728#(and (= 0 |main_~#ad1~0.offset|) (or (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (< (+ (* 8 main_~i~0) 8) (* 8 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))) (<= (+ (* 8 main_~i~0) 8) (* 8 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} havoc #t~mem3; {728#(and (= 0 |main_~#ad1~0.offset|) (or (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (< (+ (* 8 main_~i~0) 8) (* 8 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))) (<= (+ (* 8 main_~i~0) 8) (* 8 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2020-07-10 19:02:36,397 INFO L280 TraceCheckUtils]: 24: Hoare triple {728#(and (= 0 |main_~#ad1~0.offset|) (or (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (< (+ (* 8 main_~i~0) 8) (* 8 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))) (<= (+ (* 8 main_~i~0) 8) (* 8 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} #t~pre4 := 1 + ~i~0; {728#(and (= 0 |main_~#ad1~0.offset|) (or (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (< (+ (* 8 main_~i~0) 8) (* 8 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))) (<= (+ (* 8 main_~i~0) 8) (* 8 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2020-07-10 19:02:36,398 INFO L280 TraceCheckUtils]: 25: Hoare triple {728#(and (= 0 |main_~#ad1~0.offset|) (or (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (< (+ (* 8 main_~i~0) 8) (* 8 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))) (<= (+ (* 8 main_~i~0) 8) (* 8 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} ~i~0 := 1 + ~i~0; {729#(and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= 0 |main_~#ad1~0.offset|) (or (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (< main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2020-07-10 19:02:36,399 INFO L280 TraceCheckUtils]: 26: Hoare triple {729#(and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= 0 |main_~#ad1~0.offset|) (or (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (< main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} havoc #t~pre4; {729#(and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= 0 |main_~#ad1~0.offset|) (or (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (< main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2020-07-10 19:02:36,400 INFO L280 TraceCheckUtils]: 27: Hoare triple {729#(and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= 0 |main_~#ad1~0.offset|) (or (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) 8) |main_~#ad1~0.offset|))) (< main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} SUMMARY for call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L26-5 {730#(and (= 0 |main_~#ad1~0.offset|) (or (< main_~i~0 |main_#t~mem3|) (= (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* |main_#t~mem3| 8) |main_~#ad1~0.offset|)) |main_#t~mem3|)) (<= (* 8 main_~i~0) (* 8 |main_#t~mem3|)))} is VALID [2020-07-10 19:02:36,401 INFO L280 TraceCheckUtils]: 28: Hoare triple {730#(and (= 0 |main_~#ad1~0.offset|) (or (< main_~i~0 |main_#t~mem3|) (= (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* |main_#t~mem3| 8) |main_~#ad1~0.offset|)) |main_#t~mem3|)) (<= (* 8 main_~i~0) (* 8 |main_#t~mem3|)))} assume !(~i~0 < #t~mem3); {725#(and (= 0 |main_~#ad1~0.offset|) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))))} is VALID [2020-07-10 19:02:36,401 INFO L280 TraceCheckUtils]: 29: Hoare triple {725#(and (= 0 |main_~#ad1~0.offset|) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))))} havoc #t~mem3; {725#(and (= 0 |main_~#ad1~0.offset|) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))))} is VALID [2020-07-10 19:02:36,402 INFO L263 TraceCheckUtils]: 30: Hoare triple {725#(and (= 0 |main_~#ad1~0.offset|) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))))} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {717#true} is VALID [2020-07-10 19:02:36,402 INFO L280 TraceCheckUtils]: 31: Hoare triple {717#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; {740#(and (= check_~ad1.offset |check_#in~ad1.offset|) (= check_~ad1.base |check_#in~ad1.base|))} is VALID [2020-07-10 19:02:36,403 INFO L280 TraceCheckUtils]: 32: Hoare triple {740#(and (= check_~ad1.offset |check_#in~ad1.offset|) (= check_~ad1.base |check_#in~ad1.base|))} ~b := #in~b; {741#(and (= check_~ad1.offset |check_#in~ad1.offset|) (= |check_#in~b| check_~b) (= check_~ad1.base |check_#in~ad1.base|))} is VALID [2020-07-10 19:02:36,404 INFO L280 TraceCheckUtils]: 33: Hoare triple {741#(and (= check_~ad1.offset |check_#in~ad1.offset|) (= |check_#in~b| check_~b) (= check_~ad1.base |check_#in~ad1.base|))} SUMMARY for call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); srcloc: L11 {742#(and (= |check_#t~mem0| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* check_~b 8)))) (= |check_#in~b| check_~b))} is VALID [2020-07-10 19:02:36,405 INFO L280 TraceCheckUtils]: 34: Hoare triple {742#(and (= |check_#t~mem0| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* check_~b 8)))) (= |check_#in~b| check_~b))} #res := (if #t~mem0 == ~b then 1 else 0); {743#(or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))} is VALID [2020-07-10 19:02:36,405 INFO L280 TraceCheckUtils]: 35: Hoare triple {743#(or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))} havoc #t~mem0; {743#(or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))} is VALID [2020-07-10 19:02:36,406 INFO L280 TraceCheckUtils]: 36: Hoare triple {743#(or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))} assume true; {743#(or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))} is VALID [2020-07-10 19:02:36,407 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {743#(or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))} {725#(and (= 0 |main_~#ad1~0.offset|) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))))} #73#return; {738#(<= 1 |main_#t~ret5|)} is VALID [2020-07-10 19:02:36,408 INFO L280 TraceCheckUtils]: 38: Hoare triple {738#(<= 1 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {738#(<= 1 |main_#t~ret5|)} is VALID [2020-07-10 19:02:36,408 INFO L280 TraceCheckUtils]: 39: Hoare triple {738#(<= 1 |main_#t~ret5|)} assume 0 == #t~ret5; {718#false} is VALID [2020-07-10 19:02:36,408 INFO L280 TraceCheckUtils]: 40: Hoare triple {718#false} havoc #t~ret5; {718#false} is VALID [2020-07-10 19:02:36,409 INFO L280 TraceCheckUtils]: 41: Hoare triple {718#false} assume !false; {718#false} is VALID [2020-07-10 19:02:36,417 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-10 19:02:36,417 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:36,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812767495] [2020-07-10 19:02:36,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:36,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 19:02:36,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145474206] [2020-07-10 19:02:36,419 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-10 19:02:36,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:36,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 19:02:36,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:36,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 19:02:36,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:36,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 19:02:36,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-07-10 19:02:36,485 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 15 states. [2020-07-10 19:02:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:37,910 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-10 19:02:37,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 19:02:37,910 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-10 19:02:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 19:02:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2020-07-10 19:02:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 19:02:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2020-07-10 19:02:37,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 43 transitions. [2020-07-10 19:02:37,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:37,991 INFO L225 Difference]: With dead ends: 43 [2020-07-10 19:02:37,991 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 19:02:37,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2020-07-10 19:02:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 19:02:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 19:02:37,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:37,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:37,994 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:37,994 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:37,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:37,994 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:02:37,994 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:02:37,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:37,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:37,995 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:37,995 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:37,996 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:02:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:02:37,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:37,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:37,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:37,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 19:02:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 19:02:37,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2020-07-10 19:02:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:37,998 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 19:02:37,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 19:02:37,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 19:02:37,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:02:37,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:37,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:02:38,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 19:02:38,698 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 19:02:38,699 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-10 19:02:38,699 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 19:02:38,699 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 19:02:38,700 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:02:38,700 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:02:38,700 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 19:02:38,700 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 19:02:38,700 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 19:02:38,701 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= .cse0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* .cse0 8) |main_~#ad1~0.offset|))) (= 0 |main_~#ad1~0.offset|) (= |main_~#ad1~0.offset| main_~ad2~0.offset) (<= (+ (* 8 main_~i~0) 8) (* 8 .cse0)) (= |main_~#ad1~0.base| main_~ad2~0.base))) [2020-07-10 19:02:38,701 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= .cse0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* .cse0 8) |main_~#ad1~0.offset|))) (= 0 |main_~#ad1~0.offset|) (= |main_~#ad1~0.offset| main_~ad2~0.offset) (<= (+ (* 8 main_~i~0) 8) (* 8 .cse0)) (= |main_~#ad1~0.base| main_~ad2~0.base))) [2020-07-10 19:02:38,701 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= main_~ad2~0.offset |main_~#ad1~0.offset|) (= .cse0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* .cse0 8) |main_~#ad1~0.offset|))) (<= main_~i~0 .cse0) (= 0 |main_~#ad1~0.offset|) (= |main_~#ad1~0.base| main_~ad2~0.base))) [2020-07-10 19:02:38,701 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 14 38) the Hoare annotation is: true [2020-07-10 19:02:38,702 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= main_~ad2~0.offset |main_~#ad1~0.offset|) (= 0 |main_~#ad1~0.offset|) (= |main_~#ad1~0.base| main_~ad2~0.base)) [2020-07-10 19:02:38,702 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (= 0 |main_~#ad1~0.offset|) (= |main_~#ad1~0.offset| main_~ad2~0.offset) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))) (= |main_~#ad1~0.base| main_~ad2~0.base)) [2020-07-10 19:02:38,702 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= 0 |main_~#ad1~0.offset|) [2020-07-10 19:02:38,702 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (= 0 |main_~#ad1~0.offset|) [2020-07-10 19:02:38,702 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (= 0 |main_~#ad1~0.offset|) [2020-07-10 19:02:38,702 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (= 0 |main_~#ad1~0.offset|) [2020-07-10 19:02:38,703 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-10 19:02:38,703 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-10 19:02:38,703 INFO L264 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: false [2020-07-10 19:02:38,703 INFO L264 CegarLoopResult]: At program point L16-4(line 16) the Hoare annotation is: false [2020-07-10 19:02:38,703 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: false [2020-07-10 19:02:38,703 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (.cse1 (select |#memory_int| |main_~#ad1~0.base|))) (and (= main_~ad2~0.offset |main_~#ad1~0.offset|) (= .cse0 (select .cse1 (+ (* .cse0 8) |main_~#ad1~0.offset|))) (<= main_~i~0 .cse0) (= 0 |main_~#ad1~0.offset|) (= main_~i~0 (select .cse1 (+ (* main_~i~0 8) |main_~#ad1~0.offset|))) (<= 1 |main_#t~ret5|) (= |main_~#ad1~0.base| main_~ad2~0.base))) [2020-07-10 19:02:38,704 INFO L264 CegarLoopResult]: At program point L29-1(lines 29 31) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (.cse1 (select |#memory_int| |main_~#ad1~0.base|))) (and (= main_~ad2~0.offset |main_~#ad1~0.offset|) (= .cse0 (select .cse1 (+ (* .cse0 8) |main_~#ad1~0.offset|))) (<= main_~i~0 .cse0) (= 0 |main_~#ad1~0.offset|) (= main_~i~0 (select .cse1 (+ (* main_~i~0 8) |main_~#ad1~0.offset|))) (<= 1 |main_#t~ret5|) (= |main_~#ad1~0.base| main_~ad2~0.base))) [2020-07-10 19:02:38,704 INFO L264 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: false [2020-07-10 19:02:38,704 INFO L271 CegarLoopResult]: At program point L29-3(line 29) the Hoare annotation is: true [2020-07-10 19:02:38,704 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) main_~i~0) (= 0 |main_~#ad1~0.offset|) (= |main_~#ad1~0.offset| main_~ad2~0.offset) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))) (= |main_~#ad1~0.base| main_~ad2~0.base)) [2020-07-10 19:02:38,704 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= .cse0 main_~i~0) (<= |main_#t~mem2| (+ .cse0 9)) (= 0 |main_~#ad1~0.offset|) (= |main_~#ad1~0.offset| main_~ad2~0.offset) (= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* main_~i~0 8) |main_~#ad1~0.offset|))) (= |main_~#ad1~0.base| main_~ad2~0.base))) [2020-07-10 19:02:38,705 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= main_~ad2~0.offset |main_~#ad1~0.offset|) (= .cse0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* .cse0 8) |main_~#ad1~0.offset|))) (<= |main_#t~mem2| (+ .cse0 9)) (= 0 |main_~#ad1~0.offset|) (<= (+ main_~i~0 1) .cse0) (= |main_~#ad1~0.base| main_~ad2~0.base))) [2020-07-10 19:02:38,705 INFO L264 CegarLoopResult]: At program point L21(lines 21 32) the Hoare annotation is: (= 0 |main_~#ad1~0.offset|) [2020-07-10 19:02:38,705 INFO L271 CegarLoopResult]: At program point L21-2(lines 21 32) the Hoare annotation is: true [2020-07-10 19:02:38,705 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (= 0 |main_~#ad1~0.offset|) [2020-07-10 19:02:38,705 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (= 0 |main_~#ad1~0.offset|) [2020-07-10 19:02:38,706 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 14 38) the Hoare annotation is: true [2020-07-10 19:02:38,706 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) the Hoare annotation is: false [2020-07-10 19:02:38,706 INFO L264 CegarLoopResult]: At program point L30(lines 15 38) the Hoare annotation is: false [2020-07-10 19:02:38,706 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 14 38) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-10 19:02:38,706 INFO L264 CegarLoopResult]: At program point L26-1(lines 26 28) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (.cse1 (select |#memory_int| |main_~#ad1~0.base|))) (and (= .cse0 (select .cse1 (+ (* .cse0 8) |main_~#ad1~0.offset|))) (= |main_~#ad1~0.offset| main_~ad2~0.offset) (= 0 |main_~#ad1~0.offset|) (<= |main_#t~mem3| .cse0) (or (< main_~i~0 |main_#t~mem3|) (= (select .cse1 (+ (* |main_#t~mem3| 8) |main_~#ad1~0.offset|)) |main_#t~mem3|)) (= |main_~#ad1~0.base| main_~ad2~0.base) (<= (* 8 main_~i~0) (* 8 |main_#t~mem3|)))) [2020-07-10 19:02:38,707 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |main_~#ad1~0.base|)) (.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= main_~ad2~0.offset |main_~#ad1~0.offset|) (= .cse0 (select .cse1 (+ (* .cse0 8) |main_~#ad1~0.offset|))) (= 0 |main_~#ad1~0.offset|) (= main_~i~0 (select .cse1 (+ (* main_~i~0 8) |main_~#ad1~0.offset|))) (<= |main_#t~mem3| .cse0) (= |main_~#ad1~0.base| main_~ad2~0.base) (<= (* 8 main_~i~0) (* 8 |main_#t~mem3|)))) [2020-07-10 19:02:38,707 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (= 0 |main_~#ad1~0.offset|) [2020-07-10 19:02:38,707 INFO L264 CegarLoopResult]: At program point L26-4(line 26) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= .cse0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* .cse0 8) |main_~#ad1~0.offset|))) (= 0 |main_~#ad1~0.offset|) (= |main_~#ad1~0.offset| main_~ad2~0.offset) (<= |main_#t~mem3| .cse0) (<= (+ main_~i~0 1) |main_#t~mem3|) (= |main_~#ad1~0.base| main_~ad2~0.base))) [2020-07-10 19:02:38,707 INFO L264 CegarLoopResult]: At program point L26-5(lines 26 28) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= .cse0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* .cse0 8) |main_~#ad1~0.offset|))) (<= main_~i~0 .cse0) (= |main_~#ad1~0.offset| main_~ad2~0.offset) (= 0 |main_~#ad1~0.offset|) (= |main_~#ad1~0.base| main_~ad2~0.base))) [2020-07-10 19:02:38,708 INFO L264 CegarLoopResult]: At program point L26-6(lines 26 28) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (.cse1 (select |#memory_int| |main_~#ad1~0.base|))) (and (= main_~ad2~0.offset |main_~#ad1~0.offset|) (= .cse0 (select .cse1 (+ (* .cse0 8) |main_~#ad1~0.offset|))) (<= main_~i~0 .cse0) (= 0 |main_~#ad1~0.offset|) (= main_~i~0 (select .cse1 (+ (* main_~i~0 8) |main_~#ad1~0.offset|))) (= |main_~#ad1~0.base| main_~ad2~0.base))) [2020-07-10 19:02:38,708 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 9 12) the Hoare annotation is: true [2020-07-10 19:02:38,708 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (= check_~ad1.offset |check_#in~ad1.offset|) (= |check_#in~b| check_~b) (= check_~ad1.base |check_#in~ad1.base|)) [2020-07-10 19:02:38,708 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (and (= |check_#t~mem0| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* check_~b 8)))) (= check_~ad1.offset |check_#in~ad1.offset|) (= |check_#in~b| check_~b) (= check_~ad1.base |check_#in~ad1.base|)) [2020-07-10 19:02:38,708 INFO L264 CegarLoopResult]: At program point L9(lines 9 12) the Hoare annotation is: (and (= check_~ad1.offset |check_#in~ad1.offset|) (= check_~ad1.base |check_#in~ad1.base|)) [2020-07-10 19:02:38,709 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |check_#in~ad1.base|))) (and (= |check_#t~mem0| (select .cse0 (+ |check_#in~ad1.offset| (* check_~b 8)))) (= check_~ad1.offset |check_#in~ad1.offset|) (= |check_#in~b| check_~b) (= check_~ad1.base |check_#in~ad1.base|) (or (not (= |check_#in~b| (select .cse0 (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|)))) [2020-07-10 19:02:38,709 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 9 12) the Hoare annotation is: (and (= check_~ad1.offset |check_#in~ad1.offset|) (= |check_#in~b| check_~b) (= check_~ad1.base |check_#in~ad1.base|) (or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))) [2020-07-10 19:02:38,709 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 9 12) the Hoare annotation is: (and (= check_~ad1.offset |check_#in~ad1.offset|) (= |check_#in~b| check_~b) (= check_~ad1.base |check_#in~ad1.base|) (or (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* |check_#in~b| 8))))) (<= 1 |check_#res|))) [2020-07-10 19:02:38,750 INFO L163 areAnnotationChecker]: CFG has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 19:02:38,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,769 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,772 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,772 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:02:38 BoogieIcfgContainer [2020-07-10 19:02:38,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:02:38,788 INFO L168 Benchmark]: Toolchain (without parser) took 6799.53 ms. Allocated memory was 137.9 MB in the beginning and 285.7 MB in the end (delta: 147.8 MB). Free memory was 103.0 MB in the beginning and 132.8 MB in the end (delta: -29.8 MB). Peak memory consumption was 118.1 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:38,789 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 137.9 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 19:02:38,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.81 ms. Allocated memory is still 137.9 MB. Free memory was 102.6 MB in the beginning and 92.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:38,797 INFO L168 Benchmark]: Boogie Preprocessor took 129.67 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 92.3 MB in the beginning and 179.4 MB in the end (delta: -87.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:38,799 INFO L168 Benchmark]: RCFGBuilder took 446.27 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 155.1 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:38,802 INFO L168 Benchmark]: TraceAbstraction took 5830.69 ms. Allocated memory was 201.9 MB in the beginning and 285.7 MB in the end (delta: 83.9 MB). Free memory was 155.1 MB in the beginning and 132.8 MB in the end (delta: 22.3 MB). Peak memory consumption was 106.2 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:38,815 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.81 ms. Allocated memory is still 137.9 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 387.81 ms. Allocated memory is still 137.9 MB. Free memory was 102.6 MB in the beginning and 92.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.67 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 92.3 MB in the beginning and 179.4 MB in the end (delta: -87.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 446.27 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 155.1 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5830.69 ms. Allocated memory was 201.9 MB in the beginning and 285.7 MB in the end (delta: 83.9 MB). Free memory was 155.1 MB in the beginning and 132.8 MB in the end (delta: 22.3 MB). Peak memory consumption was 106.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant [2020-07-10 19:02:38,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((unknown-#memory_int-unknown[pa][pa] == unknown-#memory_int-unknown[ad1][unknown-#memory_int-unknown[pa][pa] * 8 + ad1] && i <= unknown-#memory_int-unknown[pa][pa]) && ad1 == ad2) && 0 == ad1) && ad1 == ad2 - ProcedureContractResult [Line: 14]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for check [2020-07-10 19:02:38,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:02:38,839 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived contract for procedure check: ((ad1 == ad1 && \old(b) == b) && ad1 == ad1) && (!(\old(b) == unknown-#memory_int-unknown[ad1][ad1 + \old(b) * 8]) || 1 <= \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.9s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 105 SDtfs, 90 SDslu, 249 SDs, 0 SdLazy, 367 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 66 PreInvPairs, 80 NumberOfFragments, 784 HoareAnnotationTreeSize, 66 FomulaSimplifications, 59 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 52 FomulaSimplificationsInter, 247 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...