/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/test14.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:21:51,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:21:51,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:21:51,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:21:51,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:21:51,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:21:51,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:21:51,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:21:51,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:21:51,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:21:51,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:21:51,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:21:51,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:21:51,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:21:51,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:21:51,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:21:51,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:21:51,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:21:51,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:21:51,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:21:51,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:21:51,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:21:51,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:21:51,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:21:51,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:21:51,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:21:51,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:21:51,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:21:51,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:21:51,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:21:51,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:21:51,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:21:51,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:21:51,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:21:51,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:21:51,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:21:51,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:21:51,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:21:51,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:21:51,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:21:51,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:21:51,810 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:51,841 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:21:51,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:21:51,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:21:51,847 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:21:51,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:21:51,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:21:51,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:21:51,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:21:51,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:21:51,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:21:51,852 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:21:51,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:21:51,852 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:21:51,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:21:51,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:21:51,853 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:21:51,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:21:51,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:21:51,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:21:51,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:21:51,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:21:51,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:21:51,858 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:21:52,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:21:52,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:21:52,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:21:52,234 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:21:52,235 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:21:52,236 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test14.c [2020-07-18 00:21:52,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91d443e13/fe649dab7ef84fcbaf35d310b72f896d/FLAG7155c5372 [2020-07-18 00:21:52,982 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:21:52,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test14.c [2020-07-18 00:21:52,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91d443e13/fe649dab7ef84fcbaf35d310b72f896d/FLAG7155c5372 [2020-07-18 00:21:53,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91d443e13/fe649dab7ef84fcbaf35d310b72f896d [2020-07-18 00:21:53,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:21:53,329 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:21:53,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:21:53,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:21:53,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:21:53,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:21:53" (1/1) ... [2020-07-18 00:21:53,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b8024a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:53, skipping insertion in model container [2020-07-18 00:21:53,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:21:53" (1/1) ... [2020-07-18 00:21:53,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:21:53,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:21:53,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:21:53,595 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:21:53,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:21:53,650 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:21:53,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:53 WrapperNode [2020-07-18 00:21:53,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:21:53,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:21:53,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:21:53,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:21:53,666 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:53" (1/1) ... [2020-07-18 00:21:53,667 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:53" (1/1) ... [2020-07-18 00:21:53,779 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:53" (1/1) ... [2020-07-18 00:21:53,780 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:53" (1/1) ... [2020-07-18 00:21:53,810 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:53" (1/1) ... [2020-07-18 00:21:53,816 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:53" (1/1) ... [2020-07-18 00:21:53,818 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:53" (1/1) ... [2020-07-18 00:21:53,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:21:53,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:21:53,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:21:53,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:21:53,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:53" (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:53,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:21:53,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:21:53,928 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2020-07-18 00:21:53,928 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:21:53,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:21:53,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:21:53,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-18 00:21:53,929 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2020-07-18 00:21:53,929 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:21:53,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:21:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-18 00:21:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:21:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:21:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:21:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:21:53,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:21:54,441 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:21:54,442 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:21:54,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:21:54 BoogieIcfgContainer [2020-07-18 00:21:54,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:21:54,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:21:54,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:21:54,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:21:54,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:21:53" (1/3) ... [2020-07-18 00:21:54,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d744d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:21:54, skipping insertion in model container [2020-07-18 00:21:54,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:21:53" (2/3) ... [2020-07-18 00:21:54,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d744d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:21:54, skipping insertion in model container [2020-07-18 00:21:54,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:21:54" (3/3) ... [2020-07-18 00:21:54,461 INFO L109 eAbstractionObserver]: Analyzing ICFG test14.c [2020-07-18 00:21:54,476 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:21:54,487 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:21:54,507 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:21:54,535 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:21:54,536 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:21:54,536 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:21:54,536 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:21:54,536 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:21:54,536 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:21:54,537 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:21:54,537 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:21:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-18 00:21:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 00:21:54,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:21:54,578 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:54,579 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:21:54,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:21:54,585 INFO L82 PathProgramCache]: Analyzing trace with hash 465652526, now seen corresponding path program 1 times [2020-07-18 00:21:54,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:21:54,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1190290348] [2020-07-18 00:21:54,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:21:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:55,062 INFO L280 TraceCheckUtils]: 0: Hoare triple {89#(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; {68#true} is VALID [2020-07-18 00:21:55,063 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-18 00:21:55,064 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-18 00:21:55,065 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {68#true} is VALID [2020-07-18 00:21:55,065 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {68#true} is VALID [2020-07-18 00:21:55,065 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {68#true} is VALID [2020-07-18 00:21:55,066 INFO L280 TraceCheckUtils]: 6: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {68#true} is VALID [2020-07-18 00:21:55,067 INFO L280 TraceCheckUtils]: 7: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-18 00:21:55,067 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {68#true} {68#true} #81#return; {68#true} is VALID [2020-07-18 00:21:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:55,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {68#true} assume 0 != #t~nondet0 % 256; {68#true} is VALID [2020-07-18 00:21:55,114 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {68#true} is VALID [2020-07-18 00:21:55,115 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {68#true} is VALID [2020-07-18 00:21:55,115 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} havoc #t~nondet0; {68#true} is VALID [2020-07-18 00:21:55,116 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} havoc #t~ite1.base, #t~ite1.offset; {68#true} is VALID [2020-07-18 00:21:55,116 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-18 00:21:55,119 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {68#true} {80#(not (= 0 main_~pc~0.base))} #85#return; {80#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:55,121 INFO L263 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {89#(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:55,123 INFO L280 TraceCheckUtils]: 1: Hoare triple {89#(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; {68#true} is VALID [2020-07-18 00:21:55,124 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-18 00:21:55,124 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-18 00:21:55,125 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {68#true} is VALID [2020-07-18 00:21:55,125 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {68#true} is VALID [2020-07-18 00:21:55,125 INFO L280 TraceCheckUtils]: 6: Hoare triple {68#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {68#true} is VALID [2020-07-18 00:21:55,126 INFO L280 TraceCheckUtils]: 7: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {68#true} is VALID [2020-07-18 00:21:55,126 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-18 00:21:55,126 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {68#true} {68#true} #81#return; {68#true} is VALID [2020-07-18 00:21:55,127 INFO L263 TraceCheckUtils]: 10: Hoare triple {68#true} call #t~ret9 := main(); {68#true} is VALID [2020-07-18 00:21:55,127 INFO L280 TraceCheckUtils]: 11: Hoare triple {68#true} havoc ~a~1; {68#true} is VALID [2020-07-18 00:21:55,128 INFO L280 TraceCheckUtils]: 12: Hoare triple {68#true} havoc ~b~1; {68#true} is VALID [2020-07-18 00:21:55,129 INFO L280 TraceCheckUtils]: 13: Hoare triple {68#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: L13-1 {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:55,131 INFO L280 TraceCheckUtils]: 14: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} SUMMARY for call write~init~int(5, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-2 {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:55,134 INFO L280 TraceCheckUtils]: 15: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:55,135 INFO L280 TraceCheckUtils]: 16: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} ~a~1 := #t~nondet2; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:55,138 INFO L280 TraceCheckUtils]: 17: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} havoc #t~nondet2; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:55,139 INFO L280 TraceCheckUtils]: 18: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:55,140 INFO L280 TraceCheckUtils]: 19: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} ~b~1 := #t~nondet3; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:55,141 INFO L280 TraceCheckUtils]: 20: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} havoc #t~nondet3; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:55,144 INFO L280 TraceCheckUtils]: 21: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} havoc ~pa~0.base, ~pa~0.offset; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:55,146 INFO L280 TraceCheckUtils]: 22: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} havoc ~pb~0.base, ~pb~0.offset; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-18 00:21:55,149 INFO L280 TraceCheckUtils]: 23: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {80#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:55,150 INFO L263 TraceCheckUtils]: 24: Hoare triple {80#(not (= 0 main_~pc~0.base))} call #t~ret4.base, #t~ret4.offset := get_dummy(); {68#true} is VALID [2020-07-18 00:21:55,150 INFO L280 TraceCheckUtils]: 25: Hoare triple {68#true} assume 0 != #t~nondet0 % 256; {68#true} is VALID [2020-07-18 00:21:55,150 INFO L280 TraceCheckUtils]: 26: Hoare triple {68#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {68#true} is VALID [2020-07-18 00:21:55,151 INFO L280 TraceCheckUtils]: 27: Hoare triple {68#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {68#true} is VALID [2020-07-18 00:21:55,151 INFO L280 TraceCheckUtils]: 28: Hoare triple {68#true} havoc #t~nondet0; {68#true} is VALID [2020-07-18 00:21:55,151 INFO L280 TraceCheckUtils]: 29: Hoare triple {68#true} havoc #t~ite1.base, #t~ite1.offset; {68#true} is VALID [2020-07-18 00:21:55,152 INFO L280 TraceCheckUtils]: 30: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-18 00:21:55,154 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {68#true} {80#(not (= 0 main_~pc~0.base))} #85#return; {80#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:55,156 INFO L280 TraceCheckUtils]: 32: Hoare triple {80#(not (= 0 main_~pc~0.base))} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset; {80#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:55,159 INFO L280 TraceCheckUtils]: 33: Hoare triple {80#(not (= 0 main_~pc~0.base))} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {80#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:55,161 INFO L280 TraceCheckUtils]: 34: Hoare triple {80#(not (= 0 main_~pc~0.base))} havoc #t~ret4.base, #t~ret4.offset; {80#(not (= 0 main_~pc~0.base))} is VALID [2020-07-18 00:21:55,165 INFO L280 TraceCheckUtils]: 35: Hoare triple {80#(not (= 0 main_~pc~0.base))} #t~short8 := ~pc~0.base == 0 && ~pc~0.offset == 0; {88#(not |main_#t~short8|)} is VALID [2020-07-18 00:21:55,166 INFO L280 TraceCheckUtils]: 36: Hoare triple {88#(not |main_#t~short8|)} assume #t~short8; {69#false} is VALID [2020-07-18 00:21:55,167 INFO L280 TraceCheckUtils]: 37: Hoare triple {69#false} assume #t~short8; {69#false} is VALID [2020-07-18 00:21:55,167 INFO L280 TraceCheckUtils]: 38: Hoare triple {69#false} havoc #t~short7; {69#false} is VALID [2020-07-18 00:21:55,168 INFO L280 TraceCheckUtils]: 39: Hoare triple {69#false} havoc #t~short8; {69#false} is VALID [2020-07-18 00:21:55,168 INFO L280 TraceCheckUtils]: 40: Hoare triple {69#false} havoc #t~mem5; {69#false} is VALID [2020-07-18 00:21:55,168 INFO L280 TraceCheckUtils]: 41: Hoare triple {69#false} havoc #t~mem6; {69#false} is VALID [2020-07-18 00:21:55,169 INFO L280 TraceCheckUtils]: 42: Hoare triple {69#false} assume !false; {69#false} is VALID [2020-07-18 00:21:55,177 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:55,180 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:21:55,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1190290348] [2020-07-18 00:21:55,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:21:55,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:21:55,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407858768] [2020-07-18 00:21:55,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-18 00:21:55,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:21:55,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:21:55,354 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:55,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:21:55,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:21:55,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:21:55,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:21:55,374 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 6 states. [2020-07-18 00:21:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:56,391 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2020-07-18 00:21:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:21:56,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-18 00:21:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:21:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:21:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2020-07-18 00:21:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:21:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2020-07-18 00:21:56,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 86 transitions. [2020-07-18 00:21:56,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:56,640 INFO L225 Difference]: With dead ends: 83 [2020-07-18 00:21:56,641 INFO L226 Difference]: Without dead ends: 51 [2020-07-18 00:21:56,646 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:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-18 00:21:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-18 00:21:56,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:21:56,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2020-07-18 00:21:56,845 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2020-07-18 00:21:56,845 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2020-07-18 00:21:56,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:56,853 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-07-18 00:21:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-07-18 00:21:56,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:56,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:56,855 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2020-07-18 00:21:56,855 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2020-07-18 00:21:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:56,862 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-07-18 00:21:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-07-18 00:21:56,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:56,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:56,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:21:56,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:21:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-18 00:21:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-07-18 00:21:56,871 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 43 [2020-07-18 00:21:56,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:21:56,872 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-07-18 00:21:56,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:21:56,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 52 transitions. [2020-07-18 00:21:56,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-07-18 00:21:56,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-18 00:21:56,988 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:21:56,988 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:56,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:21:56,989 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:21:56,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:21:56,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1782210472, now seen corresponding path program 1 times [2020-07-18 00:21:56,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:21:56,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2105499412] [2020-07-18 00:21:56,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:21:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:57,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {486#(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; {466#true} is VALID [2020-07-18 00:21:57,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {466#true} #valid := #valid[0 := 0]; {466#true} is VALID [2020-07-18 00:21:57,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {466#true} assume 0 < #StackHeapBarrier; {466#true} is VALID [2020-07-18 00:21:57,221 INFO L280 TraceCheckUtils]: 3: Hoare triple {466#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {466#true} is VALID [2020-07-18 00:21:57,221 INFO L280 TraceCheckUtils]: 4: Hoare triple {466#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {466#true} is VALID [2020-07-18 00:21:57,222 INFO L280 TraceCheckUtils]: 5: Hoare triple {466#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {466#true} is VALID [2020-07-18 00:21:57,222 INFO L280 TraceCheckUtils]: 6: Hoare triple {466#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {466#true} is VALID [2020-07-18 00:21:57,222 INFO L280 TraceCheckUtils]: 7: Hoare triple {466#true} assume true; {466#true} is VALID [2020-07-18 00:21:57,223 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2020-07-18 00:21:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:57,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {466#true} assume 0 != #t~nondet0 % 256; {466#true} is VALID [2020-07-18 00:21:57,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {466#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {466#true} is VALID [2020-07-18 00:21:57,233 INFO L280 TraceCheckUtils]: 2: Hoare triple {466#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {466#true} is VALID [2020-07-18 00:21:57,234 INFO L280 TraceCheckUtils]: 3: Hoare triple {466#true} havoc #t~nondet0; {466#true} is VALID [2020-07-18 00:21:57,234 INFO L280 TraceCheckUtils]: 4: Hoare triple {466#true} havoc #t~ite1.base, #t~ite1.offset; {466#true} is VALID [2020-07-18 00:21:57,234 INFO L280 TraceCheckUtils]: 5: Hoare triple {466#true} assume true; {466#true} is VALID [2020-07-18 00:21:57,235 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {466#true} {466#true} #85#return; {466#true} is VALID [2020-07-18 00:21:57,237 INFO L263 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {486#(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:57,237 INFO L280 TraceCheckUtils]: 1: Hoare triple {486#(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; {466#true} is VALID [2020-07-18 00:21:57,237 INFO L280 TraceCheckUtils]: 2: Hoare triple {466#true} #valid := #valid[0 := 0]; {466#true} is VALID [2020-07-18 00:21:57,238 INFO L280 TraceCheckUtils]: 3: Hoare triple {466#true} assume 0 < #StackHeapBarrier; {466#true} is VALID [2020-07-18 00:21:57,238 INFO L280 TraceCheckUtils]: 4: Hoare triple {466#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {466#true} is VALID [2020-07-18 00:21:57,239 INFO L280 TraceCheckUtils]: 5: Hoare triple {466#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {466#true} is VALID [2020-07-18 00:21:57,239 INFO L280 TraceCheckUtils]: 6: Hoare triple {466#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {466#true} is VALID [2020-07-18 00:21:57,239 INFO L280 TraceCheckUtils]: 7: Hoare triple {466#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {466#true} is VALID [2020-07-18 00:21:57,240 INFO L280 TraceCheckUtils]: 8: Hoare triple {466#true} assume true; {466#true} is VALID [2020-07-18 00:21:57,240 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2020-07-18 00:21:57,241 INFO L263 TraceCheckUtils]: 10: Hoare triple {466#true} call #t~ret9 := main(); {466#true} is VALID [2020-07-18 00:21:57,241 INFO L280 TraceCheckUtils]: 11: Hoare triple {466#true} havoc ~a~1; {466#true} is VALID [2020-07-18 00:21:57,241 INFO L280 TraceCheckUtils]: 12: Hoare triple {466#true} havoc ~b~1; {466#true} is VALID [2020-07-18 00:21:57,241 INFO L280 TraceCheckUtils]: 13: Hoare triple {466#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: L13-1 {466#true} is VALID [2020-07-18 00:21:57,242 INFO L280 TraceCheckUtils]: 14: Hoare triple {466#true} SUMMARY for call write~init~int(5, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-2 {466#true} is VALID [2020-07-18 00:21:57,242 INFO L280 TraceCheckUtils]: 15: Hoare triple {466#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {466#true} is VALID [2020-07-18 00:21:57,242 INFO L280 TraceCheckUtils]: 16: Hoare triple {466#true} ~a~1 := #t~nondet2; {466#true} is VALID [2020-07-18 00:21:57,243 INFO L280 TraceCheckUtils]: 17: Hoare triple {466#true} havoc #t~nondet2; {466#true} is VALID [2020-07-18 00:21:57,243 INFO L280 TraceCheckUtils]: 18: Hoare triple {466#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {466#true} is VALID [2020-07-18 00:21:57,243 INFO L280 TraceCheckUtils]: 19: Hoare triple {466#true} ~b~1 := #t~nondet3; {466#true} is VALID [2020-07-18 00:21:57,244 INFO L280 TraceCheckUtils]: 20: Hoare triple {466#true} havoc #t~nondet3; {466#true} is VALID [2020-07-18 00:21:57,244 INFO L280 TraceCheckUtils]: 21: Hoare triple {466#true} havoc ~pa~0.base, ~pa~0.offset; {466#true} is VALID [2020-07-18 00:21:57,245 INFO L280 TraceCheckUtils]: 22: Hoare triple {466#true} havoc ~pb~0.base, ~pb~0.offset; {466#true} is VALID [2020-07-18 00:21:57,245 INFO L280 TraceCheckUtils]: 23: Hoare triple {466#true} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {466#true} is VALID [2020-07-18 00:21:57,245 INFO L263 TraceCheckUtils]: 24: Hoare triple {466#true} call #t~ret4.base, #t~ret4.offset := get_dummy(); {466#true} is VALID [2020-07-18 00:21:57,246 INFO L280 TraceCheckUtils]: 25: Hoare triple {466#true} assume 0 != #t~nondet0 % 256; {466#true} is VALID [2020-07-18 00:21:57,246 INFO L280 TraceCheckUtils]: 26: Hoare triple {466#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {466#true} is VALID [2020-07-18 00:21:57,246 INFO L280 TraceCheckUtils]: 27: Hoare triple {466#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {466#true} is VALID [2020-07-18 00:21:57,247 INFO L280 TraceCheckUtils]: 28: Hoare triple {466#true} havoc #t~nondet0; {466#true} is VALID [2020-07-18 00:21:57,247 INFO L280 TraceCheckUtils]: 29: Hoare triple {466#true} havoc #t~ite1.base, #t~ite1.offset; {466#true} is VALID [2020-07-18 00:21:57,247 INFO L280 TraceCheckUtils]: 30: Hoare triple {466#true} assume true; {466#true} is VALID [2020-07-18 00:21:57,248 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {466#true} {466#true} #85#return; {466#true} is VALID [2020-07-18 00:21:57,248 INFO L280 TraceCheckUtils]: 32: Hoare triple {466#true} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset; {466#true} is VALID [2020-07-18 00:21:57,249 INFO L280 TraceCheckUtils]: 33: Hoare triple {466#true} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:57,250 INFO L280 TraceCheckUtils]: 34: Hoare triple {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} havoc #t~ret4.base, #t~ret4.offset; {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:57,252 INFO L280 TraceCheckUtils]: 35: Hoare triple {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short8 := ~pc~0.base == 0 && ~pc~0.offset == 0; {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:57,254 INFO L280 TraceCheckUtils]: 36: Hoare triple {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume !#t~short8; {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:57,255 INFO L280 TraceCheckUtils]: 37: Hoare triple {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short7 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {485#|main_#t~short7|} is VALID [2020-07-18 00:21:57,256 INFO L280 TraceCheckUtils]: 38: Hoare triple {485#|main_#t~short7|} assume !#t~short7; {467#false} is VALID [2020-07-18 00:21:57,257 INFO L280 TraceCheckUtils]: 39: Hoare triple {467#false} #t~short8 := #t~short7; {467#false} is VALID [2020-07-18 00:21:57,257 INFO L280 TraceCheckUtils]: 40: Hoare triple {467#false} assume #t~short8; {467#false} is VALID [2020-07-18 00:21:57,258 INFO L280 TraceCheckUtils]: 41: Hoare triple {467#false} havoc #t~short7; {467#false} is VALID [2020-07-18 00:21:57,258 INFO L280 TraceCheckUtils]: 42: Hoare triple {467#false} havoc #t~short8; {467#false} is VALID [2020-07-18 00:21:57,259 INFO L280 TraceCheckUtils]: 43: Hoare triple {467#false} havoc #t~mem5; {467#false} is VALID [2020-07-18 00:21:57,259 INFO L280 TraceCheckUtils]: 44: Hoare triple {467#false} havoc #t~mem6; {467#false} is VALID [2020-07-18 00:21:57,259 INFO L280 TraceCheckUtils]: 45: Hoare triple {467#false} assume !false; {467#false} is VALID [2020-07-18 00:21:57,263 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:57,264 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:21:57,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2105499412] [2020-07-18 00:21:57,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:21:57,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:21:57,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117693021] [2020-07-18 00:21:57,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-07-18 00:21:57,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:21:57,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:21:57,328 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:57,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:21:57,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:21:57,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:21:57,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:21:57,330 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 5 states. [2020-07-18 00:21:57,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:57,947 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2020-07-18 00:21:57,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:21:57,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-07-18 00:21:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:21:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:21:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-07-18 00:21:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:21:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-07-18 00:21:57,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2020-07-18 00:21:58,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:58,051 INFO L225 Difference]: With dead ends: 59 [2020-07-18 00:21:58,052 INFO L226 Difference]: Without dead ends: 51 [2020-07-18 00:21:58,054 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:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-18 00:21:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-18 00:21:58,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:21:58,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2020-07-18 00:21:58,214 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2020-07-18 00:21:58,215 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2020-07-18 00:21:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:58,219 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-18 00:21:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-07-18 00:21:58,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:58,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:58,221 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2020-07-18 00:21:58,221 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2020-07-18 00:21:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:58,225 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-18 00:21:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-07-18 00:21:58,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:58,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:58,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:21:58,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:21:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-18 00:21:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2020-07-18 00:21:58,230 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2020-07-18 00:21:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:21:58,231 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2020-07-18 00:21:58,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:21:58,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2020-07-18 00:21:58,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-07-18 00:21:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-18 00:21:58,310 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:21:58,311 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:58,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:21:58,312 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:21:58,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:21:58,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1590234488, now seen corresponding path program 1 times [2020-07-18 00:21:58,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:21:58,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [976059746] [2020-07-18 00:21:58,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:21:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:58,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {836#(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; {813#true} is VALID [2020-07-18 00:21:58,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {813#true} #valid := #valid[0 := 0]; {813#true} is VALID [2020-07-18 00:21:58,482 INFO L280 TraceCheckUtils]: 2: Hoare triple {813#true} assume 0 < #StackHeapBarrier; {813#true} is VALID [2020-07-18 00:21:58,482 INFO L280 TraceCheckUtils]: 3: Hoare triple {813#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {813#true} is VALID [2020-07-18 00:21:58,482 INFO L280 TraceCheckUtils]: 4: Hoare triple {813#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {813#true} is VALID [2020-07-18 00:21:58,483 INFO L280 TraceCheckUtils]: 5: Hoare triple {813#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {813#true} is VALID [2020-07-18 00:21:58,483 INFO L280 TraceCheckUtils]: 6: Hoare triple {813#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {813#true} is VALID [2020-07-18 00:21:58,483 INFO L280 TraceCheckUtils]: 7: Hoare triple {813#true} assume true; {813#true} is VALID [2020-07-18 00:21:58,484 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {813#true} {813#true} #81#return; {813#true} is VALID [2020-07-18 00:21:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:58,492 INFO L280 TraceCheckUtils]: 0: Hoare triple {813#true} assume 0 != #t~nondet0 % 256; {813#true} is VALID [2020-07-18 00:21:58,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {813#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {813#true} is VALID [2020-07-18 00:21:58,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {813#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {813#true} is VALID [2020-07-18 00:21:58,493 INFO L280 TraceCheckUtils]: 3: Hoare triple {813#true} havoc #t~nondet0; {813#true} is VALID [2020-07-18 00:21:58,493 INFO L280 TraceCheckUtils]: 4: Hoare triple {813#true} havoc #t~ite1.base, #t~ite1.offset; {813#true} is VALID [2020-07-18 00:21:58,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {813#true} assume true; {813#true} is VALID [2020-07-18 00:21:58,494 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {813#true} {813#true} #85#return; {813#true} is VALID [2020-07-18 00:21:58,496 INFO L263 TraceCheckUtils]: 0: Hoare triple {813#true} call ULTIMATE.init(); {836#(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:58,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {836#(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; {813#true} is VALID [2020-07-18 00:21:58,497 INFO L280 TraceCheckUtils]: 2: Hoare triple {813#true} #valid := #valid[0 := 0]; {813#true} is VALID [2020-07-18 00:21:58,497 INFO L280 TraceCheckUtils]: 3: Hoare triple {813#true} assume 0 < #StackHeapBarrier; {813#true} is VALID [2020-07-18 00:21:58,498 INFO L280 TraceCheckUtils]: 4: Hoare triple {813#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {813#true} is VALID [2020-07-18 00:21:58,498 INFO L280 TraceCheckUtils]: 5: Hoare triple {813#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {813#true} is VALID [2020-07-18 00:21:58,498 INFO L280 TraceCheckUtils]: 6: Hoare triple {813#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {813#true} is VALID [2020-07-18 00:21:58,499 INFO L280 TraceCheckUtils]: 7: Hoare triple {813#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {813#true} is VALID [2020-07-18 00:21:58,499 INFO L280 TraceCheckUtils]: 8: Hoare triple {813#true} assume true; {813#true} is VALID [2020-07-18 00:21:58,499 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {813#true} {813#true} #81#return; {813#true} is VALID [2020-07-18 00:21:58,499 INFO L263 TraceCheckUtils]: 10: Hoare triple {813#true} call #t~ret9 := main(); {813#true} is VALID [2020-07-18 00:21:58,500 INFO L280 TraceCheckUtils]: 11: Hoare triple {813#true} havoc ~a~1; {813#true} is VALID [2020-07-18 00:21:58,500 INFO L280 TraceCheckUtils]: 12: Hoare triple {813#true} havoc ~b~1; {813#true} is VALID [2020-07-18 00:21:58,500 INFO L280 TraceCheckUtils]: 13: Hoare triple {813#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: L13-1 {813#true} is VALID [2020-07-18 00:21:58,501 INFO L280 TraceCheckUtils]: 14: Hoare triple {813#true} SUMMARY for call write~init~int(5, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-2 {813#true} is VALID [2020-07-18 00:21:58,501 INFO L280 TraceCheckUtils]: 15: Hoare triple {813#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {813#true} is VALID [2020-07-18 00:21:58,501 INFO L280 TraceCheckUtils]: 16: Hoare triple {813#true} ~a~1 := #t~nondet2; {813#true} is VALID [2020-07-18 00:21:58,502 INFO L280 TraceCheckUtils]: 17: Hoare triple {813#true} havoc #t~nondet2; {813#true} is VALID [2020-07-18 00:21:58,502 INFO L280 TraceCheckUtils]: 18: Hoare triple {813#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {813#true} is VALID [2020-07-18 00:21:58,502 INFO L280 TraceCheckUtils]: 19: Hoare triple {813#true} ~b~1 := #t~nondet3; {813#true} is VALID [2020-07-18 00:21:58,503 INFO L280 TraceCheckUtils]: 20: Hoare triple {813#true} havoc #t~nondet3; {813#true} is VALID [2020-07-18 00:21:58,503 INFO L280 TraceCheckUtils]: 21: Hoare triple {813#true} havoc ~pa~0.base, ~pa~0.offset; {813#true} is VALID [2020-07-18 00:21:58,503 INFO L280 TraceCheckUtils]: 22: Hoare triple {813#true} havoc ~pb~0.base, ~pb~0.offset; {813#true} is VALID [2020-07-18 00:21:58,504 INFO L280 TraceCheckUtils]: 23: Hoare triple {813#true} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {813#true} is VALID [2020-07-18 00:21:58,504 INFO L263 TraceCheckUtils]: 24: Hoare triple {813#true} call #t~ret4.base, #t~ret4.offset := get_dummy(); {813#true} is VALID [2020-07-18 00:21:58,504 INFO L280 TraceCheckUtils]: 25: Hoare triple {813#true} assume 0 != #t~nondet0 % 256; {813#true} is VALID [2020-07-18 00:21:58,504 INFO L280 TraceCheckUtils]: 26: Hoare triple {813#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {813#true} is VALID [2020-07-18 00:21:58,505 INFO L280 TraceCheckUtils]: 27: Hoare triple {813#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {813#true} is VALID [2020-07-18 00:21:58,505 INFO L280 TraceCheckUtils]: 28: Hoare triple {813#true} havoc #t~nondet0; {813#true} is VALID [2020-07-18 00:21:58,505 INFO L280 TraceCheckUtils]: 29: Hoare triple {813#true} havoc #t~ite1.base, #t~ite1.offset; {813#true} is VALID [2020-07-18 00:21:58,506 INFO L280 TraceCheckUtils]: 30: Hoare triple {813#true} assume true; {813#true} is VALID [2020-07-18 00:21:58,506 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {813#true} {813#true} #85#return; {813#true} is VALID [2020-07-18 00:21:58,506 INFO L280 TraceCheckUtils]: 32: Hoare triple {813#true} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset; {813#true} is VALID [2020-07-18 00:21:58,507 INFO L280 TraceCheckUtils]: 33: Hoare triple {813#true} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:58,509 INFO L280 TraceCheckUtils]: 34: Hoare triple {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} havoc #t~ret4.base, #t~ret4.offset; {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:58,511 INFO L280 TraceCheckUtils]: 35: Hoare triple {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short8 := ~pc~0.base == 0 && ~pc~0.offset == 0; {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:58,512 INFO L280 TraceCheckUtils]: 36: Hoare triple {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume !#t~short8; {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:58,513 INFO L280 TraceCheckUtils]: 37: Hoare triple {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short7 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:58,514 INFO L280 TraceCheckUtils]: 38: Hoare triple {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume #t~short7; {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-18 00:21:58,515 INFO L280 TraceCheckUtils]: 39: Hoare triple {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} SUMMARY for call #t~mem5 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L19-2 {832#(= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem5|)} is VALID [2020-07-18 00:21:58,517 INFO L280 TraceCheckUtils]: 40: Hoare triple {832#(= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem5|)} SUMMARY for call #t~mem6 := read~int(~pb~0.base, ~pb~0.offset, 4); srcloc: L19-3 {833#(= |main_#t~mem6| |main_#t~mem5|)} is VALID [2020-07-18 00:21:58,518 INFO L280 TraceCheckUtils]: 41: Hoare triple {833#(= |main_#t~mem6| |main_#t~mem5|)} #t~short7 := #t~mem5 != #t~mem6; {834#(not |main_#t~short7|)} is VALID [2020-07-18 00:21:58,519 INFO L280 TraceCheckUtils]: 42: Hoare triple {834#(not |main_#t~short7|)} #t~short8 := #t~short7; {835#(not |main_#t~short8|)} is VALID [2020-07-18 00:21:58,520 INFO L280 TraceCheckUtils]: 43: Hoare triple {835#(not |main_#t~short8|)} assume #t~short8; {814#false} is VALID [2020-07-18 00:21:58,521 INFO L280 TraceCheckUtils]: 44: Hoare triple {814#false} havoc #t~short7; {814#false} is VALID [2020-07-18 00:21:58,521 INFO L280 TraceCheckUtils]: 45: Hoare triple {814#false} havoc #t~short8; {814#false} is VALID [2020-07-18 00:21:58,521 INFO L280 TraceCheckUtils]: 46: Hoare triple {814#false} havoc #t~mem5; {814#false} is VALID [2020-07-18 00:21:58,522 INFO L280 TraceCheckUtils]: 47: Hoare triple {814#false} havoc #t~mem6; {814#false} is VALID [2020-07-18 00:21:58,522 INFO L280 TraceCheckUtils]: 48: Hoare triple {814#false} assume !false; {814#false} is VALID [2020-07-18 00:21:58,527 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:58,528 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:21:58,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [976059746] [2020-07-18 00:21:58,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:21:58,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:21:58,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468200749] [2020-07-18 00:21:58,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-07-18 00:21:58,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:21:58,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:21:58,620 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:58,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:21:58,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:21:58,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:21:58,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:21:58,623 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 8 states. [2020-07-18 00:21:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:59,333 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-18 00:21:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:21:59,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-07-18 00:21:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:21:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:21:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2020-07-18 00:21:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:21:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2020-07-18 00:21:59,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2020-07-18 00:21:59,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:59,416 INFO L225 Difference]: With dead ends: 51 [2020-07-18 00:21:59,416 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:21:59,417 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:21:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:21:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:21:59,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:21:59,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:59,418 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:59,419 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:59,419 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:21:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:21:59,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:59,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:59,420 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:59,420 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:59,421 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:21:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:21:59,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:59,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:59,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:21:59,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:21:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:21:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:21:59,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2020-07-18 00:21:59,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:21:59,423 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:21:59,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:21:59,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:21:59,423 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:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:21:59,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:59,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:21:59,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:22:00,048 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:22:00,048 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-18 00:22:00,048 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2020-07-18 00:22:00,049 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:22:00,049 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-18 00:22:00,049 INFO L271 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-07-18 00:22:00,049 INFO L271 CegarLoopResult]: At program point L5-2(line 5) the Hoare annotation is: true [2020-07-18 00:22:00,049 INFO L271 CegarLoopResult]: At program point L5-3(line 5) the Hoare annotation is: true [2020-07-18 00:22:00,049 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:22:00,050 INFO L271 CegarLoopResult]: At program point get_dummyFINAL(lines 7 10) the Hoare annotation is: true [2020-07-18 00:22:00,050 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-18 00:22:00,050 INFO L271 CegarLoopResult]: At program point get_dummyENTRY(lines 7 10) the Hoare annotation is: true [2020-07-18 00:22:00,050 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-18 00:22:00,050 INFO L271 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: true [2020-07-18 00:22:00,050 INFO L271 CegarLoopResult]: At program point L9-4(line 9) the Hoare annotation is: true [2020-07-18 00:22:00,051 INFO L271 CegarLoopResult]: At program point L9-5(line 9) the Hoare annotation is: true [2020-07-18 00:22:00,051 INFO L271 CegarLoopResult]: At program point get_dummyEXIT(lines 7 10) the Hoare annotation is: true [2020-07-18 00:22:00,051 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:22:00,051 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:22:00,051 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:22:00,051 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:22:00,051 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 12 27) the Hoare annotation is: (not (= 0 main_~pc~0.base)) [2020-07-18 00:22:00,051 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:22:00,052 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (not |main_#t~short8|) (not (= 0 |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:22:00,052 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and |main_#t~short7| (not |main_#t~short8|) (not (= 0 |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:22:00,052 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and |main_#t~short7| (not |main_#t~short8|) (not (= 0 |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:22:00,052 INFO L264 CegarLoopResult]: At program point L19-3(line 19) the Hoare annotation is: (and |main_#t~short7| (not |main_#t~short8|) (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem5|) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:22:00,053 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:22:00,053 INFO L264 CegarLoopResult]: At program point L19-4(line 19) the Hoare annotation is: (and |main_#t~short7| (not |main_#t~short8|) (not (= 0 |main_~#c~0.base|)) (= |main_#t~mem6| |main_#t~mem5|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem5|) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:22:00,053 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:22:00,053 INFO L264 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:22:00,053 INFO L264 CegarLoopResult]: At program point L19-6(line 19) the Hoare annotation is: (and (not |main_#t~short8|) (not (= 0 |main_~#c~0.base|)) (not |main_#t~short7|) (= |main_#t~mem6| |main_#t~mem5|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem5|) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:22:00,054 INFO L264 CegarLoopResult]: At program point L19-7(line 19) the Hoare annotation is: false [2020-07-18 00:22:00,054 INFO L264 CegarLoopResult]: At program point L19-8(line 19) the Hoare annotation is: false [2020-07-18 00:22:00,054 INFO L264 CegarLoopResult]: At program point L19-9(line 19) the Hoare annotation is: false [2020-07-18 00:22:00,054 INFO L264 CegarLoopResult]: At program point L19-10(line 19) the Hoare annotation is: (and (not |main_#t~short8|) (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:22:00,054 INFO L264 CegarLoopResult]: At program point L19-11(line 19) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:22:00,054 INFO L264 CegarLoopResult]: At program point L19-12(line 19) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:22:00,055 INFO L264 CegarLoopResult]: At program point L20(lines 12 27) the Hoare annotation is: false [2020-07-18 00:22:00,055 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:22:00,055 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:22:00,055 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:22:00,055 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:22:00,055 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:22:00,056 INFO L264 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:22:00,056 INFO L264 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: (and (not (= 0 |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:22:00,056 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-18 00:22:00,056 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 12 27) the Hoare annotation is: (not (= 0 main_~pc~0.base)) [2020-07-18 00:22:00,056 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-18 00:22:00,057 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:22:00,057 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:22:00,057 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:22:00,057 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:22:00,057 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: false [2020-07-18 00:22:00,057 INFO L264 CegarLoopResult]: At program point L13-7(line 13) the Hoare annotation is: false [2020-07-18 00:22:00,058 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) the Hoare annotation is: false [2020-07-18 00:22:00,058 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 12 27) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-18 00:22:00,058 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: false [2020-07-18 00:22:00,059 INFO L264 CegarLoopResult]: At program point L18(lines 18 19) the Hoare annotation is: (and (not (= 0 |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:22:00,059 INFO L264 CegarLoopResult]: At program point L18-1(lines 18 19) the Hoare annotation is: (and (not |main_#t~short8|) (not (= 0 |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:22:00,059 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 21) the Hoare annotation is: (and (not |main_#t~short8|) (not (= 0 |main_~#c~0.base|)) (not |main_#t~short7|) (= |main_#t~mem6| |main_#t~mem5|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem5|) (= main_~pa~0.base main_~pb~0.base)) [2020-07-18 00:22:00,059 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:22:00,060 INFO L264 CegarLoopResult]: At program point L18-4(lines 18 19) the Hoare annotation is: false [2020-07-18 00:22:00,060 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-18 00:22:00,060 INFO L264 CegarLoopResult]: At program point L18-5(lines 18 19) the Hoare annotation is: (and (not |main_#t~short8|) (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-18 00:22:00,099 INFO L163 areAnnotationChecker]: CFG has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:22:00,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:22:00 BoogieIcfgContainer [2020-07-18 00:22:00,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:22:00,119 INFO L168 Benchmark]: Toolchain (without parser) took 6789.93 ms. Allocated memory was 136.8 MB in the beginning and 286.3 MB in the end (delta: 149.4 MB). Free memory was 100.6 MB in the beginning and 131.8 MB in the end (delta: -31.2 MB). Peak memory consumption was 118.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:00,120 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:22:00,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.57 ms. Allocated memory is still 136.8 MB. Free memory was 100.1 MB in the beginning and 90.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:00,122 INFO L168 Benchmark]: Boogie Preprocessor took 171.02 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 90.0 MB in the beginning and 180.5 MB in the end (delta: -90.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:00,123 INFO L168 Benchmark]: RCFGBuilder took 627.38 ms. Allocated memory is still 202.4 MB. Free memory was 180.5 MB in the beginning and 153.4 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:00,124 INFO L168 Benchmark]: TraceAbstraction took 5662.82 ms. Allocated memory was 202.4 MB in the beginning and 286.3 MB in the end (delta: 83.9 MB). Free memory was 152.7 MB in the beginning and 131.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:00,128 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.23 ms. Allocated memory is still 136.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 320.57 ms. Allocated memory is still 136.8 MB. Free memory was 100.1 MB in the beginning and 90.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 171.02 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 90.0 MB in the beginning and 180.5 MB in the end (delta: -90.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 627.38 ms. Allocated memory is still 202.4 MB. Free memory was 180.5 MB in the beginning and 153.4 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5662.82 ms. Allocated memory was 202.4 MB in the beginning and 286.3 MB in the end (delta: 83.9 MB). Free memory was 152.7 MB in the beginning and 131.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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, 65 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.8s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 136 SDtfs, 114 SDslu, 264 SDs, 0 SdLazy, 273 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 65 LocationsWithAnnotation, 65 PreInvPairs, 78 NumberOfFragments, 428 HoareAnnotationTreeSize, 65 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 65 FomulaSimplificationsInter, 246 FormulaSimplificationTreeSizeReductionInter, 0.3s 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...