/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/test11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:21:48,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:21:48,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:21:48,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:21:48,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:21:48,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:21:48,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:21:48,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:21:48,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:21:48,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:21:48,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:21:48,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:21:48,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:21:48,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:21:48,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:21:48,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:21:48,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:21:48,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:21:48,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:21:48,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:21:48,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:21:48,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:21:48,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:21:48,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:21:48,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:21:48,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:21:48,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:21:48,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:21:48,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:21:48,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:21:48,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:21:48,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:21:48,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:21:48,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:21:48,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:21:48,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:21:48,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:21:48,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:21:48,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:21:48,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:21:48,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:21:48,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:21:48,152 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:21:48,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:21:48,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:21:48,154 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:21:48,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:21:48,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:21:48,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:21:48,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:21:48,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:21:48,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:21:48,155 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:21:48,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:21:48,155 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:21:48,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:21:48,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:21:48,156 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:21:48,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:21:48,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:21:48,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:21:48,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:21:48,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:21:48,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:21:48,157 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:21:48,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:21:48,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:21:48,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:21:48,449 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:21:48,450 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:21:48,451 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test11.c [2020-07-18 00:21:48,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9e0c0cc6/c2c6fadc31c94079a2e7fcb8bfeb3af7/FLAG3da365138 [2020-07-18 00:21:49,051 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:21:49,052 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test11.c [2020-07-18 00:21:49,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9e0c0cc6/c2c6fadc31c94079a2e7fcb8bfeb3af7/FLAG3da365138 [2020-07-18 00:21:49,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9e0c0cc6/c2c6fadc31c94079a2e7fcb8bfeb3af7 [2020-07-18 00:21:49,411 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:21:49,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:21:49,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:21:49,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:21:49,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:21:49,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:21:49" (1/1) ... [2020-07-18 00:21:49,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bfab701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:49, skipping insertion in model container [2020-07-18 00:21:49,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:21:49" (1/1) ... [2020-07-18 00:21:49,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:21:49,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:21:49,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:21:49,641 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:21:49,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:21:49,681 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:21:49,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:49 WrapperNode [2020-07-18 00:21:49,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:21:49,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:21:49,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:21:49,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:21:49,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:49" (1/1) ... [2020-07-18 00:21:49,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:49" (1/1) ... [2020-07-18 00:21:49,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:49" (1/1) ... [2020-07-18 00:21:49,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:49" (1/1) ... [2020-07-18 00:21:49,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:49" (1/1) ... [2020-07-18 00:21:49,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:49" (1/1) ... [2020-07-18 00:21:49,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:49" (1/1) ... [2020-07-18 00:21:49,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:21:49,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:21:49,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:21:49,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:21:49,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:49" (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-18 00:21:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:21:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:21:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2020-07-18 00:21:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:21:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:21:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:21:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-18 00:21:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2020-07-18 00:21:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:21:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:21:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-18 00:21:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:21:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:21:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:21:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:21:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:21:50,346 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:21:50,346 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:21:50,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:21:50 BoogieIcfgContainer [2020-07-18 00:21:50,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:21:50,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:21:50,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:21:50,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:21:50,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:21:49" (1/3) ... [2020-07-18 00:21:50,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4b1bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:21:50, skipping insertion in model container [2020-07-18 00:21:50,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:49" (2/3) ... [2020-07-18 00:21:50,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4b1bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:21:50, skipping insertion in model container [2020-07-18 00:21:50,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:21:50" (3/3) ... [2020-07-18 00:21:50,360 INFO L109 eAbstractionObserver]: Analyzing ICFG test11.c [2020-07-18 00:21:50,370 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:21:50,378 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:21:50,391 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:21:50,411 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:21:50,411 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:21:50,411 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:21:50,411 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:21:50,411 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:21:50,412 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:21:50,412 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:21:50,412 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:21:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2020-07-18 00:21:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 00:21:50,440 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:21:50,441 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:21:50,442 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:21:50,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:21:50,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1040052544, now seen corresponding path program 1 times [2020-07-18 00:21:50,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:21:50,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2112748245] [2020-07-18 00:21:50,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:21:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:50,874 INFO L280 TraceCheckUtils]: 0: Hoare triple {94#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {73#true} is VALID [2020-07-18 00:21:50,875 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#true} #valid := #valid[0 := 0]; {73#true} is VALID [2020-07-18 00:21:50,876 INFO L280 TraceCheckUtils]: 2: Hoare triple {73#true} assume 0 < #StackHeapBarrier; {73#true} is VALID [2020-07-18 00:21:50,876 INFO L280 TraceCheckUtils]: 3: Hoare triple {73#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {73#true} is VALID [2020-07-18 00:21:50,877 INFO L280 TraceCheckUtils]: 4: Hoare triple {73#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {73#true} is VALID [2020-07-18 00:21:50,878 INFO L280 TraceCheckUtils]: 5: Hoare triple {73#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {73#true} is VALID [2020-07-18 00:21:50,878 INFO L280 TraceCheckUtils]: 6: Hoare triple {73#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {73#true} is VALID [2020-07-18 00:21:50,878 INFO L280 TraceCheckUtils]: 7: Hoare triple {73#true} assume true; {73#true} is VALID [2020-07-18 00:21:50,879 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {73#true} {73#true} #90#return; {73#true} is VALID [2020-07-18 00:21:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:50,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {73#true} assume 0 != #t~nondet0 % 256; {73#true} is VALID [2020-07-18 00:21:50,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {73#true} is VALID [2020-07-18 00:21:50,899 INFO L280 TraceCheckUtils]: 2: Hoare triple {73#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {73#true} is VALID [2020-07-18 00:21:50,899 INFO L280 TraceCheckUtils]: 3: Hoare triple {73#true} havoc #t~nondet0; {73#true} is VALID [2020-07-18 00:21:50,900 INFO L280 TraceCheckUtils]: 4: Hoare triple {73#true} havoc #t~ite1.base, #t~ite1.offset; {73#true} is VALID [2020-07-18 00:21:50,900 INFO L280 TraceCheckUtils]: 5: Hoare triple {73#true} assume true; {73#true} is VALID [2020-07-18 00:21:50,903 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {73#true} {85#(not (= 0 main_~pc~0.base))} #94#return; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:50,905 INFO L263 TraceCheckUtils]: 0: Hoare triple {73#true} call ULTIMATE.init(); {94#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:21:50,906 INFO L280 TraceCheckUtils]: 1: Hoare triple {94#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {73#true} is VALID [2020-07-18 00:21:50,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {73#true} #valid := #valid[0 := 0]; {73#true} is VALID [2020-07-18 00:21:50,907 INFO L280 TraceCheckUtils]: 3: Hoare triple {73#true} assume 0 < #StackHeapBarrier; {73#true} is VALID [2020-07-18 00:21:50,907 INFO L280 TraceCheckUtils]: 4: Hoare triple {73#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {73#true} is VALID [2020-07-18 00:21:50,908 INFO L280 TraceCheckUtils]: 5: Hoare triple {73#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {73#true} is VALID [2020-07-18 00:21:50,908 INFO L280 TraceCheckUtils]: 6: Hoare triple {73#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {73#true} is VALID [2020-07-18 00:21:50,909 INFO L280 TraceCheckUtils]: 7: Hoare triple {73#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {73#true} is VALID [2020-07-18 00:21:50,909 INFO L280 TraceCheckUtils]: 8: Hoare triple {73#true} assume true; {73#true} is VALID [2020-07-18 00:21:50,909 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {73#true} {73#true} #90#return; {73#true} is VALID [2020-07-18 00:21:50,910 INFO L263 TraceCheckUtils]: 10: Hoare triple {73#true} call #t~ret11 := main(); {73#true} is VALID [2020-07-18 00:21:50,911 INFO L280 TraceCheckUtils]: 11: Hoare triple {73#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {84#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:50,912 INFO L280 TraceCheckUtils]: 12: Hoare triple {84#(not (= 0 |main_~#c~0.base|))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {84#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:50,913 INFO L280 TraceCheckUtils]: 13: Hoare triple {84#(not (= 0 |main_~#c~0.base|))} SUMMARY for call write~init~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-1 {84#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:50,914 INFO L280 TraceCheckUtils]: 14: Hoare triple {84#(not (= 0 |main_~#c~0.base|))} havoc #t~nondet2; {84#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:50,915 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#(not (= 0 |main_~#c~0.base|))} havoc ~pa~0.base, ~pa~0.offset; {84#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:50,917 INFO L280 TraceCheckUtils]: 16: Hoare triple {84#(not (= 0 |main_~#c~0.base|))} havoc ~pb~0.base, ~pb~0.offset; {84#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:50,918 INFO L280 TraceCheckUtils]: 17: Hoare triple {84#(not (= 0 |main_~#c~0.base|))} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:50,919 INFO L280 TraceCheckUtils]: 18: Hoare triple {85#(not (= 0 main_~pc~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:50,920 INFO L280 TraceCheckUtils]: 19: Hoare triple {85#(not (= 0 main_~pc~0.base))} SUMMARY for call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4); srcloc: L15-1 {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:50,921 INFO L280 TraceCheckUtils]: 20: Hoare triple {85#(not (= 0 main_~pc~0.base))} havoc #t~nondet3; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:50,922 INFO L280 TraceCheckUtils]: 21: Hoare triple {85#(not (= 0 main_~pc~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:50,924 INFO L280 TraceCheckUtils]: 22: Hoare triple {85#(not (= 0 main_~pc~0.base))} SUMMARY for call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4); srcloc: L16-1 {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:50,924 INFO L280 TraceCheckUtils]: 23: Hoare triple {85#(not (= 0 main_~pc~0.base))} havoc #t~nondet4; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:50,925 INFO L263 TraceCheckUtils]: 24: Hoare triple {85#(not (= 0 main_~pc~0.base))} call #t~ret5.base, #t~ret5.offset := get_dummy(); {73#true} is VALID [2020-07-18 00:21:50,925 INFO L280 TraceCheckUtils]: 25: Hoare triple {73#true} assume 0 != #t~nondet0 % 256; {73#true} is VALID [2020-07-18 00:21:50,926 INFO L280 TraceCheckUtils]: 26: Hoare triple {73#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {73#true} is VALID [2020-07-18 00:21:50,926 INFO L280 TraceCheckUtils]: 27: Hoare triple {73#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {73#true} is VALID [2020-07-18 00:21:50,926 INFO L280 TraceCheckUtils]: 28: Hoare triple {73#true} havoc #t~nondet0; {73#true} is VALID [2020-07-18 00:21:50,927 INFO L280 TraceCheckUtils]: 29: Hoare triple {73#true} havoc #t~ite1.base, #t~ite1.offset; {73#true} is VALID [2020-07-18 00:21:50,927 INFO L280 TraceCheckUtils]: 30: Hoare triple {73#true} assume true; {73#true} is VALID [2020-07-18 00:21:50,928 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {73#true} {85#(not (= 0 main_~pc~0.base))} #94#return; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:50,930 INFO L280 TraceCheckUtils]: 32: Hoare triple {85#(not (= 0 main_~pc~0.base))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:50,930 INFO L280 TraceCheckUtils]: 33: Hoare triple {85#(not (= 0 main_~pc~0.base))} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:50,931 INFO L280 TraceCheckUtils]: 34: Hoare triple {85#(not (= 0 main_~pc~0.base))} havoc #t~ret5.base, #t~ret5.offset; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:50,933 INFO L280 TraceCheckUtils]: 35: Hoare triple {85#(not (= 0 main_~pc~0.base))} #t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {93#(not |main_#t~short9|)} is VALID [2020-07-18 00:21:50,934 INFO L280 TraceCheckUtils]: 36: Hoare triple {93#(not |main_#t~short9|)} assume #t~short9; {74#false} is VALID [2020-07-18 00:21:50,934 INFO L280 TraceCheckUtils]: 37: Hoare triple {74#false} assume #t~short9; {74#false} is VALID [2020-07-18 00:21:50,934 INFO L280 TraceCheckUtils]: 38: Hoare triple {74#false} havoc #t~mem6; {74#false} is VALID [2020-07-18 00:21:50,935 INFO L280 TraceCheckUtils]: 39: Hoare triple {74#false} havoc #t~short9; {74#false} is VALID [2020-07-18 00:21:50,935 INFO L280 TraceCheckUtils]: 40: Hoare triple {74#false} havoc #t~mem7; {74#false} is VALID [2020-07-18 00:21:50,936 INFO L280 TraceCheckUtils]: 41: Hoare triple {74#false} havoc #t~short8; {74#false} is VALID [2020-07-18 00:21:50,936 INFO L280 TraceCheckUtils]: 42: Hoare triple {74#false} assume !false; {74#false} is VALID [2020-07-18 00:21:50,943 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-18 00:21:50,946 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:21:50,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2112748245] [2020-07-18 00:21:50,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:21:50,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:21:50,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648907450] [2020-07-18 00:21:50,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-18 00:21:50,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:21:50,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:21:51,046 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-18 00:21:51,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:21:51,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:21:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:21:51,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:21:51,060 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 6 states. [2020-07-18 00:21:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:51,775 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2020-07-18 00:21:51,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:21:51,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-18 00:21:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:21:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:21:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2020-07-18 00:21:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:21:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2020-07-18 00:21:51,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 98 transitions. [2020-07-18 00:21:51,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:51,948 INFO L225 Difference]: With dead ends: 93 [2020-07-18 00:21:51,948 INFO L226 Difference]: Without dead ends: 59 [2020-07-18 00:21:51,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:21:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-18 00:21:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-18 00:21:52,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:21:52,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-18 00:21:52,120 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-18 00:21:52,120 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-18 00:21:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:52,126 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-18 00:21:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-18 00:21:52,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:52,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:52,128 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-18 00:21:52,129 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-18 00:21:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:52,134 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-18 00:21:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-18 00:21:52,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:52,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:52,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:21:52,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:21:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-18 00:21:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-07-18 00:21:52,143 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 43 [2020-07-18 00:21:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:21:52,143 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-07-18 00:21:52,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:21:52,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 61 transitions. [2020-07-18 00:21:52,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-18 00:21:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-18 00:21:52,267 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:21:52,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:21:52,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:21:52,268 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:21:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:21:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash -981249608, now seen corresponding path program 1 times [2020-07-18 00:21:52,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:21:52,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [698576176] [2020-07-18 00:21:52,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:21:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:52,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {543#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {523#true} is VALID [2020-07-18 00:21:52,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#true} #valid := #valid[0 := 0]; {523#true} is VALID [2020-07-18 00:21:52,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#true} assume 0 < #StackHeapBarrier; {523#true} is VALID [2020-07-18 00:21:52,394 INFO L280 TraceCheckUtils]: 3: Hoare triple {523#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {523#true} is VALID [2020-07-18 00:21:52,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {523#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {523#true} is VALID [2020-07-18 00:21:52,394 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {523#true} is VALID [2020-07-18 00:21:52,395 INFO L280 TraceCheckUtils]: 6: Hoare triple {523#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {523#true} is VALID [2020-07-18 00:21:52,395 INFO L280 TraceCheckUtils]: 7: Hoare triple {523#true} assume true; {523#true} is VALID [2020-07-18 00:21:52,395 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {523#true} {523#true} #90#return; {523#true} is VALID [2020-07-18 00:21:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:52,402 INFO L280 TraceCheckUtils]: 0: Hoare triple {523#true} assume 0 != #t~nondet0 % 256; {523#true} is VALID [2020-07-18 00:21:52,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {523#true} is VALID [2020-07-18 00:21:52,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {523#true} is VALID [2020-07-18 00:21:52,404 INFO L280 TraceCheckUtils]: 3: Hoare triple {523#true} havoc #t~nondet0; {523#true} is VALID [2020-07-18 00:21:52,404 INFO L280 TraceCheckUtils]: 4: Hoare triple {523#true} havoc #t~ite1.base, #t~ite1.offset; {523#true} is VALID [2020-07-18 00:21:52,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#true} assume true; {523#true} is VALID [2020-07-18 00:21:52,405 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {523#true} {523#true} #94#return; {523#true} is VALID [2020-07-18 00:21:52,406 INFO L263 TraceCheckUtils]: 0: Hoare triple {523#true} call ULTIMATE.init(); {543#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:21:52,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {543#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {523#true} is VALID [2020-07-18 00:21:52,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#true} #valid := #valid[0 := 0]; {523#true} is VALID [2020-07-18 00:21:52,407 INFO L280 TraceCheckUtils]: 3: Hoare triple {523#true} assume 0 < #StackHeapBarrier; {523#true} is VALID [2020-07-18 00:21:52,408 INFO L280 TraceCheckUtils]: 4: Hoare triple {523#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {523#true} is VALID [2020-07-18 00:21:52,408 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {523#true} is VALID [2020-07-18 00:21:52,408 INFO L280 TraceCheckUtils]: 6: Hoare triple {523#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {523#true} is VALID [2020-07-18 00:21:52,408 INFO L280 TraceCheckUtils]: 7: Hoare triple {523#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {523#true} is VALID [2020-07-18 00:21:52,409 INFO L280 TraceCheckUtils]: 8: Hoare triple {523#true} assume true; {523#true} is VALID [2020-07-18 00:21:52,409 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {523#true} {523#true} #90#return; {523#true} is VALID [2020-07-18 00:21:52,409 INFO L263 TraceCheckUtils]: 10: Hoare triple {523#true} call #t~ret11 := main(); {523#true} is VALID [2020-07-18 00:21:52,410 INFO L280 TraceCheckUtils]: 11: Hoare triple {523#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {523#true} is VALID [2020-07-18 00:21:52,410 INFO L280 TraceCheckUtils]: 12: Hoare triple {523#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {523#true} is VALID [2020-07-18 00:21:52,410 INFO L280 TraceCheckUtils]: 13: Hoare triple {523#true} SUMMARY for call write~init~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-1 {523#true} is VALID [2020-07-18 00:21:52,411 INFO L280 TraceCheckUtils]: 14: Hoare triple {523#true} havoc #t~nondet2; {523#true} is VALID [2020-07-18 00:21:52,411 INFO L280 TraceCheckUtils]: 15: Hoare triple {523#true} havoc ~pa~0.base, ~pa~0.offset; {523#true} is VALID [2020-07-18 00:21:52,411 INFO L280 TraceCheckUtils]: 16: Hoare triple {523#true} havoc ~pb~0.base, ~pb~0.offset; {523#true} is VALID [2020-07-18 00:21:52,412 INFO L280 TraceCheckUtils]: 17: Hoare triple {523#true} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {523#true} is VALID [2020-07-18 00:21:52,412 INFO L280 TraceCheckUtils]: 18: Hoare triple {523#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {523#true} is VALID [2020-07-18 00:21:52,412 INFO L280 TraceCheckUtils]: 19: Hoare triple {523#true} SUMMARY for call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4); srcloc: L15-1 {523#true} is VALID [2020-07-18 00:21:52,413 INFO L280 TraceCheckUtils]: 20: Hoare triple {523#true} havoc #t~nondet3; {523#true} is VALID [2020-07-18 00:21:52,413 INFO L280 TraceCheckUtils]: 21: Hoare triple {523#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {523#true} is VALID [2020-07-18 00:21:52,413 INFO L280 TraceCheckUtils]: 22: Hoare triple {523#true} SUMMARY for call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4); srcloc: L16-1 {523#true} is VALID [2020-07-18 00:21:52,413 INFO L280 TraceCheckUtils]: 23: Hoare triple {523#true} havoc #t~nondet4; {523#true} is VALID [2020-07-18 00:21:52,414 INFO L263 TraceCheckUtils]: 24: Hoare triple {523#true} call #t~ret5.base, #t~ret5.offset := get_dummy(); {523#true} is VALID [2020-07-18 00:21:52,414 INFO L280 TraceCheckUtils]: 25: Hoare triple {523#true} assume 0 != #t~nondet0 % 256; {523#true} is VALID [2020-07-18 00:21:52,414 INFO L280 TraceCheckUtils]: 26: Hoare triple {523#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {523#true} is VALID [2020-07-18 00:21:52,415 INFO L280 TraceCheckUtils]: 27: Hoare triple {523#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {523#true} is VALID [2020-07-18 00:21:52,415 INFO L280 TraceCheckUtils]: 28: Hoare triple {523#true} havoc #t~nondet0; {523#true} is VALID [2020-07-18 00:21:52,415 INFO L280 TraceCheckUtils]: 29: Hoare triple {523#true} havoc #t~ite1.base, #t~ite1.offset; {523#true} is VALID [2020-07-18 00:21:52,416 INFO L280 TraceCheckUtils]: 30: Hoare triple {523#true} assume true; {523#true} is VALID [2020-07-18 00:21:52,416 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {523#true} {523#true} #94#return; {523#true} is VALID [2020-07-18 00:21:52,416 INFO L280 TraceCheckUtils]: 32: Hoare triple {523#true} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset; {523#true} is VALID [2020-07-18 00:21:52,418 INFO L280 TraceCheckUtils]: 33: Hoare triple {523#true} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:52,419 INFO L280 TraceCheckUtils]: 34: Hoare triple {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} havoc #t~ret5.base, #t~ret5.offset; {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:52,420 INFO L280 TraceCheckUtils]: 35: Hoare triple {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:52,421 INFO L280 TraceCheckUtils]: 36: Hoare triple {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume !#t~short9; {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:52,422 INFO L280 TraceCheckUtils]: 37: Hoare triple {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {542#|main_#t~short8|} is VALID [2020-07-18 00:21:52,422 INFO L280 TraceCheckUtils]: 38: Hoare triple {542#|main_#t~short8|} assume !#t~short8; {524#false} is VALID [2020-07-18 00:21:52,423 INFO L280 TraceCheckUtils]: 39: Hoare triple {524#false} #t~short9 := #t~short8; {524#false} is VALID [2020-07-18 00:21:52,423 INFO L280 TraceCheckUtils]: 40: Hoare triple {524#false} assume #t~short9; {524#false} is VALID [2020-07-18 00:21:52,423 INFO L280 TraceCheckUtils]: 41: Hoare triple {524#false} havoc #t~mem6; {524#false} is VALID [2020-07-18 00:21:52,424 INFO L280 TraceCheckUtils]: 42: Hoare triple {524#false} havoc #t~short9; {524#false} is VALID [2020-07-18 00:21:52,424 INFO L280 TraceCheckUtils]: 43: Hoare triple {524#false} havoc #t~mem7; {524#false} is VALID [2020-07-18 00:21:52,424 INFO L280 TraceCheckUtils]: 44: Hoare triple {524#false} havoc #t~short8; {524#false} is VALID [2020-07-18 00:21:52,425 INFO L280 TraceCheckUtils]: 45: Hoare triple {524#false} assume !false; {524#false} is VALID [2020-07-18 00:21:52,428 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-18 00:21:52,428 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:21:52,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [698576176] [2020-07-18 00:21:52,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:21:52,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:21:52,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906192428] [2020-07-18 00:21:52,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-07-18 00:21:52,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:21:52,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:21:52,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:52,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:21:52,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:21:52,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:21:52,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:21:52,479 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2020-07-18 00:21:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:52,955 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-07-18 00:21:52,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:21:52,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-07-18 00:21:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:21:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:21:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2020-07-18 00:21:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:21:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2020-07-18 00:21:52,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2020-07-18 00:21:53,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:53,067 INFO L225 Difference]: With dead ends: 75 [2020-07-18 00:21:53,067 INFO L226 Difference]: Without dead ends: 59 [2020-07-18 00:21:53,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:21:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-18 00:21:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-18 00:21:53,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:21:53,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-18 00:21:53,230 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-18 00:21:53,230 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-18 00:21:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:53,235 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-18 00:21:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-18 00:21:53,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:53,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:53,236 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-18 00:21:53,236 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-18 00:21:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:53,240 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-18 00:21:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-18 00:21:53,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:53,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:53,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:21:53,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:21:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-18 00:21:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-07-18 00:21:53,244 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 46 [2020-07-18 00:21:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:21:53,245 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-07-18 00:21:53,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:21:53,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 60 transitions. [2020-07-18 00:21:53,311 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-18 00:21:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-18 00:21:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-18 00:21:53,314 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:21:53,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:21:53,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:21:53,315 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:21:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:21:53,315 INFO L82 PathProgramCache]: Analyzing trace with hash 176769226, now seen corresponding path program 1 times [2020-07-18 00:21:53,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:21:53,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042201041] [2020-07-18 00:21:53,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:21:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:53,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {957#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {934#true} is VALID [2020-07-18 00:21:53,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {934#true} #valid := #valid[0 := 0]; {934#true} is VALID [2020-07-18 00:21:53,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {934#true} assume 0 < #StackHeapBarrier; {934#true} is VALID [2020-07-18 00:21:53,490 INFO L280 TraceCheckUtils]: 3: Hoare triple {934#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {934#true} is VALID [2020-07-18 00:21:53,490 INFO L280 TraceCheckUtils]: 4: Hoare triple {934#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {934#true} is VALID [2020-07-18 00:21:53,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {934#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {934#true} is VALID [2020-07-18 00:21:53,491 INFO L280 TraceCheckUtils]: 6: Hoare triple {934#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {934#true} is VALID [2020-07-18 00:21:53,491 INFO L280 TraceCheckUtils]: 7: Hoare triple {934#true} assume true; {934#true} is VALID [2020-07-18 00:21:53,492 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {934#true} {934#true} #90#return; {934#true} is VALID [2020-07-18 00:21:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:53,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {934#true} assume 0 != #t~nondet0 % 256; {934#true} is VALID [2020-07-18 00:21:53,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {934#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {934#true} is VALID [2020-07-18 00:21:53,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {934#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {934#true} is VALID [2020-07-18 00:21:53,507 INFO L280 TraceCheckUtils]: 3: Hoare triple {934#true} havoc #t~nondet0; {934#true} is VALID [2020-07-18 00:21:53,508 INFO L280 TraceCheckUtils]: 4: Hoare triple {934#true} havoc #t~ite1.base, #t~ite1.offset; {934#true} is VALID [2020-07-18 00:21:53,508 INFO L280 TraceCheckUtils]: 5: Hoare triple {934#true} assume true; {934#true} is VALID [2020-07-18 00:21:53,509 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {934#true} {934#true} #94#return; {934#true} is VALID [2020-07-18 00:21:53,512 INFO L263 TraceCheckUtils]: 0: Hoare triple {934#true} call ULTIMATE.init(); {957#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:21:53,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {957#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {934#true} is VALID [2020-07-18 00:21:53,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {934#true} #valid := #valid[0 := 0]; {934#true} is VALID [2020-07-18 00:21:53,513 INFO L280 TraceCheckUtils]: 3: Hoare triple {934#true} assume 0 < #StackHeapBarrier; {934#true} is VALID [2020-07-18 00:21:53,513 INFO L280 TraceCheckUtils]: 4: Hoare triple {934#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {934#true} is VALID [2020-07-18 00:21:53,514 INFO L280 TraceCheckUtils]: 5: Hoare triple {934#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {934#true} is VALID [2020-07-18 00:21:53,514 INFO L280 TraceCheckUtils]: 6: Hoare triple {934#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {934#true} is VALID [2020-07-18 00:21:53,514 INFO L280 TraceCheckUtils]: 7: Hoare triple {934#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {934#true} is VALID [2020-07-18 00:21:53,515 INFO L280 TraceCheckUtils]: 8: Hoare triple {934#true} assume true; {934#true} is VALID [2020-07-18 00:21:53,515 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {934#true} {934#true} #90#return; {934#true} is VALID [2020-07-18 00:21:53,515 INFO L263 TraceCheckUtils]: 10: Hoare triple {934#true} call #t~ret11 := main(); {934#true} is VALID [2020-07-18 00:21:53,515 INFO L280 TraceCheckUtils]: 11: Hoare triple {934#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {934#true} is VALID [2020-07-18 00:21:53,516 INFO L280 TraceCheckUtils]: 12: Hoare triple {934#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {934#true} is VALID [2020-07-18 00:21:53,521 INFO L280 TraceCheckUtils]: 13: Hoare triple {934#true} SUMMARY for call write~init~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-1 {934#true} is VALID [2020-07-18 00:21:53,522 INFO L280 TraceCheckUtils]: 14: Hoare triple {934#true} havoc #t~nondet2; {934#true} is VALID [2020-07-18 00:21:53,522 INFO L280 TraceCheckUtils]: 15: Hoare triple {934#true} havoc ~pa~0.base, ~pa~0.offset; {934#true} is VALID [2020-07-18 00:21:53,522 INFO L280 TraceCheckUtils]: 16: Hoare triple {934#true} havoc ~pb~0.base, ~pb~0.offset; {934#true} is VALID [2020-07-18 00:21:53,523 INFO L280 TraceCheckUtils]: 17: Hoare triple {934#true} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {934#true} is VALID [2020-07-18 00:21:53,523 INFO L280 TraceCheckUtils]: 18: Hoare triple {934#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {934#true} is VALID [2020-07-18 00:21:53,523 INFO L280 TraceCheckUtils]: 19: Hoare triple {934#true} SUMMARY for call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4); srcloc: L15-1 {934#true} is VALID [2020-07-18 00:21:53,524 INFO L280 TraceCheckUtils]: 20: Hoare triple {934#true} havoc #t~nondet3; {934#true} is VALID [2020-07-18 00:21:53,527 INFO L280 TraceCheckUtils]: 21: Hoare triple {934#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {934#true} is VALID [2020-07-18 00:21:53,527 INFO L280 TraceCheckUtils]: 22: Hoare triple {934#true} SUMMARY for call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4); srcloc: L16-1 {934#true} is VALID [2020-07-18 00:21:53,527 INFO L280 TraceCheckUtils]: 23: Hoare triple {934#true} havoc #t~nondet4; {934#true} is VALID [2020-07-18 00:21:53,528 INFO L263 TraceCheckUtils]: 24: Hoare triple {934#true} call #t~ret5.base, #t~ret5.offset := get_dummy(); {934#true} is VALID [2020-07-18 00:21:53,528 INFO L280 TraceCheckUtils]: 25: Hoare triple {934#true} assume 0 != #t~nondet0 % 256; {934#true} is VALID [2020-07-18 00:21:53,528 INFO L280 TraceCheckUtils]: 26: Hoare triple {934#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {934#true} is VALID [2020-07-18 00:21:53,529 INFO L280 TraceCheckUtils]: 27: Hoare triple {934#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {934#true} is VALID [2020-07-18 00:21:53,529 INFO L280 TraceCheckUtils]: 28: Hoare triple {934#true} havoc #t~nondet0; {934#true} is VALID [2020-07-18 00:21:53,530 INFO L280 TraceCheckUtils]: 29: Hoare triple {934#true} havoc #t~ite1.base, #t~ite1.offset; {934#true} is VALID [2020-07-18 00:21:53,530 INFO L280 TraceCheckUtils]: 30: Hoare triple {934#true} assume true; {934#true} is VALID [2020-07-18 00:21:53,531 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {934#true} {934#true} #94#return; {934#true} is VALID [2020-07-18 00:21:53,532 INFO L280 TraceCheckUtils]: 32: Hoare triple {934#true} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset; {934#true} is VALID [2020-07-18 00:21:53,533 INFO L280 TraceCheckUtils]: 33: Hoare triple {934#true} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:53,534 INFO L280 TraceCheckUtils]: 34: Hoare triple {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} havoc #t~ret5.base, #t~ret5.offset; {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:53,536 INFO L280 TraceCheckUtils]: 35: Hoare triple {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:53,537 INFO L280 TraceCheckUtils]: 36: Hoare triple {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume !#t~short9; {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:53,538 INFO L280 TraceCheckUtils]: 37: Hoare triple {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:53,539 INFO L280 TraceCheckUtils]: 38: Hoare triple {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume #t~short8; {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:53,540 INFO L280 TraceCheckUtils]: 39: Hoare triple {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} SUMMARY for call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L19-2 {953#(= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|)} is VALID [2020-07-18 00:21:53,541 INFO L280 TraceCheckUtils]: 40: Hoare triple {953#(= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|)} SUMMARY for call #t~mem7 := read~int(~pb~0.base, ~pb~0.offset, 4); srcloc: L19-3 {954#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2020-07-18 00:21:53,542 INFO L280 TraceCheckUtils]: 41: Hoare triple {954#(= |main_#t~mem7| |main_#t~mem6|)} #t~short8 := #t~mem6 != #t~mem7; {955#(not |main_#t~short8|)} is VALID [2020-07-18 00:21:53,543 INFO L280 TraceCheckUtils]: 42: Hoare triple {955#(not |main_#t~short8|)} #t~short9 := #t~short8; {956#(not |main_#t~short9|)} is VALID [2020-07-18 00:21:53,544 INFO L280 TraceCheckUtils]: 43: Hoare triple {956#(not |main_#t~short9|)} assume #t~short9; {935#false} is VALID [2020-07-18 00:21:53,545 INFO L280 TraceCheckUtils]: 44: Hoare triple {935#false} havoc #t~mem6; {935#false} is VALID [2020-07-18 00:21:53,545 INFO L280 TraceCheckUtils]: 45: Hoare triple {935#false} havoc #t~short9; {935#false} is VALID [2020-07-18 00:21:53,546 INFO L280 TraceCheckUtils]: 46: Hoare triple {935#false} havoc #t~mem7; {935#false} is VALID [2020-07-18 00:21:53,546 INFO L280 TraceCheckUtils]: 47: Hoare triple {935#false} havoc #t~short8; {935#false} is VALID [2020-07-18 00:21:53,546 INFO L280 TraceCheckUtils]: 48: Hoare triple {935#false} assume !false; {935#false} is VALID [2020-07-18 00:21:53,553 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-18 00:21:53,554 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:21:53,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042201041] [2020-07-18 00:21:53,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:21:53,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:21:53,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583723157] [2020-07-18 00:21:53,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-07-18 00:21:53,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:21:53,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:21:53,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:53,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:21:53,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:21:53,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:21:53,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:21:53,624 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 8 states. [2020-07-18 00:21:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:54,308 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2020-07-18 00:21:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:21:54,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-07-18 00:21:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:21:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:21:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2020-07-18 00:21:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:21:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2020-07-18 00:21:54,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2020-07-18 00:21:54,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:54,402 INFO L225 Difference]: With dead ends: 61 [2020-07-18 00:21:54,402 INFO L226 Difference]: Without dead ends: 55 [2020-07-18 00:21:54,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-07-18 00:21:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-18 00:21:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-18 00:21:54,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:21:54,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-18 00:21:54,516 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-18 00:21:54,516 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-18 00:21:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:54,525 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-07-18 00:21:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2020-07-18 00:21:54,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:54,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:54,527 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-18 00:21:54,527 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-18 00:21:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:54,533 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-07-18 00:21:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2020-07-18 00:21:54,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:54,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:54,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:21:54,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:21:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-18 00:21:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2020-07-18 00:21:54,540 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 49 [2020-07-18 00:21:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:21:54,543 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2020-07-18 00:21:54,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:21:54,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2020-07-18 00:21:54,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2020-07-18 00:21:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-18 00:21:54,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:21:54,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:21:54,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:21:54,631 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:21:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:21:54,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1988535102, now seen corresponding path program 1 times [2020-07-18 00:21:54,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:21:54,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [345173738] [2020-07-18 00:21:54,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:21:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:54,769 INFO L280 TraceCheckUtils]: 0: Hoare triple {1335#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {1314#true} is VALID [2020-07-18 00:21:54,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {1314#true} #valid := #valid[0 := 0]; {1314#true} is VALID [2020-07-18 00:21:54,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {1314#true} assume 0 < #StackHeapBarrier; {1314#true} is VALID [2020-07-18 00:21:54,770 INFO L280 TraceCheckUtils]: 3: Hoare triple {1314#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {1314#true} is VALID [2020-07-18 00:21:54,770 INFO L280 TraceCheckUtils]: 4: Hoare triple {1314#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {1314#true} is VALID [2020-07-18 00:21:54,770 INFO L280 TraceCheckUtils]: 5: Hoare triple {1314#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {1314#true} is VALID [2020-07-18 00:21:54,770 INFO L280 TraceCheckUtils]: 6: Hoare triple {1314#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {1314#true} is VALID [2020-07-18 00:21:54,771 INFO L280 TraceCheckUtils]: 7: Hoare triple {1314#true} assume true; {1314#true} is VALID [2020-07-18 00:21:54,771 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1314#true} {1314#true} #90#return; {1314#true} is VALID [2020-07-18 00:21:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:54,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {1314#true} assume 0 != #t~nondet0 % 256; {1314#true} is VALID [2020-07-18 00:21:54,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {1314#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {1314#true} is VALID [2020-07-18 00:21:54,782 INFO L280 TraceCheckUtils]: 2: Hoare triple {1314#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {1314#true} is VALID [2020-07-18 00:21:54,782 INFO L280 TraceCheckUtils]: 3: Hoare triple {1314#true} havoc #t~nondet0; {1314#true} is VALID [2020-07-18 00:21:54,782 INFO L280 TraceCheckUtils]: 4: Hoare triple {1314#true} havoc #t~ite1.base, #t~ite1.offset; {1314#true} is VALID [2020-07-18 00:21:54,782 INFO L280 TraceCheckUtils]: 5: Hoare triple {1314#true} assume true; {1314#true} is VALID [2020-07-18 00:21:54,784 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1314#true} {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #94#return; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,785 INFO L263 TraceCheckUtils]: 0: Hoare triple {1314#true} call ULTIMATE.init(); {1335#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:21:54,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {1335#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {1314#true} is VALID [2020-07-18 00:21:54,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {1314#true} #valid := #valid[0 := 0]; {1314#true} is VALID [2020-07-18 00:21:54,786 INFO L280 TraceCheckUtils]: 3: Hoare triple {1314#true} assume 0 < #StackHeapBarrier; {1314#true} is VALID [2020-07-18 00:21:54,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {1314#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {1314#true} is VALID [2020-07-18 00:21:54,787 INFO L280 TraceCheckUtils]: 5: Hoare triple {1314#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {1314#true} is VALID [2020-07-18 00:21:54,787 INFO L280 TraceCheckUtils]: 6: Hoare triple {1314#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {1314#true} is VALID [2020-07-18 00:21:54,787 INFO L280 TraceCheckUtils]: 7: Hoare triple {1314#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {1314#true} is VALID [2020-07-18 00:21:54,787 INFO L280 TraceCheckUtils]: 8: Hoare triple {1314#true} assume true; {1314#true} is VALID [2020-07-18 00:21:54,788 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1314#true} {1314#true} #90#return; {1314#true} is VALID [2020-07-18 00:21:54,788 INFO L263 TraceCheckUtils]: 10: Hoare triple {1314#true} call #t~ret11 := main(); {1314#true} is VALID [2020-07-18 00:21:54,788 INFO L280 TraceCheckUtils]: 11: Hoare triple {1314#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {1314#true} is VALID [2020-07-18 00:21:54,788 INFO L280 TraceCheckUtils]: 12: Hoare triple {1314#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1314#true} is VALID [2020-07-18 00:21:54,789 INFO L280 TraceCheckUtils]: 13: Hoare triple {1314#true} SUMMARY for call write~init~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-1 {1314#true} is VALID [2020-07-18 00:21:54,789 INFO L280 TraceCheckUtils]: 14: Hoare triple {1314#true} havoc #t~nondet2; {1314#true} is VALID [2020-07-18 00:21:54,789 INFO L280 TraceCheckUtils]: 15: Hoare triple {1314#true} havoc ~pa~0.base, ~pa~0.offset; {1314#true} is VALID [2020-07-18 00:21:54,789 INFO L280 TraceCheckUtils]: 16: Hoare triple {1314#true} havoc ~pb~0.base, ~pb~0.offset; {1314#true} is VALID [2020-07-18 00:21:54,790 INFO L280 TraceCheckUtils]: 17: Hoare triple {1314#true} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,791 INFO L280 TraceCheckUtils]: 18: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,792 INFO L280 TraceCheckUtils]: 19: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} SUMMARY for call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4); srcloc: L15-1 {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,793 INFO L280 TraceCheckUtils]: 20: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~nondet3; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,794 INFO L280 TraceCheckUtils]: 21: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,795 INFO L280 TraceCheckUtils]: 22: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} SUMMARY for call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4); srcloc: L16-1 {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,796 INFO L280 TraceCheckUtils]: 23: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~nondet4; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,796 INFO L263 TraceCheckUtils]: 24: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} call #t~ret5.base, #t~ret5.offset := get_dummy(); {1314#true} is VALID [2020-07-18 00:21:54,797 INFO L280 TraceCheckUtils]: 25: Hoare triple {1314#true} assume 0 != #t~nondet0 % 256; {1314#true} is VALID [2020-07-18 00:21:54,797 INFO L280 TraceCheckUtils]: 26: Hoare triple {1314#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {1314#true} is VALID [2020-07-18 00:21:54,797 INFO L280 TraceCheckUtils]: 27: Hoare triple {1314#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {1314#true} is VALID [2020-07-18 00:21:54,798 INFO L280 TraceCheckUtils]: 28: Hoare triple {1314#true} havoc #t~nondet0; {1314#true} is VALID [2020-07-18 00:21:54,798 INFO L280 TraceCheckUtils]: 29: Hoare triple {1314#true} havoc #t~ite1.base, #t~ite1.offset; {1314#true} is VALID [2020-07-18 00:21:54,798 INFO L280 TraceCheckUtils]: 30: Hoare triple {1314#true} assume true; {1314#true} is VALID [2020-07-18 00:21:54,800 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1314#true} {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #94#return; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,801 INFO L280 TraceCheckUtils]: 32: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,801 INFO L280 TraceCheckUtils]: 33: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,802 INFO L280 TraceCheckUtils]: 34: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~ret5.base, #t~ret5.offset; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,803 INFO L280 TraceCheckUtils]: 35: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,804 INFO L280 TraceCheckUtils]: 36: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume !#t~short9; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,805 INFO L280 TraceCheckUtils]: 37: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,806 INFO L280 TraceCheckUtils]: 38: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume #t~short8; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,807 INFO L280 TraceCheckUtils]: 39: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} SUMMARY for call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L19-2 {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,808 INFO L280 TraceCheckUtils]: 40: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} SUMMARY for call #t~mem7 := read~int(~pb~0.base, ~pb~0.offset, 4); srcloc: L19-3 {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,809 INFO L280 TraceCheckUtils]: 41: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #t~short8 := #t~mem6 != #t~mem7; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,809 INFO L280 TraceCheckUtils]: 42: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #t~short9 := #t~short8; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,810 INFO L280 TraceCheckUtils]: 43: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume !#t~short9; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,811 INFO L280 TraceCheckUtils]: 44: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~mem6; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,812 INFO L280 TraceCheckUtils]: 45: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~short9; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,813 INFO L280 TraceCheckUtils]: 46: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~mem7; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,814 INFO L280 TraceCheckUtils]: 47: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~short8; {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-18 00:21:54,815 INFO L280 TraceCheckUtils]: 48: Hoare triple {1325#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} SUMMARY for call write~int(60, ~pc~0.base, ~pc~0.offset, 4); srcloc: L23 {1333#(= (select (select |#memory_int| |main_~#c~0.base|) |main_~#c~0.offset|) 60)} is VALID [2020-07-18 00:21:54,816 INFO L280 TraceCheckUtils]: 49: Hoare triple {1333#(= (select (select |#memory_int| |main_~#c~0.base|) |main_~#c~0.offset|) 60)} SUMMARY for call #t~mem10 := read~int(~#c~0.base, ~#c~0.offset, 4); srcloc: L23-1 {1334#(= |main_#t~mem10| 60)} is VALID [2020-07-18 00:21:54,817 INFO L280 TraceCheckUtils]: 50: Hoare triple {1334#(= |main_#t~mem10| 60)} assume 60 != #t~mem10; {1315#false} is VALID [2020-07-18 00:21:54,817 INFO L280 TraceCheckUtils]: 51: Hoare triple {1315#false} havoc #t~mem10; {1315#false} is VALID [2020-07-18 00:21:54,818 INFO L280 TraceCheckUtils]: 52: Hoare triple {1315#false} assume !false; {1315#false} is VALID [2020-07-18 00:21:54,824 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-18 00:21:54,825 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:21:54,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [345173738] [2020-07-18 00:21:54,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:21:54,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:21:54,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857503560] [2020-07-18 00:21:54,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2020-07-18 00:21:54,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:21:54,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:21:54,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:54,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:21:54,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:21:54,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:21:54,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:21:54,896 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 6 states. [2020-07-18 00:21:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:55,390 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-07-18 00:21:55,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:21:55,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2020-07-18 00:21:55,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:21:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:21:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-18 00:21:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:21:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-18 00:21:55,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-18 00:21:55,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:55,470 INFO L225 Difference]: With dead ends: 55 [2020-07-18 00:21:55,470 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:21:55,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:21:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:21:55,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:21:55,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:21:55,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:55,473 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:55,473 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:55,473 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:21:55,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:21:55,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:55,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:55,474 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:55,474 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:55,474 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:21:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:21:55,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:55,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:55,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:21:55,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:21:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:21:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:21:55,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2020-07-18 00:21:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:21:55,476 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:21:55,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:21:55,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:21:55,476 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-18 00:21:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:21:55,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:55,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:21:55,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:21:56,374 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:21:56,374 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-18 00:21:56,374 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2020-07-18 00:21:56,375 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|)) [2020-07-18 00:21:56,375 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-18 00:21:56,375 INFO L271 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-07-18 00:21:56,375 INFO L271 CegarLoopResult]: At program point L5-2(line 5) the Hoare annotation is: true [2020-07-18 00:21:56,375 INFO L271 CegarLoopResult]: At program point L5-3(line 5) the Hoare annotation is: true [2020-07-18 00:21:56,375 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:21:56,375 INFO L271 CegarLoopResult]: At program point get_dummyFINAL(lines 7 10) the Hoare annotation is: true [2020-07-18 00:21:56,376 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-18 00:21:56,376 INFO L271 CegarLoopResult]: At program point get_dummyENTRY(lines 7 10) the Hoare annotation is: true [2020-07-18 00:21:56,376 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-18 00:21:56,376 INFO L271 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: true [2020-07-18 00:21:56,376 INFO L271 CegarLoopResult]: At program point L9-4(line 9) the Hoare annotation is: true [2020-07-18 00:21:56,376 INFO L271 CegarLoopResult]: At program point L9-5(line 9) the Hoare annotation is: true [2020-07-18 00:21:56,376 INFO L271 CegarLoopResult]: At program point get_dummyEXIT(lines 7 10) the Hoare annotation is: true [2020-07-18 00:21:56,376 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:21:56,377 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:21:56,377 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:21:56,377 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:21:56,377 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: false [2020-07-18 00:21:56,377 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 12 32) the Hoare annotation is: (not (= 0 main_~pc~0.base)) [2020-07-18 00:21:56,377 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,377 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (= (select (select |#memory_int| |main_~#c~0.base|) |main_~#c~0.offset|) 60) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,378 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,378 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and |main_#t~short8| (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,378 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and |main_#t~short8| (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,378 INFO L264 CegarLoopResult]: At program point L19-3(line 19) the Hoare annotation is: (and |main_#t~short8| (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|) (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,378 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,378 INFO L264 CegarLoopResult]: At program point L19-4(line 19) the Hoare annotation is: (and |main_#t~short8| (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|) (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_#t~mem7| |main_#t~mem6|) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,378 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,379 INFO L264 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,379 INFO L264 CegarLoopResult]: At program point L19-6(line 19) the Hoare annotation is: (and (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|) (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (not |main_#t~short8|) (= |main_#t~mem7| |main_#t~mem6|) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,379 INFO L264 CegarLoopResult]: At program point L19-7(line 19) the Hoare annotation is: false [2020-07-18 00:21:56,379 INFO L264 CegarLoopResult]: At program point L19-8(line 19) the Hoare annotation is: false [2020-07-18 00:21:56,379 INFO L264 CegarLoopResult]: At program point L19-9(line 19) the Hoare annotation is: false [2020-07-18 00:21:56,379 INFO L264 CegarLoopResult]: At program point L19-10(line 19) the Hoare annotation is: (and (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|) (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (not |main_#t~short8|) (= |main_#t~mem7| |main_#t~mem6|) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,379 INFO L264 CegarLoopResult]: At program point L19-11(line 19) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (not |main_#t~short8|) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,380 INFO L264 CegarLoopResult]: At program point L19-12(line 19) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (not |main_#t~short8|) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,380 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,380 INFO L264 CegarLoopResult]: At program point L24(lines 24 26) the Hoare annotation is: (and (= (select (select |#memory_int| |main_~#c~0.base|) |main_~#c~0.offset|) 60) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= |main_#t~mem10| 60) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,380 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: false [2020-07-18 00:21:56,380 INFO L264 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,380 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,381 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,381 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,381 INFO L264 CegarLoopResult]: At program point L25(lines 12 32) the Hoare annotation is: false [2020-07-18 00:21:56,381 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,381 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,381 INFO L264 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,381 INFO L264 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,381 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:21:56,381 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 12 32) the Hoare annotation is: (not (= 0 main_~pc~0.base)) [2020-07-18 00:21:56,382 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:21:56,382 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:21:56,382 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,382 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:21:56,382 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: false [2020-07-18 00:21:56,382 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: false [2020-07-18 00:21:56,382 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) the Hoare annotation is: false [2020-07-18 00:21:56,382 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 12 32) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-18 00:21:56,382 INFO L264 CegarLoopResult]: At program point L18(lines 18 19) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,383 INFO L264 CegarLoopResult]: At program point L18-1(lines 18 19) the Hoare annotation is: (and (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,383 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 21) the Hoare annotation is: (and (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|) (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (not |main_#t~short8|) (= |main_#t~mem7| |main_#t~mem6|) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,383 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:21:56,383 INFO L264 CegarLoopResult]: At program point L18-4(lines 18 19) the Hoare annotation is: false [2020-07-18 00:21:56,383 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:21:56,383 INFO L264 CegarLoopResult]: At program point L18-5(lines 18 19) the Hoare annotation is: (and (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (not |main_#t~short8|) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:21:56,383 INFO L264 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:21:56,415 INFO L163 areAnnotationChecker]: CFG has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:21:56,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:21:56 BoogieIcfgContainer [2020-07-18 00:21:56,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:21:56,430 INFO L168 Benchmark]: Toolchain (without parser) took 7017.03 ms. Allocated memory was 143.7 MB in the beginning and 314.0 MB in the end (delta: 170.4 MB). Free memory was 100.7 MB in the beginning and 212.3 MB in the end (delta: -111.5 MB). Peak memory consumption was 58.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:21:56,431 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 143.7 MB. Free memory is still 118.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:21:56,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.55 ms. Allocated memory is still 143.7 MB. Free memory was 100.7 MB in the beginning and 89.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:21:56,433 INFO L168 Benchmark]: Boogie Preprocessor took 139.73 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 89.7 MB in the beginning and 178.2 MB in the end (delta: -88.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:21:56,433 INFO L168 Benchmark]: RCFGBuilder took 528.15 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 148.9 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:21:56,434 INFO L168 Benchmark]: TraceAbstraction took 6075.22 ms. Allocated memory was 200.8 MB in the beginning and 314.0 MB in the end (delta: 113.2 MB). Free memory was 148.9 MB in the beginning and 212.3 MB in the end (delta: -63.4 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:21:56,438 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.26 ms. Allocated memory is still 143.7 MB. Free memory is still 118.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 266.55 ms. Allocated memory is still 143.7 MB. Free memory was 100.7 MB in the beginning and 89.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.73 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 89.7 MB in the beginning and 178.2 MB in the end (delta: -88.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 528.15 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 148.9 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6075.22 ms. Allocated memory was 200.8 MB in the beginning and 314.0 MB in the end (delta: 113.2 MB). Free memory was 148.9 MB in the beginning and 212.3 MB in the end (delta: -63.4 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: 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: 12]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 7]: Procedure Contract for get_dummy Derived contract for procedure get_dummy: 1 - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: !(0 == pc) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.0s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 204 SDtfs, 164 SDslu, 401 SDs, 0 SdLazy, 383 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred 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.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 70 PreInvPairs, 87 NumberOfFragments, 618 HoareAnnotationTreeSize, 70 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 70 FomulaSimplificationsInter, 314 FormulaSimplificationTreeSizeReductionInter, 0.6s 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...