/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test22-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:02:30,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:02:30,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:02:30,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:02:30,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:02:30,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:02:30,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:02:30,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:02:30,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:02:30,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:02:30,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:02:30,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:02:30,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:02:30,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:02:30,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:02:30,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:02:30,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:02:30,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:02:30,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:02:30,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:02:30,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:02:30,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:02:30,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:02:30,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:02:30,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:02:30,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:02:30,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:02:30,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:02:30,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:02:30,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:02:30,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:02:30,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:02:30,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:02:30,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:02:30,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:02:30,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:02:30,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:02:30,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:02:30,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:02:30,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:02:30,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:02:30,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:02:30,427 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:02:30,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:02:30,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:02:30,429 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:02:30,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:02:30,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:02:30,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:02:30,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:02:30,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:02:30,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:02:30,430 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:02:30,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:02:30,431 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:02:30,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:02:30,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:02:30,431 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:02:30,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:02:30,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:02:30,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:02:30,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:02:30,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:02:30,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:02:30,433 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:02:30,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:02:30,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:02:30,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:02:30,701 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:02:30,702 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:02:30,702 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test22-2.c [2020-07-10 19:02:30,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a54abdaa/726e0474f56148b88ece1008d28732d2/FLAG1d69d1b85 [2020-07-10 19:02:31,200 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:02:31,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test22-2.c [2020-07-10 19:02:31,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a54abdaa/726e0474f56148b88ece1008d28732d2/FLAG1d69d1b85 [2020-07-10 19:02:31,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a54abdaa/726e0474f56148b88ece1008d28732d2 [2020-07-10 19:02:31,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:02:31,638 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:02:31,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:02:31,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:02:31,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:02:31,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:02:31" (1/1) ... [2020-07-10 19:02:31,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf275e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:31, skipping insertion in model container [2020-07-10 19:02:31,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:02:31" (1/1) ... [2020-07-10 19:02:31,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:02:31,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:02:31,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:02:31,906 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:02:31,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:02:31,946 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:02:31,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:31 WrapperNode [2020-07-10 19:02:31,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:02:31,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:02:31,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:02:31,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:02:32,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:31" (1/1) ... [2020-07-10 19:02:32,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:31" (1/1) ... [2020-07-10 19:02:32,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:31" (1/1) ... [2020-07-10 19:02:32,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:31" (1/1) ... [2020-07-10 19:02:32,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:31" (1/1) ... [2020-07-10 19:02:32,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:31" (1/1) ... [2020-07-10 19:02:32,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:31" (1/1) ... [2020-07-10 19:02:32,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:02:32,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:02:32,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:02:32,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:02:32,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:02:32,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:02:32,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:02:32,141 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-10 19:02:32,141 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2020-07-10 19:02:32,141 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-10 19:02:32,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:02:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:02:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 19:02:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-10 19:02:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-10 19:02:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:02:32,143 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2020-07-10 19:02:32,143 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-10 19:02:32,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:02:32,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:02:32,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:02:32,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 19:02:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-10 19:02:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:02:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:02:32,678 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:02:32,678 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 19:02:32,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:02:32 BoogieIcfgContainer [2020-07-10 19:02:32,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:02:32,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:02:32,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:02:32,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:02:32,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:02:31" (1/3) ... [2020-07-10 19:02:32,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efbde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:02:32, skipping insertion in model container [2020-07-10 19:02:32,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:31" (2/3) ... [2020-07-10 19:02:32,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efbde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:02:32, skipping insertion in model container [2020-07-10 19:02:32,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:02:32" (3/3) ... [2020-07-10 19:02:32,692 INFO L109 eAbstractionObserver]: Analyzing ICFG test22-2.c [2020-07-10 19:02:32,702 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:02:32,710 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 19:02:32,723 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 19:02:32,744 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:02:32,745 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:02:32,745 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:02:32,745 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:02:32,745 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:02:32,745 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:02:32,745 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:02:32,746 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:02:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-10 19:02:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-07-10 19:02:32,775 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:32,776 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:02:32,776 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:32,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2026025413, now seen corresponding path program 1 times [2020-07-10 19:02:32,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:32,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [501683340] [2020-07-10 19:02:32,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:33,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {146#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {91#true} is VALID [2020-07-10 19:02:33,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} #valid := #valid[0 := 0]; {91#true} is VALID [2020-07-10 19:02:33,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-10 19:02:33,156 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {91#true} is VALID [2020-07-10 19:02:33,156 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {91#true} is VALID [2020-07-10 19:02:33,156 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {91#true} is VALID [2020-07-10 19:02:33,157 INFO L280 TraceCheckUtils]: 6: Hoare triple {91#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {91#true} is VALID [2020-07-10 19:02:33,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {91#true} is VALID [2020-07-10 19:02:33,158 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {91#true} is VALID [2020-07-10 19:02:33,158 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:02:33,159 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {91#true} {91#true} #123#return; {91#true} is VALID [2020-07-10 19:02:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:33,195 INFO L280 TraceCheckUtils]: 0: Hoare triple {147#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {91#true} is VALID [2020-07-10 19:02:33,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {91#true} is VALID [2020-07-10 19:02:33,196 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} havoc #t~nondet0; {91#true} is VALID [2020-07-10 19:02:33,196 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {91#true} is VALID [2020-07-10 19:02:33,197 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {91#true} is VALID [2020-07-10 19:02:33,197 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} havoc #t~nondet1; {91#true} is VALID [2020-07-10 19:02:33,198 INFO L280 TraceCheckUtils]: 6: Hoare triple {91#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {91#true} is VALID [2020-07-10 19:02:33,198 INFO L280 TraceCheckUtils]: 7: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {91#true} is VALID [2020-07-10 19:02:33,198 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#true} havoc #t~nondet2; {91#true} is VALID [2020-07-10 19:02:33,199 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {91#true} is VALID [2020-07-10 19:02:33,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {91#true} is VALID [2020-07-10 19:02:33,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {91#true} havoc #t~nondet3; {91#true} is VALID [2020-07-10 19:02:33,200 INFO L280 TraceCheckUtils]: 12: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:02:33,200 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {91#true} {91#true} #113#return; {91#true} is VALID [2020-07-10 19:02:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:33,208 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} assume 0 != #t~nondet4 % 256; {91#true} is VALID [2020-07-10 19:02:33,209 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {91#true} is VALID [2020-07-10 19:02:33,209 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-10 19:02:33,210 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} havoc #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-10 19:02:33,210 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-10 19:02:33,210 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:02:33,211 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {91#true} {91#true} #115#return; {91#true} is VALID [2020-07-10 19:02:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:33,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} assume 0 != #t~nondet4 % 256; {91#true} is VALID [2020-07-10 19:02:33,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {91#true} is VALID [2020-07-10 19:02:33,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-10 19:02:33,220 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} havoc #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-10 19:02:33,221 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-10 19:02:33,221 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:02:33,221 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {91#true} {91#true} #117#return; {91#true} is VALID [2020-07-10 19:02:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:33,230 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} assume 0 != #t~nondet4 % 256; {91#true} is VALID [2020-07-10 19:02:33,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {91#true} is VALID [2020-07-10 19:02:33,230 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-10 19:02:33,231 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} havoc #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-10 19:02:33,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-10 19:02:33,232 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:02:33,232 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {91#true} {91#true} #119#return; {91#true} is VALID [2020-07-10 19:02:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:33,245 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {91#true} is VALID [2020-07-10 19:02:33,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} ~i := #in~i; {91#true} is VALID [2020-07-10 19:02:33,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {91#true} is VALID [2020-07-10 19:02:33,247 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} #res := (if #t~mem6 == ~i then 1 else 0); {91#true} is VALID [2020-07-10 19:02:33,247 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} havoc #t~mem6; {91#true} is VALID [2020-07-10 19:02:33,248 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:02:33,248 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {91#true} {92#false} #121#return; {92#false} is VALID [2020-07-10 19:02:33,250 INFO L263 TraceCheckUtils]: 0: Hoare triple {91#true} call ULTIMATE.init(); {146#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 19:02:33,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {146#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {91#true} is VALID [2020-07-10 19:02:33,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} #valid := #valid[0 := 0]; {91#true} is VALID [2020-07-10 19:02:33,252 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-10 19:02:33,252 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {91#true} is VALID [2020-07-10 19:02:33,253 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {91#true} is VALID [2020-07-10 19:02:33,253 INFO L280 TraceCheckUtils]: 6: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {91#true} is VALID [2020-07-10 19:02:33,253 INFO L280 TraceCheckUtils]: 7: Hoare triple {91#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {91#true} is VALID [2020-07-10 19:02:33,254 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {91#true} is VALID [2020-07-10 19:02:33,254 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {91#true} is VALID [2020-07-10 19:02:33,254 INFO L280 TraceCheckUtils]: 10: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:02:33,255 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {91#true} {91#true} #123#return; {91#true} is VALID [2020-07-10 19:02:33,255 INFO L263 TraceCheckUtils]: 12: Hoare triple {91#true} call #t~ret17 := main(); {91#true} is VALID [2020-07-10 19:02:33,256 INFO L263 TraceCheckUtils]: 13: Hoare triple {91#true} call init(); {147#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 19:02:33,257 INFO L280 TraceCheckUtils]: 14: Hoare triple {147#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {91#true} is VALID [2020-07-10 19:02:33,257 INFO L280 TraceCheckUtils]: 15: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {91#true} is VALID [2020-07-10 19:02:33,257 INFO L280 TraceCheckUtils]: 16: Hoare triple {91#true} havoc #t~nondet0; {91#true} is VALID [2020-07-10 19:02:33,258 INFO L280 TraceCheckUtils]: 17: Hoare triple {91#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {91#true} is VALID [2020-07-10 19:02:33,258 INFO L280 TraceCheckUtils]: 18: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {91#true} is VALID [2020-07-10 19:02:33,259 INFO L280 TraceCheckUtils]: 19: Hoare triple {91#true} havoc #t~nondet1; {91#true} is VALID [2020-07-10 19:02:33,259 INFO L280 TraceCheckUtils]: 20: Hoare triple {91#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {91#true} is VALID [2020-07-10 19:02:33,259 INFO L280 TraceCheckUtils]: 21: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {91#true} is VALID [2020-07-10 19:02:33,260 INFO L280 TraceCheckUtils]: 22: Hoare triple {91#true} havoc #t~nondet2; {91#true} is VALID [2020-07-10 19:02:33,260 INFO L280 TraceCheckUtils]: 23: Hoare triple {91#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {91#true} is VALID [2020-07-10 19:02:33,261 INFO L280 TraceCheckUtils]: 24: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {91#true} is VALID [2020-07-10 19:02:33,261 INFO L280 TraceCheckUtils]: 25: Hoare triple {91#true} havoc #t~nondet3; {91#true} is VALID [2020-07-10 19:02:33,261 INFO L280 TraceCheckUtils]: 26: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:02:33,262 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {91#true} {91#true} #113#return; {91#true} is VALID [2020-07-10 19:02:33,262 INFO L263 TraceCheckUtils]: 28: Hoare triple {91#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {91#true} is VALID [2020-07-10 19:02:33,262 INFO L280 TraceCheckUtils]: 29: Hoare triple {91#true} assume 0 != #t~nondet4 % 256; {91#true} is VALID [2020-07-10 19:02:33,263 INFO L280 TraceCheckUtils]: 30: Hoare triple {91#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {91#true} is VALID [2020-07-10 19:02:33,263 INFO L280 TraceCheckUtils]: 31: Hoare triple {91#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-10 19:02:33,264 INFO L280 TraceCheckUtils]: 32: Hoare triple {91#true} havoc #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-10 19:02:33,264 INFO L280 TraceCheckUtils]: 33: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-10 19:02:33,264 INFO L280 TraceCheckUtils]: 34: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:02:33,265 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {91#true} {91#true} #115#return; {91#true} is VALID [2020-07-10 19:02:33,265 INFO L280 TraceCheckUtils]: 36: Hoare triple {91#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset; {91#true} is VALID [2020-07-10 19:02:33,266 INFO L280 TraceCheckUtils]: 37: Hoare triple {91#true} havoc #t~ret7.base, #t~ret7.offset; {91#true} is VALID [2020-07-10 19:02:33,266 INFO L263 TraceCheckUtils]: 38: Hoare triple {91#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {91#true} is VALID [2020-07-10 19:02:33,266 INFO L280 TraceCheckUtils]: 39: Hoare triple {91#true} assume 0 != #t~nondet4 % 256; {91#true} is VALID [2020-07-10 19:02:33,267 INFO L280 TraceCheckUtils]: 40: Hoare triple {91#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {91#true} is VALID [2020-07-10 19:02:33,267 INFO L280 TraceCheckUtils]: 41: Hoare triple {91#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-10 19:02:33,267 INFO L280 TraceCheckUtils]: 42: Hoare triple {91#true} havoc #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-10 19:02:33,268 INFO L280 TraceCheckUtils]: 43: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-10 19:02:33,268 INFO L280 TraceCheckUtils]: 44: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:02:33,268 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {91#true} {91#true} #117#return; {91#true} is VALID [2020-07-10 19:02:33,269 INFO L280 TraceCheckUtils]: 46: Hoare triple {91#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset; {91#true} is VALID [2020-07-10 19:02:33,269 INFO L280 TraceCheckUtils]: 47: Hoare triple {91#true} havoc #t~ret8.base, #t~ret8.offset; {91#true} is VALID [2020-07-10 19:02:33,270 INFO L263 TraceCheckUtils]: 48: Hoare triple {91#true} call #t~ret9.base, #t~ret9.offset := get_dummy(); {91#true} is VALID [2020-07-10 19:02:33,270 INFO L280 TraceCheckUtils]: 49: Hoare triple {91#true} assume 0 != #t~nondet4 % 256; {91#true} is VALID [2020-07-10 19:02:33,270 INFO L280 TraceCheckUtils]: 50: Hoare triple {91#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {91#true} is VALID [2020-07-10 19:02:33,271 INFO L280 TraceCheckUtils]: 51: Hoare triple {91#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-10 19:02:33,271 INFO L280 TraceCheckUtils]: 52: Hoare triple {91#true} havoc #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-10 19:02:33,271 INFO L280 TraceCheckUtils]: 53: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-10 19:02:33,272 INFO L280 TraceCheckUtils]: 54: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:02:33,272 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {91#true} {91#true} #119#return; {91#true} is VALID [2020-07-10 19:02:33,273 INFO L280 TraceCheckUtils]: 56: Hoare triple {91#true} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset; {91#true} is VALID [2020-07-10 19:02:33,273 INFO L280 TraceCheckUtils]: 57: Hoare triple {91#true} havoc #t~ret9.base, #t~ret9.offset; {91#true} is VALID [2020-07-10 19:02:33,273 INFO L280 TraceCheckUtils]: 58: Hoare triple {91#true} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {91#true} is VALID [2020-07-10 19:02:33,274 INFO L280 TraceCheckUtils]: 59: Hoare triple {91#true} ~i~0 := #t~nondet10; {91#true} is VALID [2020-07-10 19:02:33,274 INFO L280 TraceCheckUtils]: 60: Hoare triple {91#true} havoc #t~nondet10; {91#true} is VALID [2020-07-10 19:02:33,274 INFO L280 TraceCheckUtils]: 61: Hoare triple {91#true} #t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {91#true} is VALID [2020-07-10 19:02:33,275 INFO L280 TraceCheckUtils]: 62: Hoare triple {91#true} assume !#t~short12; {91#true} is VALID [2020-07-10 19:02:33,275 INFO L280 TraceCheckUtils]: 63: Hoare triple {91#true} assume #t~short12; {91#true} is VALID [2020-07-10 19:02:33,276 INFO L280 TraceCheckUtils]: 64: Hoare triple {91#true} havoc #t~mem11; {91#true} is VALID [2020-07-10 19:02:33,276 INFO L280 TraceCheckUtils]: 65: Hoare triple {91#true} havoc #t~short12; {91#true} is VALID [2020-07-10 19:02:33,276 INFO L280 TraceCheckUtils]: 66: Hoare triple {91#true} ~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset; {91#true} is VALID [2020-07-10 19:02:33,277 INFO L280 TraceCheckUtils]: 67: Hoare triple {91#true} SUMMARY for call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4); srcloc: L37 {91#true} is VALID [2020-07-10 19:02:33,277 INFO L280 TraceCheckUtils]: 68: Hoare triple {91#true} ~i~0 := #t~mem13 - 10; {91#true} is VALID [2020-07-10 19:02:33,278 INFO L280 TraceCheckUtils]: 69: Hoare triple {91#true} havoc #t~mem13; {91#true} is VALID [2020-07-10 19:02:33,279 INFO L280 TraceCheckUtils]: 70: Hoare triple {91#true} assume !true; {92#false} is VALID [2020-07-10 19:02:33,279 INFO L263 TraceCheckUtils]: 71: Hoare triple {92#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {91#true} is VALID [2020-07-10 19:02:33,280 INFO L280 TraceCheckUtils]: 72: Hoare triple {91#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {91#true} is VALID [2020-07-10 19:02:33,280 INFO L280 TraceCheckUtils]: 73: Hoare triple {91#true} ~i := #in~i; {91#true} is VALID [2020-07-10 19:02:33,280 INFO L280 TraceCheckUtils]: 74: Hoare triple {91#true} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {91#true} is VALID [2020-07-10 19:02:33,281 INFO L280 TraceCheckUtils]: 75: Hoare triple {91#true} #res := (if #t~mem6 == ~i then 1 else 0); {91#true} is VALID [2020-07-10 19:02:33,281 INFO L280 TraceCheckUtils]: 76: Hoare triple {91#true} havoc #t~mem6; {91#true} is VALID [2020-07-10 19:02:33,281 INFO L280 TraceCheckUtils]: 77: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:02:33,282 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {91#true} {92#false} #121#return; {92#false} is VALID [2020-07-10 19:02:33,282 INFO L280 TraceCheckUtils]: 79: Hoare triple {92#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {92#false} is VALID [2020-07-10 19:02:33,282 INFO L280 TraceCheckUtils]: 80: Hoare triple {92#false} assume 0 == #t~ret16; {92#false} is VALID [2020-07-10 19:02:33,283 INFO L280 TraceCheckUtils]: 81: Hoare triple {92#false} havoc #t~ret16; {92#false} is VALID [2020-07-10 19:02:33,283 INFO L280 TraceCheckUtils]: 82: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-10 19:02:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-10 19:02:33,322 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:33,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [501683340] [2020-07-10 19:02:33,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:33,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:02:33,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169401323] [2020-07-10 19:02:33,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-07-10 19:02:33,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:33,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:02:33,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:33,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:02:33,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:33,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:02:33,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:02:33,448 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2020-07-10 19:02:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:34,423 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2020-07-10 19:02:34,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 19:02:34,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-07-10 19:02:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:02:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2020-07-10 19:02:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:02:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2020-07-10 19:02:34,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 114 transitions. [2020-07-10 19:02:34,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:34,640 INFO L225 Difference]: With dead ends: 107 [2020-07-10 19:02:34,640 INFO L226 Difference]: Without dead ends: 79 [2020-07-10 19:02:34,644 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 19:02:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-10 19:02:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-07-10 19:02:34,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:34,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2020-07-10 19:02:34,957 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-10 19:02:34,957 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-10 19:02:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:34,969 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2020-07-10 19:02:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-07-10 19:02:34,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:34,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:34,970 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-10 19:02:34,971 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-10 19:02:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:34,978 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2020-07-10 19:02:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-07-10 19:02:34,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:34,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:34,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:34,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-10 19:02:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2020-07-10 19:02:34,987 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 83 [2020-07-10 19:02:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:34,988 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2020-07-10 19:02:34,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:02:34,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states and 83 transitions. [2020-07-10 19:02:35,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-07-10 19:02:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-07-10 19:02:35,130 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:35,130 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:02:35,131 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:02:35,131 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:35,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash 177245466, now seen corresponding path program 1 times [2020-07-10 19:02:35,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:35,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1219720038] [2020-07-10 19:02:35,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:35,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {739#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {683#true} is VALID [2020-07-10 19:02:35,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} #valid := #valid[0 := 0]; {683#true} is VALID [2020-07-10 19:02:35,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} assume 0 < #StackHeapBarrier; {683#true} is VALID [2020-07-10 19:02:35,277 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {683#true} is VALID [2020-07-10 19:02:35,278 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {683#true} is VALID [2020-07-10 19:02:35,278 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {683#true} is VALID [2020-07-10 19:02:35,278 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {683#true} is VALID [2020-07-10 19:02:35,279 INFO L280 TraceCheckUtils]: 7: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {683#true} is VALID [2020-07-10 19:02:35,279 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {683#true} is VALID [2020-07-10 19:02:35,279 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 19:02:35,280 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {683#true} {683#true} #123#return; {683#true} is VALID [2020-07-10 19:02:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:35,298 INFO L280 TraceCheckUtils]: 0: Hoare triple {740#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {683#true} is VALID [2020-07-10 19:02:35,299 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {683#true} is VALID [2020-07-10 19:02:35,299 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} havoc #t~nondet0; {683#true} is VALID [2020-07-10 19:02:35,299 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {683#true} is VALID [2020-07-10 19:02:35,300 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {683#true} is VALID [2020-07-10 19:02:35,300 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} havoc #t~nondet1; {683#true} is VALID [2020-07-10 19:02:35,300 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {683#true} is VALID [2020-07-10 19:02:35,301 INFO L280 TraceCheckUtils]: 7: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {683#true} is VALID [2020-07-10 19:02:35,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} havoc #t~nondet2; {683#true} is VALID [2020-07-10 19:02:35,301 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {683#true} is VALID [2020-07-10 19:02:35,301 INFO L280 TraceCheckUtils]: 10: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {683#true} is VALID [2020-07-10 19:02:35,302 INFO L280 TraceCheckUtils]: 11: Hoare triple {683#true} havoc #t~nondet3; {683#true} is VALID [2020-07-10 19:02:35,302 INFO L280 TraceCheckUtils]: 12: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 19:02:35,302 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {683#true} {683#true} #113#return; {683#true} is VALID [2020-07-10 19:02:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:35,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} assume 0 != #t~nondet4 % 256; {683#true} is VALID [2020-07-10 19:02:35,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {683#true} is VALID [2020-07-10 19:02:35,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-10 19:02:35,309 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} havoc #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-10 19:02:35,309 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} havoc #t~nondet4; {683#true} is VALID [2020-07-10 19:02:35,310 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 19:02:35,310 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {683#true} {683#true} #115#return; {683#true} is VALID [2020-07-10 19:02:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:35,315 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} assume 0 != #t~nondet4 % 256; {683#true} is VALID [2020-07-10 19:02:35,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {683#true} is VALID [2020-07-10 19:02:35,315 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-10 19:02:35,316 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} havoc #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-10 19:02:35,316 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} havoc #t~nondet4; {683#true} is VALID [2020-07-10 19:02:35,316 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 19:02:35,316 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {683#true} {683#true} #117#return; {683#true} is VALID [2020-07-10 19:02:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:35,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} assume 0 != #t~nondet4 % 256; {683#true} is VALID [2020-07-10 19:02:35,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {683#true} is VALID [2020-07-10 19:02:35,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-10 19:02:35,323 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} havoc #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-10 19:02:35,323 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} havoc #t~nondet4; {683#true} is VALID [2020-07-10 19:02:35,324 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 19:02:35,324 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {683#true} {683#true} #119#return; {683#true} is VALID [2020-07-10 19:02:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:35,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {683#true} is VALID [2020-07-10 19:02:35,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} ~i := #in~i; {683#true} is VALID [2020-07-10 19:02:35,330 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {683#true} is VALID [2020-07-10 19:02:35,331 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} #res := (if #t~mem6 == ~i then 1 else 0); {683#true} is VALID [2020-07-10 19:02:35,331 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} havoc #t~mem6; {683#true} is VALID [2020-07-10 19:02:35,331 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 19:02:35,331 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {683#true} {684#false} #121#return; {684#false} is VALID [2020-07-10 19:02:35,333 INFO L263 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {739#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 19:02:35,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {739#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {683#true} is VALID [2020-07-10 19:02:35,334 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} #valid := #valid[0 := 0]; {683#true} is VALID [2020-07-10 19:02:35,334 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} assume 0 < #StackHeapBarrier; {683#true} is VALID [2020-07-10 19:02:35,334 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {683#true} is VALID [2020-07-10 19:02:35,334 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {683#true} is VALID [2020-07-10 19:02:35,335 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {683#true} is VALID [2020-07-10 19:02:35,335 INFO L280 TraceCheckUtils]: 7: Hoare triple {683#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {683#true} is VALID [2020-07-10 19:02:35,335 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {683#true} is VALID [2020-07-10 19:02:35,335 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {683#true} is VALID [2020-07-10 19:02:35,336 INFO L280 TraceCheckUtils]: 10: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 19:02:35,336 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {683#true} {683#true} #123#return; {683#true} is VALID [2020-07-10 19:02:35,336 INFO L263 TraceCheckUtils]: 12: Hoare triple {683#true} call #t~ret17 := main(); {683#true} is VALID [2020-07-10 19:02:35,337 INFO L263 TraceCheckUtils]: 13: Hoare triple {683#true} call init(); {740#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 19:02:35,337 INFO L280 TraceCheckUtils]: 14: Hoare triple {740#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {683#true} is VALID [2020-07-10 19:02:35,337 INFO L280 TraceCheckUtils]: 15: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {683#true} is VALID [2020-07-10 19:02:35,338 INFO L280 TraceCheckUtils]: 16: Hoare triple {683#true} havoc #t~nondet0; {683#true} is VALID [2020-07-10 19:02:35,338 INFO L280 TraceCheckUtils]: 17: Hoare triple {683#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {683#true} is VALID [2020-07-10 19:02:35,338 INFO L280 TraceCheckUtils]: 18: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {683#true} is VALID [2020-07-10 19:02:35,338 INFO L280 TraceCheckUtils]: 19: Hoare triple {683#true} havoc #t~nondet1; {683#true} is VALID [2020-07-10 19:02:35,339 INFO L280 TraceCheckUtils]: 20: Hoare triple {683#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {683#true} is VALID [2020-07-10 19:02:35,339 INFO L280 TraceCheckUtils]: 21: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {683#true} is VALID [2020-07-10 19:02:35,339 INFO L280 TraceCheckUtils]: 22: Hoare triple {683#true} havoc #t~nondet2; {683#true} is VALID [2020-07-10 19:02:35,339 INFO L280 TraceCheckUtils]: 23: Hoare triple {683#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {683#true} is VALID [2020-07-10 19:02:35,340 INFO L280 TraceCheckUtils]: 24: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {683#true} is VALID [2020-07-10 19:02:35,340 INFO L280 TraceCheckUtils]: 25: Hoare triple {683#true} havoc #t~nondet3; {683#true} is VALID [2020-07-10 19:02:35,340 INFO L280 TraceCheckUtils]: 26: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 19:02:35,341 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {683#true} {683#true} #113#return; {683#true} is VALID [2020-07-10 19:02:35,341 INFO L263 TraceCheckUtils]: 28: Hoare triple {683#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {683#true} is VALID [2020-07-10 19:02:35,341 INFO L280 TraceCheckUtils]: 29: Hoare triple {683#true} assume 0 != #t~nondet4 % 256; {683#true} is VALID [2020-07-10 19:02:35,341 INFO L280 TraceCheckUtils]: 30: Hoare triple {683#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {683#true} is VALID [2020-07-10 19:02:35,341 INFO L280 TraceCheckUtils]: 31: Hoare triple {683#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-10 19:02:35,342 INFO L280 TraceCheckUtils]: 32: Hoare triple {683#true} havoc #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-10 19:02:35,342 INFO L280 TraceCheckUtils]: 33: Hoare triple {683#true} havoc #t~nondet4; {683#true} is VALID [2020-07-10 19:02:35,342 INFO L280 TraceCheckUtils]: 34: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 19:02:35,343 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {683#true} {683#true} #115#return; {683#true} is VALID [2020-07-10 19:02:35,343 INFO L280 TraceCheckUtils]: 36: Hoare triple {683#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset; {683#true} is VALID [2020-07-10 19:02:35,343 INFO L280 TraceCheckUtils]: 37: Hoare triple {683#true} havoc #t~ret7.base, #t~ret7.offset; {683#true} is VALID [2020-07-10 19:02:35,343 INFO L263 TraceCheckUtils]: 38: Hoare triple {683#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {683#true} is VALID [2020-07-10 19:02:35,344 INFO L280 TraceCheckUtils]: 39: Hoare triple {683#true} assume 0 != #t~nondet4 % 256; {683#true} is VALID [2020-07-10 19:02:35,344 INFO L280 TraceCheckUtils]: 40: Hoare triple {683#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {683#true} is VALID [2020-07-10 19:02:35,344 INFO L280 TraceCheckUtils]: 41: Hoare triple {683#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-10 19:02:35,344 INFO L280 TraceCheckUtils]: 42: Hoare triple {683#true} havoc #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-10 19:02:35,345 INFO L280 TraceCheckUtils]: 43: Hoare triple {683#true} havoc #t~nondet4; {683#true} is VALID [2020-07-10 19:02:35,345 INFO L280 TraceCheckUtils]: 44: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 19:02:35,345 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {683#true} {683#true} #117#return; {683#true} is VALID [2020-07-10 19:02:35,345 INFO L280 TraceCheckUtils]: 46: Hoare triple {683#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset; {683#true} is VALID [2020-07-10 19:02:35,346 INFO L280 TraceCheckUtils]: 47: Hoare triple {683#true} havoc #t~ret8.base, #t~ret8.offset; {683#true} is VALID [2020-07-10 19:02:35,346 INFO L263 TraceCheckUtils]: 48: Hoare triple {683#true} call #t~ret9.base, #t~ret9.offset := get_dummy(); {683#true} is VALID [2020-07-10 19:02:35,346 INFO L280 TraceCheckUtils]: 49: Hoare triple {683#true} assume 0 != #t~nondet4 % 256; {683#true} is VALID [2020-07-10 19:02:35,346 INFO L280 TraceCheckUtils]: 50: Hoare triple {683#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {683#true} is VALID [2020-07-10 19:02:35,347 INFO L280 TraceCheckUtils]: 51: Hoare triple {683#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-10 19:02:35,347 INFO L280 TraceCheckUtils]: 52: Hoare triple {683#true} havoc #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-10 19:02:35,347 INFO L280 TraceCheckUtils]: 53: Hoare triple {683#true} havoc #t~nondet4; {683#true} is VALID [2020-07-10 19:02:35,347 INFO L280 TraceCheckUtils]: 54: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 19:02:35,348 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {683#true} {683#true} #119#return; {683#true} is VALID [2020-07-10 19:02:35,348 INFO L280 TraceCheckUtils]: 56: Hoare triple {683#true} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset; {683#true} is VALID [2020-07-10 19:02:35,348 INFO L280 TraceCheckUtils]: 57: Hoare triple {683#true} havoc #t~ret9.base, #t~ret9.offset; {683#true} is VALID [2020-07-10 19:02:35,348 INFO L280 TraceCheckUtils]: 58: Hoare triple {683#true} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {683#true} is VALID [2020-07-10 19:02:35,349 INFO L280 TraceCheckUtils]: 59: Hoare triple {683#true} ~i~0 := #t~nondet10; {683#true} is VALID [2020-07-10 19:02:35,349 INFO L280 TraceCheckUtils]: 60: Hoare triple {683#true} havoc #t~nondet10; {683#true} is VALID [2020-07-10 19:02:35,349 INFO L280 TraceCheckUtils]: 61: Hoare triple {683#true} #t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {683#true} is VALID [2020-07-10 19:02:35,350 INFO L280 TraceCheckUtils]: 62: Hoare triple {683#true} assume !#t~short12; {731#(not |main_#t~short12|)} is VALID [2020-07-10 19:02:35,350 INFO L280 TraceCheckUtils]: 63: Hoare triple {731#(not |main_#t~short12|)} assume #t~short12; {684#false} is VALID [2020-07-10 19:02:35,351 INFO L280 TraceCheckUtils]: 64: Hoare triple {684#false} havoc #t~mem11; {684#false} is VALID [2020-07-10 19:02:35,351 INFO L280 TraceCheckUtils]: 65: Hoare triple {684#false} havoc #t~short12; {684#false} is VALID [2020-07-10 19:02:35,351 INFO L280 TraceCheckUtils]: 66: Hoare triple {684#false} ~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset; {684#false} is VALID [2020-07-10 19:02:35,351 INFO L280 TraceCheckUtils]: 67: Hoare triple {684#false} SUMMARY for call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4); srcloc: L37 {684#false} is VALID [2020-07-10 19:02:35,352 INFO L280 TraceCheckUtils]: 68: Hoare triple {684#false} ~i~0 := #t~mem13 - 10; {684#false} is VALID [2020-07-10 19:02:35,352 INFO L280 TraceCheckUtils]: 69: Hoare triple {684#false} havoc #t~mem13; {684#false} is VALID [2020-07-10 19:02:35,352 INFO L280 TraceCheckUtils]: 70: Hoare triple {684#false} SUMMARY for call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L38-5 {684#false} is VALID [2020-07-10 19:02:35,352 INFO L280 TraceCheckUtils]: 71: Hoare triple {684#false} assume !(~i~0 < #t~mem14); {684#false} is VALID [2020-07-10 19:02:35,353 INFO L280 TraceCheckUtils]: 72: Hoare triple {684#false} havoc #t~mem14; {684#false} is VALID [2020-07-10 19:02:35,353 INFO L263 TraceCheckUtils]: 73: Hoare triple {684#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {683#true} is VALID [2020-07-10 19:02:35,353 INFO L280 TraceCheckUtils]: 74: Hoare triple {683#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {683#true} is VALID [2020-07-10 19:02:35,353 INFO L280 TraceCheckUtils]: 75: Hoare triple {683#true} ~i := #in~i; {683#true} is VALID [2020-07-10 19:02:35,354 INFO L280 TraceCheckUtils]: 76: Hoare triple {683#true} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {683#true} is VALID [2020-07-10 19:02:35,354 INFO L280 TraceCheckUtils]: 77: Hoare triple {683#true} #res := (if #t~mem6 == ~i then 1 else 0); {683#true} is VALID [2020-07-10 19:02:35,354 INFO L280 TraceCheckUtils]: 78: Hoare triple {683#true} havoc #t~mem6; {683#true} is VALID [2020-07-10 19:02:35,354 INFO L280 TraceCheckUtils]: 79: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 19:02:35,355 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {683#true} {684#false} #121#return; {684#false} is VALID [2020-07-10 19:02:35,355 INFO L280 TraceCheckUtils]: 81: Hoare triple {684#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {684#false} is VALID [2020-07-10 19:02:35,355 INFO L280 TraceCheckUtils]: 82: Hoare triple {684#false} assume 0 == #t~ret16; {684#false} is VALID [2020-07-10 19:02:35,355 INFO L280 TraceCheckUtils]: 83: Hoare triple {684#false} havoc #t~ret16; {684#false} is VALID [2020-07-10 19:02:35,356 INFO L280 TraceCheckUtils]: 84: Hoare triple {684#false} assume !false; {684#false} is VALID [2020-07-10 19:02:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-10 19:02:35,362 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:35,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1219720038] [2020-07-10 19:02:35,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:35,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 19:02:35,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817195019] [2020-07-10 19:02:35,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2020-07-10 19:02:35,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:35,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 19:02:35,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:35,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 19:02:35,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:35,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 19:02:35,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 19:02:35,442 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 5 states. [2020-07-10 19:02:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:36,394 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2020-07-10 19:02:36,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 19:02:36,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2020-07-10 19:02:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:02:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2020-07-10 19:02:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:02:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2020-07-10 19:02:36,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2020-07-10 19:02:36,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:36,581 INFO L225 Difference]: With dead ends: 106 [2020-07-10 19:02:36,581 INFO L226 Difference]: Without dead ends: 79 [2020-07-10 19:02:36,583 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-10 19:02:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-10 19:02:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-07-10 19:02:36,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:36,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2020-07-10 19:02:36,813 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-10 19:02:36,813 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-10 19:02:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:36,819 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2020-07-10 19:02:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2020-07-10 19:02:36,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:36,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:36,820 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-10 19:02:36,820 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-10 19:02:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:36,825 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2020-07-10 19:02:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2020-07-10 19:02:36,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:36,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:36,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:36,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-10 19:02:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2020-07-10 19:02:36,830 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 85 [2020-07-10 19:02:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:36,831 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2020-07-10 19:02:36,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 19:02:36,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states and 82 transitions. [2020-07-10 19:02:36,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2020-07-10 19:02:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-10 19:02:36,968 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:36,968 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:02:36,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:02:36,969 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:36,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:36,969 INFO L82 PathProgramCache]: Analyzing trace with hash 679818391, now seen corresponding path program 1 times [2020-07-10 19:02:36,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:36,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [947483802] [2020-07-10 19:02:36,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:37,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {1339#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {1276#true} is VALID [2020-07-10 19:02:37,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} #valid := #valid[0 := 0]; {1276#true} is VALID [2020-07-10 19:02:37,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} assume 0 < #StackHeapBarrier; {1276#true} is VALID [2020-07-10 19:02:37,282 INFO L280 TraceCheckUtils]: 3: Hoare triple {1276#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {1276#true} is VALID [2020-07-10 19:02:37,282 INFO L280 TraceCheckUtils]: 4: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {1276#true} is VALID [2020-07-10 19:02:37,282 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {1276#true} is VALID [2020-07-10 19:02:37,283 INFO L280 TraceCheckUtils]: 6: Hoare triple {1276#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {1276#true} is VALID [2020-07-10 19:02:37,283 INFO L280 TraceCheckUtils]: 7: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {1276#true} is VALID [2020-07-10 19:02:37,283 INFO L280 TraceCheckUtils]: 8: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {1276#true} is VALID [2020-07-10 19:02:37,283 INFO L280 TraceCheckUtils]: 9: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 19:02:37,284 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1276#true} {1276#true} #123#return; {1276#true} is VALID [2020-07-10 19:02:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:37,310 INFO L280 TraceCheckUtils]: 0: Hoare triple {1340#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1276#true} is VALID [2020-07-10 19:02:37,310 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {1276#true} is VALID [2020-07-10 19:02:37,311 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} havoc #t~nondet0; {1276#true} is VALID [2020-07-10 19:02:37,311 INFO L280 TraceCheckUtils]: 3: Hoare triple {1276#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1276#true} is VALID [2020-07-10 19:02:37,311 INFO L280 TraceCheckUtils]: 4: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {1276#true} is VALID [2020-07-10 19:02:37,311 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} havoc #t~nondet1; {1276#true} is VALID [2020-07-10 19:02:37,312 INFO L280 TraceCheckUtils]: 6: Hoare triple {1276#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1276#true} is VALID [2020-07-10 19:02:37,312 INFO L280 TraceCheckUtils]: 7: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {1276#true} is VALID [2020-07-10 19:02:37,312 INFO L280 TraceCheckUtils]: 8: Hoare triple {1276#true} havoc #t~nondet2; {1276#true} is VALID [2020-07-10 19:02:37,312 INFO L280 TraceCheckUtils]: 9: Hoare triple {1276#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1276#true} is VALID [2020-07-10 19:02:37,313 INFO L280 TraceCheckUtils]: 10: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {1276#true} is VALID [2020-07-10 19:02:37,313 INFO L280 TraceCheckUtils]: 11: Hoare triple {1276#true} havoc #t~nondet3; {1276#true} is VALID [2020-07-10 19:02:37,313 INFO L280 TraceCheckUtils]: 12: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 19:02:37,313 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1276#true} {1276#true} #113#return; {1276#true} is VALID [2020-07-10 19:02:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:37,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {1276#true} assume 0 != #t~nondet4 % 256; {1276#true} is VALID [2020-07-10 19:02:37,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-10 19:02:37,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,375 INFO L280 TraceCheckUtils]: 3: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,375 INFO L280 TraceCheckUtils]: 4: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~nondet4; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,376 INFO L280 TraceCheckUtils]: 5: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,377 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {1276#true} #115#return; {1310#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} is VALID [2020-07-10 19:02:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:37,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {1276#true} assume 0 != #t~nondet4 % 256; {1276#true} is VALID [2020-07-10 19:02:37,384 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1276#true} is VALID [2020-07-10 19:02:37,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {1276#true} is VALID [2020-07-10 19:02:37,384 INFO L280 TraceCheckUtils]: 3: Hoare triple {1276#true} havoc #t~ite5.base, #t~ite5.offset; {1276#true} is VALID [2020-07-10 19:02:37,384 INFO L280 TraceCheckUtils]: 4: Hoare triple {1276#true} havoc #t~nondet4; {1276#true} is VALID [2020-07-10 19:02:37,385 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 19:02:37,386 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1276#true} {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #117#return; {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-10 19:02:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:37,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {1276#true} assume 0 != #t~nondet4 % 256; {1276#true} is VALID [2020-07-10 19:02:37,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-10 19:02:37,399 INFO L280 TraceCheckUtils]: 2: Hoare triple {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,400 INFO L280 TraceCheckUtils]: 3: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,401 INFO L280 TraceCheckUtils]: 4: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~nondet4; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,402 INFO L280 TraceCheckUtils]: 5: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,403 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #119#return; {1326#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|))} is VALID [2020-07-10 19:02:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:37,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {1276#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {1276#true} is VALID [2020-07-10 19:02:37,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} ~i := #in~i; {1276#true} is VALID [2020-07-10 19:02:37,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {1276#true} is VALID [2020-07-10 19:02:37,409 INFO L280 TraceCheckUtils]: 3: Hoare triple {1276#true} #res := (if #t~mem6 == ~i then 1 else 0); {1276#true} is VALID [2020-07-10 19:02:37,409 INFO L280 TraceCheckUtils]: 4: Hoare triple {1276#true} havoc #t~mem6; {1276#true} is VALID [2020-07-10 19:02:37,409 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 19:02:37,410 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1276#true} {1277#false} #121#return; {1277#false} is VALID [2020-07-10 19:02:37,411 INFO L263 TraceCheckUtils]: 0: Hoare triple {1276#true} call ULTIMATE.init(); {1339#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 19:02:37,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {1339#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {1276#true} is VALID [2020-07-10 19:02:37,411 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} #valid := #valid[0 := 0]; {1276#true} is VALID [2020-07-10 19:02:37,412 INFO L280 TraceCheckUtils]: 3: Hoare triple {1276#true} assume 0 < #StackHeapBarrier; {1276#true} is VALID [2020-07-10 19:02:37,412 INFO L280 TraceCheckUtils]: 4: Hoare triple {1276#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {1276#true} is VALID [2020-07-10 19:02:37,412 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {1276#true} is VALID [2020-07-10 19:02:37,412 INFO L280 TraceCheckUtils]: 6: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {1276#true} is VALID [2020-07-10 19:02:37,413 INFO L280 TraceCheckUtils]: 7: Hoare triple {1276#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {1276#true} is VALID [2020-07-10 19:02:37,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {1276#true} is VALID [2020-07-10 19:02:37,413 INFO L280 TraceCheckUtils]: 9: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {1276#true} is VALID [2020-07-10 19:02:37,413 INFO L280 TraceCheckUtils]: 10: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 19:02:37,414 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1276#true} {1276#true} #123#return; {1276#true} is VALID [2020-07-10 19:02:37,414 INFO L263 TraceCheckUtils]: 12: Hoare triple {1276#true} call #t~ret17 := main(); {1276#true} is VALID [2020-07-10 19:02:37,415 INFO L263 TraceCheckUtils]: 13: Hoare triple {1276#true} call init(); {1340#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 19:02:37,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {1340#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1276#true} is VALID [2020-07-10 19:02:37,415 INFO L280 TraceCheckUtils]: 15: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {1276#true} is VALID [2020-07-10 19:02:37,415 INFO L280 TraceCheckUtils]: 16: Hoare triple {1276#true} havoc #t~nondet0; {1276#true} is VALID [2020-07-10 19:02:37,416 INFO L280 TraceCheckUtils]: 17: Hoare triple {1276#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1276#true} is VALID [2020-07-10 19:02:37,416 INFO L280 TraceCheckUtils]: 18: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {1276#true} is VALID [2020-07-10 19:02:37,416 INFO L280 TraceCheckUtils]: 19: Hoare triple {1276#true} havoc #t~nondet1; {1276#true} is VALID [2020-07-10 19:02:37,416 INFO L280 TraceCheckUtils]: 20: Hoare triple {1276#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1276#true} is VALID [2020-07-10 19:02:37,417 INFO L280 TraceCheckUtils]: 21: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {1276#true} is VALID [2020-07-10 19:02:37,417 INFO L280 TraceCheckUtils]: 22: Hoare triple {1276#true} havoc #t~nondet2; {1276#true} is VALID [2020-07-10 19:02:37,417 INFO L280 TraceCheckUtils]: 23: Hoare triple {1276#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1276#true} is VALID [2020-07-10 19:02:37,417 INFO L280 TraceCheckUtils]: 24: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {1276#true} is VALID [2020-07-10 19:02:37,417 INFO L280 TraceCheckUtils]: 25: Hoare triple {1276#true} havoc #t~nondet3; {1276#true} is VALID [2020-07-10 19:02:37,418 INFO L280 TraceCheckUtils]: 26: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 19:02:37,418 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1276#true} {1276#true} #113#return; {1276#true} is VALID [2020-07-10 19:02:37,418 INFO L263 TraceCheckUtils]: 28: Hoare triple {1276#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {1276#true} is VALID [2020-07-10 19:02:37,418 INFO L280 TraceCheckUtils]: 29: Hoare triple {1276#true} assume 0 != #t~nondet4 % 256; {1276#true} is VALID [2020-07-10 19:02:37,419 INFO L280 TraceCheckUtils]: 30: Hoare triple {1276#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-10 19:02:37,420 INFO L280 TraceCheckUtils]: 31: Hoare triple {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,420 INFO L280 TraceCheckUtils]: 32: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,421 INFO L280 TraceCheckUtils]: 33: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~nondet4; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,422 INFO L280 TraceCheckUtils]: 34: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,423 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {1276#true} #115#return; {1310#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} is VALID [2020-07-10 19:02:37,423 INFO L280 TraceCheckUtils]: 36: Hoare triple {1310#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset; {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-10 19:02:37,424 INFO L280 TraceCheckUtils]: 37: Hoare triple {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} havoc #t~ret7.base, #t~ret7.offset; {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-10 19:02:37,424 INFO L263 TraceCheckUtils]: 38: Hoare triple {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {1276#true} is VALID [2020-07-10 19:02:37,425 INFO L280 TraceCheckUtils]: 39: Hoare triple {1276#true} assume 0 != #t~nondet4 % 256; {1276#true} is VALID [2020-07-10 19:02:37,425 INFO L280 TraceCheckUtils]: 40: Hoare triple {1276#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1276#true} is VALID [2020-07-10 19:02:37,425 INFO L280 TraceCheckUtils]: 41: Hoare triple {1276#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {1276#true} is VALID [2020-07-10 19:02:37,425 INFO L280 TraceCheckUtils]: 42: Hoare triple {1276#true} havoc #t~ite5.base, #t~ite5.offset; {1276#true} is VALID [2020-07-10 19:02:37,426 INFO L280 TraceCheckUtils]: 43: Hoare triple {1276#true} havoc #t~nondet4; {1276#true} is VALID [2020-07-10 19:02:37,426 INFO L280 TraceCheckUtils]: 44: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 19:02:37,427 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1276#true} {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #117#return; {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-10 19:02:37,428 INFO L280 TraceCheckUtils]: 46: Hoare triple {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset; {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-10 19:02:37,428 INFO L280 TraceCheckUtils]: 47: Hoare triple {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} havoc #t~ret8.base, #t~ret8.offset; {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-10 19:02:37,429 INFO L263 TraceCheckUtils]: 48: Hoare triple {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {1276#true} is VALID [2020-07-10 19:02:37,429 INFO L280 TraceCheckUtils]: 49: Hoare triple {1276#true} assume 0 != #t~nondet4 % 256; {1276#true} is VALID [2020-07-10 19:02:37,429 INFO L280 TraceCheckUtils]: 50: Hoare triple {1276#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-10 19:02:37,430 INFO L280 TraceCheckUtils]: 51: Hoare triple {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,431 INFO L280 TraceCheckUtils]: 52: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,431 INFO L280 TraceCheckUtils]: 53: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~nondet4; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,432 INFO L280 TraceCheckUtils]: 54: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-10 19:02:37,433 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #119#return; {1326#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|))} is VALID [2020-07-10 19:02:37,434 INFO L280 TraceCheckUtils]: 56: Hoare triple {1326#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|))} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-10 19:02:37,435 INFO L280 TraceCheckUtils]: 57: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} havoc #t~ret9.base, #t~ret9.offset; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-10 19:02:37,435 INFO L280 TraceCheckUtils]: 58: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-10 19:02:37,436 INFO L280 TraceCheckUtils]: 59: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} ~i~0 := #t~nondet10; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-10 19:02:37,437 INFO L280 TraceCheckUtils]: 60: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} havoc #t~nondet10; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-10 19:02:37,439 INFO L280 TraceCheckUtils]: 61: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} #t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-10 19:02:37,440 INFO L280 TraceCheckUtils]: 62: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} assume #t~short12; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-10 19:02:37,440 INFO L280 TraceCheckUtils]: 63: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} SUMMARY for call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4); srcloc: L35-2 {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-10 19:02:37,441 INFO L280 TraceCheckUtils]: 64: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} #t~short12 := #t~mem11 > 0; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-10 19:02:37,442 INFO L280 TraceCheckUtils]: 65: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} assume #t~short12; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-10 19:02:37,442 INFO L280 TraceCheckUtils]: 66: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} havoc #t~mem11; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-10 19:02:37,443 INFO L280 TraceCheckUtils]: 67: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} havoc #t~short12; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-10 19:02:37,444 INFO L280 TraceCheckUtils]: 68: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} ~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset; {1328#(and (= main_~pa~0.base main_~pd3~0.base) (= main_~pd3~0.offset main_~pa~0.offset))} is VALID [2020-07-10 19:02:37,445 INFO L280 TraceCheckUtils]: 69: Hoare triple {1328#(and (= main_~pa~0.base main_~pd3~0.base) (= main_~pd3~0.offset main_~pa~0.offset))} SUMMARY for call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4); srcloc: L37 {1329#(= |main_#t~mem13| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2020-07-10 19:02:37,445 INFO L280 TraceCheckUtils]: 70: Hoare triple {1329#(= |main_#t~mem13| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} ~i~0 := #t~mem13 - 10; {1330#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2020-07-10 19:02:37,446 INFO L280 TraceCheckUtils]: 71: Hoare triple {1330#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} havoc #t~mem13; {1330#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2020-07-10 19:02:37,447 INFO L280 TraceCheckUtils]: 72: Hoare triple {1330#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} SUMMARY for call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L38-5 {1331#(<= (+ main_~i~0 10) |main_#t~mem14|)} is VALID [2020-07-10 19:02:37,447 INFO L280 TraceCheckUtils]: 73: Hoare triple {1331#(<= (+ main_~i~0 10) |main_#t~mem14|)} assume !(~i~0 < #t~mem14); {1277#false} is VALID [2020-07-10 19:02:37,448 INFO L280 TraceCheckUtils]: 74: Hoare triple {1277#false} havoc #t~mem14; {1277#false} is VALID [2020-07-10 19:02:37,448 INFO L263 TraceCheckUtils]: 75: Hoare triple {1277#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {1276#true} is VALID [2020-07-10 19:02:37,448 INFO L280 TraceCheckUtils]: 76: Hoare triple {1276#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {1276#true} is VALID [2020-07-10 19:02:37,448 INFO L280 TraceCheckUtils]: 77: Hoare triple {1276#true} ~i := #in~i; {1276#true} is VALID [2020-07-10 19:02:37,449 INFO L280 TraceCheckUtils]: 78: Hoare triple {1276#true} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {1276#true} is VALID [2020-07-10 19:02:37,449 INFO L280 TraceCheckUtils]: 79: Hoare triple {1276#true} #res := (if #t~mem6 == ~i then 1 else 0); {1276#true} is VALID [2020-07-10 19:02:37,449 INFO L280 TraceCheckUtils]: 80: Hoare triple {1276#true} havoc #t~mem6; {1276#true} is VALID [2020-07-10 19:02:37,449 INFO L280 TraceCheckUtils]: 81: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 19:02:37,449 INFO L275 TraceCheckUtils]: 82: Hoare quadruple {1276#true} {1277#false} #121#return; {1277#false} is VALID [2020-07-10 19:02:37,450 INFO L280 TraceCheckUtils]: 83: Hoare triple {1277#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {1277#false} is VALID [2020-07-10 19:02:37,450 INFO L280 TraceCheckUtils]: 84: Hoare triple {1277#false} assume 0 == #t~ret16; {1277#false} is VALID [2020-07-10 19:02:37,450 INFO L280 TraceCheckUtils]: 85: Hoare triple {1277#false} havoc #t~ret16; {1277#false} is VALID [2020-07-10 19:02:37,450 INFO L280 TraceCheckUtils]: 86: Hoare triple {1277#false} assume !false; {1277#false} is VALID [2020-07-10 19:02:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-10 19:02:37,460 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:37,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [947483802] [2020-07-10 19:02:37,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:37,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 19:02:37,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98754996] [2020-07-10 19:02:37,461 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2020-07-10 19:02:37,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:37,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 19:02:37,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:37,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 19:02:37,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:37,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 19:02:37,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-07-10 19:02:37,545 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 14 states. [2020-07-10 19:02:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:42,143 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2020-07-10 19:02:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 19:02:42,144 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2020-07-10 19:02:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:02:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 178 transitions. [2020-07-10 19:02:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:02:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 178 transitions. [2020-07-10 19:02:42,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 178 transitions. [2020-07-10 19:02:42,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:42,484 INFO L225 Difference]: With dead ends: 167 [2020-07-10 19:02:42,484 INFO L226 Difference]: Without dead ends: 153 [2020-07-10 19:02:42,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2020-07-10 19:02:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-07-10 19:02:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 108. [2020-07-10 19:02:42,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:42,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 108 states. [2020-07-10 19:02:42,939 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 108 states. [2020-07-10 19:02:42,939 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 108 states. [2020-07-10 19:02:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:42,957 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2020-07-10 19:02:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2020-07-10 19:02:42,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:42,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:42,961 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 153 states. [2020-07-10 19:02:42,962 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 153 states. [2020-07-10 19:02:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:42,980 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2020-07-10 19:02:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2020-07-10 19:02:42,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:42,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:42,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:42,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-10 19:02:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2020-07-10 19:02:42,990 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 87 [2020-07-10 19:02:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:42,991 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2020-07-10 19:02:42,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 19:02:42,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states and 117 transitions. [2020-07-10 19:02:43,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2020-07-10 19:02:43,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-10 19:02:43,184 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:43,184 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:02:43,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:02:43,185 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:43,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2022406921, now seen corresponding path program 1 times [2020-07-10 19:02:43,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:43,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [341958198] [2020-07-10 19:02:43,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 19:02:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 19:02:43,342 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:43,342 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-10 19:02:43,342 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 19:02:43,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 19:02:43,365 WARN L170 areAnnotationChecker]: initENTRY has no Hoare annotation [2020-07-10 19:02:43,365 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 19:02:43,365 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 19:02:43,365 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 19:02:43,365 WARN L170 areAnnotationChecker]: get_dummyENTRY has no Hoare annotation [2020-07-10 19:02:43,365 WARN L170 areAnnotationChecker]: get_dummyENTRY has no Hoare annotation [2020-07-10 19:02:43,365 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 19:02:43,365 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 19:02:43,365 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2020-07-10 19:02:43,365 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 19:02:43,365 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 19:02:43,366 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 19:02:43,367 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 19:02:43,367 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-10 19:02:43,367 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-10 19:02:43,367 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-10 19:02:43,367 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-10 19:02:43,367 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 19:02:43,367 WARN L170 areAnnotationChecker]: L22-5 has no Hoare annotation [2020-07-10 19:02:43,367 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-10 19:02:43,367 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-10 19:02:43,368 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-10 19:02:43,368 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-10 19:02:43,368 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2020-07-10 19:02:43,368 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2020-07-10 19:02:43,368 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-10 19:02:43,368 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2020-07-10 19:02:43,368 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 19:02:43,368 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-10 19:02:43,368 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2020-07-10 19:02:43,369 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2020-07-10 19:02:43,369 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2020-07-10 19:02:43,369 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-10 19:02:43,369 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-10 19:02:43,369 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-10 19:02:43,369 WARN L170 areAnnotationChecker]: L9-4 has no Hoare annotation [2020-07-10 19:02:43,369 WARN L170 areAnnotationChecker]: L33-6 has no Hoare annotation [2020-07-10 19:02:43,369 WARN L170 areAnnotationChecker]: L33-5 has no Hoare annotation [2020-07-10 19:02:43,369 WARN L170 areAnnotationChecker]: L33-5 has no Hoare annotation [2020-07-10 19:02:43,370 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 19:02:43,370 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-10 19:02:43,370 WARN L170 areAnnotationChecker]: L9-5 has no Hoare annotation [2020-07-10 19:02:43,370 WARN L170 areAnnotationChecker]: L33-7 has no Hoare annotation [2020-07-10 19:02:43,370 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-10 19:02:43,370 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-10 19:02:43,370 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 19:02:43,370 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 19:02:43,370 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 19:02:43,370 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 19:02:43,371 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 19:02:43,371 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-10 19:02:43,371 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 19:02:43,371 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-10 19:02:43,371 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 19:02:43,371 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 19:02:43,371 WARN L170 areAnnotationChecker]: L35-11 has no Hoare annotation [2020-07-10 19:02:43,371 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-10 19:02:43,372 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2020-07-10 19:02:43,372 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 19:02:43,372 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 19:02:43,372 WARN L170 areAnnotationChecker]: initFINAL has no Hoare annotation [2020-07-10 19:02:43,372 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 19:02:43,372 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 19:02:43,372 WARN L170 areAnnotationChecker]: initEXIT has no Hoare annotation [2020-07-10 19:02:43,372 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-10 19:02:43,372 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-10 19:02:43,372 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 19:02:43,373 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-10 19:02:43,373 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-10 19:02:43,373 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 19:02:43,373 WARN L170 areAnnotationChecker]: L35-6 has no Hoare annotation [2020-07-10 19:02:43,373 WARN L170 areAnnotationChecker]: L35-9 has no Hoare annotation [2020-07-10 19:02:43,373 WARN L170 areAnnotationChecker]: L35-7 has no Hoare annotation [2020-07-10 19:02:43,373 WARN L170 areAnnotationChecker]: L35-10 has no Hoare annotation [2020-07-10 19:02:43,373 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 19:02:43,373 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 19:02:43,374 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-10 19:02:43,374 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-10 19:02:43,374 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-10 19:02:43,374 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-10 19:02:43,374 WARN L170 areAnnotationChecker]: L38-6 has no Hoare annotation [2020-07-10 19:02:43,374 WARN L170 areAnnotationChecker]: L38-6 has no Hoare annotation [2020-07-10 19:02:43,374 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-10 19:02:43,374 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-10 19:02:43,374 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 19:02:43,374 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-10 19:02:43,375 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 19:02:43,375 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-10 19:02:43,375 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2020-07-10 19:02:43,375 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 19:02:43,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:02:43 BoogieIcfgContainer [2020-07-10 19:02:43,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:02:43,381 INFO L168 Benchmark]: Toolchain (without parser) took 11742.85 ms. Allocated memory was 140.5 MB in the beginning and 349.2 MB in the end (delta: 208.7 MB). Free memory was 101.9 MB in the beginning and 160.8 MB in the end (delta: -58.8 MB). Peak memory consumption was 149.8 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:43,382 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.5 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 19:02:43,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.00 ms. Allocated memory is still 140.5 MB. Free memory was 101.7 MB in the beginning and 90.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:43,384 INFO L168 Benchmark]: Boogie Preprocessor took 131.74 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 90.6 MB in the beginning and 179.5 MB in the end (delta: -88.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:43,384 INFO L168 Benchmark]: RCFGBuilder took 603.15 ms. Allocated memory is still 202.9 MB. Free memory was 179.5 MB in the beginning and 144.4 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:43,385 INFO L168 Benchmark]: TraceAbstraction took 10693.89 ms. Allocated memory was 202.9 MB in the beginning and 349.2 MB in the end (delta: 146.3 MB). Free memory was 143.7 MB in the beginning and 160.8 MB in the end (delta: -17.0 MB). Peak memory consumption was 129.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:43,389 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.25 ms. Allocated memory is still 140.5 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 306.00 ms. Allocated memory is still 140.5 MB. Free memory was 101.7 MB in the beginning and 90.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.74 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 90.6 MB in the beginning and 179.5 MB in the end (delta: -88.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 603.15 ms. Allocated memory is still 202.9 MB. Free memory was 179.5 MB in the beginning and 144.4 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10693.89 ms. Allocated memory was 202.9 MB in the beginning and 349.2 MB in the end (delta: 146.3 MB). Free memory was 143.7 MB in the beginning and 160.8 MB in the end (delta: -17.0 MB). Peak memory consumption was 129.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 48]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] struct dummy d1, d2; [L32] CALL init() [L13] d1.a = __VERIFIER_nondet_int() [L14] d1.b = __VERIFIER_nondet_int() [L16] d2.a = __VERIFIER_nondet_int() [L17] d2.b = __VERIFIER_nondet_int() [L32] RET init() [L33] CALL, EXPR get_dummy() [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L34] int i = __VERIFIER_nondet_int(); [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L35] EXPR (*pd2).a [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L35] COND TRUE pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L36] int *pa = &pd1->a; [L37] EXPR pd3->a [L37] i = pd3->a - 10 [L38] EXPR \read(*pa) [L38] COND FALSE !(i < *pa) [L41] CALL, EXPR check(pd2, i) [L27] EXPR s1->a [L27] return s1->a == i; [L41] RET, EXPR check(pd2, i) [L41] COND TRUE !check(pd2, i) [L48] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.6s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 209 SDtfs, 395 SDslu, 76 SDs, 0 SdLazy, 1267 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 45 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...