/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test29-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 22:23:26,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:23:26,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:23:26,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:23:26,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:23:26,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:23:26,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:23:26,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:23:26,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:23:26,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:23:26,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:23:26,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:23:26,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:23:26,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:23:26,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:23:26,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:23:26,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:23:26,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:23:26,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:23:26,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:23:26,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:23:26,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:23:26,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:23:26,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:23:26,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:23:26,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:23:26,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:23:26,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:23:26,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:23:26,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:23:26,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:23:26,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:23:26,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:23:26,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:23:26,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:23:26,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:23:26,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:23:26,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:23:26,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:23:26,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:23:26,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:23:26,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:23:26,937 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:23:26,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:23:26,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:23:26,940 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:23:26,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:23:26,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:23:26,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:23:26,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:23:26,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:23:26,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:23:26,941 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:23:26,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:23:26,944 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:23:26,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:23:26,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:23:26,945 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:23:26,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:23:26,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:23:26,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:23:26,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:23:26,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:23:26,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:23:26,947 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 22:23:27,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:23:27,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:23:27,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:23:27,281 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:23:27,282 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:23:27,283 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test29-2.c [2020-07-08 22:23:27,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1143e393a/e568b4c85c4642b4b8faa7fc0366fde2/FLAG6c231291e [2020-07-08 22:23:27,824 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:23:27,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test29-2.c [2020-07-08 22:23:27,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1143e393a/e568b4c85c4642b4b8faa7fc0366fde2/FLAG6c231291e [2020-07-08 22:23:28,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1143e393a/e568b4c85c4642b4b8faa7fc0366fde2 [2020-07-08 22:23:28,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:23:28,190 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:23:28,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:23:28,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:23:28,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:23:28,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:23:28" (1/1) ... [2020-07-08 22:23:28,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b173b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:28, skipping insertion in model container [2020-07-08 22:23:28,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:23:28" (1/1) ... [2020-07-08 22:23:28,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:23:28,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:23:28,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:23:28,441 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:23:28,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:23:28,480 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:23:28,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:28 WrapperNode [2020-07-08 22:23:28,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:23:28,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:23:28,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:23:28,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:23:28,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:28" (1/1) ... [2020-07-08 22:23:28,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:28" (1/1) ... [2020-07-08 22:23:28,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:28" (1/1) ... [2020-07-08 22:23:28,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:28" (1/1) ... [2020-07-08 22:23:28,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:28" (1/1) ... [2020-07-08 22:23:28,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:28" (1/1) ... [2020-07-08 22:23:28,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:28" (1/1) ... [2020-07-08 22:23:28,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:23:28,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:23:28,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:23:28,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:23:28,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:28" (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-08 22:23:28,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:23:28,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:23:28,686 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:23:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:23:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 22:23:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:23:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 22:23:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 22:23:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 22:23:28,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 22:23:28,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:23:28,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:23:29,018 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:23:29,018 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 22:23:29,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:23:29 BoogieIcfgContainer [2020-07-08 22:23:29,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:23:29,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:23:29,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:23:29,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:23:29,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:23:28" (1/3) ... [2020-07-08 22:23:29,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440a0484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:23:29, skipping insertion in model container [2020-07-08 22:23:29,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:28" (2/3) ... [2020-07-08 22:23:29,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440a0484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:23:29, skipping insertion in model container [2020-07-08 22:23:29,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:23:29" (3/3) ... [2020-07-08 22:23:29,035 INFO L109 eAbstractionObserver]: Analyzing ICFG test29-2.c [2020-07-08 22:23:29,048 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:23:29,058 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 22:23:29,075 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 22:23:29,100 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:23:29,100 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:23:29,100 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:23:29,101 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:23:29,101 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:23:29,101 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:23:29,101 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:23:29,101 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:23:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-08 22:23:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 22:23:29,145 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:23:29,147 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] [2020-07-08 22:23:29,150 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:23:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:23:29,164 INFO L82 PathProgramCache]: Analyzing trace with hash -374520961, now seen corresponding path program 1 times [2020-07-08 22:23:29,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:23:29,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1693608328] [2020-07-08 22:23:29,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:23:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:29,432 INFO L280 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {48#true} is VALID [2020-07-08 22:23:29,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-08 22:23:29,433 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-08 22:23:29,433 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-08 22:23:29,434 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#true} {48#true} #62#return; {48#true} is VALID [2020-07-08 22:23:29,441 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {56#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:23:29,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {48#true} is VALID [2020-07-08 22:23:29,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-08 22:23:29,443 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-08 22:23:29,444 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-08 22:23:29,444 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {48#true} {48#true} #62#return; {48#true} is VALID [2020-07-08 22:23:29,445 INFO L263 TraceCheckUtils]: 6: Hoare triple {48#true} call #t~ret4 := main(); {48#true} is VALID [2020-07-08 22:23:29,445 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {48#true} is VALID [2020-07-08 22:23:29,446 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4); srcloc: L13 {48#true} is VALID [2020-07-08 22:23:29,446 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {48#true} is VALID [2020-07-08 22:23:29,450 INFO L280 TraceCheckUtils]: 10: Hoare triple {48#true} ~n~0 := #t~nondet0; {48#true} is VALID [2020-07-08 22:23:29,450 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#true} havoc #t~nondet0; {48#true} is VALID [2020-07-08 22:23:29,451 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#true} assume !(0 != ~n~0); {48#true} is VALID [2020-07-08 22:23:29,451 INFO L280 TraceCheckUtils]: 13: Hoare triple {48#true} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {48#true} is VALID [2020-07-08 22:23:29,452 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#true} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {48#true} is VALID [2020-07-08 22:23:29,452 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#true} havoc #t~ite1.base, #t~ite1.offset; {48#true} is VALID [2020-07-08 22:23:29,453 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#true} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {48#true} is VALID [2020-07-08 22:23:29,454 INFO L280 TraceCheckUtils]: 17: Hoare triple {48#true} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L17 {48#true} is VALID [2020-07-08 22:23:29,455 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#true} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {48#true} is VALID [2020-07-08 22:23:29,459 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#true} assume !#t~short3; {55#(not |main_#t~short3|)} is VALID [2020-07-08 22:23:29,460 INFO L280 TraceCheckUtils]: 20: Hoare triple {55#(not |main_#t~short3|)} assume #t~short3; {49#false} is VALID [2020-07-08 22:23:29,461 INFO L280 TraceCheckUtils]: 21: Hoare triple {49#false} havoc #t~short3; {49#false} is VALID [2020-07-08 22:23:29,464 INFO L280 TraceCheckUtils]: 22: Hoare triple {49#false} havoc #t~mem2; {49#false} is VALID [2020-07-08 22:23:29,464 INFO L280 TraceCheckUtils]: 23: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-08 22:23:29,469 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-08 22:23:29,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1693608328] [2020-07-08 22:23:29,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:23:29,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 22:23:29,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688105195] [2020-07-08 22:23:29,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-08 22:23:29,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:23:29,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 22:23:29,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:29,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 22:23:29,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:23:29,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 22:23:29,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 22:23:29,572 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2020-07-08 22:23:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:29,888 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2020-07-08 22:23:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 22:23:29,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-08 22:23:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:23:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 22:23:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2020-07-08 22:23:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 22:23:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2020-07-08 22:23:29,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2020-07-08 22:23:30,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:30,037 INFO L225 Difference]: With dead ends: 54 [2020-07-08 22:23:30,037 INFO L226 Difference]: Without dead ends: 29 [2020-07-08 22:23:30,041 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 22:23:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-08 22:23:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-08 22:23:30,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:23:30,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-08 22:23:30,104 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-08 22:23:30,105 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-08 22:23:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:30,109 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-08 22:23:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-08 22:23:30,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:30,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:30,111 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-08 22:23:30,111 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-08 22:23:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:30,115 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-08 22:23:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-08 22:23:30,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:30,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:30,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:23:30,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:23:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-08 22:23:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-08 22:23:30,122 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2020-07-08 22:23:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:23:30,122 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-08 22:23:30,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 22:23:30,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2020-07-08 22:23:30,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-08 22:23:30,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 22:23:30,161 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:23:30,162 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] [2020-07-08 22:23:30,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:23:30,162 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:23:30,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:23:30,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1400624444, now seen corresponding path program 1 times [2020-07-08 22:23:30,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:23:30,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1429651762] [2020-07-08 22:23:30,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:23:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:30,307 INFO L280 TraceCheckUtils]: 0: Hoare triple {294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {283#true} is VALID [2020-07-08 22:23:30,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {283#true} #valid := #valid[0 := 0]; {283#true} is VALID [2020-07-08 22:23:30,308 INFO L280 TraceCheckUtils]: 2: Hoare triple {283#true} assume 0 < #StackHeapBarrier; {283#true} is VALID [2020-07-08 22:23:30,308 INFO L280 TraceCheckUtils]: 3: Hoare triple {283#true} assume true; {283#true} is VALID [2020-07-08 22:23:30,309 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {283#true} {283#true} #62#return; {283#true} is VALID [2020-07-08 22:23:30,310 INFO L263 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:23:30,311 INFO L280 TraceCheckUtils]: 1: Hoare triple {294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {283#true} is VALID [2020-07-08 22:23:30,311 INFO L280 TraceCheckUtils]: 2: Hoare triple {283#true} #valid := #valid[0 := 0]; {283#true} is VALID [2020-07-08 22:23:30,311 INFO L280 TraceCheckUtils]: 3: Hoare triple {283#true} assume 0 < #StackHeapBarrier; {283#true} is VALID [2020-07-08 22:23:30,312 INFO L280 TraceCheckUtils]: 4: Hoare triple {283#true} assume true; {283#true} is VALID [2020-07-08 22:23:30,312 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {283#true} {283#true} #62#return; {283#true} is VALID [2020-07-08 22:23:30,312 INFO L263 TraceCheckUtils]: 6: Hoare triple {283#true} call #t~ret4 := main(); {283#true} is VALID [2020-07-08 22:23:30,314 INFO L280 TraceCheckUtils]: 7: Hoare triple {283#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {290#(= 1 (select |#valid| |main_~#d1~0.base|))} is VALID [2020-07-08 22:23:30,315 INFO L280 TraceCheckUtils]: 8: Hoare triple {290#(= 1 (select |#valid| |main_~#d1~0.base|))} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4); srcloc: L13 {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:30,316 INFO L280 TraceCheckUtils]: 9: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:30,317 INFO L280 TraceCheckUtils]: 10: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} ~n~0 := #t~nondet0; {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:30,318 INFO L280 TraceCheckUtils]: 11: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} havoc #t~nondet0; {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:30,319 INFO L280 TraceCheckUtils]: 12: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume !(0 != ~n~0); {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:30,319 INFO L280 TraceCheckUtils]: 13: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {292#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:30,320 INFO L280 TraceCheckUtils]: 14: Hoare triple {292#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {293#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} is VALID [2020-07-08 22:23:30,322 INFO L280 TraceCheckUtils]: 15: Hoare triple {293#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} havoc #t~ite1.base, #t~ite1.offset; {293#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} is VALID [2020-07-08 22:23:30,322 INFO L280 TraceCheckUtils]: 16: Hoare triple {293#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {284#false} is VALID [2020-07-08 22:23:30,323 INFO L280 TraceCheckUtils]: 17: Hoare triple {284#false} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L17 {284#false} is VALID [2020-07-08 22:23:30,323 INFO L280 TraceCheckUtils]: 18: Hoare triple {284#false} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {284#false} is VALID [2020-07-08 22:23:30,324 INFO L280 TraceCheckUtils]: 19: Hoare triple {284#false} assume #t~short3; {284#false} is VALID [2020-07-08 22:23:30,324 INFO L280 TraceCheckUtils]: 20: Hoare triple {284#false} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1); srcloc: L21-1 {284#false} is VALID [2020-07-08 22:23:30,324 INFO L280 TraceCheckUtils]: 21: Hoare triple {284#false} #t~short3 := 0 != #t~mem2; {284#false} is VALID [2020-07-08 22:23:30,325 INFO L280 TraceCheckUtils]: 22: Hoare triple {284#false} assume #t~short3; {284#false} is VALID [2020-07-08 22:23:30,325 INFO L280 TraceCheckUtils]: 23: Hoare triple {284#false} havoc #t~short3; {284#false} is VALID [2020-07-08 22:23:30,325 INFO L280 TraceCheckUtils]: 24: Hoare triple {284#false} havoc #t~mem2; {284#false} is VALID [2020-07-08 22:23:30,326 INFO L280 TraceCheckUtils]: 25: Hoare triple {284#false} assume !false; {284#false} is VALID [2020-07-08 22:23:30,327 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-08 22:23:30,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1429651762] [2020-07-08 22:23:30,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:23:30,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 22:23:30,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776101783] [2020-07-08 22:23:30,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-07-08 22:23:30,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:23:30,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 22:23:30,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:30,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 22:23:30,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:23:30,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 22:23:30,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 22:23:30,367 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 7 states. [2020-07-08 22:23:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:30,824 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2020-07-08 22:23:30,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 22:23:30,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-07-08 22:23:30,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:23:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:23:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-08 22:23:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:23:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-08 22:23:30,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2020-07-08 22:23:30,930 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-08 22:23:30,933 INFO L225 Difference]: With dead ends: 52 [2020-07-08 22:23:30,933 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 22:23:30,936 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-08 22:23:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 22:23:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2020-07-08 22:23:31,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:23:31,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 32 states. [2020-07-08 22:23:31,024 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 32 states. [2020-07-08 22:23:31,024 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 32 states. [2020-07-08 22:23:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:31,030 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-08 22:23:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-08 22:23:31,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:31,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:31,032 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 42 states. [2020-07-08 22:23:31,032 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 42 states. [2020-07-08 22:23:31,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:31,039 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-08 22:23:31,039 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-08 22:23:31,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:31,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:31,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:23:31,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:23:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 22:23:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-08 22:23:31,046 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2020-07-08 22:23:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:23:31,046 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-08 22:23:31,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 22:23:31,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-08 22:23:31,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-08 22:23:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 22:23:31,098 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:23:31,105 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] [2020-07-08 22:23:31,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:23:31,106 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:23:31,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:23:31,106 INFO L82 PathProgramCache]: Analyzing trace with hash -316312164, now seen corresponding path program 1 times [2020-07-08 22:23:31,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:23:31,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1873137043] [2020-07-08 22:23:31,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:23:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:31,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {570#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {557#true} is VALID [2020-07-08 22:23:31,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} #valid := #valid[0 := 0]; {557#true} is VALID [2020-07-08 22:23:31,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {557#true} assume 0 < #StackHeapBarrier; {557#true} is VALID [2020-07-08 22:23:31,261 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-08 22:23:31,261 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {557#true} {557#true} #62#return; {557#true} is VALID [2020-07-08 22:23:31,263 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {570#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:23:31,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {570#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {557#true} is VALID [2020-07-08 22:23:31,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {557#true} #valid := #valid[0 := 0]; {557#true} is VALID [2020-07-08 22:23:31,264 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} assume 0 < #StackHeapBarrier; {557#true} is VALID [2020-07-08 22:23:31,264 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-08 22:23:31,264 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {557#true} {557#true} #62#return; {557#true} is VALID [2020-07-08 22:23:31,265 INFO L263 TraceCheckUtils]: 6: Hoare triple {557#true} call #t~ret4 := main(); {557#true} is VALID [2020-07-08 22:23:31,265 INFO L280 TraceCheckUtils]: 7: Hoare triple {557#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {557#true} is VALID [2020-07-08 22:23:31,265 INFO L280 TraceCheckUtils]: 8: Hoare triple {557#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4); srcloc: L13 {557#true} is VALID [2020-07-08 22:23:31,266 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {557#true} is VALID [2020-07-08 22:23:31,266 INFO L280 TraceCheckUtils]: 10: Hoare triple {557#true} ~n~0 := #t~nondet0; {557#true} is VALID [2020-07-08 22:23:31,266 INFO L280 TraceCheckUtils]: 11: Hoare triple {557#true} havoc #t~nondet0; {557#true} is VALID [2020-07-08 22:23:31,267 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} assume !(0 != ~n~0); {557#true} is VALID [2020-07-08 22:23:31,267 INFO L280 TraceCheckUtils]: 13: Hoare triple {557#true} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {564#(and (= |main_#t~ite1.offset| |main_~#d2~0.offset|) (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:31,268 INFO L280 TraceCheckUtils]: 14: Hoare triple {564#(and (= |main_#t~ite1.offset| |main_~#d2~0.offset|) (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {565#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:31,269 INFO L280 TraceCheckUtils]: 15: Hoare triple {565#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} havoc #t~ite1.base, #t~ite1.offset; {565#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:31,270 INFO L280 TraceCheckUtils]: 16: Hoare triple {565#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset); {565#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:31,271 INFO L280 TraceCheckUtils]: 17: Hoare triple {565#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 1); srcloc: L19 {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:31,272 INFO L280 TraceCheckUtils]: 18: Hoare triple {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) (= main_~pd~0.base |main_~#d2~0.base|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {567#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} is VALID [2020-07-08 22:23:31,273 INFO L280 TraceCheckUtils]: 19: Hoare triple {567#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} assume #t~short3; {567#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} is VALID [2020-07-08 22:23:31,274 INFO L280 TraceCheckUtils]: 20: Hoare triple {567#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1); srcloc: L21-1 {568#(= 0 |main_#t~mem2|)} is VALID [2020-07-08 22:23:31,275 INFO L280 TraceCheckUtils]: 21: Hoare triple {568#(= 0 |main_#t~mem2|)} #t~short3 := 0 != #t~mem2; {569#(not |main_#t~short3|)} is VALID [2020-07-08 22:23:31,276 INFO L280 TraceCheckUtils]: 22: Hoare triple {569#(not |main_#t~short3|)} assume #t~short3; {558#false} is VALID [2020-07-08 22:23:31,276 INFO L280 TraceCheckUtils]: 23: Hoare triple {558#false} havoc #t~short3; {558#false} is VALID [2020-07-08 22:23:31,276 INFO L280 TraceCheckUtils]: 24: Hoare triple {558#false} havoc #t~mem2; {558#false} is VALID [2020-07-08 22:23:31,277 INFO L280 TraceCheckUtils]: 25: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-08 22:23:31,278 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-08 22:23:31,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1873137043] [2020-07-08 22:23:31,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:23:31,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 22:23:31,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076229868] [2020-07-08 22:23:31,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-08 22:23:31,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:23:31,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 22:23:31,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:31,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 22:23:31,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:23:31,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 22:23:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-08 22:23:31,311 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 9 states. [2020-07-08 22:23:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:31,724 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-08 22:23:31,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 22:23:31,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-08 22:23:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:23:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 22:23:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2020-07-08 22:23:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 22:23:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2020-07-08 22:23:31,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2020-07-08 22:23:31,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:31,790 INFO L225 Difference]: With dead ends: 42 [2020-07-08 22:23:31,790 INFO L226 Difference]: Without dead ends: 28 [2020-07-08 22:23:31,791 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-08 22:23:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-08 22:23:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-08 22:23:31,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:23:31,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-08 22:23:31,858 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 22:23:31,858 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 22:23:31,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:31,864 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-08 22:23:31,864 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-08 22:23:31,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:31,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:31,865 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 22:23:31,865 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 22:23:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:31,869 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-08 22:23:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-08 22:23:31,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:31,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:31,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:23:31,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:23:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-08 22:23:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-08 22:23:31,874 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2020-07-08 22:23:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:23:31,875 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-08 22:23:31,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 22:23:31,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2020-07-08 22:23:31,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-08 22:23:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 22:23:31,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:23:31,912 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] [2020-07-08 22:23:31,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 22:23:31,912 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:23:31,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:23:31,913 INFO L82 PathProgramCache]: Analyzing trace with hash -497457956, now seen corresponding path program 1 times [2020-07-08 22:23:31,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:23:31,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2105430307] [2020-07-08 22:23:31,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:23:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:32,062 INFO L280 TraceCheckUtils]: 0: Hoare triple {788#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {775#true} is VALID [2020-07-08 22:23:32,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {775#true} #valid := #valid[0 := 0]; {775#true} is VALID [2020-07-08 22:23:32,063 INFO L280 TraceCheckUtils]: 2: Hoare triple {775#true} assume 0 < #StackHeapBarrier; {775#true} is VALID [2020-07-08 22:23:32,063 INFO L280 TraceCheckUtils]: 3: Hoare triple {775#true} assume true; {775#true} is VALID [2020-07-08 22:23:32,063 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {775#true} {775#true} #62#return; {775#true} is VALID [2020-07-08 22:23:32,065 INFO L263 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {788#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:23:32,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {788#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {775#true} is VALID [2020-07-08 22:23:32,066 INFO L280 TraceCheckUtils]: 2: Hoare triple {775#true} #valid := #valid[0 := 0]; {775#true} is VALID [2020-07-08 22:23:32,066 INFO L280 TraceCheckUtils]: 3: Hoare triple {775#true} assume 0 < #StackHeapBarrier; {775#true} is VALID [2020-07-08 22:23:32,066 INFO L280 TraceCheckUtils]: 4: Hoare triple {775#true} assume true; {775#true} is VALID [2020-07-08 22:23:32,066 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {775#true} {775#true} #62#return; {775#true} is VALID [2020-07-08 22:23:32,067 INFO L263 TraceCheckUtils]: 6: Hoare triple {775#true} call #t~ret4 := main(); {775#true} is VALID [2020-07-08 22:23:32,068 INFO L280 TraceCheckUtils]: 7: Hoare triple {775#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {782#(= 1 (select |#valid| |main_~#d1~0.base|))} is VALID [2020-07-08 22:23:32,070 INFO L280 TraceCheckUtils]: 8: Hoare triple {782#(= 1 (select |#valid| |main_~#d1~0.base|))} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4); srcloc: L13 {783#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:32,072 INFO L280 TraceCheckUtils]: 9: Hoare triple {783#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {783#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:32,072 INFO L280 TraceCheckUtils]: 10: Hoare triple {783#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} ~n~0 := #t~nondet0; {783#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:32,073 INFO L280 TraceCheckUtils]: 11: Hoare triple {783#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} havoc #t~nondet0; {783#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:32,074 INFO L280 TraceCheckUtils]: 12: Hoare triple {783#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume 0 != ~n~0; {783#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:32,075 INFO L280 TraceCheckUtils]: 13: Hoare triple {783#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} #t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {784#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} is VALID [2020-07-08 22:23:32,075 INFO L280 TraceCheckUtils]: 14: Hoare triple {784#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {785#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-08 22:23:32,076 INFO L280 TraceCheckUtils]: 15: Hoare triple {785#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_~#d1~0.base| main_~pd~0.base))} havoc #t~ite1.base, #t~ite1.offset; {785#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-08 22:23:32,077 INFO L280 TraceCheckUtils]: 16: Hoare triple {785#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_~#d1~0.base| main_~pd~0.base))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:32,078 INFO L280 TraceCheckUtils]: 17: Hoare triple {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L17 {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:32,079 INFO L280 TraceCheckUtils]: 18: Hoare triple {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {787#(not |main_#t~short3|)} is VALID [2020-07-08 22:23:32,079 INFO L280 TraceCheckUtils]: 19: Hoare triple {787#(not |main_#t~short3|)} assume #t~short3; {776#false} is VALID [2020-07-08 22:23:32,080 INFO L280 TraceCheckUtils]: 20: Hoare triple {776#false} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1); srcloc: L21-1 {776#false} is VALID [2020-07-08 22:23:32,080 INFO L280 TraceCheckUtils]: 21: Hoare triple {776#false} #t~short3 := 0 != #t~mem2; {776#false} is VALID [2020-07-08 22:23:32,080 INFO L280 TraceCheckUtils]: 22: Hoare triple {776#false} assume #t~short3; {776#false} is VALID [2020-07-08 22:23:32,080 INFO L280 TraceCheckUtils]: 23: Hoare triple {776#false} havoc #t~short3; {776#false} is VALID [2020-07-08 22:23:32,081 INFO L280 TraceCheckUtils]: 24: Hoare triple {776#false} havoc #t~mem2; {776#false} is VALID [2020-07-08 22:23:32,081 INFO L280 TraceCheckUtils]: 25: Hoare triple {776#false} assume !false; {776#false} is VALID [2020-07-08 22:23:32,090 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-08 22:23:32,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2105430307] [2020-07-08 22:23:32,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:23:32,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 22:23:32,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498169516] [2020-07-08 22:23:32,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-08 22:23:32,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:23:32,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 22:23:32,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:32,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 22:23:32,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:23:32,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 22:23:32,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 22:23:32,131 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 9 states. [2020-07-08 22:23:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:32,420 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-08 22:23:32,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 22:23:32,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-08 22:23:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:23:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 22:23:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-07-08 22:23:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 22:23:32,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-07-08 22:23:32,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 28 transitions. [2020-07-08 22:23:32,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:32,459 INFO L225 Difference]: With dead ends: 28 [2020-07-08 22:23:32,459 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 22:23:32,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-07-08 22:23:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 22:23:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 22:23:32,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:23:32,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 22:23:32,461 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:23:32,461 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:23:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:32,462 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:23:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:23:32,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:32,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:32,463 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:23:32,463 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:23:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:32,463 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:23:32,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:23:32,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:32,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:32,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:23:32,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:23:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 22:23:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 22:23:32,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-07-08 22:23:32,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:23:32,465 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 22:23:32,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 22:23:32,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 22:23:32,465 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-08 22:23:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:23:32,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:32,466 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 22:23:32,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 22:23:32,863 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 22:23:32,863 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-08 22:23:32,863 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:23:32,863 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-08 22:23:32,864 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:23:32,864 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:23:32,864 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 22:23:32,864 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 22:23:32,864 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:23:32,865 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 29) the Hoare annotation is: true [2020-07-08 22:23:32,865 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|) .cse0 .cse1) (and .cse0 .cse1 (= |main_~#d1~0.base| main_~pd~0.base)))) [2020-07-08 22:23:32,865 INFO L264 CegarLoopResult]: At program point L19-1(lines 16 20) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) (= main_~pd~0.base |main_~#d2~0.base|) .cse0 .cse1) (and .cse0 .cse1 (= |main_~#d1~0.base| main_~pd~0.base)))) [2020-07-08 22:23:32,865 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:32,865 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:32,865 INFO L264 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:32,866 INFO L264 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (= |main_#t~ite1.offset| |main_~#d2~0.offset|) .cse0 (= |main_#t~ite1.base| |main_~#d2~0.base|) .cse1) (and (= |main_~#d1~0.base| |main_#t~ite1.base|) .cse0 .cse1))) [2020-07-08 22:23:32,866 INFO L264 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (= |main_~#d1~0.base| |main_#t~ite1.base|) .cse0 .cse1 (= |main_~#d1~0.base| main_~pd~0.base)) (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|) (= |main_#t~ite1.offset| |main_~#d2~0.offset|) .cse0 (= |main_#t~ite1.base| |main_~#d2~0.base|) .cse1))) [2020-07-08 22:23:32,866 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: false [2020-07-08 22:23:32,866 INFO L264 CegarLoopResult]: At program point L16(lines 16 20) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|) .cse0 .cse1) (and .cse0 .cse1 (= |main_~#d1~0.base| main_~pd~0.base)))) [2020-07-08 22:23:32,866 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-08 22:23:32,866 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) (= main_~pd~0.base |main_~#d2~0.base|) .cse0 .cse1) (and .cse0 .cse1 (not |main_#t~short3|) (= |main_~#d1~0.base| main_~pd~0.base)))) [2020-07-08 22:23:32,867 INFO L264 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:32,867 INFO L264 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) (= 0 |main_#t~mem2|) (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:32,867 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|)) (= |main_~#d1~0.base| main_~pd~0.base)) [2020-07-08 22:23:32,867 INFO L264 CegarLoopResult]: At program point L21-4(lines 21 23) the Hoare annotation is: (not |main_#t~short3|) [2020-07-08 22:23:32,867 INFO L264 CegarLoopResult]: At program point L21-5(line 21) the Hoare annotation is: false [2020-07-08 22:23:32,868 INFO L264 CegarLoopResult]: At program point L21-6(line 21) the Hoare annotation is: false [2020-07-08 22:23:32,868 INFO L264 CegarLoopResult]: At program point L21-7(line 21) the Hoare annotation is: (not |main_#t~short3|) [2020-07-08 22:23:32,868 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (= 1 (select |#valid| |main_~#d1~0.base|)) [2020-07-08 22:23:32,868 INFO L271 CegarLoopResult]: At program point L21-8(line 21) the Hoare annotation is: true [2020-07-08 22:23:32,868 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 11 29) the Hoare annotation is: true [2020-07-08 22:23:32,868 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:32,868 INFO L271 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: true [2020-07-08 22:23:32,869 INFO L271 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: true [2020-07-08 22:23:32,869 INFO L271 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: true [2020-07-08 22:23:32,869 INFO L271 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: true [2020-07-08 22:23:32,869 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: false [2020-07-08 22:23:32,869 INFO L264 CegarLoopResult]: At program point L13-7(line 13) the Hoare annotation is: false [2020-07-08 22:23:32,869 INFO L264 CegarLoopResult]: At program point L13-8(line 13) the Hoare annotation is: false [2020-07-08 22:23:32,869 INFO L264 CegarLoopResult]: At program point L13-9(line 13) the Hoare annotation is: false [2020-07-08 22:23:32,870 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) the Hoare annotation is: false [2020-07-08 22:23:32,870 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 29) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-08 22:23:32,870 INFO L264 CegarLoopResult]: At program point L22(lines 12 29) the Hoare annotation is: false [2020-07-08 22:23:32,870 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:32,870 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:32,889 INFO L163 areAnnotationChecker]: CFG has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 22:23:32,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:23:32 BoogieIcfgContainer [2020-07-08 22:23:32,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:23:32,903 INFO L168 Benchmark]: Toolchain (without parser) took 4712.34 ms. Allocated memory was 145.2 MB in the beginning and 280.5 MB in the end (delta: 135.3 MB). Free memory was 103.8 MB in the beginning and 242.4 MB in the end (delta: -138.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 22:23:32,904 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 22:23:32,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.25 ms. Allocated memory is still 145.2 MB. Free memory was 103.6 MB in the beginning and 93.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-08 22:23:32,906 INFO L168 Benchmark]: Boogie Preprocessor took 139.95 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 93.3 MB in the beginning and 180.4 MB in the end (delta: -87.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-08 22:23:32,907 INFO L168 Benchmark]: RCFGBuilder took 403.17 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 157.6 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2020-07-08 22:23:32,908 INFO L168 Benchmark]: TraceAbstraction took 3873.40 ms. Allocated memory was 202.4 MB in the beginning and 280.5 MB in the end (delta: 78.1 MB). Free memory was 157.6 MB in the beginning and 242.4 MB in the end (delta: -84.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 22:23:32,912 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.25 ms. Allocated memory is still 145.2 MB. Free memory was 103.6 MB in the beginning and 93.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.95 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 93.3 MB in the beginning and 180.4 MB in the end (delta: -87.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 403.17 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 157.6 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3873.40 ms. Allocated memory was 202.4 MB in the beginning and 280.5 MB in the end (delta: 78.1 MB). Free memory was 157.6 MB in the beginning and 242.4 MB in the end (delta: -84.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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: 11]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 95 SDtfs, 106 SDslu, 245 SDs, 0 SdLazy, 230 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 45 PreInvPairs, 62 NumberOfFragments, 374 HoareAnnotationTreeSize, 45 FomulaSimplifications, 191 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 6784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...