/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-8fc6572 [2020-07-11 01:07:18,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:07:18,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:07:18,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:07:18,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:07:18,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:07:18,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:07:18,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:07:18,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:07:18,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:07:18,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:07:18,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:07:18,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:07:18,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:07:18,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:07:18,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:07:18,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:07:18,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:07:18,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:07:18,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:07:18,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:07:18,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:07:18,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:07:18,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:07:18,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:07:18,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:07:18,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:07:18,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:07:18,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:07:18,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:07:18,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:07:18,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:07:18,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:07:18,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:07:18,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:07:18,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:07:18,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:07:18,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:07:18,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:07:18,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:07:18,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:07:18,292 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 01:07:18,301 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:07:18,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:07:18,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:07:18,306 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:07:18,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:07:18,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:07:18,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:07:18,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:07:18,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:07:18,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:07:18,307 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:07:18,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:07:18,307 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:07:18,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:07:18,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:07:18,308 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:07:18,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:07:18,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:07:18,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:07:18,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:07:18,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:07:18,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:07:18,309 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-11 01:07:18,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:07:18,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:07:18,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:07:18,611 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:07:18,611 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:07:18,612 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-11 01:07:18,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65adb88ae/a31785e9e8df4004a033618847d84ee1/FLAG57bbef106 [2020-07-11 01:07:19,134 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:07:19,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test29-2.c [2020-07-11 01:07:19,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65adb88ae/a31785e9e8df4004a033618847d84ee1/FLAG57bbef106 [2020-07-11 01:07:19,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65adb88ae/a31785e9e8df4004a033618847d84ee1 [2020-07-11 01:07:19,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:07:19,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:07:19,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:07:19,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:07:19,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:07:19,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:07:19" (1/1) ... [2020-07-11 01:07:19,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1bd7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:19, skipping insertion in model container [2020-07-11 01:07:19,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:07:19" (1/1) ... [2020-07-11 01:07:19,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:07:19,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:07:19,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:07:19,758 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:07:19,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:07:19,793 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:07:19,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:19 WrapperNode [2020-07-11 01:07:19,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:07:19,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:07:19,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:07:19,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:07:19,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:19" (1/1) ... [2020-07-11 01:07:19,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:19" (1/1) ... [2020-07-11 01:07:19,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:19" (1/1) ... [2020-07-11 01:07:19,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:19" (1/1) ... [2020-07-11 01:07:19,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:19" (1/1) ... [2020-07-11 01:07:19,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:19" (1/1) ... [2020-07-11 01:07:19,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:19" (1/1) ... [2020-07-11 01:07:19,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:07:19,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:07:19,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:07:19,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:07:19,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:19" (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-11 01:07:19,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:07:19,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:07:19,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:07:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:07:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:07:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:07:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 01:07:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 01:07:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 01:07:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 01:07:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:07:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:07:20,335 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:07:20,336 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 01:07:20,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:07:20 BoogieIcfgContainer [2020-07-11 01:07:20,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:07:20,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:07:20,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:07:20,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:07:20,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:07:19" (1/3) ... [2020-07-11 01:07:20,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd196f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:07:20, skipping insertion in model container [2020-07-11 01:07:20,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:19" (2/3) ... [2020-07-11 01:07:20,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd196f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:07:20, skipping insertion in model container [2020-07-11 01:07:20,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:07:20" (3/3) ... [2020-07-11 01:07:20,349 INFO L109 eAbstractionObserver]: Analyzing ICFG test29-2.c [2020-07-11 01:07:20,361 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:07:20,373 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 01:07:20,386 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 01:07:20,409 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:07:20,409 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:07:20,409 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:07:20,410 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:07:20,410 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:07:20,410 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:07:20,410 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:07:20,410 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:07:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-11 01:07:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 01:07:20,437 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:07:20,438 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-11 01:07:20,438 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:07:20,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:07:20,443 INFO L82 PathProgramCache]: Analyzing trace with hash -374520961, now seen corresponding path program 1 times [2020-07-11 01:07:20,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:07:20,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [772581195] [2020-07-11 01:07:20,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:07:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:20,699 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-11 01:07:20,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-11 01:07:20,700 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-11 01:07:20,700 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-11 01:07:20,701 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#true} {48#true} #62#return; {48#true} is VALID [2020-07-11 01:07:20,705 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-11 01:07:20,705 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-11 01:07:20,706 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-11 01:07:20,706 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-11 01:07:20,706 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-11 01:07:20,707 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {48#true} {48#true} #62#return; {48#true} is VALID [2020-07-11 01:07:20,707 INFO L263 TraceCheckUtils]: 6: Hoare triple {48#true} call #t~ret4 := main(); {48#true} is VALID [2020-07-11 01:07:20,707 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-11 01:07:20,708 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-11 01:07:20,708 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {48#true} is VALID [2020-07-11 01:07:20,708 INFO L280 TraceCheckUtils]: 10: Hoare triple {48#true} ~n~0 := #t~nondet0; {48#true} is VALID [2020-07-11 01:07:20,709 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#true} havoc #t~nondet0; {48#true} is VALID [2020-07-11 01:07:20,709 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#true} assume !(0 != ~n~0); {48#true} is VALID [2020-07-11 01:07:20,710 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-11 01:07:20,710 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-11 01:07:20,710 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#true} havoc #t~ite1.base, #t~ite1.offset; {48#true} is VALID [2020-07-11 01:07:20,711 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-11 01:07:20,711 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-11 01:07:20,712 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-11 01:07:20,713 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#true} assume !#t~short3; {55#(not |main_#t~short3|)} is VALID [2020-07-11 01:07:20,714 INFO L280 TraceCheckUtils]: 20: Hoare triple {55#(not |main_#t~short3|)} assume #t~short3; {49#false} is VALID [2020-07-11 01:07:20,714 INFO L280 TraceCheckUtils]: 21: Hoare triple {49#false} havoc #t~mem2; {49#false} is VALID [2020-07-11 01:07:20,715 INFO L280 TraceCheckUtils]: 22: Hoare triple {49#false} havoc #t~short3; {49#false} is VALID [2020-07-11 01:07:20,715 INFO L280 TraceCheckUtils]: 23: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-11 01:07:20,719 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-11 01:07:20,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [772581195] [2020-07-11 01:07:20,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:07:20,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:07:20,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254084825] [2020-07-11 01:07:20,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-11 01:07:20,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:07:20,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:07:20,799 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-11 01:07:20,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:07:20,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:07:20,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:07:20,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:07:20,812 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2020-07-11 01:07:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:21,070 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2020-07-11 01:07:21,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:07:21,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-11 01:07:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:07:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:07:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2020-07-11 01:07:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:07:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2020-07-11 01:07:21,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2020-07-11 01:07:21,175 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-11 01:07:21,191 INFO L225 Difference]: With dead ends: 54 [2020-07-11 01:07:21,192 INFO L226 Difference]: Without dead ends: 29 [2020-07-11 01:07:21,197 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-11 01:07:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-11 01:07:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-11 01:07:21,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:07:21,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-11 01:07:21,281 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-11 01:07:21,281 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-11 01:07:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:21,285 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-11 01:07:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-11 01:07:21,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:21,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:21,287 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-11 01:07:21,287 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-11 01:07:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:21,292 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-11 01:07:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-11 01:07:21,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:21,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:21,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:07:21,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:07:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-11 01:07:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-11 01:07:21,298 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2020-07-11 01:07:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:07:21,298 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-11 01:07:21,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:07:21,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2020-07-11 01:07:21,340 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-11 01:07:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-11 01:07:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 01:07:21,341 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:07:21,341 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-11 01:07:21,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:07:21,342 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:07:21,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:07:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1400624444, now seen corresponding path program 1 times [2020-07-11 01:07:21,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:07:21,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1987597648] [2020-07-11 01:07:21,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:07:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:21,482 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-11 01:07:21,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {283#true} #valid := #valid[0 := 0]; {283#true} is VALID [2020-07-11 01:07:21,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {283#true} assume 0 < #StackHeapBarrier; {283#true} is VALID [2020-07-11 01:07:21,483 INFO L280 TraceCheckUtils]: 3: Hoare triple {283#true} assume true; {283#true} is VALID [2020-07-11 01:07:21,483 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {283#true} {283#true} #62#return; {283#true} is VALID [2020-07-11 01:07:21,485 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-11 01:07:21,485 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-11 01:07:21,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {283#true} #valid := #valid[0 := 0]; {283#true} is VALID [2020-07-11 01:07:21,486 INFO L280 TraceCheckUtils]: 3: Hoare triple {283#true} assume 0 < #StackHeapBarrier; {283#true} is VALID [2020-07-11 01:07:21,486 INFO L280 TraceCheckUtils]: 4: Hoare triple {283#true} assume true; {283#true} is VALID [2020-07-11 01:07:21,487 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {283#true} {283#true} #62#return; {283#true} is VALID [2020-07-11 01:07:21,487 INFO L263 TraceCheckUtils]: 6: Hoare triple {283#true} call #t~ret4 := main(); {283#true} is VALID [2020-07-11 01:07:21,489 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-11 01:07:21,490 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-11 01:07:21,491 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-11 01:07:21,492 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-11 01:07:21,493 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-11 01:07:21,494 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-11 01:07:21,495 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#(not (= |main_~#d1~0.base| |main_#t~ite1.base|))} is VALID [2020-07-11 01:07:21,496 INFO L280 TraceCheckUtils]: 14: Hoare triple {292#(not (= |main_~#d1~0.base| |main_#t~ite1.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {293#(not (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-11 01:07:21,496 INFO L280 TraceCheckUtils]: 15: Hoare triple {293#(not (= |main_~#d1~0.base| main_~pd~0.base))} havoc #t~ite1.base, #t~ite1.offset; {293#(not (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-11 01:07:21,497 INFO L280 TraceCheckUtils]: 16: Hoare triple {293#(not (= |main_~#d1~0.base| main_~pd~0.base))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {284#false} is VALID [2020-07-11 01:07:21,498 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-11 01:07:21,498 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-11 01:07:21,498 INFO L280 TraceCheckUtils]: 19: Hoare triple {284#false} assume #t~short3; {284#false} is VALID [2020-07-11 01:07:21,499 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-11 01:07:21,499 INFO L280 TraceCheckUtils]: 21: Hoare triple {284#false} #t~short3 := 0 != #t~mem2; {284#false} is VALID [2020-07-11 01:07:21,499 INFO L280 TraceCheckUtils]: 22: Hoare triple {284#false} assume #t~short3; {284#false} is VALID [2020-07-11 01:07:21,500 INFO L280 TraceCheckUtils]: 23: Hoare triple {284#false} havoc #t~mem2; {284#false} is VALID [2020-07-11 01:07:21,500 INFO L280 TraceCheckUtils]: 24: Hoare triple {284#false} havoc #t~short3; {284#false} is VALID [2020-07-11 01:07:21,500 INFO L280 TraceCheckUtils]: 25: Hoare triple {284#false} assume !false; {284#false} is VALID [2020-07-11 01:07:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:07:21,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1987597648] [2020-07-11 01:07:21,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:07:21,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 01:07:21,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553754969] [2020-07-11 01:07:21,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-07-11 01:07:21,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:07:21,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 01:07:21,547 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-11 01:07:21,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 01:07:21,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:07:21,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 01:07:21,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 01:07:21,548 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 7 states. [2020-07-11 01:07:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:21,944 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2020-07-11 01:07:21,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 01:07:21,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-07-11 01:07:21,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:07:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:07:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-11 01:07:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:07:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-11 01:07:21,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2020-07-11 01:07:22,029 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-11 01:07:22,032 INFO L225 Difference]: With dead ends: 52 [2020-07-11 01:07:22,032 INFO L226 Difference]: Without dead ends: 42 [2020-07-11 01:07:22,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-11 01:07:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-11 01:07:22,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2020-07-11 01:07:22,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:07:22,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 32 states. [2020-07-11 01:07:22,104 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 32 states. [2020-07-11 01:07:22,105 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 32 states. [2020-07-11 01:07:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:22,109 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-11 01:07:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-11 01:07:22,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:22,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:22,110 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 42 states. [2020-07-11 01:07:22,110 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 42 states. [2020-07-11 01:07:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:22,114 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-11 01:07:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-11 01:07:22,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:22,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:22,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:07:22,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:07:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 01:07:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-11 01:07:22,119 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2020-07-11 01:07:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:07:22,119 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-11 01:07:22,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 01:07:22,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-11 01:07:22,167 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-11 01:07:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-11 01:07:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 01:07:22,169 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:07:22,169 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-11 01:07:22,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:07:22,170 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:07:22,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:07:22,171 INFO L82 PathProgramCache]: Analyzing trace with hash -316312164, now seen corresponding path program 1 times [2020-07-11 01:07:22,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:07:22,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [619823122] [2020-07-11 01:07:22,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:07:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:22,316 INFO L280 TraceCheckUtils]: 0: Hoare triple {569#(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-11 01:07:22,317 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} #valid := #valid[0 := 0]; {557#true} is VALID [2020-07-11 01:07:22,317 INFO L280 TraceCheckUtils]: 2: Hoare triple {557#true} assume 0 < #StackHeapBarrier; {557#true} is VALID [2020-07-11 01:07:22,317 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-11 01:07:22,318 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {557#true} {557#true} #62#return; {557#true} is VALID [2020-07-11 01:07:22,319 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {569#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:07:22,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {569#(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-11 01:07:22,320 INFO L280 TraceCheckUtils]: 2: Hoare triple {557#true} #valid := #valid[0 := 0]; {557#true} is VALID [2020-07-11 01:07:22,320 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} assume 0 < #StackHeapBarrier; {557#true} is VALID [2020-07-11 01:07:22,320 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-11 01:07:22,321 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {557#true} {557#true} #62#return; {557#true} is VALID [2020-07-11 01:07:22,321 INFO L263 TraceCheckUtils]: 6: Hoare triple {557#true} call #t~ret4 := main(); {557#true} is VALID [2020-07-11 01:07:22,321 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-11 01:07:22,321 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-11 01:07:22,322 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {557#true} is VALID [2020-07-11 01:07:22,322 INFO L280 TraceCheckUtils]: 10: Hoare triple {557#true} ~n~0 := #t~nondet0; {557#true} is VALID [2020-07-11 01:07:22,322 INFO L280 TraceCheckUtils]: 11: Hoare triple {557#true} havoc #t~nondet0; {557#true} is VALID [2020-07-11 01:07:22,323 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} assume !(0 != ~n~0); {557#true} is VALID [2020-07-11 01:07:22,324 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-11 01:07:22,325 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-11 01:07:22,326 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-11 01:07:22,327 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-11 01:07:22,329 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#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} is VALID [2020-07-11 01:07:22,329 INFO L280 TraceCheckUtils]: 18: Hoare triple {566#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {566#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} is VALID [2020-07-11 01:07:22,330 INFO L280 TraceCheckUtils]: 19: Hoare triple {566#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} assume #t~short3; {566#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} is VALID [2020-07-11 01:07:22,332 INFO L280 TraceCheckUtils]: 20: Hoare triple {566#(= 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 {567#(= 0 |main_#t~mem2|)} is VALID [2020-07-11 01:07:22,332 INFO L280 TraceCheckUtils]: 21: Hoare triple {567#(= 0 |main_#t~mem2|)} #t~short3 := 0 != #t~mem2; {568#(not |main_#t~short3|)} is VALID [2020-07-11 01:07:22,333 INFO L280 TraceCheckUtils]: 22: Hoare triple {568#(not |main_#t~short3|)} assume #t~short3; {558#false} is VALID [2020-07-11 01:07:22,333 INFO L280 TraceCheckUtils]: 23: Hoare triple {558#false} havoc #t~mem2; {558#false} is VALID [2020-07-11 01:07:22,334 INFO L280 TraceCheckUtils]: 24: Hoare triple {558#false} havoc #t~short3; {558#false} is VALID [2020-07-11 01:07:22,334 INFO L280 TraceCheckUtils]: 25: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-11 01:07:22,336 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-11 01:07:22,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [619823122] [2020-07-11 01:07:22,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:07:22,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 01:07:22,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540045698] [2020-07-11 01:07:22,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-11 01:07:22,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:07:22,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 01:07:22,368 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-11 01:07:22,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 01:07:22,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:07:22,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 01:07:22,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:07:22,369 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 8 states. [2020-07-11 01:07:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:22,749 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-11 01:07:22,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 01:07:22,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-11 01:07:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:07:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:07:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2020-07-11 01:07:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:07:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2020-07-11 01:07:22,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2020-07-11 01:07:22,797 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-11 01:07:22,799 INFO L225 Difference]: With dead ends: 42 [2020-07-11 01:07:22,799 INFO L226 Difference]: Without dead ends: 28 [2020-07-11 01:07:22,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-11 01:07:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-11 01:07:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-11 01:07:22,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:07:22,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-11 01:07:22,850 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 01:07:22,850 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 01:07:22,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:22,853 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-11 01:07:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-11 01:07:22,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:22,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:22,854 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 01:07:22,854 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 01:07:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:22,856 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-11 01:07:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-11 01:07:22,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:22,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:22,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:07:22,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:07:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 01:07:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-11 01:07:22,860 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2020-07-11 01:07:22,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:07:22,860 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-11 01:07:22,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 01:07:22,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2020-07-11 01:07:22,894 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-11 01:07:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-11 01:07:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 01:07:22,895 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:07:22,896 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-11 01:07:22,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:07:22,896 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:07:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:07:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash -497457956, now seen corresponding path program 1 times [2020-07-11 01:07:22,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:07:22,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1644467375] [2020-07-11 01:07:22,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:07:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:23,010 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; {776#true} is VALID [2020-07-11 01:07:23,010 INFO L280 TraceCheckUtils]: 1: Hoare triple {776#true} #valid := #valid[0 := 0]; {776#true} is VALID [2020-07-11 01:07:23,011 INFO L280 TraceCheckUtils]: 2: Hoare triple {776#true} assume 0 < #StackHeapBarrier; {776#true} is VALID [2020-07-11 01:07:23,011 INFO L280 TraceCheckUtils]: 3: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-11 01:07:23,011 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {776#true} {776#true} #62#return; {776#true} is VALID [2020-07-11 01:07:23,019 INFO L263 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {788#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:07:23,019 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; {776#true} is VALID [2020-07-11 01:07:23,020 INFO L280 TraceCheckUtils]: 2: Hoare triple {776#true} #valid := #valid[0 := 0]; {776#true} is VALID [2020-07-11 01:07:23,020 INFO L280 TraceCheckUtils]: 3: Hoare triple {776#true} assume 0 < #StackHeapBarrier; {776#true} is VALID [2020-07-11 01:07:23,020 INFO L280 TraceCheckUtils]: 4: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-11 01:07:23,020 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {776#true} {776#true} #62#return; {776#true} is VALID [2020-07-11 01:07:23,021 INFO L263 TraceCheckUtils]: 6: Hoare triple {776#true} call #t~ret4 := main(); {776#true} is VALID [2020-07-11 01:07:23,022 INFO L280 TraceCheckUtils]: 7: Hoare triple {776#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {783#(= 1 (select |#valid| |main_~#d1~0.base|))} is VALID [2020-07-11 01:07:23,023 INFO L280 TraceCheckUtils]: 8: Hoare triple {783#(= 1 (select |#valid| |main_~#d1~0.base|))} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4); srcloc: L13 {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:23,024 INFO L280 TraceCheckUtils]: 9: Hoare triple {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:23,025 INFO L280 TraceCheckUtils]: 10: Hoare triple {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} ~n~0 := #t~nondet0; {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:23,026 INFO L280 TraceCheckUtils]: 11: Hoare triple {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} havoc #t~nondet0; {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:23,026 INFO L280 TraceCheckUtils]: 12: Hoare triple {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume 0 != ~n~0; {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:23,027 INFO L280 TraceCheckUtils]: 13: Hoare triple {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} #t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {785#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:23,028 INFO L280 TraceCheckUtils]: 14: Hoare triple {785#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:23,029 INFO L280 TraceCheckUtils]: 15: Hoare triple {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} havoc #t~ite1.base, #t~ite1.offset; {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:23,029 INFO L280 TraceCheckUtils]: 16: Hoare triple {786#(not (= main_~pd~0.base |main_~#d2~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-11 01:07:23,030 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-11 01:07:23,043 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-11 01:07:23,045 INFO L280 TraceCheckUtils]: 19: Hoare triple {787#(not |main_#t~short3|)} assume #t~short3; {777#false} is VALID [2020-07-11 01:07:23,045 INFO L280 TraceCheckUtils]: 20: Hoare triple {777#false} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1); srcloc: L21-1 {777#false} is VALID [2020-07-11 01:07:23,045 INFO L280 TraceCheckUtils]: 21: Hoare triple {777#false} #t~short3 := 0 != #t~mem2; {777#false} is VALID [2020-07-11 01:07:23,045 INFO L280 TraceCheckUtils]: 22: Hoare triple {777#false} assume #t~short3; {777#false} is VALID [2020-07-11 01:07:23,046 INFO L280 TraceCheckUtils]: 23: Hoare triple {777#false} havoc #t~mem2; {777#false} is VALID [2020-07-11 01:07:23,046 INFO L280 TraceCheckUtils]: 24: Hoare triple {777#false} havoc #t~short3; {777#false} is VALID [2020-07-11 01:07:23,046 INFO L280 TraceCheckUtils]: 25: Hoare triple {777#false} assume !false; {777#false} is VALID [2020-07-11 01:07:23,048 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-11 01:07:23,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1644467375] [2020-07-11 01:07:23,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:07:23,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 01:07:23,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003247018] [2020-07-11 01:07:23,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-11 01:07:23,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:07:23,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 01:07:23,080 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-11 01:07:23,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 01:07:23,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:07:23,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 01:07:23,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:07:23,081 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 8 states. [2020-07-11 01:07:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:23,355 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-11 01:07:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 01:07:23,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-11 01:07:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:07:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:07:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-07-11 01:07:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:07:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-07-11 01:07:23,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 28 transitions. [2020-07-11 01:07:23,394 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-11 01:07:23,394 INFO L225 Difference]: With dead ends: 28 [2020-07-11 01:07:23,395 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 01:07:23,396 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-07-11 01:07:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 01:07:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 01:07:23,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:07:23,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 01:07:23,397 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:07:23,397 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:07:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:23,398 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:07:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:07:23,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:23,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:23,398 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:07:23,398 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:07:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:23,399 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:07:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:07:23,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:23,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:23,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:07:23,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:07:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 01:07:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 01:07:23,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-07-11 01:07:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:07:23,400 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 01:07:23,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 01:07:23,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 01:07:23,400 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-11 01:07:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:07:23,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:23,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:07:23,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 01:07:23,890 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 01:07:23,890 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-11 01:07:23,890 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:07:23,891 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-11 01:07:23,891 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:07:23,891 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:07:23,891 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 01:07:23,891 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 01:07:23,892 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:07:23,892 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 29) the Hoare annotation is: true [2020-07-11 01:07:23,892 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 .cse0 .cse1 (not (= main_~pd~0.base |main_~#d2~0.base|))) (and (= |main_~#d2~0.offset| main_~pd~0.offset) .cse0 .cse1))) [2020-07-11 01:07:23,892 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 .cse0 .cse1 (not (= main_~pd~0.base |main_~#d2~0.base|))) (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) .cse0 .cse1))) [2020-07-11 01:07:23,893 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-11 01:07:23,893 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-11 01:07:23,893 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-11 01:07:23,894 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 .cse0 .cse1 (not (= |main_#t~ite1.base| |main_~#d2~0.base|))) (and (= |main_#t~ite1.offset| |main_~#d2~0.offset|) .cse0 .cse1))) [2020-07-11 01:07:23,894 INFO L264 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse2 (= main_~pd~0.base |main_~#d2~0.base|)) (.cse1 (= |main_#t~ite1.base| |main_~#d2~0.base|)) (.cse0 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) .cse0 (not .cse1) (not .cse2)) (and (= |main_~#d2~0.offset| main_~pd~0.offset) .cse2 (= |main_#t~ite1.offset| |main_~#d2~0.offset|) .cse1 .cse0 (not (= |main_~#d1~0.base| |main_#t~ite1.base|))))) [2020-07-11 01:07:23,894 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: false [2020-07-11 01:07:23,894 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 .cse0 .cse1 (not (= main_~pd~0.base |main_~#d2~0.base|))) (and (= |main_~#d2~0.offset| main_~pd~0.offset) .cse0 .cse1))) [2020-07-11 01:07:23,894 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-11 01:07:23,894 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse1 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|))) (.cse0 (= main_~pd~0.base |main_~#d2~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|)) .cse0 .cse1 .cse2) (and .cse1 .cse2 (not |main_#t~short3|) (not .cse0)))) [2020-07-11 01:07:23,895 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-11 01:07:23,895 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-11 01:07:23,895 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|)) (not (= main_~pd~0.base |main_~#d2~0.base|))) [2020-07-11 01:07:23,895 INFO L264 CegarLoopResult]: At program point L21-4(lines 21 23) the Hoare annotation is: (not |main_#t~short3|) [2020-07-11 01:07:23,895 INFO L264 CegarLoopResult]: At program point L21-5(line 21) the Hoare annotation is: false [2020-07-11 01:07:23,895 INFO L264 CegarLoopResult]: At program point L21-6(line 21) the Hoare annotation is: false [2020-07-11 01:07:23,896 INFO L264 CegarLoopResult]: At program point L21-7(line 21) the Hoare annotation is: (not |main_#t~short3|) [2020-07-11 01:07:23,896 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (= 1 (select |#valid| |main_~#d1~0.base|)) [2020-07-11 01:07:23,896 INFO L264 CegarLoopResult]: At program point L21-8(line 21) the Hoare annotation is: (not |main_#t~short3|) [2020-07-11 01:07:23,896 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 11 29) the Hoare annotation is: true [2020-07-11 01:07:23,896 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-11 01:07:23,896 INFO L271 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: true [2020-07-11 01:07:23,896 INFO L271 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: true [2020-07-11 01:07:23,897 INFO L271 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: true [2020-07-11 01:07:23,897 INFO L271 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: true [2020-07-11 01:07:23,897 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: false [2020-07-11 01:07:23,897 INFO L264 CegarLoopResult]: At program point L13-7(line 13) the Hoare annotation is: false [2020-07-11 01:07:23,897 INFO L264 CegarLoopResult]: At program point L13-8(line 13) the Hoare annotation is: false [2020-07-11 01:07:23,897 INFO L264 CegarLoopResult]: At program point L13-9(line 13) the Hoare annotation is: false [2020-07-11 01:07:23,898 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) the Hoare annotation is: false [2020-07-11 01:07:23,898 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 29) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-11 01:07:23,898 INFO L264 CegarLoopResult]: At program point L22(lines 12 29) the Hoare annotation is: false [2020-07-11 01:07:23,898 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-11 01:07:23,898 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-11 01:07:23,931 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-11 01:07:23,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:07:23 BoogieIcfgContainer [2020-07-11 01:07:23,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:07:23,943 INFO L168 Benchmark]: Toolchain (without parser) took 4454.28 ms. Allocated memory was 143.1 MB in the beginning and 287.3 MB in the end (delta: 144.2 MB). Free memory was 101.1 MB in the beginning and 259.9 MB in the end (delta: -158.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 01:07:23,943 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 143.1 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 01:07:23,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.64 ms. Allocated memory is still 143.1 MB. Free memory was 100.9 MB in the beginning and 90.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:23,945 INFO L168 Benchmark]: Boogie Preprocessor took 140.94 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 90.7 MB in the beginning and 178.7 MB in the end (delta: -88.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:23,946 INFO L168 Benchmark]: RCFGBuilder took 404.59 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 156.8 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:23,947 INFO L168 Benchmark]: TraceAbstraction took 3598.26 ms. Allocated memory was 201.3 MB in the beginning and 287.3 MB in the end (delta: 86.0 MB). Free memory was 156.1 MB in the beginning and 259.9 MB in the end (delta: -103.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 01:07:23,950 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.21 ms. Allocated memory is still 143.1 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 304.64 ms. Allocated memory is still 143.1 MB. Free memory was 100.9 MB in the beginning and 90.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.94 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 90.7 MB in the beginning and 178.7 MB in the end (delta: -88.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 404.59 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 156.8 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3598.26 ms. Allocated memory was 201.3 MB in the beginning and 287.3 MB in the end (delta: 86.0 MB). Free memory was 156.1 MB in the beginning and 259.9 MB in the end (delta: -103.7 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: 2.9s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 95 SDtfs, 108 SDslu, 246 SDs, 0 SdLazy, 227 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 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, 371 HoareAnnotationTreeSize, 45 FomulaSimplifications, 206 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 29 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 6009 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...