/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test24-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:25:16,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:25:16,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:25:16,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:25:16,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:25:16,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:25:16,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:25:16,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:25:16,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:25:16,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:25:16,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:25:16,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:25:16,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:25:16,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:25:16,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:25:16,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:25:16,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:25:16,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:25:16,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:25:16,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:25:16,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:25:16,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:25:16,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:25:16,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:25:16,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:25:16,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:25:16,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:25:16,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:25:16,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:25:16,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:25:16,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:25:16,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:25:16,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:25:16,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:25:16,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:25:16,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:25:16,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:25:16,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:25:16,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:25:16,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:25:16,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:25:16,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:25:16,539 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:25:16,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:25:16,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:25:16,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:25:16,541 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:25:16,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:25:16,541 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:25:16,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:25:16,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:25:16,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:25:16,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:25:16,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:25:16,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:25:16,543 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:25:16,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:25:16,544 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:25:16,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:25:16,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:25:16,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:25:16,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:25:16,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:25:16,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:25:16,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:25:16,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:25:16,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:25:16,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:25:16,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:25:16,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:25:16,547 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:25:16,547 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:25:16,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:25:16,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:25:16,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:25:16,865 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:25:16,866 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:25:16,867 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test24-2.c [2020-07-08 12:25:16,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c8f467f2/8e2d4fbaf5bf4e1981abfd1857e20f02/FLAGa11c0e523 [2020-07-08 12:25:17,407 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:25:17,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test24-2.c [2020-07-08 12:25:17,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c8f467f2/8e2d4fbaf5bf4e1981abfd1857e20f02/FLAGa11c0e523 [2020-07-08 12:25:17,771 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c8f467f2/8e2d4fbaf5bf4e1981abfd1857e20f02 [2020-07-08 12:25:17,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:25:17,780 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:25:17,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:25:17,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:25:17,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:25:17,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:25:17" (1/1) ... [2020-07-08 12:25:17,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ab632c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:17, skipping insertion in model container [2020-07-08 12:25:17,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:25:17" (1/1) ... [2020-07-08 12:25:17,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:25:17,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:25:18,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:25:18,022 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:25:18,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:25:18,144 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:25:18,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:18 WrapperNode [2020-07-08 12:25:18,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:25:18,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:25:18,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:25:18,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:25:18,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:18" (1/1) ... [2020-07-08 12:25:18,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:18" (1/1) ... [2020-07-08 12:25:18,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:18" (1/1) ... [2020-07-08 12:25:18,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:18" (1/1) ... [2020-07-08 12:25:18,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:18" (1/1) ... [2020-07-08 12:25:18,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:18" (1/1) ... [2020-07-08 12:25:18,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:18" (1/1) ... [2020-07-08 12:25:18,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:25:18,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:25:18,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:25:18,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:25:18,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:25:18,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:25:18,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:25:18,266 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-08 12:25:18,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:25:18,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:25:18,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:25:18,268 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-08 12:25:18,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:25:18,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:25:18,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:25:18,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:25:18,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:25:18,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:25:18,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:25:18,656 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:25:18,657 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 12:25:18,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:25:18 BoogieIcfgContainer [2020-07-08 12:25:18,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:25:18,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:25:18,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:25:18,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:25:18,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:25:17" (1/3) ... [2020-07-08 12:25:18,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19bc93a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:25:18, skipping insertion in model container [2020-07-08 12:25:18,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:18" (2/3) ... [2020-07-08 12:25:18,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19bc93a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:25:18, skipping insertion in model container [2020-07-08 12:25:18,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:25:18" (3/3) ... [2020-07-08 12:25:18,668 INFO L109 eAbstractionObserver]: Analyzing ICFG test24-2.c [2020-07-08 12:25:18,679 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:25:18,686 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:25:18,699 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:25:18,719 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:25:18,719 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:25:18,719 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:25:18,719 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:25:18,719 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:25:18,720 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:25:18,720 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:25:18,720 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:25:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-08 12:25:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 12:25:18,741 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:18,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:18,743 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:18,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:18,750 INFO L82 PathProgramCache]: Analyzing trace with hash 855240046, now seen corresponding path program 1 times [2020-07-08 12:25:18,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:18,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365739470] [2020-07-08 12:25:18,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:18,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-08 12:25:18,971 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-08 12:25:18,971 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #53#return; {28#true} is VALID [2020-07-08 12:25:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:18,992 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {28#true} is VALID [2020-07-08 12:25:18,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-08 12:25:18,994 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {29#false} #57#return; {29#false} is VALID [2020-07-08 12:25:18,996 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:18,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-08 12:25:18,997 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-08 12:25:18,997 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #53#return; {28#true} is VALID [2020-07-08 12:25:18,998 INFO L263 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2020-07-08 12:25:18,998 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {28#true} is VALID [2020-07-08 12:25:19,000 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2020-07-08 12:25:19,000 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {29#false} is VALID [2020-07-08 12:25:19,001 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {29#false} is VALID [2020-07-08 12:25:19,001 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#false} assume !true; {29#false} is VALID [2020-07-08 12:25:19,002 INFO L263 TraceCheckUtils]: 10: Hoare triple {29#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {28#true} is VALID [2020-07-08 12:25:19,002 INFO L280 TraceCheckUtils]: 11: Hoare triple {28#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {28#true} is VALID [2020-07-08 12:25:19,002 INFO L280 TraceCheckUtils]: 12: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-08 12:25:19,003 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {28#true} {29#false} #57#return; {29#false} is VALID [2020-07-08 12:25:19,003 INFO L280 TraceCheckUtils]: 14: Hoare triple {29#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {29#false} is VALID [2020-07-08 12:25:19,004 INFO L280 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == #t~ret8;havoc #t~ret8; {29#false} is VALID [2020-07-08 12:25:19,004 INFO L280 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-08 12:25:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:19,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365739470] [2020-07-08 12:25:19,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:25:19,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:25:19,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107203722] [2020-07-08 12:25:19,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-08 12:25:19,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:19,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:25:19,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:19,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:25:19,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:25:19,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:25:19,076 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-07-08 12:25:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:19,313 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2020-07-08 12:25:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:25:19,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-08 12:25:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:25:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2020-07-08 12:25:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:25:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2020-07-08 12:25:19,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2020-07-08 12:25:19,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:19,449 INFO L225 Difference]: With dead ends: 42 [2020-07-08 12:25:19,449 INFO L226 Difference]: Without dead ends: 20 [2020-07-08 12:25:19,453 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:25:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-08 12:25:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-08 12:25:19,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:19,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-08 12:25:19,502 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-08 12:25:19,502 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-08 12:25:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:19,506 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-08 12:25:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-08 12:25:19,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:19,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:19,508 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-08 12:25:19,508 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-08 12:25:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:19,512 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-08 12:25:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-08 12:25:19,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:19,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:19,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:19,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 12:25:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-08 12:25:19,518 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2020-07-08 12:25:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:19,518 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-08 12:25:19,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:25:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-08 12:25:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 12:25:19,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:19,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:19,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:25:19,521 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1631497781, now seen corresponding path program 1 times [2020-07-08 12:25:19,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:19,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595611518] [2020-07-08 12:25:19,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:19,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {172#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {163#true} is VALID [2020-07-08 12:25:19,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-08 12:25:19,617 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #53#return; {163#true} is VALID [2020-07-08 12:25:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:19,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {163#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {163#true} is VALID [2020-07-08 12:25:19,628 INFO L280 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-08 12:25:19,628 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {163#true} {164#false} #57#return; {164#false} is VALID [2020-07-08 12:25:19,630 INFO L263 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {172#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:19,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {172#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {163#true} is VALID [2020-07-08 12:25:19,631 INFO L280 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-08 12:25:19,631 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #53#return; {163#true} is VALID [2020-07-08 12:25:19,631 INFO L263 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret9 := main(); {163#true} is VALID [2020-07-08 12:25:19,633 INFO L280 TraceCheckUtils]: 5: Hoare triple {163#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {168#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:19,634 INFO L280 TraceCheckUtils]: 6: Hoare triple {168#(= 0 main_~j~0)} assume !(~j~0 < 20); {164#false} is VALID [2020-07-08 12:25:19,634 INFO L280 TraceCheckUtils]: 7: Hoare triple {164#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {164#false} is VALID [2020-07-08 12:25:19,635 INFO L280 TraceCheckUtils]: 8: Hoare triple {164#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {164#false} is VALID [2020-07-08 12:25:19,635 INFO L280 TraceCheckUtils]: 9: Hoare triple {164#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {164#false} is VALID [2020-07-08 12:25:19,635 INFO L280 TraceCheckUtils]: 10: Hoare triple {164#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {164#false} is VALID [2020-07-08 12:25:19,636 INFO L263 TraceCheckUtils]: 11: Hoare triple {164#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {163#true} is VALID [2020-07-08 12:25:19,636 INFO L280 TraceCheckUtils]: 12: Hoare triple {163#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {163#true} is VALID [2020-07-08 12:25:19,636 INFO L280 TraceCheckUtils]: 13: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-08 12:25:19,637 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {163#true} {164#false} #57#return; {164#false} is VALID [2020-07-08 12:25:19,637 INFO L280 TraceCheckUtils]: 15: Hoare triple {164#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {164#false} is VALID [2020-07-08 12:25:19,637 INFO L280 TraceCheckUtils]: 16: Hoare triple {164#false} assume 0 == #t~ret8;havoc #t~ret8; {164#false} is VALID [2020-07-08 12:25:19,638 INFO L280 TraceCheckUtils]: 17: Hoare triple {164#false} assume !false; {164#false} is VALID [2020-07-08 12:25:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:19,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595611518] [2020-07-08 12:25:19,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:25:19,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:25:19,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511610362] [2020-07-08 12:25:19,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-08 12:25:19,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:19,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:25:19,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:19,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:25:19,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:19,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:25:19,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:25:19,684 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2020-07-08 12:25:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:19,816 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-08 12:25:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:25:19,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-08 12:25:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:25:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2020-07-08 12:25:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:25:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2020-07-08 12:25:19,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2020-07-08 12:25:19,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:19,876 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:25:19,876 INFO L226 Difference]: Without dead ends: 22 [2020-07-08 12:25:19,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:25:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-08 12:25:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-08 12:25:19,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:19,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-08 12:25:19,893 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-08 12:25:19,893 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-08 12:25:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:19,896 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-08 12:25:19,896 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:25:19,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:19,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:19,897 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-08 12:25:19,897 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-08 12:25:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:19,900 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-08 12:25:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:25:19,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:19,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:19,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:19,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:25:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-08 12:25:19,903 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2020-07-08 12:25:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:19,904 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-08 12:25:19,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:25:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-08 12:25:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:25:19,905 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:19,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:19,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:25:19,906 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1934775405, now seen corresponding path program 1 times [2020-07-08 12:25:19,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:19,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116712611] [2020-07-08 12:25:19,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:20,014 INFO L280 TraceCheckUtils]: 0: Hoare triple {308#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {298#true} is VALID [2020-07-08 12:25:20,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-08 12:25:20,015 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {298#true} {298#true} #53#return; {298#true} is VALID [2020-07-08 12:25:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:20,036 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {298#true} is VALID [2020-07-08 12:25:20,036 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-08 12:25:20,037 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {298#true} {299#false} #57#return; {299#false} is VALID [2020-07-08 12:25:20,038 INFO L263 TraceCheckUtils]: 0: Hoare triple {298#true} call ULTIMATE.init(); {308#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:20,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {308#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {298#true} is VALID [2020-07-08 12:25:20,039 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-08 12:25:20,039 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {298#true} {298#true} #53#return; {298#true} is VALID [2020-07-08 12:25:20,039 INFO L263 TraceCheckUtils]: 4: Hoare triple {298#true} call #t~ret9 := main(); {298#true} is VALID [2020-07-08 12:25:20,041 INFO L280 TraceCheckUtils]: 5: Hoare triple {298#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {303#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:20,043 INFO L280 TraceCheckUtils]: 6: Hoare triple {303#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {303#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:20,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {304#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:20,046 INFO L280 TraceCheckUtils]: 8: Hoare triple {304#(<= main_~j~0 1)} assume !(~j~0 < 20); {299#false} is VALID [2020-07-08 12:25:20,046 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {299#false} is VALID [2020-07-08 12:25:20,047 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {299#false} is VALID [2020-07-08 12:25:20,047 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {299#false} is VALID [2020-07-08 12:25:20,050 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {299#false} is VALID [2020-07-08 12:25:20,050 INFO L263 TraceCheckUtils]: 13: Hoare triple {299#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {298#true} is VALID [2020-07-08 12:25:20,050 INFO L280 TraceCheckUtils]: 14: Hoare triple {298#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {298#true} is VALID [2020-07-08 12:25:20,050 INFO L280 TraceCheckUtils]: 15: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-08 12:25:20,051 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {298#true} {299#false} #57#return; {299#false} is VALID [2020-07-08 12:25:20,051 INFO L280 TraceCheckUtils]: 17: Hoare triple {299#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {299#false} is VALID [2020-07-08 12:25:20,051 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#false} assume 0 == #t~ret8;havoc #t~ret8; {299#false} is VALID [2020-07-08 12:25:20,051 INFO L280 TraceCheckUtils]: 19: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-08 12:25:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:20,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116712611] [2020-07-08 12:25:20,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541925924] [2020-07-08 12:25:20,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:20,102 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-08 12:25:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:20,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:20,192 INFO L263 TraceCheckUtils]: 0: Hoare triple {298#true} call ULTIMATE.init(); {298#true} is VALID [2020-07-08 12:25:20,193 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {298#true} is VALID [2020-07-08 12:25:20,193 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-08 12:25:20,194 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {298#true} {298#true} #53#return; {298#true} is VALID [2020-07-08 12:25:20,194 INFO L263 TraceCheckUtils]: 4: Hoare triple {298#true} call #t~ret9 := main(); {298#true} is VALID [2020-07-08 12:25:20,195 INFO L280 TraceCheckUtils]: 5: Hoare triple {298#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {327#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:20,196 INFO L280 TraceCheckUtils]: 6: Hoare triple {327#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {327#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:20,197 INFO L280 TraceCheckUtils]: 7: Hoare triple {327#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {304#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:20,198 INFO L280 TraceCheckUtils]: 8: Hoare triple {304#(<= main_~j~0 1)} assume !(~j~0 < 20); {299#false} is VALID [2020-07-08 12:25:20,198 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {299#false} is VALID [2020-07-08 12:25:20,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {299#false} is VALID [2020-07-08 12:25:20,199 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {299#false} is VALID [2020-07-08 12:25:20,199 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {299#false} is VALID [2020-07-08 12:25:20,200 INFO L263 TraceCheckUtils]: 13: Hoare triple {299#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {299#false} is VALID [2020-07-08 12:25:20,200 INFO L280 TraceCheckUtils]: 14: Hoare triple {299#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {299#false} is VALID [2020-07-08 12:25:20,200 INFO L280 TraceCheckUtils]: 15: Hoare triple {299#false} assume true; {299#false} is VALID [2020-07-08 12:25:20,200 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {299#false} {299#false} #57#return; {299#false} is VALID [2020-07-08 12:25:20,201 INFO L280 TraceCheckUtils]: 17: Hoare triple {299#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {299#false} is VALID [2020-07-08 12:25:20,201 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#false} assume 0 == #t~ret8;havoc #t~ret8; {299#false} is VALID [2020-07-08 12:25:20,201 INFO L280 TraceCheckUtils]: 19: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-08 12:25:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:20,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:20,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-08 12:25:20,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267742627] [2020-07-08 12:25:20,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-08 12:25:20,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:20,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:25:20,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:20,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:25:20,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:20,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:25:20,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:25:20,247 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2020-07-08 12:25:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:20,394 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-08 12:25:20,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:25:20,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-08 12:25:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:25:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-08 12:25:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:25:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-08 12:25:20,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2020-07-08 12:25:20,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:20,459 INFO L225 Difference]: With dead ends: 36 [2020-07-08 12:25:20,459 INFO L226 Difference]: Without dead ends: 24 [2020-07-08 12:25:20,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:25:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-08 12:25:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-08 12:25:20,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:20,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-08 12:25:20,477 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-08 12:25:20,477 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-08 12:25:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:20,480 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-08 12:25:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 12:25:20,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:20,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:20,481 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-08 12:25:20,481 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-08 12:25:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:20,484 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-08 12:25:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 12:25:20,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:20,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:20,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:20,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 12:25:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-08 12:25:20,487 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2020-07-08 12:25:20,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:20,488 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-08 12:25:20,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:25:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-08 12:25:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:25:20,489 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:20,489 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:20,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-08 12:25:20,705 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:20,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1739404943, now seen corresponding path program 2 times [2020-07-08 12:25:20,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:20,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533717710] [2020-07-08 12:25:20,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:20,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {513#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {502#true} is VALID [2020-07-08 12:25:20,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-08 12:25:20,807 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {502#true} {502#true} #53#return; {502#true} is VALID [2020-07-08 12:25:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:20,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {502#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {502#true} is VALID [2020-07-08 12:25:20,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-08 12:25:20,816 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {502#true} {503#false} #57#return; {503#false} is VALID [2020-07-08 12:25:20,818 INFO L263 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {513#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:20,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {513#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {502#true} is VALID [2020-07-08 12:25:20,819 INFO L280 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-08 12:25:20,819 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #53#return; {502#true} is VALID [2020-07-08 12:25:20,819 INFO L263 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret9 := main(); {502#true} is VALID [2020-07-08 12:25:20,821 INFO L280 TraceCheckUtils]: 5: Hoare triple {502#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {507#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:20,821 INFO L280 TraceCheckUtils]: 6: Hoare triple {507#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {507#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:20,822 INFO L280 TraceCheckUtils]: 7: Hoare triple {507#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {508#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:20,823 INFO L280 TraceCheckUtils]: 8: Hoare triple {508#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {508#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:20,825 INFO L280 TraceCheckUtils]: 9: Hoare triple {508#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {509#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:20,826 INFO L280 TraceCheckUtils]: 10: Hoare triple {509#(<= main_~j~0 2)} assume !(~j~0 < 20); {503#false} is VALID [2020-07-08 12:25:20,826 INFO L280 TraceCheckUtils]: 11: Hoare triple {503#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {503#false} is VALID [2020-07-08 12:25:20,826 INFO L280 TraceCheckUtils]: 12: Hoare triple {503#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {503#false} is VALID [2020-07-08 12:25:20,827 INFO L280 TraceCheckUtils]: 13: Hoare triple {503#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {503#false} is VALID [2020-07-08 12:25:20,827 INFO L280 TraceCheckUtils]: 14: Hoare triple {503#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {503#false} is VALID [2020-07-08 12:25:20,827 INFO L263 TraceCheckUtils]: 15: Hoare triple {503#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {502#true} is VALID [2020-07-08 12:25:20,828 INFO L280 TraceCheckUtils]: 16: Hoare triple {502#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {502#true} is VALID [2020-07-08 12:25:20,828 INFO L280 TraceCheckUtils]: 17: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-08 12:25:20,828 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {502#true} {503#false} #57#return; {503#false} is VALID [2020-07-08 12:25:20,829 INFO L280 TraceCheckUtils]: 19: Hoare triple {503#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {503#false} is VALID [2020-07-08 12:25:20,829 INFO L280 TraceCheckUtils]: 20: Hoare triple {503#false} assume 0 == #t~ret8;havoc #t~ret8; {503#false} is VALID [2020-07-08 12:25:20,829 INFO L280 TraceCheckUtils]: 21: Hoare triple {503#false} assume !false; {503#false} is VALID [2020-07-08 12:25:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:20,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533717710] [2020-07-08 12:25:20,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607525913] [2020-07-08 12:25:20,832 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:20,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:25:20,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:20,898 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:25:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:20,912 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:20,975 INFO L263 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2020-07-08 12:25:20,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {502#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {502#true} is VALID [2020-07-08 12:25:20,975 INFO L280 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-08 12:25:20,976 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #53#return; {502#true} is VALID [2020-07-08 12:25:20,976 INFO L263 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret9 := main(); {502#true} is VALID [2020-07-08 12:25:20,977 INFO L280 TraceCheckUtils]: 5: Hoare triple {502#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {532#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:20,978 INFO L280 TraceCheckUtils]: 6: Hoare triple {532#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {532#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:20,979 INFO L280 TraceCheckUtils]: 7: Hoare triple {532#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {508#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:20,980 INFO L280 TraceCheckUtils]: 8: Hoare triple {508#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {508#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:20,980 INFO L280 TraceCheckUtils]: 9: Hoare triple {508#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {509#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:20,981 INFO L280 TraceCheckUtils]: 10: Hoare triple {509#(<= main_~j~0 2)} assume !(~j~0 < 20); {503#false} is VALID [2020-07-08 12:25:20,981 INFO L280 TraceCheckUtils]: 11: Hoare triple {503#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {503#false} is VALID [2020-07-08 12:25:20,982 INFO L280 TraceCheckUtils]: 12: Hoare triple {503#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {503#false} is VALID [2020-07-08 12:25:20,982 INFO L280 TraceCheckUtils]: 13: Hoare triple {503#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {503#false} is VALID [2020-07-08 12:25:20,982 INFO L280 TraceCheckUtils]: 14: Hoare triple {503#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {503#false} is VALID [2020-07-08 12:25:20,982 INFO L263 TraceCheckUtils]: 15: Hoare triple {503#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {503#false} is VALID [2020-07-08 12:25:20,983 INFO L280 TraceCheckUtils]: 16: Hoare triple {503#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {503#false} is VALID [2020-07-08 12:25:20,983 INFO L280 TraceCheckUtils]: 17: Hoare triple {503#false} assume true; {503#false} is VALID [2020-07-08 12:25:20,983 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {503#false} {503#false} #57#return; {503#false} is VALID [2020-07-08 12:25:20,983 INFO L280 TraceCheckUtils]: 19: Hoare triple {503#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {503#false} is VALID [2020-07-08 12:25:20,984 INFO L280 TraceCheckUtils]: 20: Hoare triple {503#false} assume 0 == #t~ret8;havoc #t~ret8; {503#false} is VALID [2020-07-08 12:25:20,984 INFO L280 TraceCheckUtils]: 21: Hoare triple {503#false} assume !false; {503#false} is VALID [2020-07-08 12:25:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:20,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:20,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-08 12:25:20,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804343413] [2020-07-08 12:25:20,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-08 12:25:20,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:20,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:25:21,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:21,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:25:21,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:21,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:25:21,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:25:21,027 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2020-07-08 12:25:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:21,192 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-08 12:25:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:25:21,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-08 12:25:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:25:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-08 12:25:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:25:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-08 12:25:21,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2020-07-08 12:25:21,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:21,249 INFO L225 Difference]: With dead ends: 38 [2020-07-08 12:25:21,249 INFO L226 Difference]: Without dead ends: 26 [2020-07-08 12:25:21,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:25:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-08 12:25:21,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-08 12:25:21,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:21,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-08 12:25:21,269 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-08 12:25:21,269 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-08 12:25:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:21,272 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-08 12:25:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-08 12:25:21,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:21,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:21,273 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-08 12:25:21,273 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-08 12:25:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:21,275 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-08 12:25:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-08 12:25:21,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:21,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:21,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:21,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 12:25:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-08 12:25:21,278 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2020-07-08 12:25:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:21,278 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-08 12:25:21,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:25:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-08 12:25:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:25:21,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:21,280 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:21,494 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:21,494 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1328015311, now seen corresponding path program 3 times [2020-07-08 12:25:21,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:21,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491542420] [2020-07-08 12:25:21,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:21,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {723#true} is VALID [2020-07-08 12:25:21,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-08 12:25:21,608 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {723#true} {723#true} #53#return; {723#true} is VALID [2020-07-08 12:25:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:21,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {723#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {723#true} is VALID [2020-07-08 12:25:21,622 INFO L280 TraceCheckUtils]: 1: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-08 12:25:21,623 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {723#true} {724#false} #57#return; {724#false} is VALID [2020-07-08 12:25:21,624 INFO L263 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:21,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {723#true} is VALID [2020-07-08 12:25:21,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-08 12:25:21,625 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #53#return; {723#true} is VALID [2020-07-08 12:25:21,625 INFO L263 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret9 := main(); {723#true} is VALID [2020-07-08 12:25:21,626 INFO L280 TraceCheckUtils]: 5: Hoare triple {723#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {728#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:21,627 INFO L280 TraceCheckUtils]: 6: Hoare triple {728#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {728#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:21,627 INFO L280 TraceCheckUtils]: 7: Hoare triple {728#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {729#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:21,628 INFO L280 TraceCheckUtils]: 8: Hoare triple {729#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {729#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:21,629 INFO L280 TraceCheckUtils]: 9: Hoare triple {729#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {730#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:21,629 INFO L280 TraceCheckUtils]: 10: Hoare triple {730#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {730#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:21,630 INFO L280 TraceCheckUtils]: 11: Hoare triple {730#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {731#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:21,631 INFO L280 TraceCheckUtils]: 12: Hoare triple {731#(<= main_~j~0 3)} assume !(~j~0 < 20); {724#false} is VALID [2020-07-08 12:25:21,631 INFO L280 TraceCheckUtils]: 13: Hoare triple {724#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {724#false} is VALID [2020-07-08 12:25:21,632 INFO L280 TraceCheckUtils]: 14: Hoare triple {724#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {724#false} is VALID [2020-07-08 12:25:21,632 INFO L280 TraceCheckUtils]: 15: Hoare triple {724#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {724#false} is VALID [2020-07-08 12:25:21,635 INFO L280 TraceCheckUtils]: 16: Hoare triple {724#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {724#false} is VALID [2020-07-08 12:25:21,642 INFO L263 TraceCheckUtils]: 17: Hoare triple {724#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {723#true} is VALID [2020-07-08 12:25:21,642 INFO L280 TraceCheckUtils]: 18: Hoare triple {723#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {723#true} is VALID [2020-07-08 12:25:21,642 INFO L280 TraceCheckUtils]: 19: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-08 12:25:21,643 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {723#true} {724#false} #57#return; {724#false} is VALID [2020-07-08 12:25:21,643 INFO L280 TraceCheckUtils]: 21: Hoare triple {724#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {724#false} is VALID [2020-07-08 12:25:21,644 INFO L280 TraceCheckUtils]: 22: Hoare triple {724#false} assume 0 == #t~ret8;havoc #t~ret8; {724#false} is VALID [2020-07-08 12:25:21,644 INFO L280 TraceCheckUtils]: 23: Hoare triple {724#false} assume !false; {724#false} is VALID [2020-07-08 12:25:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:21,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491542420] [2020-07-08 12:25:21,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236831494] [2020-07-08 12:25:21,646 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:21,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-08 12:25:21,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:21,701 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:25:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:21,713 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:21,768 INFO L263 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2020-07-08 12:25:21,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {723#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {723#true} is VALID [2020-07-08 12:25:21,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-08 12:25:21,769 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #53#return; {723#true} is VALID [2020-07-08 12:25:21,769 INFO L263 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret9 := main(); {723#true} is VALID [2020-07-08 12:25:21,770 INFO L280 TraceCheckUtils]: 5: Hoare triple {723#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {754#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:21,771 INFO L280 TraceCheckUtils]: 6: Hoare triple {754#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {754#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:21,772 INFO L280 TraceCheckUtils]: 7: Hoare triple {754#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {729#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:21,772 INFO L280 TraceCheckUtils]: 8: Hoare triple {729#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {729#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:21,773 INFO L280 TraceCheckUtils]: 9: Hoare triple {729#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {730#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:21,774 INFO L280 TraceCheckUtils]: 10: Hoare triple {730#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {730#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:21,775 INFO L280 TraceCheckUtils]: 11: Hoare triple {730#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {731#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:21,776 INFO L280 TraceCheckUtils]: 12: Hoare triple {731#(<= main_~j~0 3)} assume !(~j~0 < 20); {724#false} is VALID [2020-07-08 12:25:21,776 INFO L280 TraceCheckUtils]: 13: Hoare triple {724#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {724#false} is VALID [2020-07-08 12:25:21,776 INFO L280 TraceCheckUtils]: 14: Hoare triple {724#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {724#false} is VALID [2020-07-08 12:25:21,776 INFO L280 TraceCheckUtils]: 15: Hoare triple {724#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {724#false} is VALID [2020-07-08 12:25:21,777 INFO L280 TraceCheckUtils]: 16: Hoare triple {724#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {724#false} is VALID [2020-07-08 12:25:21,777 INFO L263 TraceCheckUtils]: 17: Hoare triple {724#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {724#false} is VALID [2020-07-08 12:25:21,777 INFO L280 TraceCheckUtils]: 18: Hoare triple {724#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {724#false} is VALID [2020-07-08 12:25:21,777 INFO L280 TraceCheckUtils]: 19: Hoare triple {724#false} assume true; {724#false} is VALID [2020-07-08 12:25:21,778 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {724#false} {724#false} #57#return; {724#false} is VALID [2020-07-08 12:25:21,778 INFO L280 TraceCheckUtils]: 21: Hoare triple {724#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {724#false} is VALID [2020-07-08 12:25:21,778 INFO L280 TraceCheckUtils]: 22: Hoare triple {724#false} assume 0 == #t~ret8;havoc #t~ret8; {724#false} is VALID [2020-07-08 12:25:21,778 INFO L280 TraceCheckUtils]: 23: Hoare triple {724#false} assume !false; {724#false} is VALID [2020-07-08 12:25:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:21,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:21,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-08 12:25:21,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994121997] [2020-07-08 12:25:21,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-08 12:25:21,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:21,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:25:21,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:21,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:25:21,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:21,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:25:21,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:25:21,837 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2020-07-08 12:25:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:22,048 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-08 12:25:22,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:25:22,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-08 12:25:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:25:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2020-07-08 12:25:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:25:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2020-07-08 12:25:22,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2020-07-08 12:25:22,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:22,112 INFO L225 Difference]: With dead ends: 40 [2020-07-08 12:25:22,112 INFO L226 Difference]: Without dead ends: 28 [2020-07-08 12:25:22,113 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:25:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-08 12:25:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-08 12:25:22,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:22,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-08 12:25:22,136 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-08 12:25:22,136 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-08 12:25:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:22,138 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-08 12:25:22,138 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 12:25:22,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:22,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:22,139 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-08 12:25:22,139 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-08 12:25:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:22,143 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-08 12:25:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 12:25:22,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:22,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:22,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:22,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:25:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-08 12:25:22,149 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2020-07-08 12:25:22,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:22,149 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-08 12:25:22,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:25:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-08 12:25:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:25:22,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:22,151 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:22,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:22,352 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1523652947, now seen corresponding path program 4 times [2020-07-08 12:25:22,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:22,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833982151] [2020-07-08 12:25:22,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:22,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {961#true} is VALID [2020-07-08 12:25:22,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-08 12:25:22,530 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {961#true} {961#true} #53#return; {961#true} is VALID [2020-07-08 12:25:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:22,536 INFO L280 TraceCheckUtils]: 0: Hoare triple {961#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {961#true} is VALID [2020-07-08 12:25:22,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-08 12:25:22,537 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {961#true} {962#false} #57#return; {962#false} is VALID [2020-07-08 12:25:22,538 INFO L263 TraceCheckUtils]: 0: Hoare triple {961#true} call ULTIMATE.init(); {974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:22,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {961#true} is VALID [2020-07-08 12:25:22,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-08 12:25:22,539 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {961#true} {961#true} #53#return; {961#true} is VALID [2020-07-08 12:25:22,539 INFO L263 TraceCheckUtils]: 4: Hoare triple {961#true} call #t~ret9 := main(); {961#true} is VALID [2020-07-08 12:25:22,540 INFO L280 TraceCheckUtils]: 5: Hoare triple {961#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {966#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:22,540 INFO L280 TraceCheckUtils]: 6: Hoare triple {966#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {966#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:22,541 INFO L280 TraceCheckUtils]: 7: Hoare triple {966#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {967#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:22,542 INFO L280 TraceCheckUtils]: 8: Hoare triple {967#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {967#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:22,542 INFO L280 TraceCheckUtils]: 9: Hoare triple {967#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {968#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:22,543 INFO L280 TraceCheckUtils]: 10: Hoare triple {968#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {968#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:22,544 INFO L280 TraceCheckUtils]: 11: Hoare triple {968#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {969#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:22,544 INFO L280 TraceCheckUtils]: 12: Hoare triple {969#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {969#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:22,545 INFO L280 TraceCheckUtils]: 13: Hoare triple {969#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {970#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:22,546 INFO L280 TraceCheckUtils]: 14: Hoare triple {970#(<= main_~j~0 4)} assume !(~j~0 < 20); {962#false} is VALID [2020-07-08 12:25:22,546 INFO L280 TraceCheckUtils]: 15: Hoare triple {962#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {962#false} is VALID [2020-07-08 12:25:22,546 INFO L280 TraceCheckUtils]: 16: Hoare triple {962#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {962#false} is VALID [2020-07-08 12:25:22,547 INFO L280 TraceCheckUtils]: 17: Hoare triple {962#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {962#false} is VALID [2020-07-08 12:25:22,547 INFO L280 TraceCheckUtils]: 18: Hoare triple {962#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {962#false} is VALID [2020-07-08 12:25:22,547 INFO L263 TraceCheckUtils]: 19: Hoare triple {962#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {961#true} is VALID [2020-07-08 12:25:22,547 INFO L280 TraceCheckUtils]: 20: Hoare triple {961#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {961#true} is VALID [2020-07-08 12:25:22,548 INFO L280 TraceCheckUtils]: 21: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-08 12:25:22,548 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {961#true} {962#false} #57#return; {962#false} is VALID [2020-07-08 12:25:22,548 INFO L280 TraceCheckUtils]: 23: Hoare triple {962#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {962#false} is VALID [2020-07-08 12:25:22,548 INFO L280 TraceCheckUtils]: 24: Hoare triple {962#false} assume 0 == #t~ret8;havoc #t~ret8; {962#false} is VALID [2020-07-08 12:25:22,549 INFO L280 TraceCheckUtils]: 25: Hoare triple {962#false} assume !false; {962#false} is VALID [2020-07-08 12:25:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:22,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833982151] [2020-07-08 12:25:22,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518693456] [2020-07-08 12:25:22,551 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:22,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-08 12:25:22,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:22,602 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-08 12:25:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:22,614 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:22,693 INFO L263 TraceCheckUtils]: 0: Hoare triple {961#true} call ULTIMATE.init(); {961#true} is VALID [2020-07-08 12:25:22,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {961#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {961#true} is VALID [2020-07-08 12:25:22,694 INFO L280 TraceCheckUtils]: 2: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-08 12:25:22,694 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {961#true} {961#true} #53#return; {961#true} is VALID [2020-07-08 12:25:22,694 INFO L263 TraceCheckUtils]: 4: Hoare triple {961#true} call #t~ret9 := main(); {961#true} is VALID [2020-07-08 12:25:22,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {961#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {993#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:22,696 INFO L280 TraceCheckUtils]: 6: Hoare triple {993#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {993#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:22,697 INFO L280 TraceCheckUtils]: 7: Hoare triple {993#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {967#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:22,698 INFO L280 TraceCheckUtils]: 8: Hoare triple {967#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {967#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:22,699 INFO L280 TraceCheckUtils]: 9: Hoare triple {967#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {968#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:22,700 INFO L280 TraceCheckUtils]: 10: Hoare triple {968#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {968#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:22,701 INFO L280 TraceCheckUtils]: 11: Hoare triple {968#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {969#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:22,702 INFO L280 TraceCheckUtils]: 12: Hoare triple {969#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {969#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:22,703 INFO L280 TraceCheckUtils]: 13: Hoare triple {969#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {970#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:22,704 INFO L280 TraceCheckUtils]: 14: Hoare triple {970#(<= main_~j~0 4)} assume !(~j~0 < 20); {962#false} is VALID [2020-07-08 12:25:22,704 INFO L280 TraceCheckUtils]: 15: Hoare triple {962#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {962#false} is VALID [2020-07-08 12:25:22,704 INFO L280 TraceCheckUtils]: 16: Hoare triple {962#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {962#false} is VALID [2020-07-08 12:25:22,704 INFO L280 TraceCheckUtils]: 17: Hoare triple {962#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {962#false} is VALID [2020-07-08 12:25:22,705 INFO L280 TraceCheckUtils]: 18: Hoare triple {962#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {962#false} is VALID [2020-07-08 12:25:22,705 INFO L263 TraceCheckUtils]: 19: Hoare triple {962#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {962#false} is VALID [2020-07-08 12:25:22,705 INFO L280 TraceCheckUtils]: 20: Hoare triple {962#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {962#false} is VALID [2020-07-08 12:25:22,705 INFO L280 TraceCheckUtils]: 21: Hoare triple {962#false} assume true; {962#false} is VALID [2020-07-08 12:25:22,706 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {962#false} {962#false} #57#return; {962#false} is VALID [2020-07-08 12:25:22,706 INFO L280 TraceCheckUtils]: 23: Hoare triple {962#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {962#false} is VALID [2020-07-08 12:25:22,706 INFO L280 TraceCheckUtils]: 24: Hoare triple {962#false} assume 0 == #t~ret8;havoc #t~ret8; {962#false} is VALID [2020-07-08 12:25:22,706 INFO L280 TraceCheckUtils]: 25: Hoare triple {962#false} assume !false; {962#false} is VALID [2020-07-08 12:25:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:22,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:22,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-08 12:25:22,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749572993] [2020-07-08 12:25:22,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-08 12:25:22,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:22,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:25:22,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:22,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:25:22,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:22,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:25:22,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:25:22,758 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-07-08 12:25:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:22,975 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2020-07-08 12:25:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:25:22,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-08 12:25:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:25:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-08 12:25:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:25:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-08 12:25:22,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2020-07-08 12:25:23,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:23,053 INFO L225 Difference]: With dead ends: 42 [2020-07-08 12:25:23,053 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:25:23,056 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:25:23,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:25:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-08 12:25:23,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:23,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-08 12:25:23,076 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-08 12:25:23,076 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-08 12:25:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:23,078 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-08 12:25:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-08 12:25:23,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:23,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:23,079 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-08 12:25:23,079 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-08 12:25:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:23,084 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-08 12:25:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-08 12:25:23,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:23,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:23,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:23,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-08 12:25:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-08 12:25:23,087 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2020-07-08 12:25:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:23,087 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-08 12:25:23,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:25:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-08 12:25:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:25:23,088 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:23,089 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:23,301 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:23,301 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:23,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:23,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1787714037, now seen corresponding path program 5 times [2020-07-08 12:25:23,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:23,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854754144] [2020-07-08 12:25:23,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:23,433 INFO L280 TraceCheckUtils]: 0: Hoare triple {1230#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1216#true} is VALID [2020-07-08 12:25:23,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-08 12:25:23,434 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1216#true} {1216#true} #53#return; {1216#true} is VALID [2020-07-08 12:25:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:23,439 INFO L280 TraceCheckUtils]: 0: Hoare triple {1216#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1216#true} is VALID [2020-07-08 12:25:23,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-08 12:25:23,440 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1216#true} {1217#false} #57#return; {1217#false} is VALID [2020-07-08 12:25:23,441 INFO L263 TraceCheckUtils]: 0: Hoare triple {1216#true} call ULTIMATE.init(); {1230#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:23,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {1230#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1216#true} is VALID [2020-07-08 12:25:23,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-08 12:25:23,442 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1216#true} {1216#true} #53#return; {1216#true} is VALID [2020-07-08 12:25:23,442 INFO L263 TraceCheckUtils]: 4: Hoare triple {1216#true} call #t~ret9 := main(); {1216#true} is VALID [2020-07-08 12:25:23,443 INFO L280 TraceCheckUtils]: 5: Hoare triple {1216#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1221#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:23,444 INFO L280 TraceCheckUtils]: 6: Hoare triple {1221#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1221#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:23,445 INFO L280 TraceCheckUtils]: 7: Hoare triple {1221#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1222#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:23,445 INFO L280 TraceCheckUtils]: 8: Hoare triple {1222#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1222#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:23,446 INFO L280 TraceCheckUtils]: 9: Hoare triple {1222#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1223#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:23,447 INFO L280 TraceCheckUtils]: 10: Hoare triple {1223#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1223#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:23,448 INFO L280 TraceCheckUtils]: 11: Hoare triple {1223#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1224#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:23,448 INFO L280 TraceCheckUtils]: 12: Hoare triple {1224#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1224#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:23,449 INFO L280 TraceCheckUtils]: 13: Hoare triple {1224#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1225#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:23,450 INFO L280 TraceCheckUtils]: 14: Hoare triple {1225#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1225#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:23,451 INFO L280 TraceCheckUtils]: 15: Hoare triple {1225#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1226#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:23,451 INFO L280 TraceCheckUtils]: 16: Hoare triple {1226#(<= main_~j~0 5)} assume !(~j~0 < 20); {1217#false} is VALID [2020-07-08 12:25:23,452 INFO L280 TraceCheckUtils]: 17: Hoare triple {1217#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1217#false} is VALID [2020-07-08 12:25:23,452 INFO L280 TraceCheckUtils]: 18: Hoare triple {1217#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1217#false} is VALID [2020-07-08 12:25:23,452 INFO L280 TraceCheckUtils]: 19: Hoare triple {1217#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1217#false} is VALID [2020-07-08 12:25:23,452 INFO L280 TraceCheckUtils]: 20: Hoare triple {1217#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1217#false} is VALID [2020-07-08 12:25:23,452 INFO L263 TraceCheckUtils]: 21: Hoare triple {1217#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1216#true} is VALID [2020-07-08 12:25:23,453 INFO L280 TraceCheckUtils]: 22: Hoare triple {1216#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1216#true} is VALID [2020-07-08 12:25:23,453 INFO L280 TraceCheckUtils]: 23: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-08 12:25:23,453 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1216#true} {1217#false} #57#return; {1217#false} is VALID [2020-07-08 12:25:23,453 INFO L280 TraceCheckUtils]: 25: Hoare triple {1217#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1217#false} is VALID [2020-07-08 12:25:23,454 INFO L280 TraceCheckUtils]: 26: Hoare triple {1217#false} assume 0 == #t~ret8;havoc #t~ret8; {1217#false} is VALID [2020-07-08 12:25:23,454 INFO L280 TraceCheckUtils]: 27: Hoare triple {1217#false} assume !false; {1217#false} is VALID [2020-07-08 12:25:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:23,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854754144] [2020-07-08 12:25:23,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325904016] [2020-07-08 12:25:23,456 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:23,516 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-08 12:25:23,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:23,518 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:25:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:23,530 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:23,620 INFO L263 TraceCheckUtils]: 0: Hoare triple {1216#true} call ULTIMATE.init(); {1216#true} is VALID [2020-07-08 12:25:23,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1216#true} is VALID [2020-07-08 12:25:23,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-08 12:25:23,621 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1216#true} {1216#true} #53#return; {1216#true} is VALID [2020-07-08 12:25:23,621 INFO L263 TraceCheckUtils]: 4: Hoare triple {1216#true} call #t~ret9 := main(); {1216#true} is VALID [2020-07-08 12:25:23,622 INFO L280 TraceCheckUtils]: 5: Hoare triple {1216#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1249#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:23,623 INFO L280 TraceCheckUtils]: 6: Hoare triple {1249#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1249#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:23,624 INFO L280 TraceCheckUtils]: 7: Hoare triple {1249#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1222#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:23,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {1222#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1222#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:23,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {1222#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1223#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:23,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {1223#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1223#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:23,626 INFO L280 TraceCheckUtils]: 11: Hoare triple {1223#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1224#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:23,626 INFO L280 TraceCheckUtils]: 12: Hoare triple {1224#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1224#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:23,627 INFO L280 TraceCheckUtils]: 13: Hoare triple {1224#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1225#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:23,629 INFO L280 TraceCheckUtils]: 14: Hoare triple {1225#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1225#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:23,630 INFO L280 TraceCheckUtils]: 15: Hoare triple {1225#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1226#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:23,634 INFO L280 TraceCheckUtils]: 16: Hoare triple {1226#(<= main_~j~0 5)} assume !(~j~0 < 20); {1217#false} is VALID [2020-07-08 12:25:23,634 INFO L280 TraceCheckUtils]: 17: Hoare triple {1217#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1217#false} is VALID [2020-07-08 12:25:23,635 INFO L280 TraceCheckUtils]: 18: Hoare triple {1217#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1217#false} is VALID [2020-07-08 12:25:23,635 INFO L280 TraceCheckUtils]: 19: Hoare triple {1217#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1217#false} is VALID [2020-07-08 12:25:23,635 INFO L280 TraceCheckUtils]: 20: Hoare triple {1217#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1217#false} is VALID [2020-07-08 12:25:23,635 INFO L263 TraceCheckUtils]: 21: Hoare triple {1217#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1217#false} is VALID [2020-07-08 12:25:23,635 INFO L280 TraceCheckUtils]: 22: Hoare triple {1217#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1217#false} is VALID [2020-07-08 12:25:23,636 INFO L280 TraceCheckUtils]: 23: Hoare triple {1217#false} assume true; {1217#false} is VALID [2020-07-08 12:25:23,636 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1217#false} {1217#false} #57#return; {1217#false} is VALID [2020-07-08 12:25:23,636 INFO L280 TraceCheckUtils]: 25: Hoare triple {1217#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1217#false} is VALID [2020-07-08 12:25:23,637 INFO L280 TraceCheckUtils]: 26: Hoare triple {1217#false} assume 0 == #t~ret8;havoc #t~ret8; {1217#false} is VALID [2020-07-08 12:25:23,638 INFO L280 TraceCheckUtils]: 27: Hoare triple {1217#false} assume !false; {1217#false} is VALID [2020-07-08 12:25:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:23,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:23,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-07-08 12:25:23,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660938099] [2020-07-08 12:25:23,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-08 12:25:23,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:23,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:25:23,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:23,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:25:23,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:23,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:25:23,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:25:23,697 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 10 states. [2020-07-08 12:25:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:23,927 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-08 12:25:23,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:25:23,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-08 12:25:23,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:25:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2020-07-08 12:25:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:25:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2020-07-08 12:25:23,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2020-07-08 12:25:23,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:23,986 INFO L225 Difference]: With dead ends: 44 [2020-07-08 12:25:23,986 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 12:25:23,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:25:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 12:25:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-07-08 12:25:24,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:24,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2020-07-08 12:25:24,002 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2020-07-08 12:25:24,002 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2020-07-08 12:25:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:24,003 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-08 12:25:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-08 12:25:24,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:24,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:24,004 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2020-07-08 12:25:24,004 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2020-07-08 12:25:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:24,007 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-08 12:25:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-08 12:25:24,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:24,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:24,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:24,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-08 12:25:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-07-08 12:25:24,010 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2020-07-08 12:25:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:24,010 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-07-08 12:25:24,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:25:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-08 12:25:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 12:25:24,016 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:24,016 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:24,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-08 12:25:24,223 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:24,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2147351063, now seen corresponding path program 6 times [2020-07-08 12:25:24,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:24,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874242066] [2020-07-08 12:25:24,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:24,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {1503#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1488#true} is VALID [2020-07-08 12:25:24,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-08 12:25:24,346 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1488#true} {1488#true} #53#return; {1488#true} is VALID [2020-07-08 12:25:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:24,351 INFO L280 TraceCheckUtils]: 0: Hoare triple {1488#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1488#true} is VALID [2020-07-08 12:25:24,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-08 12:25:24,351 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1488#true} {1489#false} #57#return; {1489#false} is VALID [2020-07-08 12:25:24,352 INFO L263 TraceCheckUtils]: 0: Hoare triple {1488#true} call ULTIMATE.init(); {1503#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:24,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {1503#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1488#true} is VALID [2020-07-08 12:25:24,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-08 12:25:24,353 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1488#true} {1488#true} #53#return; {1488#true} is VALID [2020-07-08 12:25:24,353 INFO L263 TraceCheckUtils]: 4: Hoare triple {1488#true} call #t~ret9 := main(); {1488#true} is VALID [2020-07-08 12:25:24,354 INFO L280 TraceCheckUtils]: 5: Hoare triple {1488#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1493#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:24,355 INFO L280 TraceCheckUtils]: 6: Hoare triple {1493#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1493#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:24,355 INFO L280 TraceCheckUtils]: 7: Hoare triple {1493#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1494#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:24,356 INFO L280 TraceCheckUtils]: 8: Hoare triple {1494#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1494#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:24,357 INFO L280 TraceCheckUtils]: 9: Hoare triple {1494#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1495#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:24,358 INFO L280 TraceCheckUtils]: 10: Hoare triple {1495#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1495#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:24,359 INFO L280 TraceCheckUtils]: 11: Hoare triple {1495#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1496#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:24,359 INFO L280 TraceCheckUtils]: 12: Hoare triple {1496#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1496#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:24,360 INFO L280 TraceCheckUtils]: 13: Hoare triple {1496#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1497#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:24,361 INFO L280 TraceCheckUtils]: 14: Hoare triple {1497#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1497#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:24,361 INFO L280 TraceCheckUtils]: 15: Hoare triple {1497#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1498#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:24,362 INFO L280 TraceCheckUtils]: 16: Hoare triple {1498#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1498#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:24,363 INFO L280 TraceCheckUtils]: 17: Hoare triple {1498#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1499#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:24,363 INFO L280 TraceCheckUtils]: 18: Hoare triple {1499#(<= main_~j~0 6)} assume !(~j~0 < 20); {1489#false} is VALID [2020-07-08 12:25:24,364 INFO L280 TraceCheckUtils]: 19: Hoare triple {1489#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1489#false} is VALID [2020-07-08 12:25:24,364 INFO L280 TraceCheckUtils]: 20: Hoare triple {1489#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1489#false} is VALID [2020-07-08 12:25:24,364 INFO L280 TraceCheckUtils]: 21: Hoare triple {1489#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1489#false} is VALID [2020-07-08 12:25:24,364 INFO L280 TraceCheckUtils]: 22: Hoare triple {1489#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1489#false} is VALID [2020-07-08 12:25:24,364 INFO L263 TraceCheckUtils]: 23: Hoare triple {1489#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1488#true} is VALID [2020-07-08 12:25:24,365 INFO L280 TraceCheckUtils]: 24: Hoare triple {1488#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1488#true} is VALID [2020-07-08 12:25:24,365 INFO L280 TraceCheckUtils]: 25: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-08 12:25:24,365 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1488#true} {1489#false} #57#return; {1489#false} is VALID [2020-07-08 12:25:24,365 INFO L280 TraceCheckUtils]: 27: Hoare triple {1489#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1489#false} is VALID [2020-07-08 12:25:24,366 INFO L280 TraceCheckUtils]: 28: Hoare triple {1489#false} assume 0 == #t~ret8;havoc #t~ret8; {1489#false} is VALID [2020-07-08 12:25:24,366 INFO L280 TraceCheckUtils]: 29: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2020-07-08 12:25:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:24,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874242066] [2020-07-08 12:25:24,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448827034] [2020-07-08 12:25:24,368 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:24,486 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-08 12:25:24,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:24,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-08 12:25:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:24,503 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:24,603 INFO L263 TraceCheckUtils]: 0: Hoare triple {1488#true} call ULTIMATE.init(); {1488#true} is VALID [2020-07-08 12:25:24,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {1488#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1488#true} is VALID [2020-07-08 12:25:24,603 INFO L280 TraceCheckUtils]: 2: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-08 12:25:24,603 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1488#true} {1488#true} #53#return; {1488#true} is VALID [2020-07-08 12:25:24,604 INFO L263 TraceCheckUtils]: 4: Hoare triple {1488#true} call #t~ret9 := main(); {1488#true} is VALID [2020-07-08 12:25:24,605 INFO L280 TraceCheckUtils]: 5: Hoare triple {1488#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1522#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:24,605 INFO L280 TraceCheckUtils]: 6: Hoare triple {1522#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1522#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:24,606 INFO L280 TraceCheckUtils]: 7: Hoare triple {1522#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1494#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:24,606 INFO L280 TraceCheckUtils]: 8: Hoare triple {1494#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1494#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:24,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {1494#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1495#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:24,607 INFO L280 TraceCheckUtils]: 10: Hoare triple {1495#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1495#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:24,609 INFO L280 TraceCheckUtils]: 11: Hoare triple {1495#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1496#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:24,610 INFO L280 TraceCheckUtils]: 12: Hoare triple {1496#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1496#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:24,612 INFO L280 TraceCheckUtils]: 13: Hoare triple {1496#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1497#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:24,614 INFO L280 TraceCheckUtils]: 14: Hoare triple {1497#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1497#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:24,616 INFO L280 TraceCheckUtils]: 15: Hoare triple {1497#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1498#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:24,617 INFO L280 TraceCheckUtils]: 16: Hoare triple {1498#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1498#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:24,618 INFO L280 TraceCheckUtils]: 17: Hoare triple {1498#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1499#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:24,618 INFO L280 TraceCheckUtils]: 18: Hoare triple {1499#(<= main_~j~0 6)} assume !(~j~0 < 20); {1489#false} is VALID [2020-07-08 12:25:24,619 INFO L280 TraceCheckUtils]: 19: Hoare triple {1489#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1489#false} is VALID [2020-07-08 12:25:24,619 INFO L280 TraceCheckUtils]: 20: Hoare triple {1489#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1489#false} is VALID [2020-07-08 12:25:24,619 INFO L280 TraceCheckUtils]: 21: Hoare triple {1489#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1489#false} is VALID [2020-07-08 12:25:24,619 INFO L280 TraceCheckUtils]: 22: Hoare triple {1489#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1489#false} is VALID [2020-07-08 12:25:24,619 INFO L263 TraceCheckUtils]: 23: Hoare triple {1489#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1489#false} is VALID [2020-07-08 12:25:24,620 INFO L280 TraceCheckUtils]: 24: Hoare triple {1489#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1489#false} is VALID [2020-07-08 12:25:24,620 INFO L280 TraceCheckUtils]: 25: Hoare triple {1489#false} assume true; {1489#false} is VALID [2020-07-08 12:25:24,620 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1489#false} {1489#false} #57#return; {1489#false} is VALID [2020-07-08 12:25:24,620 INFO L280 TraceCheckUtils]: 27: Hoare triple {1489#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1489#false} is VALID [2020-07-08 12:25:24,620 INFO L280 TraceCheckUtils]: 28: Hoare triple {1489#false} assume 0 == #t~ret8;havoc #t~ret8; {1489#false} is VALID [2020-07-08 12:25:24,621 INFO L280 TraceCheckUtils]: 29: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2020-07-08 12:25:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:24,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:24,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-07-08 12:25:24,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821655294] [2020-07-08 12:25:24,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-08 12:25:24,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:24,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:25:24,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:24,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:25:24,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:24,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:25:24,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:25:24,694 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 11 states. [2020-07-08 12:25:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:24,946 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-07-08 12:25:24,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:25:24,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-08 12:25:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:25:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-08 12:25:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:25:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-08 12:25:24,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2020-07-08 12:25:25,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:25,010 INFO L225 Difference]: With dead ends: 46 [2020-07-08 12:25:25,010 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 12:25:25,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:25:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 12:25:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-08 12:25:25,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:25,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-08 12:25:25,037 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-08 12:25:25,037 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-08 12:25:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:25,040 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-08 12:25:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-08 12:25:25,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:25,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:25,041 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-08 12:25:25,041 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-08 12:25:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:25,043 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-08 12:25:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-08 12:25:25,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:25,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:25,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:25,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 12:25:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-08 12:25:25,045 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2020-07-08 12:25:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:25,046 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-08 12:25:25,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:25:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-08 12:25:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-08 12:25:25,046 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:25,046 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:25,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:25,258 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash -133817927, now seen corresponding path program 7 times [2020-07-08 12:25:25,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:25,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485159699] [2020-07-08 12:25:25,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:25,418 INFO L280 TraceCheckUtils]: 0: Hoare triple {1793#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2020-07-08 12:25:25,418 INFO L280 TraceCheckUtils]: 1: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-08 12:25:25,419 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1777#true} {1777#true} #53#return; {1777#true} is VALID [2020-07-08 12:25:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:25,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {1777#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1777#true} is VALID [2020-07-08 12:25:25,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-08 12:25:25,430 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1777#true} {1778#false} #57#return; {1778#false} is VALID [2020-07-08 12:25:25,434 INFO L263 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1793#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:25,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {1793#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2020-07-08 12:25:25,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-08 12:25:25,435 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #53#return; {1777#true} is VALID [2020-07-08 12:25:25,435 INFO L263 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret9 := main(); {1777#true} is VALID [2020-07-08 12:25:25,437 INFO L280 TraceCheckUtils]: 5: Hoare triple {1777#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1782#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:25,437 INFO L280 TraceCheckUtils]: 6: Hoare triple {1782#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1782#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:25,438 INFO L280 TraceCheckUtils]: 7: Hoare triple {1782#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1783#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:25,438 INFO L280 TraceCheckUtils]: 8: Hoare triple {1783#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1783#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:25,439 INFO L280 TraceCheckUtils]: 9: Hoare triple {1783#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1784#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:25,440 INFO L280 TraceCheckUtils]: 10: Hoare triple {1784#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1784#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:25,441 INFO L280 TraceCheckUtils]: 11: Hoare triple {1784#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1785#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:25,441 INFO L280 TraceCheckUtils]: 12: Hoare triple {1785#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1785#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:25,442 INFO L280 TraceCheckUtils]: 13: Hoare triple {1785#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1786#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:25,443 INFO L280 TraceCheckUtils]: 14: Hoare triple {1786#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1786#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:25,444 INFO L280 TraceCheckUtils]: 15: Hoare triple {1786#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1787#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:25,444 INFO L280 TraceCheckUtils]: 16: Hoare triple {1787#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1787#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:25,445 INFO L280 TraceCheckUtils]: 17: Hoare triple {1787#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1788#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:25,446 INFO L280 TraceCheckUtils]: 18: Hoare triple {1788#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1788#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:25,446 INFO L280 TraceCheckUtils]: 19: Hoare triple {1788#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1789#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:25,447 INFO L280 TraceCheckUtils]: 20: Hoare triple {1789#(<= main_~j~0 7)} assume !(~j~0 < 20); {1778#false} is VALID [2020-07-08 12:25:25,447 INFO L280 TraceCheckUtils]: 21: Hoare triple {1778#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1778#false} is VALID [2020-07-08 12:25:25,448 INFO L280 TraceCheckUtils]: 22: Hoare triple {1778#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1778#false} is VALID [2020-07-08 12:25:25,448 INFO L280 TraceCheckUtils]: 23: Hoare triple {1778#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1778#false} is VALID [2020-07-08 12:25:25,448 INFO L280 TraceCheckUtils]: 24: Hoare triple {1778#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1778#false} is VALID [2020-07-08 12:25:25,448 INFO L263 TraceCheckUtils]: 25: Hoare triple {1778#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1777#true} is VALID [2020-07-08 12:25:25,448 INFO L280 TraceCheckUtils]: 26: Hoare triple {1777#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1777#true} is VALID [2020-07-08 12:25:25,449 INFO L280 TraceCheckUtils]: 27: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-08 12:25:25,449 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1777#true} {1778#false} #57#return; {1778#false} is VALID [2020-07-08 12:25:25,449 INFO L280 TraceCheckUtils]: 29: Hoare triple {1778#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1778#false} is VALID [2020-07-08 12:25:25,453 INFO L280 TraceCheckUtils]: 30: Hoare triple {1778#false} assume 0 == #t~ret8;havoc #t~ret8; {1778#false} is VALID [2020-07-08 12:25:25,454 INFO L280 TraceCheckUtils]: 31: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2020-07-08 12:25:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:25,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485159699] [2020-07-08 12:25:25,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586683089] [2020-07-08 12:25:25,460 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:25,511 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-08 12:25:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:25,528 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:25,638 INFO L263 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1777#true} is VALID [2020-07-08 12:25:25,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {1777#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2020-07-08 12:25:25,639 INFO L280 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-08 12:25:25,639 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #53#return; {1777#true} is VALID [2020-07-08 12:25:25,639 INFO L263 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret9 := main(); {1777#true} is VALID [2020-07-08 12:25:25,640 INFO L280 TraceCheckUtils]: 5: Hoare triple {1777#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1812#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:25,641 INFO L280 TraceCheckUtils]: 6: Hoare triple {1812#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1812#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:25,642 INFO L280 TraceCheckUtils]: 7: Hoare triple {1812#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1783#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:25,642 INFO L280 TraceCheckUtils]: 8: Hoare triple {1783#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1783#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:25,643 INFO L280 TraceCheckUtils]: 9: Hoare triple {1783#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1784#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:25,644 INFO L280 TraceCheckUtils]: 10: Hoare triple {1784#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1784#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:25,645 INFO L280 TraceCheckUtils]: 11: Hoare triple {1784#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1785#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:25,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {1785#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1785#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:25,646 INFO L280 TraceCheckUtils]: 13: Hoare triple {1785#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1786#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:25,647 INFO L280 TraceCheckUtils]: 14: Hoare triple {1786#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1786#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:25,647 INFO L280 TraceCheckUtils]: 15: Hoare triple {1786#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1787#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:25,648 INFO L280 TraceCheckUtils]: 16: Hoare triple {1787#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1787#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:25,648 INFO L280 TraceCheckUtils]: 17: Hoare triple {1787#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1788#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:25,649 INFO L280 TraceCheckUtils]: 18: Hoare triple {1788#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1788#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:25,649 INFO L280 TraceCheckUtils]: 19: Hoare triple {1788#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1789#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:25,650 INFO L280 TraceCheckUtils]: 20: Hoare triple {1789#(<= main_~j~0 7)} assume !(~j~0 < 20); {1778#false} is VALID [2020-07-08 12:25:25,650 INFO L280 TraceCheckUtils]: 21: Hoare triple {1778#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1778#false} is VALID [2020-07-08 12:25:25,651 INFO L280 TraceCheckUtils]: 22: Hoare triple {1778#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1778#false} is VALID [2020-07-08 12:25:25,651 INFO L280 TraceCheckUtils]: 23: Hoare triple {1778#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1778#false} is VALID [2020-07-08 12:25:25,651 INFO L280 TraceCheckUtils]: 24: Hoare triple {1778#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1778#false} is VALID [2020-07-08 12:25:25,651 INFO L263 TraceCheckUtils]: 25: Hoare triple {1778#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1778#false} is VALID [2020-07-08 12:25:25,652 INFO L280 TraceCheckUtils]: 26: Hoare triple {1778#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1778#false} is VALID [2020-07-08 12:25:25,652 INFO L280 TraceCheckUtils]: 27: Hoare triple {1778#false} assume true; {1778#false} is VALID [2020-07-08 12:25:25,652 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1778#false} {1778#false} #57#return; {1778#false} is VALID [2020-07-08 12:25:25,652 INFO L280 TraceCheckUtils]: 29: Hoare triple {1778#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1778#false} is VALID [2020-07-08 12:25:25,652 INFO L280 TraceCheckUtils]: 30: Hoare triple {1778#false} assume 0 == #t~ret8;havoc #t~ret8; {1778#false} is VALID [2020-07-08 12:25:25,653 INFO L280 TraceCheckUtils]: 31: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2020-07-08 12:25:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:25,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:25,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2020-07-08 12:25:25,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466834831] [2020-07-08 12:25:25,655 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-08 12:25:25,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:25,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 12:25:25,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:25,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 12:25:25,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:25,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 12:25:25,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:25:25,701 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 12 states. [2020-07-08 12:25:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:26,020 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2020-07-08 12:25:26,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:25:26,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-08 12:25:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 12:25:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-08 12:25:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 12:25:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-08 12:25:26,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2020-07-08 12:25:26,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:26,089 INFO L225 Difference]: With dead ends: 48 [2020-07-08 12:25:26,090 INFO L226 Difference]: Without dead ends: 36 [2020-07-08 12:25:26,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:25:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-08 12:25:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-08 12:25:26,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:26,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-08 12:25:26,115 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-08 12:25:26,116 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-08 12:25:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:26,118 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-08 12:25:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-08 12:25:26,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:26,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:26,119 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-08 12:25:26,119 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-08 12:25:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:26,121 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-08 12:25:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-08 12:25:26,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:26,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:26,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:26,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 12:25:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-07-08 12:25:26,123 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2020-07-08 12:25:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:26,124 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-07-08 12:25:26,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 12:25:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-08 12:25:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 12:25:26,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:26,125 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:26,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:26,339 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:26,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1903896357, now seen corresponding path program 8 times [2020-07-08 12:25:26,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:26,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315373199] [2020-07-08 12:25:26,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:26,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {2100#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2083#true} is VALID [2020-07-08 12:25:26,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-08 12:25:26,515 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2083#true} {2083#true} #53#return; {2083#true} is VALID [2020-07-08 12:25:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:26,518 INFO L280 TraceCheckUtils]: 0: Hoare triple {2083#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2083#true} is VALID [2020-07-08 12:25:26,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-08 12:25:26,519 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2083#true} {2084#false} #57#return; {2084#false} is VALID [2020-07-08 12:25:26,519 INFO L263 TraceCheckUtils]: 0: Hoare triple {2083#true} call ULTIMATE.init(); {2100#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:26,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {2100#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2083#true} is VALID [2020-07-08 12:25:26,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-08 12:25:26,520 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2083#true} {2083#true} #53#return; {2083#true} is VALID [2020-07-08 12:25:26,520 INFO L263 TraceCheckUtils]: 4: Hoare triple {2083#true} call #t~ret9 := main(); {2083#true} is VALID [2020-07-08 12:25:26,521 INFO L280 TraceCheckUtils]: 5: Hoare triple {2083#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2088#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:26,521 INFO L280 TraceCheckUtils]: 6: Hoare triple {2088#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2088#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:26,522 INFO L280 TraceCheckUtils]: 7: Hoare triple {2088#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2089#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:26,522 INFO L280 TraceCheckUtils]: 8: Hoare triple {2089#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2089#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:26,523 INFO L280 TraceCheckUtils]: 9: Hoare triple {2089#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2090#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:26,523 INFO L280 TraceCheckUtils]: 10: Hoare triple {2090#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2090#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:26,523 INFO L280 TraceCheckUtils]: 11: Hoare triple {2090#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2091#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:26,524 INFO L280 TraceCheckUtils]: 12: Hoare triple {2091#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2091#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:26,524 INFO L280 TraceCheckUtils]: 13: Hoare triple {2091#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2092#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:26,525 INFO L280 TraceCheckUtils]: 14: Hoare triple {2092#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2092#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:26,525 INFO L280 TraceCheckUtils]: 15: Hoare triple {2092#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2093#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:26,526 INFO L280 TraceCheckUtils]: 16: Hoare triple {2093#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2093#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:26,526 INFO L280 TraceCheckUtils]: 17: Hoare triple {2093#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2094#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:26,527 INFO L280 TraceCheckUtils]: 18: Hoare triple {2094#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2094#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:26,527 INFO L280 TraceCheckUtils]: 19: Hoare triple {2094#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2095#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:26,528 INFO L280 TraceCheckUtils]: 20: Hoare triple {2095#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2095#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:26,528 INFO L280 TraceCheckUtils]: 21: Hoare triple {2095#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2096#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:26,529 INFO L280 TraceCheckUtils]: 22: Hoare triple {2096#(<= main_~j~0 8)} assume !(~j~0 < 20); {2084#false} is VALID [2020-07-08 12:25:26,529 INFO L280 TraceCheckUtils]: 23: Hoare triple {2084#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2084#false} is VALID [2020-07-08 12:25:26,529 INFO L280 TraceCheckUtils]: 24: Hoare triple {2084#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2084#false} is VALID [2020-07-08 12:25:26,529 INFO L280 TraceCheckUtils]: 25: Hoare triple {2084#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2084#false} is VALID [2020-07-08 12:25:26,529 INFO L280 TraceCheckUtils]: 26: Hoare triple {2084#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2084#false} is VALID [2020-07-08 12:25:26,529 INFO L263 TraceCheckUtils]: 27: Hoare triple {2084#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2083#true} is VALID [2020-07-08 12:25:26,529 INFO L280 TraceCheckUtils]: 28: Hoare triple {2083#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2083#true} is VALID [2020-07-08 12:25:26,530 INFO L280 TraceCheckUtils]: 29: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-08 12:25:26,530 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2083#true} {2084#false} #57#return; {2084#false} is VALID [2020-07-08 12:25:26,530 INFO L280 TraceCheckUtils]: 31: Hoare triple {2084#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2084#false} is VALID [2020-07-08 12:25:26,530 INFO L280 TraceCheckUtils]: 32: Hoare triple {2084#false} assume 0 == #t~ret8;havoc #t~ret8; {2084#false} is VALID [2020-07-08 12:25:26,530 INFO L280 TraceCheckUtils]: 33: Hoare triple {2084#false} assume !false; {2084#false} is VALID [2020-07-08 12:25:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:26,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315373199] [2020-07-08 12:25:26,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271138863] [2020-07-08 12:25:26,532 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:26,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:25:26,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:26,574 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-08 12:25:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:26,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:26,694 INFO L263 TraceCheckUtils]: 0: Hoare triple {2083#true} call ULTIMATE.init(); {2083#true} is VALID [2020-07-08 12:25:26,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {2083#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2083#true} is VALID [2020-07-08 12:25:26,694 INFO L280 TraceCheckUtils]: 2: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-08 12:25:26,695 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2083#true} {2083#true} #53#return; {2083#true} is VALID [2020-07-08 12:25:26,695 INFO L263 TraceCheckUtils]: 4: Hoare triple {2083#true} call #t~ret9 := main(); {2083#true} is VALID [2020-07-08 12:25:26,696 INFO L280 TraceCheckUtils]: 5: Hoare triple {2083#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2119#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:26,697 INFO L280 TraceCheckUtils]: 6: Hoare triple {2119#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2119#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:26,698 INFO L280 TraceCheckUtils]: 7: Hoare triple {2119#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2089#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:26,698 INFO L280 TraceCheckUtils]: 8: Hoare triple {2089#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2089#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:26,699 INFO L280 TraceCheckUtils]: 9: Hoare triple {2089#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2090#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:26,699 INFO L280 TraceCheckUtils]: 10: Hoare triple {2090#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2090#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:26,700 INFO L280 TraceCheckUtils]: 11: Hoare triple {2090#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2091#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:26,700 INFO L280 TraceCheckUtils]: 12: Hoare triple {2091#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2091#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:26,701 INFO L280 TraceCheckUtils]: 13: Hoare triple {2091#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2092#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:26,701 INFO L280 TraceCheckUtils]: 14: Hoare triple {2092#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2092#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:26,702 INFO L280 TraceCheckUtils]: 15: Hoare triple {2092#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2093#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:26,702 INFO L280 TraceCheckUtils]: 16: Hoare triple {2093#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2093#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:26,703 INFO L280 TraceCheckUtils]: 17: Hoare triple {2093#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2094#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:26,704 INFO L280 TraceCheckUtils]: 18: Hoare triple {2094#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2094#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:26,707 INFO L280 TraceCheckUtils]: 19: Hoare triple {2094#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2095#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:26,715 INFO L280 TraceCheckUtils]: 20: Hoare triple {2095#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2095#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:26,716 INFO L280 TraceCheckUtils]: 21: Hoare triple {2095#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2096#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:26,717 INFO L280 TraceCheckUtils]: 22: Hoare triple {2096#(<= main_~j~0 8)} assume !(~j~0 < 20); {2084#false} is VALID [2020-07-08 12:25:26,717 INFO L280 TraceCheckUtils]: 23: Hoare triple {2084#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2084#false} is VALID [2020-07-08 12:25:26,717 INFO L280 TraceCheckUtils]: 24: Hoare triple {2084#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2084#false} is VALID [2020-07-08 12:25:26,717 INFO L280 TraceCheckUtils]: 25: Hoare triple {2084#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2084#false} is VALID [2020-07-08 12:25:26,717 INFO L280 TraceCheckUtils]: 26: Hoare triple {2084#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2084#false} is VALID [2020-07-08 12:25:26,718 INFO L263 TraceCheckUtils]: 27: Hoare triple {2084#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2084#false} is VALID [2020-07-08 12:25:26,718 INFO L280 TraceCheckUtils]: 28: Hoare triple {2084#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2084#false} is VALID [2020-07-08 12:25:26,718 INFO L280 TraceCheckUtils]: 29: Hoare triple {2084#false} assume true; {2084#false} is VALID [2020-07-08 12:25:26,718 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2084#false} {2084#false} #57#return; {2084#false} is VALID [2020-07-08 12:25:26,718 INFO L280 TraceCheckUtils]: 31: Hoare triple {2084#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2084#false} is VALID [2020-07-08 12:25:26,718 INFO L280 TraceCheckUtils]: 32: Hoare triple {2084#false} assume 0 == #t~ret8;havoc #t~ret8; {2084#false} is VALID [2020-07-08 12:25:26,718 INFO L280 TraceCheckUtils]: 33: Hoare triple {2084#false} assume !false; {2084#false} is VALID [2020-07-08 12:25:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:26,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:26,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2020-07-08 12:25:26,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519897509] [2020-07-08 12:25:26,720 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-07-08 12:25:26,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:26,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 12:25:26,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:26,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 12:25:26,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 12:25:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:25:26,777 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2020-07-08 12:25:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:26,939 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2020-07-08 12:25:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 12:25:26,940 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-07-08 12:25:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:25:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-08 12:25:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:25:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-08 12:25:26,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2020-07-08 12:25:27,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:27,008 INFO L225 Difference]: With dead ends: 50 [2020-07-08 12:25:27,008 INFO L226 Difference]: Without dead ends: 38 [2020-07-08 12:25:27,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:25:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-08 12:25:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-08 12:25:27,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:27,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2020-07-08 12:25:27,037 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2020-07-08 12:25:27,038 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2020-07-08 12:25:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:27,039 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-08 12:25:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-08 12:25:27,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:27,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:27,040 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2020-07-08 12:25:27,040 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2020-07-08 12:25:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:27,043 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-08 12:25:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-08 12:25:27,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:27,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:27,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:27,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 12:25:27,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-07-08 12:25:27,045 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2020-07-08 12:25:27,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:27,045 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-07-08 12:25:27,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 12:25:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-07-08 12:25:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-08 12:25:27,047 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:27,047 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:27,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-08 12:25:27,249 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:27,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2142218371, now seen corresponding path program 9 times [2020-07-08 12:25:27,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:27,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822810874] [2020-07-08 12:25:27,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:27,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {2424#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2406#true} is VALID [2020-07-08 12:25:27,428 INFO L280 TraceCheckUtils]: 1: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-08 12:25:27,429 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2406#true} {2406#true} #53#return; {2406#true} is VALID [2020-07-08 12:25:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:27,433 INFO L280 TraceCheckUtils]: 0: Hoare triple {2406#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2406#true} is VALID [2020-07-08 12:25:27,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-08 12:25:27,434 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2406#true} {2407#false} #57#return; {2407#false} is VALID [2020-07-08 12:25:27,436 INFO L263 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2424#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:27,436 INFO L280 TraceCheckUtils]: 1: Hoare triple {2424#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2406#true} is VALID [2020-07-08 12:25:27,437 INFO L280 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-08 12:25:27,437 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #53#return; {2406#true} is VALID [2020-07-08 12:25:27,437 INFO L263 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret9 := main(); {2406#true} is VALID [2020-07-08 12:25:27,439 INFO L280 TraceCheckUtils]: 5: Hoare triple {2406#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2411#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:27,439 INFO L280 TraceCheckUtils]: 6: Hoare triple {2411#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2411#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:27,441 INFO L280 TraceCheckUtils]: 7: Hoare triple {2411#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2412#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:27,441 INFO L280 TraceCheckUtils]: 8: Hoare triple {2412#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2412#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:27,443 INFO L280 TraceCheckUtils]: 9: Hoare triple {2412#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2413#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:27,443 INFO L280 TraceCheckUtils]: 10: Hoare triple {2413#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2413#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:27,445 INFO L280 TraceCheckUtils]: 11: Hoare triple {2413#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2414#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:27,446 INFO L280 TraceCheckUtils]: 12: Hoare triple {2414#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2414#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:27,447 INFO L280 TraceCheckUtils]: 13: Hoare triple {2414#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2415#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:27,447 INFO L280 TraceCheckUtils]: 14: Hoare triple {2415#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2415#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:27,448 INFO L280 TraceCheckUtils]: 15: Hoare triple {2415#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2416#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:27,449 INFO L280 TraceCheckUtils]: 16: Hoare triple {2416#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2416#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:27,450 INFO L280 TraceCheckUtils]: 17: Hoare triple {2416#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2417#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:27,451 INFO L280 TraceCheckUtils]: 18: Hoare triple {2417#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2417#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:27,452 INFO L280 TraceCheckUtils]: 19: Hoare triple {2417#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2418#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:27,453 INFO L280 TraceCheckUtils]: 20: Hoare triple {2418#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2418#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:27,453 INFO L280 TraceCheckUtils]: 21: Hoare triple {2418#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2419#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:27,454 INFO L280 TraceCheckUtils]: 22: Hoare triple {2419#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2419#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:27,455 INFO L280 TraceCheckUtils]: 23: Hoare triple {2419#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2420#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:27,456 INFO L280 TraceCheckUtils]: 24: Hoare triple {2420#(<= main_~j~0 9)} assume !(~j~0 < 20); {2407#false} is VALID [2020-07-08 12:25:27,456 INFO L280 TraceCheckUtils]: 25: Hoare triple {2407#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2407#false} is VALID [2020-07-08 12:25:27,456 INFO L280 TraceCheckUtils]: 26: Hoare triple {2407#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2407#false} is VALID [2020-07-08 12:25:27,456 INFO L280 TraceCheckUtils]: 27: Hoare triple {2407#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2407#false} is VALID [2020-07-08 12:25:27,457 INFO L280 TraceCheckUtils]: 28: Hoare triple {2407#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2407#false} is VALID [2020-07-08 12:25:27,457 INFO L263 TraceCheckUtils]: 29: Hoare triple {2407#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2406#true} is VALID [2020-07-08 12:25:27,457 INFO L280 TraceCheckUtils]: 30: Hoare triple {2406#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2406#true} is VALID [2020-07-08 12:25:27,457 INFO L280 TraceCheckUtils]: 31: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-08 12:25:27,458 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2406#true} {2407#false} #57#return; {2407#false} is VALID [2020-07-08 12:25:27,458 INFO L280 TraceCheckUtils]: 33: Hoare triple {2407#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2407#false} is VALID [2020-07-08 12:25:27,458 INFO L280 TraceCheckUtils]: 34: Hoare triple {2407#false} assume 0 == #t~ret8;havoc #t~ret8; {2407#false} is VALID [2020-07-08 12:25:27,458 INFO L280 TraceCheckUtils]: 35: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2020-07-08 12:25:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:27,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822810874] [2020-07-08 12:25:27,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179461074] [2020-07-08 12:25:27,462 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:27,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-07-08 12:25:27,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:27,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-08 12:25:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:27,773 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:27,869 INFO L263 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2406#true} is VALID [2020-07-08 12:25:27,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {2406#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2406#true} is VALID [2020-07-08 12:25:27,869 INFO L280 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-08 12:25:27,869 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #53#return; {2406#true} is VALID [2020-07-08 12:25:27,870 INFO L263 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret9 := main(); {2406#true} is VALID [2020-07-08 12:25:27,870 INFO L280 TraceCheckUtils]: 5: Hoare triple {2406#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2443#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:27,870 INFO L280 TraceCheckUtils]: 6: Hoare triple {2443#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2443#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:27,871 INFO L280 TraceCheckUtils]: 7: Hoare triple {2443#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2412#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:27,871 INFO L280 TraceCheckUtils]: 8: Hoare triple {2412#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2412#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:27,872 INFO L280 TraceCheckUtils]: 9: Hoare triple {2412#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2413#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:27,872 INFO L280 TraceCheckUtils]: 10: Hoare triple {2413#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2413#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:27,873 INFO L280 TraceCheckUtils]: 11: Hoare triple {2413#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2414#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:27,873 INFO L280 TraceCheckUtils]: 12: Hoare triple {2414#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2414#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:27,874 INFO L280 TraceCheckUtils]: 13: Hoare triple {2414#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2415#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:27,874 INFO L280 TraceCheckUtils]: 14: Hoare triple {2415#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2415#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:27,875 INFO L280 TraceCheckUtils]: 15: Hoare triple {2415#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2416#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:27,875 INFO L280 TraceCheckUtils]: 16: Hoare triple {2416#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2416#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:27,876 INFO L280 TraceCheckUtils]: 17: Hoare triple {2416#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2417#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:27,876 INFO L280 TraceCheckUtils]: 18: Hoare triple {2417#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2417#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:27,876 INFO L280 TraceCheckUtils]: 19: Hoare triple {2417#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2418#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:27,877 INFO L280 TraceCheckUtils]: 20: Hoare triple {2418#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2418#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:27,877 INFO L280 TraceCheckUtils]: 21: Hoare triple {2418#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2419#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:27,878 INFO L280 TraceCheckUtils]: 22: Hoare triple {2419#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2419#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:27,878 INFO L280 TraceCheckUtils]: 23: Hoare triple {2419#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2420#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:27,879 INFO L280 TraceCheckUtils]: 24: Hoare triple {2420#(<= main_~j~0 9)} assume !(~j~0 < 20); {2407#false} is VALID [2020-07-08 12:25:27,879 INFO L280 TraceCheckUtils]: 25: Hoare triple {2407#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2407#false} is VALID [2020-07-08 12:25:27,879 INFO L280 TraceCheckUtils]: 26: Hoare triple {2407#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2407#false} is VALID [2020-07-08 12:25:27,879 INFO L280 TraceCheckUtils]: 27: Hoare triple {2407#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2407#false} is VALID [2020-07-08 12:25:27,879 INFO L280 TraceCheckUtils]: 28: Hoare triple {2407#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2407#false} is VALID [2020-07-08 12:25:27,879 INFO L263 TraceCheckUtils]: 29: Hoare triple {2407#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2407#false} is VALID [2020-07-08 12:25:27,880 INFO L280 TraceCheckUtils]: 30: Hoare triple {2407#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2407#false} is VALID [2020-07-08 12:25:27,880 INFO L280 TraceCheckUtils]: 31: Hoare triple {2407#false} assume true; {2407#false} is VALID [2020-07-08 12:25:27,880 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2407#false} {2407#false} #57#return; {2407#false} is VALID [2020-07-08 12:25:27,880 INFO L280 TraceCheckUtils]: 33: Hoare triple {2407#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2407#false} is VALID [2020-07-08 12:25:27,880 INFO L280 TraceCheckUtils]: 34: Hoare triple {2407#false} assume 0 == #t~ret8;havoc #t~ret8; {2407#false} is VALID [2020-07-08 12:25:27,880 INFO L280 TraceCheckUtils]: 35: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2020-07-08 12:25:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:27,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:27,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2020-07-08 12:25:27,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123572576] [2020-07-08 12:25:27,883 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-08 12:25:27,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:27,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 12:25:27,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:27,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 12:25:27,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:27,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 12:25:27,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:25:27,945 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 14 states. [2020-07-08 12:25:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:28,173 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-08 12:25:28,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 12:25:28,174 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-08 12:25:28,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:25:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2020-07-08 12:25:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:25:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2020-07-08 12:25:28,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2020-07-08 12:25:28,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:28,250 INFO L225 Difference]: With dead ends: 52 [2020-07-08 12:25:28,250 INFO L226 Difference]: Without dead ends: 40 [2020-07-08 12:25:28,251 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:25:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-08 12:25:28,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-08 12:25:28,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:28,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-08 12:25:28,271 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-08 12:25:28,271 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-08 12:25:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:28,273 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-07-08 12:25:28,273 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-08 12:25:28,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:28,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:28,274 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-08 12:25:28,274 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-08 12:25:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:28,275 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-07-08 12:25:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-08 12:25:28,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:28,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:28,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:28,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-08 12:25:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-07-08 12:25:28,278 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-07-08 12:25:28,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:28,278 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-07-08 12:25:28,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 12:25:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-07-08 12:25:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 12:25:28,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:28,279 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:28,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:28,489 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:28,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:28,490 INFO L82 PathProgramCache]: Analyzing trace with hash 758560159, now seen corresponding path program 10 times [2020-07-08 12:25:28,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:28,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940842568] [2020-07-08 12:25:28,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:28,668 INFO L280 TraceCheckUtils]: 0: Hoare triple {2765#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2746#true} is VALID [2020-07-08 12:25:28,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-08 12:25:28,669 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2746#true} {2746#true} #53#return; {2746#true} is VALID [2020-07-08 12:25:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:28,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {2746#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2746#true} is VALID [2020-07-08 12:25:28,674 INFO L280 TraceCheckUtils]: 1: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-08 12:25:28,674 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2746#true} {2747#false} #57#return; {2747#false} is VALID [2020-07-08 12:25:28,676 INFO L263 TraceCheckUtils]: 0: Hoare triple {2746#true} call ULTIMATE.init(); {2765#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:28,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {2765#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2746#true} is VALID [2020-07-08 12:25:28,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-08 12:25:28,676 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2746#true} {2746#true} #53#return; {2746#true} is VALID [2020-07-08 12:25:28,677 INFO L263 TraceCheckUtils]: 4: Hoare triple {2746#true} call #t~ret9 := main(); {2746#true} is VALID [2020-07-08 12:25:28,678 INFO L280 TraceCheckUtils]: 5: Hoare triple {2746#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2751#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:28,678 INFO L280 TraceCheckUtils]: 6: Hoare triple {2751#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2751#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:28,679 INFO L280 TraceCheckUtils]: 7: Hoare triple {2751#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2752#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:28,679 INFO L280 TraceCheckUtils]: 8: Hoare triple {2752#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2752#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:28,680 INFO L280 TraceCheckUtils]: 9: Hoare triple {2752#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2753#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:28,681 INFO L280 TraceCheckUtils]: 10: Hoare triple {2753#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2753#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:28,681 INFO L280 TraceCheckUtils]: 11: Hoare triple {2753#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2754#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:28,682 INFO L280 TraceCheckUtils]: 12: Hoare triple {2754#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2754#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:28,683 INFO L280 TraceCheckUtils]: 13: Hoare triple {2754#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2755#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:28,683 INFO L280 TraceCheckUtils]: 14: Hoare triple {2755#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2755#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:28,684 INFO L280 TraceCheckUtils]: 15: Hoare triple {2755#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2756#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:28,685 INFO L280 TraceCheckUtils]: 16: Hoare triple {2756#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2756#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:28,686 INFO L280 TraceCheckUtils]: 17: Hoare triple {2756#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2757#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:28,686 INFO L280 TraceCheckUtils]: 18: Hoare triple {2757#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2757#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:28,687 INFO L280 TraceCheckUtils]: 19: Hoare triple {2757#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2758#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:28,688 INFO L280 TraceCheckUtils]: 20: Hoare triple {2758#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2758#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:28,688 INFO L280 TraceCheckUtils]: 21: Hoare triple {2758#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2759#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:28,689 INFO L280 TraceCheckUtils]: 22: Hoare triple {2759#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2759#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:28,690 INFO L280 TraceCheckUtils]: 23: Hoare triple {2759#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2760#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:28,690 INFO L280 TraceCheckUtils]: 24: Hoare triple {2760#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2760#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:28,691 INFO L280 TraceCheckUtils]: 25: Hoare triple {2760#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2761#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:28,692 INFO L280 TraceCheckUtils]: 26: Hoare triple {2761#(<= main_~j~0 10)} assume !(~j~0 < 20); {2747#false} is VALID [2020-07-08 12:25:28,692 INFO L280 TraceCheckUtils]: 27: Hoare triple {2747#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2747#false} is VALID [2020-07-08 12:25:28,692 INFO L280 TraceCheckUtils]: 28: Hoare triple {2747#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2747#false} is VALID [2020-07-08 12:25:28,693 INFO L280 TraceCheckUtils]: 29: Hoare triple {2747#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2747#false} is VALID [2020-07-08 12:25:28,693 INFO L280 TraceCheckUtils]: 30: Hoare triple {2747#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2747#false} is VALID [2020-07-08 12:25:28,693 INFO L263 TraceCheckUtils]: 31: Hoare triple {2747#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2746#true} is VALID [2020-07-08 12:25:28,693 INFO L280 TraceCheckUtils]: 32: Hoare triple {2746#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2746#true} is VALID [2020-07-08 12:25:28,693 INFO L280 TraceCheckUtils]: 33: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-08 12:25:28,694 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2746#true} {2747#false} #57#return; {2747#false} is VALID [2020-07-08 12:25:28,694 INFO L280 TraceCheckUtils]: 35: Hoare triple {2747#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2747#false} is VALID [2020-07-08 12:25:28,694 INFO L280 TraceCheckUtils]: 36: Hoare triple {2747#false} assume 0 == #t~ret8;havoc #t~ret8; {2747#false} is VALID [2020-07-08 12:25:28,694 INFO L280 TraceCheckUtils]: 37: Hoare triple {2747#false} assume !false; {2747#false} is VALID [2020-07-08 12:25:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:28,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940842568] [2020-07-08 12:25:28,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532341678] [2020-07-08 12:25:28,696 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:28,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-08 12:25:28,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:28,745 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-08 12:25:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:28,770 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:28,884 INFO L263 TraceCheckUtils]: 0: Hoare triple {2746#true} call ULTIMATE.init(); {2746#true} is VALID [2020-07-08 12:25:28,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {2746#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2746#true} is VALID [2020-07-08 12:25:28,885 INFO L280 TraceCheckUtils]: 2: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-08 12:25:28,885 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2746#true} {2746#true} #53#return; {2746#true} is VALID [2020-07-08 12:25:28,885 INFO L263 TraceCheckUtils]: 4: Hoare triple {2746#true} call #t~ret9 := main(); {2746#true} is VALID [2020-07-08 12:25:28,886 INFO L280 TraceCheckUtils]: 5: Hoare triple {2746#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2784#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:28,887 INFO L280 TraceCheckUtils]: 6: Hoare triple {2784#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2784#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:28,887 INFO L280 TraceCheckUtils]: 7: Hoare triple {2784#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2752#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:28,888 INFO L280 TraceCheckUtils]: 8: Hoare triple {2752#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2752#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:28,889 INFO L280 TraceCheckUtils]: 9: Hoare triple {2752#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2753#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:28,889 INFO L280 TraceCheckUtils]: 10: Hoare triple {2753#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2753#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:28,889 INFO L280 TraceCheckUtils]: 11: Hoare triple {2753#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2754#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:28,890 INFO L280 TraceCheckUtils]: 12: Hoare triple {2754#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2754#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:28,892 INFO L280 TraceCheckUtils]: 13: Hoare triple {2754#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2755#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:28,893 INFO L280 TraceCheckUtils]: 14: Hoare triple {2755#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2755#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:28,894 INFO L280 TraceCheckUtils]: 15: Hoare triple {2755#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2756#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:28,894 INFO L280 TraceCheckUtils]: 16: Hoare triple {2756#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2756#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:28,895 INFO L280 TraceCheckUtils]: 17: Hoare triple {2756#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2757#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:28,895 INFO L280 TraceCheckUtils]: 18: Hoare triple {2757#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2757#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:28,896 INFO L280 TraceCheckUtils]: 19: Hoare triple {2757#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2758#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:28,896 INFO L280 TraceCheckUtils]: 20: Hoare triple {2758#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2758#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:28,897 INFO L280 TraceCheckUtils]: 21: Hoare triple {2758#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2759#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:28,899 INFO L280 TraceCheckUtils]: 22: Hoare triple {2759#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2759#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:28,901 INFO L280 TraceCheckUtils]: 23: Hoare triple {2759#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2760#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:28,903 INFO L280 TraceCheckUtils]: 24: Hoare triple {2760#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2760#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:28,904 INFO L280 TraceCheckUtils]: 25: Hoare triple {2760#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2761#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:28,904 INFO L280 TraceCheckUtils]: 26: Hoare triple {2761#(<= main_~j~0 10)} assume !(~j~0 < 20); {2747#false} is VALID [2020-07-08 12:25:28,905 INFO L280 TraceCheckUtils]: 27: Hoare triple {2747#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2747#false} is VALID [2020-07-08 12:25:28,905 INFO L280 TraceCheckUtils]: 28: Hoare triple {2747#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2747#false} is VALID [2020-07-08 12:25:28,905 INFO L280 TraceCheckUtils]: 29: Hoare triple {2747#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2747#false} is VALID [2020-07-08 12:25:28,905 INFO L280 TraceCheckUtils]: 30: Hoare triple {2747#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2747#false} is VALID [2020-07-08 12:25:28,905 INFO L263 TraceCheckUtils]: 31: Hoare triple {2747#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2747#false} is VALID [2020-07-08 12:25:28,905 INFO L280 TraceCheckUtils]: 32: Hoare triple {2747#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2747#false} is VALID [2020-07-08 12:25:28,905 INFO L280 TraceCheckUtils]: 33: Hoare triple {2747#false} assume true; {2747#false} is VALID [2020-07-08 12:25:28,906 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2747#false} {2747#false} #57#return; {2747#false} is VALID [2020-07-08 12:25:28,906 INFO L280 TraceCheckUtils]: 35: Hoare triple {2747#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2747#false} is VALID [2020-07-08 12:25:28,906 INFO L280 TraceCheckUtils]: 36: Hoare triple {2747#false} assume 0 == #t~ret8;havoc #t~ret8; {2747#false} is VALID [2020-07-08 12:25:28,906 INFO L280 TraceCheckUtils]: 37: Hoare triple {2747#false} assume !false; {2747#false} is VALID [2020-07-08 12:25:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:28,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:28,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2020-07-08 12:25:28,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591794350] [2020-07-08 12:25:28,908 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2020-07-08 12:25:28,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:28,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 12:25:28,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:28,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 12:25:28,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:28,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 12:25:28,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2020-07-08 12:25:28,984 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 15 states. [2020-07-08 12:25:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:29,306 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-07-08 12:25:29,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 12:25:29,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2020-07-08 12:25:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:25:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-08 12:25:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:25:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-08 12:25:29,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2020-07-08 12:25:29,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:29,386 INFO L225 Difference]: With dead ends: 54 [2020-07-08 12:25:29,387 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 12:25:29,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2020-07-08 12:25:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 12:25:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-08 12:25:29,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:29,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2020-07-08 12:25:29,407 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2020-07-08 12:25:29,407 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2020-07-08 12:25:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:29,409 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-08 12:25:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-08 12:25:29,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:29,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:29,409 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2020-07-08 12:25:29,409 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2020-07-08 12:25:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:29,410 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-08 12:25:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-08 12:25:29,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:29,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:29,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:29,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-08 12:25:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2020-07-08 12:25:29,412 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2020-07-08 12:25:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:29,412 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2020-07-08 12:25:29,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 12:25:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-07-08 12:25:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 12:25:29,413 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:29,413 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:29,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:29,619 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:29,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:29,620 INFO L82 PathProgramCache]: Analyzing trace with hash 972952385, now seen corresponding path program 11 times [2020-07-08 12:25:29,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:29,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430141616] [2020-07-08 12:25:29,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:29,809 INFO L280 TraceCheckUtils]: 0: Hoare triple {3123#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3103#true} is VALID [2020-07-08 12:25:29,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-08 12:25:29,810 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3103#true} {3103#true} #53#return; {3103#true} is VALID [2020-07-08 12:25:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:29,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {3103#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3103#true} is VALID [2020-07-08 12:25:29,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-08 12:25:29,815 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3103#true} {3104#false} #57#return; {3104#false} is VALID [2020-07-08 12:25:29,817 INFO L263 TraceCheckUtils]: 0: Hoare triple {3103#true} call ULTIMATE.init(); {3123#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:29,817 INFO L280 TraceCheckUtils]: 1: Hoare triple {3123#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3103#true} is VALID [2020-07-08 12:25:29,817 INFO L280 TraceCheckUtils]: 2: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-08 12:25:29,818 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3103#true} {3103#true} #53#return; {3103#true} is VALID [2020-07-08 12:25:29,818 INFO L263 TraceCheckUtils]: 4: Hoare triple {3103#true} call #t~ret9 := main(); {3103#true} is VALID [2020-07-08 12:25:29,820 INFO L280 TraceCheckUtils]: 5: Hoare triple {3103#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3108#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:29,820 INFO L280 TraceCheckUtils]: 6: Hoare triple {3108#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3108#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:29,821 INFO L280 TraceCheckUtils]: 7: Hoare triple {3108#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3109#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:29,822 INFO L280 TraceCheckUtils]: 8: Hoare triple {3109#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3109#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:29,823 INFO L280 TraceCheckUtils]: 9: Hoare triple {3109#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3110#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:29,823 INFO L280 TraceCheckUtils]: 10: Hoare triple {3110#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3110#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:29,824 INFO L280 TraceCheckUtils]: 11: Hoare triple {3110#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3111#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:29,824 INFO L280 TraceCheckUtils]: 12: Hoare triple {3111#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3111#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:29,825 INFO L280 TraceCheckUtils]: 13: Hoare triple {3111#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3112#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:29,826 INFO L280 TraceCheckUtils]: 14: Hoare triple {3112#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3112#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:29,826 INFO L280 TraceCheckUtils]: 15: Hoare triple {3112#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3113#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:29,827 INFO L280 TraceCheckUtils]: 16: Hoare triple {3113#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3113#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:29,828 INFO L280 TraceCheckUtils]: 17: Hoare triple {3113#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3114#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:29,828 INFO L280 TraceCheckUtils]: 18: Hoare triple {3114#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3114#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:29,829 INFO L280 TraceCheckUtils]: 19: Hoare triple {3114#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3115#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:29,829 INFO L280 TraceCheckUtils]: 20: Hoare triple {3115#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3115#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:29,830 INFO L280 TraceCheckUtils]: 21: Hoare triple {3115#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3116#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:29,831 INFO L280 TraceCheckUtils]: 22: Hoare triple {3116#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3116#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:29,832 INFO L280 TraceCheckUtils]: 23: Hoare triple {3116#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3117#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:29,832 INFO L280 TraceCheckUtils]: 24: Hoare triple {3117#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3117#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:29,833 INFO L280 TraceCheckUtils]: 25: Hoare triple {3117#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3118#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:29,834 INFO L280 TraceCheckUtils]: 26: Hoare triple {3118#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3118#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:29,834 INFO L280 TraceCheckUtils]: 27: Hoare triple {3118#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3119#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:29,835 INFO L280 TraceCheckUtils]: 28: Hoare triple {3119#(<= main_~j~0 11)} assume !(~j~0 < 20); {3104#false} is VALID [2020-07-08 12:25:29,835 INFO L280 TraceCheckUtils]: 29: Hoare triple {3104#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3104#false} is VALID [2020-07-08 12:25:29,835 INFO L280 TraceCheckUtils]: 30: Hoare triple {3104#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3104#false} is VALID [2020-07-08 12:25:29,835 INFO L280 TraceCheckUtils]: 31: Hoare triple {3104#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3104#false} is VALID [2020-07-08 12:25:29,836 INFO L280 TraceCheckUtils]: 32: Hoare triple {3104#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3104#false} is VALID [2020-07-08 12:25:29,836 INFO L263 TraceCheckUtils]: 33: Hoare triple {3104#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3103#true} is VALID [2020-07-08 12:25:29,836 INFO L280 TraceCheckUtils]: 34: Hoare triple {3103#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3103#true} is VALID [2020-07-08 12:25:29,836 INFO L280 TraceCheckUtils]: 35: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-08 12:25:29,836 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3103#true} {3104#false} #57#return; {3104#false} is VALID [2020-07-08 12:25:29,837 INFO L280 TraceCheckUtils]: 37: Hoare triple {3104#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3104#false} is VALID [2020-07-08 12:25:29,837 INFO L280 TraceCheckUtils]: 38: Hoare triple {3104#false} assume 0 == #t~ret8;havoc #t~ret8; {3104#false} is VALID [2020-07-08 12:25:29,837 INFO L280 TraceCheckUtils]: 39: Hoare triple {3104#false} assume !false; {3104#false} is VALID [2020-07-08 12:25:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:29,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430141616] [2020-07-08 12:25:29,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35290338] [2020-07-08 12:25:29,839 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:30,205 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2020-07-08 12:25:30,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:30,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-08 12:25:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:30,223 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:30,342 INFO L263 TraceCheckUtils]: 0: Hoare triple {3103#true} call ULTIMATE.init(); {3103#true} is VALID [2020-07-08 12:25:30,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {3103#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3103#true} is VALID [2020-07-08 12:25:30,343 INFO L280 TraceCheckUtils]: 2: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-08 12:25:30,343 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3103#true} {3103#true} #53#return; {3103#true} is VALID [2020-07-08 12:25:30,343 INFO L263 TraceCheckUtils]: 4: Hoare triple {3103#true} call #t~ret9 := main(); {3103#true} is VALID [2020-07-08 12:25:30,344 INFO L280 TraceCheckUtils]: 5: Hoare triple {3103#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3142#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:30,345 INFO L280 TraceCheckUtils]: 6: Hoare triple {3142#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3142#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:30,345 INFO L280 TraceCheckUtils]: 7: Hoare triple {3142#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3109#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:30,346 INFO L280 TraceCheckUtils]: 8: Hoare triple {3109#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3109#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:30,347 INFO L280 TraceCheckUtils]: 9: Hoare triple {3109#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3110#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:30,347 INFO L280 TraceCheckUtils]: 10: Hoare triple {3110#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3110#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:30,348 INFO L280 TraceCheckUtils]: 11: Hoare triple {3110#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3111#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:30,349 INFO L280 TraceCheckUtils]: 12: Hoare triple {3111#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3111#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:30,349 INFO L280 TraceCheckUtils]: 13: Hoare triple {3111#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3112#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:30,350 INFO L280 TraceCheckUtils]: 14: Hoare triple {3112#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3112#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:30,350 INFO L280 TraceCheckUtils]: 15: Hoare triple {3112#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3113#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:30,351 INFO L280 TraceCheckUtils]: 16: Hoare triple {3113#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3113#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:30,352 INFO L280 TraceCheckUtils]: 17: Hoare triple {3113#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3114#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:30,352 INFO L280 TraceCheckUtils]: 18: Hoare triple {3114#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3114#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:30,353 INFO L280 TraceCheckUtils]: 19: Hoare triple {3114#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3115#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:30,353 INFO L280 TraceCheckUtils]: 20: Hoare triple {3115#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3115#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:30,354 INFO L280 TraceCheckUtils]: 21: Hoare triple {3115#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3116#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:30,355 INFO L280 TraceCheckUtils]: 22: Hoare triple {3116#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3116#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:30,355 INFO L280 TraceCheckUtils]: 23: Hoare triple {3116#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3117#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:30,356 INFO L280 TraceCheckUtils]: 24: Hoare triple {3117#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3117#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:30,356 INFO L280 TraceCheckUtils]: 25: Hoare triple {3117#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3118#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:30,357 INFO L280 TraceCheckUtils]: 26: Hoare triple {3118#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3118#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:30,357 INFO L280 TraceCheckUtils]: 27: Hoare triple {3118#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3119#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:30,358 INFO L280 TraceCheckUtils]: 28: Hoare triple {3119#(<= main_~j~0 11)} assume !(~j~0 < 20); {3104#false} is VALID [2020-07-08 12:25:30,358 INFO L280 TraceCheckUtils]: 29: Hoare triple {3104#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3104#false} is VALID [2020-07-08 12:25:30,358 INFO L280 TraceCheckUtils]: 30: Hoare triple {3104#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3104#false} is VALID [2020-07-08 12:25:30,358 INFO L280 TraceCheckUtils]: 31: Hoare triple {3104#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3104#false} is VALID [2020-07-08 12:25:30,358 INFO L280 TraceCheckUtils]: 32: Hoare triple {3104#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3104#false} is VALID [2020-07-08 12:25:30,358 INFO L263 TraceCheckUtils]: 33: Hoare triple {3104#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3104#false} is VALID [2020-07-08 12:25:30,358 INFO L280 TraceCheckUtils]: 34: Hoare triple {3104#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3104#false} is VALID [2020-07-08 12:25:30,359 INFO L280 TraceCheckUtils]: 35: Hoare triple {3104#false} assume true; {3104#false} is VALID [2020-07-08 12:25:30,359 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3104#false} {3104#false} #57#return; {3104#false} is VALID [2020-07-08 12:25:30,359 INFO L280 TraceCheckUtils]: 37: Hoare triple {3104#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3104#false} is VALID [2020-07-08 12:25:30,359 INFO L280 TraceCheckUtils]: 38: Hoare triple {3104#false} assume 0 == #t~ret8;havoc #t~ret8; {3104#false} is VALID [2020-07-08 12:25:30,359 INFO L280 TraceCheckUtils]: 39: Hoare triple {3104#false} assume !false; {3104#false} is VALID [2020-07-08 12:25:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:30,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:30,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2020-07-08 12:25:30,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473377356] [2020-07-08 12:25:30,362 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-08 12:25:30,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:30,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-08 12:25:30,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:30,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-08 12:25:30,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:30,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-08 12:25:30,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2020-07-08 12:25:30,427 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 16 states. [2020-07-08 12:25:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:30,819 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-07-08 12:25:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 12:25:30,820 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-08 12:25:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 12:25:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2020-07-08 12:25:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 12:25:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2020-07-08 12:25:30,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2020-07-08 12:25:30,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:30,905 INFO L225 Difference]: With dead ends: 56 [2020-07-08 12:25:30,905 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 12:25:30,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2020-07-08 12:25:30,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 12:25:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-08 12:25:30,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:30,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2020-07-08 12:25:30,929 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2020-07-08 12:25:30,929 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2020-07-08 12:25:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:30,931 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-08 12:25:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-08 12:25:30,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:30,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:30,931 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2020-07-08 12:25:30,932 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2020-07-08 12:25:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:30,933 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-08 12:25:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-08 12:25:30,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:30,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:30,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:30,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-08 12:25:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-07-08 12:25:30,934 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2020-07-08 12:25:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:30,935 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-07-08 12:25:30,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-08 12:25:30,935 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-08 12:25:30,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-08 12:25:30,935 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:30,936 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:31,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-08 12:25:31,144 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:31,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:31,145 INFO L82 PathProgramCache]: Analyzing trace with hash 845451363, now seen corresponding path program 12 times [2020-07-08 12:25:31,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:31,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612662802] [2020-07-08 12:25:31,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:31,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {3498#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3477#true} is VALID [2020-07-08 12:25:31,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-08 12:25:31,365 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3477#true} {3477#true} #53#return; {3477#true} is VALID [2020-07-08 12:25:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:31,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {3477#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3477#true} is VALID [2020-07-08 12:25:31,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-08 12:25:31,370 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3477#true} {3478#false} #57#return; {3478#false} is VALID [2020-07-08 12:25:31,371 INFO L263 TraceCheckUtils]: 0: Hoare triple {3477#true} call ULTIMATE.init(); {3498#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:31,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {3498#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3477#true} is VALID [2020-07-08 12:25:31,371 INFO L280 TraceCheckUtils]: 2: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-08 12:25:31,371 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3477#true} {3477#true} #53#return; {3477#true} is VALID [2020-07-08 12:25:31,371 INFO L263 TraceCheckUtils]: 4: Hoare triple {3477#true} call #t~ret9 := main(); {3477#true} is VALID [2020-07-08 12:25:31,375 INFO L280 TraceCheckUtils]: 5: Hoare triple {3477#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3482#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:31,376 INFO L280 TraceCheckUtils]: 6: Hoare triple {3482#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3482#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:31,377 INFO L280 TraceCheckUtils]: 7: Hoare triple {3482#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3483#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:31,377 INFO L280 TraceCheckUtils]: 8: Hoare triple {3483#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3483#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:31,378 INFO L280 TraceCheckUtils]: 9: Hoare triple {3483#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3484#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:31,378 INFO L280 TraceCheckUtils]: 10: Hoare triple {3484#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3484#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:31,379 INFO L280 TraceCheckUtils]: 11: Hoare triple {3484#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3485#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:31,380 INFO L280 TraceCheckUtils]: 12: Hoare triple {3485#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3485#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:31,380 INFO L280 TraceCheckUtils]: 13: Hoare triple {3485#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3486#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:31,381 INFO L280 TraceCheckUtils]: 14: Hoare triple {3486#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3486#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:31,382 INFO L280 TraceCheckUtils]: 15: Hoare triple {3486#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3487#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:31,382 INFO L280 TraceCheckUtils]: 16: Hoare triple {3487#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3487#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:31,383 INFO L280 TraceCheckUtils]: 17: Hoare triple {3487#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3488#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:31,383 INFO L280 TraceCheckUtils]: 18: Hoare triple {3488#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3488#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:31,384 INFO L280 TraceCheckUtils]: 19: Hoare triple {3488#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3489#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:31,384 INFO L280 TraceCheckUtils]: 20: Hoare triple {3489#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3489#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:31,385 INFO L280 TraceCheckUtils]: 21: Hoare triple {3489#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3490#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:31,385 INFO L280 TraceCheckUtils]: 22: Hoare triple {3490#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3490#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:31,386 INFO L280 TraceCheckUtils]: 23: Hoare triple {3490#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3491#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:31,387 INFO L280 TraceCheckUtils]: 24: Hoare triple {3491#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3491#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:31,387 INFO L280 TraceCheckUtils]: 25: Hoare triple {3491#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3492#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:31,388 INFO L280 TraceCheckUtils]: 26: Hoare triple {3492#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3492#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:31,389 INFO L280 TraceCheckUtils]: 27: Hoare triple {3492#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3493#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:31,389 INFO L280 TraceCheckUtils]: 28: Hoare triple {3493#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3493#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:31,390 INFO L280 TraceCheckUtils]: 29: Hoare triple {3493#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3494#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:31,390 INFO L280 TraceCheckUtils]: 30: Hoare triple {3494#(<= main_~j~0 12)} assume !(~j~0 < 20); {3478#false} is VALID [2020-07-08 12:25:31,390 INFO L280 TraceCheckUtils]: 31: Hoare triple {3478#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3478#false} is VALID [2020-07-08 12:25:31,391 INFO L280 TraceCheckUtils]: 32: Hoare triple {3478#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3478#false} is VALID [2020-07-08 12:25:31,391 INFO L280 TraceCheckUtils]: 33: Hoare triple {3478#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3478#false} is VALID [2020-07-08 12:25:31,391 INFO L280 TraceCheckUtils]: 34: Hoare triple {3478#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3478#false} is VALID [2020-07-08 12:25:31,391 INFO L263 TraceCheckUtils]: 35: Hoare triple {3478#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3477#true} is VALID [2020-07-08 12:25:31,391 INFO L280 TraceCheckUtils]: 36: Hoare triple {3477#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3477#true} is VALID [2020-07-08 12:25:31,392 INFO L280 TraceCheckUtils]: 37: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-08 12:25:31,392 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3477#true} {3478#false} #57#return; {3478#false} is VALID [2020-07-08 12:25:31,392 INFO L280 TraceCheckUtils]: 39: Hoare triple {3478#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3478#false} is VALID [2020-07-08 12:25:31,392 INFO L280 TraceCheckUtils]: 40: Hoare triple {3478#false} assume 0 == #t~ret8;havoc #t~ret8; {3478#false} is VALID [2020-07-08 12:25:31,392 INFO L280 TraceCheckUtils]: 41: Hoare triple {3478#false} assume !false; {3478#false} is VALID [2020-07-08 12:25:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:31,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612662802] [2020-07-08 12:25:31,395 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547126456] [2020-07-08 12:25:31,395 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:31,909 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2020-07-08 12:25:31,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:31,914 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-08 12:25:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:31,927 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:32,048 INFO L263 TraceCheckUtils]: 0: Hoare triple {3477#true} call ULTIMATE.init(); {3477#true} is VALID [2020-07-08 12:25:32,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {3477#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3477#true} is VALID [2020-07-08 12:25:32,049 INFO L280 TraceCheckUtils]: 2: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-08 12:25:32,049 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3477#true} {3477#true} #53#return; {3477#true} is VALID [2020-07-08 12:25:32,049 INFO L263 TraceCheckUtils]: 4: Hoare triple {3477#true} call #t~ret9 := main(); {3477#true} is VALID [2020-07-08 12:25:32,049 INFO L280 TraceCheckUtils]: 5: Hoare triple {3477#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3517#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:32,050 INFO L280 TraceCheckUtils]: 6: Hoare triple {3517#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3517#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:32,050 INFO L280 TraceCheckUtils]: 7: Hoare triple {3517#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3483#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:32,051 INFO L280 TraceCheckUtils]: 8: Hoare triple {3483#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3483#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:32,051 INFO L280 TraceCheckUtils]: 9: Hoare triple {3483#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3484#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:32,052 INFO L280 TraceCheckUtils]: 10: Hoare triple {3484#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3484#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:32,052 INFO L280 TraceCheckUtils]: 11: Hoare triple {3484#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3485#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:32,052 INFO L280 TraceCheckUtils]: 12: Hoare triple {3485#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3485#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:32,053 INFO L280 TraceCheckUtils]: 13: Hoare triple {3485#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3486#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:32,053 INFO L280 TraceCheckUtils]: 14: Hoare triple {3486#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3486#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:32,054 INFO L280 TraceCheckUtils]: 15: Hoare triple {3486#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3487#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:32,054 INFO L280 TraceCheckUtils]: 16: Hoare triple {3487#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3487#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:32,055 INFO L280 TraceCheckUtils]: 17: Hoare triple {3487#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3488#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:32,055 INFO L280 TraceCheckUtils]: 18: Hoare triple {3488#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3488#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:32,056 INFO L280 TraceCheckUtils]: 19: Hoare triple {3488#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3489#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:32,056 INFO L280 TraceCheckUtils]: 20: Hoare triple {3489#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3489#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:32,056 INFO L280 TraceCheckUtils]: 21: Hoare triple {3489#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3490#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:32,057 INFO L280 TraceCheckUtils]: 22: Hoare triple {3490#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3490#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:32,057 INFO L280 TraceCheckUtils]: 23: Hoare triple {3490#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3491#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:32,058 INFO L280 TraceCheckUtils]: 24: Hoare triple {3491#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3491#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:32,058 INFO L280 TraceCheckUtils]: 25: Hoare triple {3491#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3492#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:32,059 INFO L280 TraceCheckUtils]: 26: Hoare triple {3492#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3492#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:32,059 INFO L280 TraceCheckUtils]: 27: Hoare triple {3492#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3493#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:32,059 INFO L280 TraceCheckUtils]: 28: Hoare triple {3493#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3493#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:32,060 INFO L280 TraceCheckUtils]: 29: Hoare triple {3493#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3494#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:32,060 INFO L280 TraceCheckUtils]: 30: Hoare triple {3494#(<= main_~j~0 12)} assume !(~j~0 < 20); {3478#false} is VALID [2020-07-08 12:25:32,060 INFO L280 TraceCheckUtils]: 31: Hoare triple {3478#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3478#false} is VALID [2020-07-08 12:25:32,061 INFO L280 TraceCheckUtils]: 32: Hoare triple {3478#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3478#false} is VALID [2020-07-08 12:25:32,061 INFO L280 TraceCheckUtils]: 33: Hoare triple {3478#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3478#false} is VALID [2020-07-08 12:25:32,061 INFO L280 TraceCheckUtils]: 34: Hoare triple {3478#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3478#false} is VALID [2020-07-08 12:25:32,061 INFO L263 TraceCheckUtils]: 35: Hoare triple {3478#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3478#false} is VALID [2020-07-08 12:25:32,061 INFO L280 TraceCheckUtils]: 36: Hoare triple {3478#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3478#false} is VALID [2020-07-08 12:25:32,061 INFO L280 TraceCheckUtils]: 37: Hoare triple {3478#false} assume true; {3478#false} is VALID [2020-07-08 12:25:32,062 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3478#false} {3478#false} #57#return; {3478#false} is VALID [2020-07-08 12:25:32,062 INFO L280 TraceCheckUtils]: 39: Hoare triple {3478#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3478#false} is VALID [2020-07-08 12:25:32,062 INFO L280 TraceCheckUtils]: 40: Hoare triple {3478#false} assume 0 == #t~ret8;havoc #t~ret8; {3478#false} is VALID [2020-07-08 12:25:32,062 INFO L280 TraceCheckUtils]: 41: Hoare triple {3478#false} assume !false; {3478#false} is VALID [2020-07-08 12:25:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:32,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:32,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 17 [2020-07-08 12:25:32,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354868485] [2020-07-08 12:25:32,065 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2020-07-08 12:25:32,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:32,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-08 12:25:32,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:32,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-08 12:25:32,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-08 12:25:32,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:25:32,121 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 17 states. [2020-07-08 12:25:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:32,400 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2020-07-08 12:25:32,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-08 12:25:32,401 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2020-07-08 12:25:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 12:25:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 60 transitions. [2020-07-08 12:25:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 12:25:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 60 transitions. [2020-07-08 12:25:32,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 60 transitions. [2020-07-08 12:25:32,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:32,480 INFO L225 Difference]: With dead ends: 58 [2020-07-08 12:25:32,480 INFO L226 Difference]: Without dead ends: 46 [2020-07-08 12:25:32,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:25:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-08 12:25:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-08 12:25:32,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:32,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2020-07-08 12:25:32,513 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2020-07-08 12:25:32,514 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2020-07-08 12:25:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:32,515 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-08 12:25:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-07-08 12:25:32,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:32,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:32,516 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2020-07-08 12:25:32,516 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2020-07-08 12:25:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:32,517 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-08 12:25:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-07-08 12:25:32,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:32,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:32,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:32,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-08 12:25:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-07-08 12:25:32,519 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2020-07-08 12:25:32,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:32,520 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-07-08 12:25:32,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-08 12:25:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-08 12:25:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-08 12:25:32,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:32,521 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:32,730 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-08 12:25:32,731 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:32,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:32,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1423946491, now seen corresponding path program 13 times [2020-07-08 12:25:32,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:32,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710416545] [2020-07-08 12:25:32,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:32,960 INFO L280 TraceCheckUtils]: 0: Hoare triple {3890#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3868#true} is VALID [2020-07-08 12:25:32,960 INFO L280 TraceCheckUtils]: 1: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-08 12:25:32,960 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3868#true} {3868#true} #53#return; {3868#true} is VALID [2020-07-08 12:25:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:32,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {3868#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3868#true} is VALID [2020-07-08 12:25:32,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-08 12:25:32,966 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3868#true} {3869#false} #57#return; {3869#false} is VALID [2020-07-08 12:25:32,967 INFO L263 TraceCheckUtils]: 0: Hoare triple {3868#true} call ULTIMATE.init(); {3890#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:32,967 INFO L280 TraceCheckUtils]: 1: Hoare triple {3890#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3868#true} is VALID [2020-07-08 12:25:32,967 INFO L280 TraceCheckUtils]: 2: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-08 12:25:32,967 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3868#true} {3868#true} #53#return; {3868#true} is VALID [2020-07-08 12:25:32,967 INFO L263 TraceCheckUtils]: 4: Hoare triple {3868#true} call #t~ret9 := main(); {3868#true} is VALID [2020-07-08 12:25:32,968 INFO L280 TraceCheckUtils]: 5: Hoare triple {3868#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3873#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:32,969 INFO L280 TraceCheckUtils]: 6: Hoare triple {3873#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3873#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:32,969 INFO L280 TraceCheckUtils]: 7: Hoare triple {3873#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3874#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:32,970 INFO L280 TraceCheckUtils]: 8: Hoare triple {3874#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3874#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:32,971 INFO L280 TraceCheckUtils]: 9: Hoare triple {3874#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3875#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:32,971 INFO L280 TraceCheckUtils]: 10: Hoare triple {3875#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3875#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:32,972 INFO L280 TraceCheckUtils]: 11: Hoare triple {3875#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3876#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:32,972 INFO L280 TraceCheckUtils]: 12: Hoare triple {3876#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3876#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:32,973 INFO L280 TraceCheckUtils]: 13: Hoare triple {3876#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3877#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:32,974 INFO L280 TraceCheckUtils]: 14: Hoare triple {3877#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3877#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:32,974 INFO L280 TraceCheckUtils]: 15: Hoare triple {3877#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3878#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:32,975 INFO L280 TraceCheckUtils]: 16: Hoare triple {3878#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3878#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:32,976 INFO L280 TraceCheckUtils]: 17: Hoare triple {3878#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3879#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:32,976 INFO L280 TraceCheckUtils]: 18: Hoare triple {3879#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3879#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:32,978 INFO L280 TraceCheckUtils]: 19: Hoare triple {3879#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3880#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:32,978 INFO L280 TraceCheckUtils]: 20: Hoare triple {3880#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3880#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:32,979 INFO L280 TraceCheckUtils]: 21: Hoare triple {3880#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3881#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:32,980 INFO L280 TraceCheckUtils]: 22: Hoare triple {3881#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3881#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:32,981 INFO L280 TraceCheckUtils]: 23: Hoare triple {3881#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3882#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:32,981 INFO L280 TraceCheckUtils]: 24: Hoare triple {3882#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3882#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:32,982 INFO L280 TraceCheckUtils]: 25: Hoare triple {3882#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3883#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:32,983 INFO L280 TraceCheckUtils]: 26: Hoare triple {3883#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3883#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:32,984 INFO L280 TraceCheckUtils]: 27: Hoare triple {3883#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3884#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:32,985 INFO L280 TraceCheckUtils]: 28: Hoare triple {3884#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3884#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:32,986 INFO L280 TraceCheckUtils]: 29: Hoare triple {3884#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3885#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:32,986 INFO L280 TraceCheckUtils]: 30: Hoare triple {3885#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3885#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:32,987 INFO L280 TraceCheckUtils]: 31: Hoare triple {3885#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3886#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:32,988 INFO L280 TraceCheckUtils]: 32: Hoare triple {3886#(<= main_~j~0 13)} assume !(~j~0 < 20); {3869#false} is VALID [2020-07-08 12:25:32,988 INFO L280 TraceCheckUtils]: 33: Hoare triple {3869#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3869#false} is VALID [2020-07-08 12:25:32,989 INFO L280 TraceCheckUtils]: 34: Hoare triple {3869#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3869#false} is VALID [2020-07-08 12:25:32,989 INFO L280 TraceCheckUtils]: 35: Hoare triple {3869#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3869#false} is VALID [2020-07-08 12:25:32,989 INFO L280 TraceCheckUtils]: 36: Hoare triple {3869#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3869#false} is VALID [2020-07-08 12:25:32,990 INFO L263 TraceCheckUtils]: 37: Hoare triple {3869#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3868#true} is VALID [2020-07-08 12:25:32,990 INFO L280 TraceCheckUtils]: 38: Hoare triple {3868#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3868#true} is VALID [2020-07-08 12:25:32,990 INFO L280 TraceCheckUtils]: 39: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-08 12:25:32,991 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3868#true} {3869#false} #57#return; {3869#false} is VALID [2020-07-08 12:25:32,991 INFO L280 TraceCheckUtils]: 41: Hoare triple {3869#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3869#false} is VALID [2020-07-08 12:25:32,991 INFO L280 TraceCheckUtils]: 42: Hoare triple {3869#false} assume 0 == #t~ret8;havoc #t~ret8; {3869#false} is VALID [2020-07-08 12:25:32,991 INFO L280 TraceCheckUtils]: 43: Hoare triple {3869#false} assume !false; {3869#false} is VALID [2020-07-08 12:25:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:32,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710416545] [2020-07-08 12:25:32,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959573127] [2020-07-08 12:25:32,995 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:33,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-08 12:25:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:33,088 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:33,233 INFO L263 TraceCheckUtils]: 0: Hoare triple {3868#true} call ULTIMATE.init(); {3868#true} is VALID [2020-07-08 12:25:33,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {3868#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3868#true} is VALID [2020-07-08 12:25:33,233 INFO L280 TraceCheckUtils]: 2: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-08 12:25:33,233 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3868#true} {3868#true} #53#return; {3868#true} is VALID [2020-07-08 12:25:33,234 INFO L263 TraceCheckUtils]: 4: Hoare triple {3868#true} call #t~ret9 := main(); {3868#true} is VALID [2020-07-08 12:25:33,234 INFO L280 TraceCheckUtils]: 5: Hoare triple {3868#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3909#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:33,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {3909#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3909#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:33,236 INFO L280 TraceCheckUtils]: 7: Hoare triple {3909#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3874#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:33,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {3874#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3874#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:33,237 INFO L280 TraceCheckUtils]: 9: Hoare triple {3874#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3875#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:33,237 INFO L280 TraceCheckUtils]: 10: Hoare triple {3875#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3875#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:33,238 INFO L280 TraceCheckUtils]: 11: Hoare triple {3875#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3876#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:33,239 INFO L280 TraceCheckUtils]: 12: Hoare triple {3876#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3876#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:33,239 INFO L280 TraceCheckUtils]: 13: Hoare triple {3876#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3877#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:33,240 INFO L280 TraceCheckUtils]: 14: Hoare triple {3877#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3877#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:33,240 INFO L280 TraceCheckUtils]: 15: Hoare triple {3877#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3878#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:33,241 INFO L280 TraceCheckUtils]: 16: Hoare triple {3878#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3878#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:33,242 INFO L280 TraceCheckUtils]: 17: Hoare triple {3878#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3879#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:33,242 INFO L280 TraceCheckUtils]: 18: Hoare triple {3879#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3879#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:33,243 INFO L280 TraceCheckUtils]: 19: Hoare triple {3879#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3880#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:33,244 INFO L280 TraceCheckUtils]: 20: Hoare triple {3880#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3880#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:33,244 INFO L280 TraceCheckUtils]: 21: Hoare triple {3880#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3881#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:33,245 INFO L280 TraceCheckUtils]: 22: Hoare triple {3881#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3881#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:33,246 INFO L280 TraceCheckUtils]: 23: Hoare triple {3881#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3882#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:33,246 INFO L280 TraceCheckUtils]: 24: Hoare triple {3882#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3882#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:33,247 INFO L280 TraceCheckUtils]: 25: Hoare triple {3882#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3883#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:33,247 INFO L280 TraceCheckUtils]: 26: Hoare triple {3883#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3883#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:33,248 INFO L280 TraceCheckUtils]: 27: Hoare triple {3883#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3884#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:33,248 INFO L280 TraceCheckUtils]: 28: Hoare triple {3884#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3884#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:33,249 INFO L280 TraceCheckUtils]: 29: Hoare triple {3884#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3885#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:33,249 INFO L280 TraceCheckUtils]: 30: Hoare triple {3885#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3885#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:33,250 INFO L280 TraceCheckUtils]: 31: Hoare triple {3885#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3886#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:33,251 INFO L280 TraceCheckUtils]: 32: Hoare triple {3886#(<= main_~j~0 13)} assume !(~j~0 < 20); {3869#false} is VALID [2020-07-08 12:25:33,251 INFO L280 TraceCheckUtils]: 33: Hoare triple {3869#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3869#false} is VALID [2020-07-08 12:25:33,251 INFO L280 TraceCheckUtils]: 34: Hoare triple {3869#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3869#false} is VALID [2020-07-08 12:25:33,251 INFO L280 TraceCheckUtils]: 35: Hoare triple {3869#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3869#false} is VALID [2020-07-08 12:25:33,251 INFO L280 TraceCheckUtils]: 36: Hoare triple {3869#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3869#false} is VALID [2020-07-08 12:25:33,252 INFO L263 TraceCheckUtils]: 37: Hoare triple {3869#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3869#false} is VALID [2020-07-08 12:25:33,252 INFO L280 TraceCheckUtils]: 38: Hoare triple {3869#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3869#false} is VALID [2020-07-08 12:25:33,252 INFO L280 TraceCheckUtils]: 39: Hoare triple {3869#false} assume true; {3869#false} is VALID [2020-07-08 12:25:33,252 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3869#false} {3869#false} #57#return; {3869#false} is VALID [2020-07-08 12:25:33,252 INFO L280 TraceCheckUtils]: 41: Hoare triple {3869#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3869#false} is VALID [2020-07-08 12:25:33,252 INFO L280 TraceCheckUtils]: 42: Hoare triple {3869#false} assume 0 == #t~ret8;havoc #t~ret8; {3869#false} is VALID [2020-07-08 12:25:33,253 INFO L280 TraceCheckUtils]: 43: Hoare triple {3869#false} assume !false; {3869#false} is VALID [2020-07-08 12:25:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:33,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:33,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 18 [2020-07-08 12:25:33,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763544101] [2020-07-08 12:25:33,256 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2020-07-08 12:25:33,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:33,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-08 12:25:33,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:33,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-08 12:25:33,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:33,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-08 12:25:33,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2020-07-08 12:25:33,313 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 18 states. [2020-07-08 12:25:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:33,689 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-07-08 12:25:33,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-08 12:25:33,689 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2020-07-08 12:25:33,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 12:25:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2020-07-08 12:25:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 12:25:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2020-07-08 12:25:33,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 62 transitions. [2020-07-08 12:25:33,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:33,771 INFO L225 Difference]: With dead ends: 60 [2020-07-08 12:25:33,771 INFO L226 Difference]: Without dead ends: 48 [2020-07-08 12:25:33,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2020-07-08 12:25:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-08 12:25:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-08 12:25:33,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:33,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-08 12:25:33,793 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-08 12:25:33,794 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-08 12:25:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:33,795 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2020-07-08 12:25:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-08 12:25:33,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:33,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:33,796 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-08 12:25:33,796 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-08 12:25:33,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:33,798 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2020-07-08 12:25:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-08 12:25:33,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:33,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:33,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:33,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 12:25:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-07-08 12:25:33,800 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2020-07-08 12:25:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:33,800 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-07-08 12:25:33,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-08 12:25:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-07-08 12:25:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-08 12:25:33,801 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:33,801 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:34,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-08 12:25:34,012 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:34,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:34,012 INFO L82 PathProgramCache]: Analyzing trace with hash -471897817, now seen corresponding path program 14 times [2020-07-08 12:25:34,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:34,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025779796] [2020-07-08 12:25:34,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:34,285 INFO L280 TraceCheckUtils]: 0: Hoare triple {4299#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4276#true} is VALID [2020-07-08 12:25:34,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-08 12:25:34,285 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4276#true} {4276#true} #53#return; {4276#true} is VALID [2020-07-08 12:25:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:34,288 INFO L280 TraceCheckUtils]: 0: Hoare triple {4276#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4276#true} is VALID [2020-07-08 12:25:34,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-08 12:25:34,288 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4276#true} {4277#false} #57#return; {4277#false} is VALID [2020-07-08 12:25:34,289 INFO L263 TraceCheckUtils]: 0: Hoare triple {4276#true} call ULTIMATE.init(); {4299#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:34,289 INFO L280 TraceCheckUtils]: 1: Hoare triple {4299#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4276#true} is VALID [2020-07-08 12:25:34,289 INFO L280 TraceCheckUtils]: 2: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-08 12:25:34,289 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4276#true} {4276#true} #53#return; {4276#true} is VALID [2020-07-08 12:25:34,290 INFO L263 TraceCheckUtils]: 4: Hoare triple {4276#true} call #t~ret9 := main(); {4276#true} is VALID [2020-07-08 12:25:34,290 INFO L280 TraceCheckUtils]: 5: Hoare triple {4276#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {4281#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:34,290 INFO L280 TraceCheckUtils]: 6: Hoare triple {4281#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4281#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:34,291 INFO L280 TraceCheckUtils]: 7: Hoare triple {4281#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4282#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:34,291 INFO L280 TraceCheckUtils]: 8: Hoare triple {4282#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4282#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:34,292 INFO L280 TraceCheckUtils]: 9: Hoare triple {4282#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4283#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:34,293 INFO L280 TraceCheckUtils]: 10: Hoare triple {4283#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4283#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:34,293 INFO L280 TraceCheckUtils]: 11: Hoare triple {4283#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4284#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:34,294 INFO L280 TraceCheckUtils]: 12: Hoare triple {4284#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4284#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:34,294 INFO L280 TraceCheckUtils]: 13: Hoare triple {4284#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4285#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:34,295 INFO L280 TraceCheckUtils]: 14: Hoare triple {4285#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4285#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:34,295 INFO L280 TraceCheckUtils]: 15: Hoare triple {4285#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4286#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:34,296 INFO L280 TraceCheckUtils]: 16: Hoare triple {4286#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4286#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:34,297 INFO L280 TraceCheckUtils]: 17: Hoare triple {4286#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4287#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:34,297 INFO L280 TraceCheckUtils]: 18: Hoare triple {4287#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4287#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:34,298 INFO L280 TraceCheckUtils]: 19: Hoare triple {4287#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4288#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:34,298 INFO L280 TraceCheckUtils]: 20: Hoare triple {4288#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4288#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:34,299 INFO L280 TraceCheckUtils]: 21: Hoare triple {4288#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4289#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:34,300 INFO L280 TraceCheckUtils]: 22: Hoare triple {4289#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4289#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:34,300 INFO L280 TraceCheckUtils]: 23: Hoare triple {4289#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4290#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:34,300 INFO L280 TraceCheckUtils]: 24: Hoare triple {4290#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4290#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:34,301 INFO L280 TraceCheckUtils]: 25: Hoare triple {4290#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4291#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:34,301 INFO L280 TraceCheckUtils]: 26: Hoare triple {4291#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4291#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:34,302 INFO L280 TraceCheckUtils]: 27: Hoare triple {4291#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4292#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:34,302 INFO L280 TraceCheckUtils]: 28: Hoare triple {4292#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4292#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:34,303 INFO L280 TraceCheckUtils]: 29: Hoare triple {4292#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4293#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:34,303 INFO L280 TraceCheckUtils]: 30: Hoare triple {4293#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4293#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:34,304 INFO L280 TraceCheckUtils]: 31: Hoare triple {4293#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4294#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:34,304 INFO L280 TraceCheckUtils]: 32: Hoare triple {4294#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4294#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:34,304 INFO L280 TraceCheckUtils]: 33: Hoare triple {4294#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4295#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:34,305 INFO L280 TraceCheckUtils]: 34: Hoare triple {4295#(<= main_~j~0 14)} assume !(~j~0 < 20); {4277#false} is VALID [2020-07-08 12:25:34,305 INFO L280 TraceCheckUtils]: 35: Hoare triple {4277#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {4277#false} is VALID [2020-07-08 12:25:34,305 INFO L280 TraceCheckUtils]: 36: Hoare triple {4277#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {4277#false} is VALID [2020-07-08 12:25:34,305 INFO L280 TraceCheckUtils]: 37: Hoare triple {4277#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {4277#false} is VALID [2020-07-08 12:25:34,305 INFO L280 TraceCheckUtils]: 38: Hoare triple {4277#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4277#false} is VALID [2020-07-08 12:25:34,306 INFO L263 TraceCheckUtils]: 39: Hoare triple {4277#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {4276#true} is VALID [2020-07-08 12:25:34,306 INFO L280 TraceCheckUtils]: 40: Hoare triple {4276#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4276#true} is VALID [2020-07-08 12:25:34,306 INFO L280 TraceCheckUtils]: 41: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-08 12:25:34,306 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {4276#true} {4277#false} #57#return; {4277#false} is VALID [2020-07-08 12:25:34,306 INFO L280 TraceCheckUtils]: 43: Hoare triple {4277#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4277#false} is VALID [2020-07-08 12:25:34,306 INFO L280 TraceCheckUtils]: 44: Hoare triple {4277#false} assume 0 == #t~ret8;havoc #t~ret8; {4277#false} is VALID [2020-07-08 12:25:34,306 INFO L280 TraceCheckUtils]: 45: Hoare triple {4277#false} assume !false; {4277#false} is VALID [2020-07-08 12:25:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:34,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025779796] [2020-07-08 12:25:34,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106064184] [2020-07-08 12:25:34,309 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:34,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:25:34,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:34,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-08 12:25:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:34,383 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:34,515 INFO L263 TraceCheckUtils]: 0: Hoare triple {4276#true} call ULTIMATE.init(); {4276#true} is VALID [2020-07-08 12:25:34,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {4276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4276#true} is VALID [2020-07-08 12:25:34,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-08 12:25:34,516 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4276#true} {4276#true} #53#return; {4276#true} is VALID [2020-07-08 12:25:34,516 INFO L263 TraceCheckUtils]: 4: Hoare triple {4276#true} call #t~ret9 := main(); {4276#true} is VALID [2020-07-08 12:25:34,517 INFO L280 TraceCheckUtils]: 5: Hoare triple {4276#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {4318#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:34,517 INFO L280 TraceCheckUtils]: 6: Hoare triple {4318#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4318#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:34,518 INFO L280 TraceCheckUtils]: 7: Hoare triple {4318#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4282#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:34,518 INFO L280 TraceCheckUtils]: 8: Hoare triple {4282#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4282#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:34,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {4282#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4283#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:34,519 INFO L280 TraceCheckUtils]: 10: Hoare triple {4283#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4283#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:34,520 INFO L280 TraceCheckUtils]: 11: Hoare triple {4283#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4284#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:34,520 INFO L280 TraceCheckUtils]: 12: Hoare triple {4284#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4284#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:34,521 INFO L280 TraceCheckUtils]: 13: Hoare triple {4284#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4285#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:34,521 INFO L280 TraceCheckUtils]: 14: Hoare triple {4285#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4285#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:34,522 INFO L280 TraceCheckUtils]: 15: Hoare triple {4285#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4286#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:34,522 INFO L280 TraceCheckUtils]: 16: Hoare triple {4286#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4286#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:34,522 INFO L280 TraceCheckUtils]: 17: Hoare triple {4286#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4287#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:34,523 INFO L280 TraceCheckUtils]: 18: Hoare triple {4287#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4287#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:34,523 INFO L280 TraceCheckUtils]: 19: Hoare triple {4287#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4288#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:34,524 INFO L280 TraceCheckUtils]: 20: Hoare triple {4288#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4288#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:34,524 INFO L280 TraceCheckUtils]: 21: Hoare triple {4288#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4289#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:34,525 INFO L280 TraceCheckUtils]: 22: Hoare triple {4289#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4289#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:34,525 INFO L280 TraceCheckUtils]: 23: Hoare triple {4289#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4290#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:34,526 INFO L280 TraceCheckUtils]: 24: Hoare triple {4290#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4290#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:34,526 INFO L280 TraceCheckUtils]: 25: Hoare triple {4290#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4291#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:34,526 INFO L280 TraceCheckUtils]: 26: Hoare triple {4291#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4291#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:34,527 INFO L280 TraceCheckUtils]: 27: Hoare triple {4291#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4292#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:34,527 INFO L280 TraceCheckUtils]: 28: Hoare triple {4292#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4292#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:34,528 INFO L280 TraceCheckUtils]: 29: Hoare triple {4292#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4293#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:34,528 INFO L280 TraceCheckUtils]: 30: Hoare triple {4293#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4293#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:34,529 INFO L280 TraceCheckUtils]: 31: Hoare triple {4293#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4294#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:34,529 INFO L280 TraceCheckUtils]: 32: Hoare triple {4294#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4294#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:34,529 INFO L280 TraceCheckUtils]: 33: Hoare triple {4294#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4295#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:34,530 INFO L280 TraceCheckUtils]: 34: Hoare triple {4295#(<= main_~j~0 14)} assume !(~j~0 < 20); {4277#false} is VALID [2020-07-08 12:25:34,530 INFO L280 TraceCheckUtils]: 35: Hoare triple {4277#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {4277#false} is VALID [2020-07-08 12:25:34,530 INFO L280 TraceCheckUtils]: 36: Hoare triple {4277#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {4277#false} is VALID [2020-07-08 12:25:34,530 INFO L280 TraceCheckUtils]: 37: Hoare triple {4277#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {4277#false} is VALID [2020-07-08 12:25:34,530 INFO L280 TraceCheckUtils]: 38: Hoare triple {4277#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4277#false} is VALID [2020-07-08 12:25:34,531 INFO L263 TraceCheckUtils]: 39: Hoare triple {4277#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {4277#false} is VALID [2020-07-08 12:25:34,531 INFO L280 TraceCheckUtils]: 40: Hoare triple {4277#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4277#false} is VALID [2020-07-08 12:25:34,531 INFO L280 TraceCheckUtils]: 41: Hoare triple {4277#false} assume true; {4277#false} is VALID [2020-07-08 12:25:34,531 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {4277#false} {4277#false} #57#return; {4277#false} is VALID [2020-07-08 12:25:34,531 INFO L280 TraceCheckUtils]: 43: Hoare triple {4277#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4277#false} is VALID [2020-07-08 12:25:34,531 INFO L280 TraceCheckUtils]: 44: Hoare triple {4277#false} assume 0 == #t~ret8;havoc #t~ret8; {4277#false} is VALID [2020-07-08 12:25:34,531 INFO L280 TraceCheckUtils]: 45: Hoare triple {4277#false} assume !false; {4277#false} is VALID [2020-07-08 12:25:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:34,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:34,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 19 [2020-07-08 12:25:34,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089997347] [2020-07-08 12:25:34,534 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2020-07-08 12:25:34,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:34,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-08 12:25:34,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:34,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-08 12:25:34,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:34,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-08 12:25:34,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2020-07-08 12:25:34,603 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 19 states. [2020-07-08 12:25:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:34,920 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2020-07-08 12:25:34,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-08 12:25:34,920 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2020-07-08 12:25:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:25:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 64 transitions. [2020-07-08 12:25:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:25:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 64 transitions. [2020-07-08 12:25:34,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 64 transitions. [2020-07-08 12:25:35,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:35,009 INFO L225 Difference]: With dead ends: 62 [2020-07-08 12:25:35,009 INFO L226 Difference]: Without dead ends: 50 [2020-07-08 12:25:35,010 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2020-07-08 12:25:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-08 12:25:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2020-07-08 12:25:35,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:35,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2020-07-08 12:25:35,038 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2020-07-08 12:25:35,039 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2020-07-08 12:25:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:35,040 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-07-08 12:25:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-08 12:25:35,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:35,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:35,041 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2020-07-08 12:25:35,041 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2020-07-08 12:25:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:35,043 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-07-08 12:25:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-08 12:25:35,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:35,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:35,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:35,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-08 12:25:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-07-08 12:25:35,045 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2020-07-08 12:25:35,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:35,046 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-07-08 12:25:35,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-08 12:25:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-07-08 12:25:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 12:25:35,047 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:35,047 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:35,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:35,260 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:35,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:35,261 INFO L82 PathProgramCache]: Analyzing trace with hash -381156151, now seen corresponding path program 15 times [2020-07-08 12:25:35,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:35,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863612625] [2020-07-08 12:25:35,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:35,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {4725#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4701#true} is VALID [2020-07-08 12:25:35,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-08 12:25:35,565 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4701#true} {4701#true} #53#return; {4701#true} is VALID [2020-07-08 12:25:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:35,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {4701#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4701#true} is VALID [2020-07-08 12:25:35,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-08 12:25:35,570 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4701#true} {4702#false} #57#return; {4702#false} is VALID [2020-07-08 12:25:35,571 INFO L263 TraceCheckUtils]: 0: Hoare triple {4701#true} call ULTIMATE.init(); {4725#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:35,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {4725#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4701#true} is VALID [2020-07-08 12:25:35,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-08 12:25:35,571 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4701#true} {4701#true} #53#return; {4701#true} is VALID [2020-07-08 12:25:35,571 INFO L263 TraceCheckUtils]: 4: Hoare triple {4701#true} call #t~ret9 := main(); {4701#true} is VALID [2020-07-08 12:25:35,572 INFO L280 TraceCheckUtils]: 5: Hoare triple {4701#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {4706#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:35,573 INFO L280 TraceCheckUtils]: 6: Hoare triple {4706#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4706#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:35,573 INFO L280 TraceCheckUtils]: 7: Hoare triple {4706#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4707#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:35,574 INFO L280 TraceCheckUtils]: 8: Hoare triple {4707#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4707#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:35,575 INFO L280 TraceCheckUtils]: 9: Hoare triple {4707#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4708#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:35,575 INFO L280 TraceCheckUtils]: 10: Hoare triple {4708#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4708#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:35,576 INFO L280 TraceCheckUtils]: 11: Hoare triple {4708#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4709#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:35,577 INFO L280 TraceCheckUtils]: 12: Hoare triple {4709#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4709#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:35,577 INFO L280 TraceCheckUtils]: 13: Hoare triple {4709#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4710#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:35,578 INFO L280 TraceCheckUtils]: 14: Hoare triple {4710#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4710#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:35,579 INFO L280 TraceCheckUtils]: 15: Hoare triple {4710#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4711#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:35,579 INFO L280 TraceCheckUtils]: 16: Hoare triple {4711#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4711#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:35,580 INFO L280 TraceCheckUtils]: 17: Hoare triple {4711#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4712#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:35,581 INFO L280 TraceCheckUtils]: 18: Hoare triple {4712#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4712#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:35,581 INFO L280 TraceCheckUtils]: 19: Hoare triple {4712#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4713#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:35,590 INFO L280 TraceCheckUtils]: 20: Hoare triple {4713#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4713#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:35,592 INFO L280 TraceCheckUtils]: 21: Hoare triple {4713#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4714#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:35,592 INFO L280 TraceCheckUtils]: 22: Hoare triple {4714#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4714#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:35,593 INFO L280 TraceCheckUtils]: 23: Hoare triple {4714#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4715#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:35,593 INFO L280 TraceCheckUtils]: 24: Hoare triple {4715#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4715#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:35,594 INFO L280 TraceCheckUtils]: 25: Hoare triple {4715#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4716#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:35,595 INFO L280 TraceCheckUtils]: 26: Hoare triple {4716#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4716#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:35,595 INFO L280 TraceCheckUtils]: 27: Hoare triple {4716#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4717#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:35,596 INFO L280 TraceCheckUtils]: 28: Hoare triple {4717#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4717#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:35,596 INFO L280 TraceCheckUtils]: 29: Hoare triple {4717#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4718#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:35,597 INFO L280 TraceCheckUtils]: 30: Hoare triple {4718#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4718#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:35,598 INFO L280 TraceCheckUtils]: 31: Hoare triple {4718#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4719#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:35,599 INFO L280 TraceCheckUtils]: 32: Hoare triple {4719#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4719#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:35,600 INFO L280 TraceCheckUtils]: 33: Hoare triple {4719#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4720#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:35,614 INFO L280 TraceCheckUtils]: 34: Hoare triple {4720#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4720#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:35,615 INFO L280 TraceCheckUtils]: 35: Hoare triple {4720#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4721#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:35,617 INFO L280 TraceCheckUtils]: 36: Hoare triple {4721#(<= main_~j~0 15)} assume !(~j~0 < 20); {4702#false} is VALID [2020-07-08 12:25:35,617 INFO L280 TraceCheckUtils]: 37: Hoare triple {4702#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {4702#false} is VALID [2020-07-08 12:25:35,617 INFO L280 TraceCheckUtils]: 38: Hoare triple {4702#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {4702#false} is VALID [2020-07-08 12:25:35,618 INFO L280 TraceCheckUtils]: 39: Hoare triple {4702#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {4702#false} is VALID [2020-07-08 12:25:35,618 INFO L280 TraceCheckUtils]: 40: Hoare triple {4702#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4702#false} is VALID [2020-07-08 12:25:35,619 INFO L263 TraceCheckUtils]: 41: Hoare triple {4702#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {4701#true} is VALID [2020-07-08 12:25:35,619 INFO L280 TraceCheckUtils]: 42: Hoare triple {4701#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4701#true} is VALID [2020-07-08 12:25:35,619 INFO L280 TraceCheckUtils]: 43: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-08 12:25:35,620 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4701#true} {4702#false} #57#return; {4702#false} is VALID [2020-07-08 12:25:35,620 INFO L280 TraceCheckUtils]: 45: Hoare triple {4702#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4702#false} is VALID [2020-07-08 12:25:35,620 INFO L280 TraceCheckUtils]: 46: Hoare triple {4702#false} assume 0 == #t~ret8;havoc #t~ret8; {4702#false} is VALID [2020-07-08 12:25:35,620 INFO L280 TraceCheckUtils]: 47: Hoare triple {4702#false} assume !false; {4702#false} is VALID [2020-07-08 12:25:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:35,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863612625] [2020-07-08 12:25:35,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961393894] [2020-07-08 12:25:35,624 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:37,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2020-07-08 12:25:37,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:37,052 INFO L264 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-08 12:25:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:37,065 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:37,206 INFO L263 TraceCheckUtils]: 0: Hoare triple {4701#true} call ULTIMATE.init(); {4701#true} is VALID [2020-07-08 12:25:37,207 INFO L280 TraceCheckUtils]: 1: Hoare triple {4701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4701#true} is VALID [2020-07-08 12:25:37,207 INFO L280 TraceCheckUtils]: 2: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-08 12:25:37,207 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4701#true} {4701#true} #53#return; {4701#true} is VALID [2020-07-08 12:25:37,208 INFO L263 TraceCheckUtils]: 4: Hoare triple {4701#true} call #t~ret9 := main(); {4701#true} is VALID [2020-07-08 12:25:37,209 INFO L280 TraceCheckUtils]: 5: Hoare triple {4701#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {4744#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:37,209 INFO L280 TraceCheckUtils]: 6: Hoare triple {4744#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4744#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:37,210 INFO L280 TraceCheckUtils]: 7: Hoare triple {4744#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4707#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:37,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {4707#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4707#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:37,210 INFO L280 TraceCheckUtils]: 9: Hoare triple {4707#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4708#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:37,211 INFO L280 TraceCheckUtils]: 10: Hoare triple {4708#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4708#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:37,212 INFO L280 TraceCheckUtils]: 11: Hoare triple {4708#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4709#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:37,213 INFO L280 TraceCheckUtils]: 12: Hoare triple {4709#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4709#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:37,213 INFO L280 TraceCheckUtils]: 13: Hoare triple {4709#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4710#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:37,214 INFO L280 TraceCheckUtils]: 14: Hoare triple {4710#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4710#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:37,215 INFO L280 TraceCheckUtils]: 15: Hoare triple {4710#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4711#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:37,216 INFO L280 TraceCheckUtils]: 16: Hoare triple {4711#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4711#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:37,216 INFO L280 TraceCheckUtils]: 17: Hoare triple {4711#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4712#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:37,217 INFO L280 TraceCheckUtils]: 18: Hoare triple {4712#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4712#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:37,218 INFO L280 TraceCheckUtils]: 19: Hoare triple {4712#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4713#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:37,219 INFO L280 TraceCheckUtils]: 20: Hoare triple {4713#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4713#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:37,219 INFO L280 TraceCheckUtils]: 21: Hoare triple {4713#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4714#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:37,220 INFO L280 TraceCheckUtils]: 22: Hoare triple {4714#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4714#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:37,221 INFO L280 TraceCheckUtils]: 23: Hoare triple {4714#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4715#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:37,222 INFO L280 TraceCheckUtils]: 24: Hoare triple {4715#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4715#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:37,222 INFO L280 TraceCheckUtils]: 25: Hoare triple {4715#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4716#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:37,223 INFO L280 TraceCheckUtils]: 26: Hoare triple {4716#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4716#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:37,224 INFO L280 TraceCheckUtils]: 27: Hoare triple {4716#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4717#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:37,225 INFO L280 TraceCheckUtils]: 28: Hoare triple {4717#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4717#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:37,226 INFO L280 TraceCheckUtils]: 29: Hoare triple {4717#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4718#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:37,227 INFO L280 TraceCheckUtils]: 30: Hoare triple {4718#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4718#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:37,229 INFO L280 TraceCheckUtils]: 31: Hoare triple {4718#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4719#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:37,229 INFO L280 TraceCheckUtils]: 32: Hoare triple {4719#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4719#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:37,230 INFO L280 TraceCheckUtils]: 33: Hoare triple {4719#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4720#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:37,230 INFO L280 TraceCheckUtils]: 34: Hoare triple {4720#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4720#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:37,231 INFO L280 TraceCheckUtils]: 35: Hoare triple {4720#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4721#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:37,231 INFO L280 TraceCheckUtils]: 36: Hoare triple {4721#(<= main_~j~0 15)} assume !(~j~0 < 20); {4702#false} is VALID [2020-07-08 12:25:37,232 INFO L280 TraceCheckUtils]: 37: Hoare triple {4702#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {4702#false} is VALID [2020-07-08 12:25:37,232 INFO L280 TraceCheckUtils]: 38: Hoare triple {4702#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {4702#false} is VALID [2020-07-08 12:25:37,232 INFO L280 TraceCheckUtils]: 39: Hoare triple {4702#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {4702#false} is VALID [2020-07-08 12:25:37,232 INFO L280 TraceCheckUtils]: 40: Hoare triple {4702#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4702#false} is VALID [2020-07-08 12:25:37,232 INFO L263 TraceCheckUtils]: 41: Hoare triple {4702#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {4702#false} is VALID [2020-07-08 12:25:37,232 INFO L280 TraceCheckUtils]: 42: Hoare triple {4702#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4702#false} is VALID [2020-07-08 12:25:37,232 INFO L280 TraceCheckUtils]: 43: Hoare triple {4702#false} assume true; {4702#false} is VALID [2020-07-08 12:25:37,232 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4702#false} {4702#false} #57#return; {4702#false} is VALID [2020-07-08 12:25:37,233 INFO L280 TraceCheckUtils]: 45: Hoare triple {4702#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4702#false} is VALID [2020-07-08 12:25:37,233 INFO L280 TraceCheckUtils]: 46: Hoare triple {4702#false} assume 0 == #t~ret8;havoc #t~ret8; {4702#false} is VALID [2020-07-08 12:25:37,233 INFO L280 TraceCheckUtils]: 47: Hoare triple {4702#false} assume !false; {4702#false} is VALID [2020-07-08 12:25:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:37,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:37,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 20 [2020-07-08 12:25:37,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684990415] [2020-07-08 12:25:37,236 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2020-07-08 12:25:37,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:37,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-08 12:25:37,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:37,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-08 12:25:37,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:37,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-08 12:25:37,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2020-07-08 12:25:37,311 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 20 states. [2020-07-08 12:25:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:37,781 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2020-07-08 12:25:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 12:25:37,782 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2020-07-08 12:25:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 12:25:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2020-07-08 12:25:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 12:25:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2020-07-08 12:25:37,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2020-07-08 12:25:37,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:37,877 INFO L225 Difference]: With dead ends: 64 [2020-07-08 12:25:37,877 INFO L226 Difference]: Without dead ends: 52 [2020-07-08 12:25:37,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2020-07-08 12:25:37,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-08 12:25:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-07-08 12:25:37,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:37,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2020-07-08 12:25:37,901 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2020-07-08 12:25:37,901 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2020-07-08 12:25:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:37,903 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-07-08 12:25:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-07-08 12:25:37,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:37,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:37,904 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2020-07-08 12:25:37,904 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2020-07-08 12:25:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:37,906 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-07-08 12:25:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-07-08 12:25:37,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:37,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:37,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:37,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-08 12:25:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-07-08 12:25:37,908 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2020-07-08 12:25:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:37,908 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-07-08 12:25:37,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-08 12:25:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-07-08 12:25:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-08 12:25:37,909 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:37,909 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:38,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-08 12:25:38,122 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:38,122 INFO L82 PathProgramCache]: Analyzing trace with hash 922238955, now seen corresponding path program 16 times [2020-07-08 12:25:38,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:38,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790692660] [2020-07-08 12:25:38,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:38,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {5168#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5143#true} is VALID [2020-07-08 12:25:38,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-08 12:25:38,441 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5143#true} {5143#true} #53#return; {5143#true} is VALID [2020-07-08 12:25:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:38,454 INFO L280 TraceCheckUtils]: 0: Hoare triple {5143#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5143#true} is VALID [2020-07-08 12:25:38,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-08 12:25:38,455 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5143#true} {5144#false} #57#return; {5144#false} is VALID [2020-07-08 12:25:38,456 INFO L263 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5168#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:38,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {5168#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5143#true} is VALID [2020-07-08 12:25:38,456 INFO L280 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-08 12:25:38,456 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #53#return; {5143#true} is VALID [2020-07-08 12:25:38,457 INFO L263 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret9 := main(); {5143#true} is VALID [2020-07-08 12:25:38,458 INFO L280 TraceCheckUtils]: 5: Hoare triple {5143#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5148#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:38,458 INFO L280 TraceCheckUtils]: 6: Hoare triple {5148#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5148#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:38,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {5148#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5149#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:38,459 INFO L280 TraceCheckUtils]: 8: Hoare triple {5149#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5149#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:38,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {5149#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5150#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:38,461 INFO L280 TraceCheckUtils]: 10: Hoare triple {5150#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5150#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:38,462 INFO L280 TraceCheckUtils]: 11: Hoare triple {5150#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5151#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:38,462 INFO L280 TraceCheckUtils]: 12: Hoare triple {5151#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5151#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:38,463 INFO L280 TraceCheckUtils]: 13: Hoare triple {5151#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5152#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:38,464 INFO L280 TraceCheckUtils]: 14: Hoare triple {5152#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5152#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:38,465 INFO L280 TraceCheckUtils]: 15: Hoare triple {5152#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5153#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:38,465 INFO L280 TraceCheckUtils]: 16: Hoare triple {5153#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5153#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:38,466 INFO L280 TraceCheckUtils]: 17: Hoare triple {5153#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5154#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:38,467 INFO L280 TraceCheckUtils]: 18: Hoare triple {5154#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5154#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:38,467 INFO L280 TraceCheckUtils]: 19: Hoare triple {5154#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5155#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:38,468 INFO L280 TraceCheckUtils]: 20: Hoare triple {5155#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5155#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:38,469 INFO L280 TraceCheckUtils]: 21: Hoare triple {5155#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5156#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:38,469 INFO L280 TraceCheckUtils]: 22: Hoare triple {5156#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5156#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:38,470 INFO L280 TraceCheckUtils]: 23: Hoare triple {5156#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5157#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:38,471 INFO L280 TraceCheckUtils]: 24: Hoare triple {5157#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5157#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:38,472 INFO L280 TraceCheckUtils]: 25: Hoare triple {5157#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5158#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:38,472 INFO L280 TraceCheckUtils]: 26: Hoare triple {5158#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5158#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:38,473 INFO L280 TraceCheckUtils]: 27: Hoare triple {5158#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5159#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:38,474 INFO L280 TraceCheckUtils]: 28: Hoare triple {5159#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5159#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:38,474 INFO L280 TraceCheckUtils]: 29: Hoare triple {5159#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5160#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:38,475 INFO L280 TraceCheckUtils]: 30: Hoare triple {5160#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5160#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:38,476 INFO L280 TraceCheckUtils]: 31: Hoare triple {5160#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5161#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:38,477 INFO L280 TraceCheckUtils]: 32: Hoare triple {5161#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5161#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:38,478 INFO L280 TraceCheckUtils]: 33: Hoare triple {5161#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5162#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:38,478 INFO L280 TraceCheckUtils]: 34: Hoare triple {5162#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5162#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:38,479 INFO L280 TraceCheckUtils]: 35: Hoare triple {5162#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5163#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:38,480 INFO L280 TraceCheckUtils]: 36: Hoare triple {5163#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5163#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:38,481 INFO L280 TraceCheckUtils]: 37: Hoare triple {5163#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5164#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:38,481 INFO L280 TraceCheckUtils]: 38: Hoare triple {5164#(<= main_~j~0 16)} assume !(~j~0 < 20); {5144#false} is VALID [2020-07-08 12:25:38,482 INFO L280 TraceCheckUtils]: 39: Hoare triple {5144#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5144#false} is VALID [2020-07-08 12:25:38,482 INFO L280 TraceCheckUtils]: 40: Hoare triple {5144#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5144#false} is VALID [2020-07-08 12:25:38,482 INFO L280 TraceCheckUtils]: 41: Hoare triple {5144#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5144#false} is VALID [2020-07-08 12:25:38,482 INFO L280 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5144#false} is VALID [2020-07-08 12:25:38,482 INFO L263 TraceCheckUtils]: 43: Hoare triple {5144#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5143#true} is VALID [2020-07-08 12:25:38,483 INFO L280 TraceCheckUtils]: 44: Hoare triple {5143#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5143#true} is VALID [2020-07-08 12:25:38,483 INFO L280 TraceCheckUtils]: 45: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-08 12:25:38,483 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {5143#true} {5144#false} #57#return; {5144#false} is VALID [2020-07-08 12:25:38,483 INFO L280 TraceCheckUtils]: 47: Hoare triple {5144#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5144#false} is VALID [2020-07-08 12:25:38,483 INFO L280 TraceCheckUtils]: 48: Hoare triple {5144#false} assume 0 == #t~ret8;havoc #t~ret8; {5144#false} is VALID [2020-07-08 12:25:38,483 INFO L280 TraceCheckUtils]: 49: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2020-07-08 12:25:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:38,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790692660] [2020-07-08 12:25:38,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469608439] [2020-07-08 12:25:38,488 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:38,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-08 12:25:38,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:38,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-08 12:25:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:38,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:38,733 INFO L263 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5143#true} is VALID [2020-07-08 12:25:38,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {5143#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5143#true} is VALID [2020-07-08 12:25:38,734 INFO L280 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-08 12:25:38,734 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #53#return; {5143#true} is VALID [2020-07-08 12:25:38,734 INFO L263 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret9 := main(); {5143#true} is VALID [2020-07-08 12:25:38,735 INFO L280 TraceCheckUtils]: 5: Hoare triple {5143#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5187#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:38,735 INFO L280 TraceCheckUtils]: 6: Hoare triple {5187#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5187#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:38,736 INFO L280 TraceCheckUtils]: 7: Hoare triple {5187#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5149#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:38,737 INFO L280 TraceCheckUtils]: 8: Hoare triple {5149#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5149#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:38,737 INFO L280 TraceCheckUtils]: 9: Hoare triple {5149#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5150#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:38,738 INFO L280 TraceCheckUtils]: 10: Hoare triple {5150#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5150#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:38,739 INFO L280 TraceCheckUtils]: 11: Hoare triple {5150#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5151#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:38,739 INFO L280 TraceCheckUtils]: 12: Hoare triple {5151#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5151#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:38,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {5151#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5152#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:38,740 INFO L280 TraceCheckUtils]: 14: Hoare triple {5152#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5152#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:38,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {5152#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5153#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:38,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {5153#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5153#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:38,742 INFO L280 TraceCheckUtils]: 17: Hoare triple {5153#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5154#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:38,742 INFO L280 TraceCheckUtils]: 18: Hoare triple {5154#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5154#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:38,743 INFO L280 TraceCheckUtils]: 19: Hoare triple {5154#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5155#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:38,743 INFO L280 TraceCheckUtils]: 20: Hoare triple {5155#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5155#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:38,744 INFO L280 TraceCheckUtils]: 21: Hoare triple {5155#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5156#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:38,744 INFO L280 TraceCheckUtils]: 22: Hoare triple {5156#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5156#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:38,745 INFO L280 TraceCheckUtils]: 23: Hoare triple {5156#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5157#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:38,745 INFO L280 TraceCheckUtils]: 24: Hoare triple {5157#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5157#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:38,745 INFO L280 TraceCheckUtils]: 25: Hoare triple {5157#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5158#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:38,746 INFO L280 TraceCheckUtils]: 26: Hoare triple {5158#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5158#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:38,746 INFO L280 TraceCheckUtils]: 27: Hoare triple {5158#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5159#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:38,747 INFO L280 TraceCheckUtils]: 28: Hoare triple {5159#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5159#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:38,747 INFO L280 TraceCheckUtils]: 29: Hoare triple {5159#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5160#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:38,748 INFO L280 TraceCheckUtils]: 30: Hoare triple {5160#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5160#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:38,750 INFO L280 TraceCheckUtils]: 31: Hoare triple {5160#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5161#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:38,752 INFO L280 TraceCheckUtils]: 32: Hoare triple {5161#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5161#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:38,753 INFO L280 TraceCheckUtils]: 33: Hoare triple {5161#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5162#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:38,753 INFO L280 TraceCheckUtils]: 34: Hoare triple {5162#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5162#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:38,754 INFO L280 TraceCheckUtils]: 35: Hoare triple {5162#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5163#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:38,754 INFO L280 TraceCheckUtils]: 36: Hoare triple {5163#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5163#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:38,755 INFO L280 TraceCheckUtils]: 37: Hoare triple {5163#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5164#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:38,755 INFO L280 TraceCheckUtils]: 38: Hoare triple {5164#(<= main_~j~0 16)} assume !(~j~0 < 20); {5144#false} is VALID [2020-07-08 12:25:38,755 INFO L280 TraceCheckUtils]: 39: Hoare triple {5144#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5144#false} is VALID [2020-07-08 12:25:38,756 INFO L280 TraceCheckUtils]: 40: Hoare triple {5144#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5144#false} is VALID [2020-07-08 12:25:38,756 INFO L280 TraceCheckUtils]: 41: Hoare triple {5144#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5144#false} is VALID [2020-07-08 12:25:38,756 INFO L280 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5144#false} is VALID [2020-07-08 12:25:38,756 INFO L263 TraceCheckUtils]: 43: Hoare triple {5144#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5144#false} is VALID [2020-07-08 12:25:38,756 INFO L280 TraceCheckUtils]: 44: Hoare triple {5144#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5144#false} is VALID [2020-07-08 12:25:38,756 INFO L280 TraceCheckUtils]: 45: Hoare triple {5144#false} assume true; {5144#false} is VALID [2020-07-08 12:25:38,756 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {5144#false} {5144#false} #57#return; {5144#false} is VALID [2020-07-08 12:25:38,757 INFO L280 TraceCheckUtils]: 47: Hoare triple {5144#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5144#false} is VALID [2020-07-08 12:25:38,757 INFO L280 TraceCheckUtils]: 48: Hoare triple {5144#false} assume 0 == #t~ret8;havoc #t~ret8; {5144#false} is VALID [2020-07-08 12:25:38,757 INFO L280 TraceCheckUtils]: 49: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2020-07-08 12:25:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:38,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:38,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 21 [2020-07-08 12:25:38,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295540056] [2020-07-08 12:25:38,759 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2020-07-08 12:25:38,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:38,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-08 12:25:38,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:38,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-08 12:25:38,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-08 12:25:38,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2020-07-08 12:25:38,835 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 21 states. [2020-07-08 12:25:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:39,235 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2020-07-08 12:25:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-08 12:25:39,235 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2020-07-08 12:25:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:25:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2020-07-08 12:25:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:25:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2020-07-08 12:25:39,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 68 transitions. [2020-07-08 12:25:39,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:39,331 INFO L225 Difference]: With dead ends: 66 [2020-07-08 12:25:39,331 INFO L226 Difference]: Without dead ends: 54 [2020-07-08 12:25:39,332 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2020-07-08 12:25:39,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-08 12:25:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2020-07-08 12:25:39,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:39,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2020-07-08 12:25:39,370 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2020-07-08 12:25:39,370 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2020-07-08 12:25:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:39,372 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-08 12:25:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-08 12:25:39,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:39,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:39,373 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2020-07-08 12:25:39,373 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2020-07-08 12:25:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:39,374 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-08 12:25:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-08 12:25:39,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:39,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:39,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:39,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-08 12:25:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-07-08 12:25:39,376 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2020-07-08 12:25:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:39,377 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-07-08 12:25:39,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-08 12:25:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-07-08 12:25:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-08 12:25:39,377 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:39,378 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:39,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-08 12:25:39,578 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:39,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:39,579 INFO L82 PathProgramCache]: Analyzing trace with hash -645514611, now seen corresponding path program 17 times [2020-07-08 12:25:39,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:39,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002352690] [2020-07-08 12:25:39,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:39,917 INFO L280 TraceCheckUtils]: 0: Hoare triple {5628#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5602#true} is VALID [2020-07-08 12:25:39,917 INFO L280 TraceCheckUtils]: 1: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-08 12:25:39,917 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5602#true} {5602#true} #53#return; {5602#true} is VALID [2020-07-08 12:25:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:39,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {5602#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5602#true} is VALID [2020-07-08 12:25:39,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-08 12:25:39,922 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5602#true} {5603#false} #57#return; {5603#false} is VALID [2020-07-08 12:25:39,923 INFO L263 TraceCheckUtils]: 0: Hoare triple {5602#true} call ULTIMATE.init(); {5628#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:39,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {5628#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5602#true} is VALID [2020-07-08 12:25:39,923 INFO L280 TraceCheckUtils]: 2: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-08 12:25:39,923 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5602#true} {5602#true} #53#return; {5602#true} is VALID [2020-07-08 12:25:39,923 INFO L263 TraceCheckUtils]: 4: Hoare triple {5602#true} call #t~ret9 := main(); {5602#true} is VALID [2020-07-08 12:25:39,924 INFO L280 TraceCheckUtils]: 5: Hoare triple {5602#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5607#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:39,924 INFO L280 TraceCheckUtils]: 6: Hoare triple {5607#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5607#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:39,925 INFO L280 TraceCheckUtils]: 7: Hoare triple {5607#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5608#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:39,925 INFO L280 TraceCheckUtils]: 8: Hoare triple {5608#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5608#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:39,926 INFO L280 TraceCheckUtils]: 9: Hoare triple {5608#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5609#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:39,926 INFO L280 TraceCheckUtils]: 10: Hoare triple {5609#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5609#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:39,927 INFO L280 TraceCheckUtils]: 11: Hoare triple {5609#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5610#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:39,927 INFO L280 TraceCheckUtils]: 12: Hoare triple {5610#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5610#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:39,927 INFO L280 TraceCheckUtils]: 13: Hoare triple {5610#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5611#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:39,928 INFO L280 TraceCheckUtils]: 14: Hoare triple {5611#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5611#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:39,928 INFO L280 TraceCheckUtils]: 15: Hoare triple {5611#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5612#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:39,929 INFO L280 TraceCheckUtils]: 16: Hoare triple {5612#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5612#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:39,929 INFO L280 TraceCheckUtils]: 17: Hoare triple {5612#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5613#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:39,930 INFO L280 TraceCheckUtils]: 18: Hoare triple {5613#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5613#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:39,930 INFO L280 TraceCheckUtils]: 19: Hoare triple {5613#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5614#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:39,931 INFO L280 TraceCheckUtils]: 20: Hoare triple {5614#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5614#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:39,931 INFO L280 TraceCheckUtils]: 21: Hoare triple {5614#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5615#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:39,931 INFO L280 TraceCheckUtils]: 22: Hoare triple {5615#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5615#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:39,932 INFO L280 TraceCheckUtils]: 23: Hoare triple {5615#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5616#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:39,932 INFO L280 TraceCheckUtils]: 24: Hoare triple {5616#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5616#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:39,933 INFO L280 TraceCheckUtils]: 25: Hoare triple {5616#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5617#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:39,933 INFO L280 TraceCheckUtils]: 26: Hoare triple {5617#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5617#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:39,934 INFO L280 TraceCheckUtils]: 27: Hoare triple {5617#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5618#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:39,934 INFO L280 TraceCheckUtils]: 28: Hoare triple {5618#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5618#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:39,935 INFO L280 TraceCheckUtils]: 29: Hoare triple {5618#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5619#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:39,935 INFO L280 TraceCheckUtils]: 30: Hoare triple {5619#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5619#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:39,936 INFO L280 TraceCheckUtils]: 31: Hoare triple {5619#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5620#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:39,936 INFO L280 TraceCheckUtils]: 32: Hoare triple {5620#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5620#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:39,937 INFO L280 TraceCheckUtils]: 33: Hoare triple {5620#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5621#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:39,937 INFO L280 TraceCheckUtils]: 34: Hoare triple {5621#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5621#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:39,938 INFO L280 TraceCheckUtils]: 35: Hoare triple {5621#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5622#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:39,938 INFO L280 TraceCheckUtils]: 36: Hoare triple {5622#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5622#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:39,938 INFO L280 TraceCheckUtils]: 37: Hoare triple {5622#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5623#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:39,939 INFO L280 TraceCheckUtils]: 38: Hoare triple {5623#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5623#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:39,939 INFO L280 TraceCheckUtils]: 39: Hoare triple {5623#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5624#(<= main_~j~0 17)} is VALID [2020-07-08 12:25:39,940 INFO L280 TraceCheckUtils]: 40: Hoare triple {5624#(<= main_~j~0 17)} assume !(~j~0 < 20); {5603#false} is VALID [2020-07-08 12:25:39,940 INFO L280 TraceCheckUtils]: 41: Hoare triple {5603#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5603#false} is VALID [2020-07-08 12:25:39,940 INFO L280 TraceCheckUtils]: 42: Hoare triple {5603#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5603#false} is VALID [2020-07-08 12:25:39,940 INFO L280 TraceCheckUtils]: 43: Hoare triple {5603#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5603#false} is VALID [2020-07-08 12:25:39,940 INFO L280 TraceCheckUtils]: 44: Hoare triple {5603#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5603#false} is VALID [2020-07-08 12:25:39,941 INFO L263 TraceCheckUtils]: 45: Hoare triple {5603#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5602#true} is VALID [2020-07-08 12:25:39,941 INFO L280 TraceCheckUtils]: 46: Hoare triple {5602#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5602#true} is VALID [2020-07-08 12:25:39,941 INFO L280 TraceCheckUtils]: 47: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-08 12:25:39,941 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {5602#true} {5603#false} #57#return; {5603#false} is VALID [2020-07-08 12:25:39,941 INFO L280 TraceCheckUtils]: 49: Hoare triple {5603#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5603#false} is VALID [2020-07-08 12:25:39,941 INFO L280 TraceCheckUtils]: 50: Hoare triple {5603#false} assume 0 == #t~ret8;havoc #t~ret8; {5603#false} is VALID [2020-07-08 12:25:39,941 INFO L280 TraceCheckUtils]: 51: Hoare triple {5603#false} assume !false; {5603#false} is VALID [2020-07-08 12:25:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:39,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002352690] [2020-07-08 12:25:39,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595511505] [2020-07-08 12:25:39,944 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:40,661 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2020-07-08 12:25:40,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:40,668 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-08 12:25:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:40,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:40,861 INFO L263 TraceCheckUtils]: 0: Hoare triple {5602#true} call ULTIMATE.init(); {5602#true} is VALID [2020-07-08 12:25:40,861 INFO L280 TraceCheckUtils]: 1: Hoare triple {5602#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5602#true} is VALID [2020-07-08 12:25:40,861 INFO L280 TraceCheckUtils]: 2: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-08 12:25:40,861 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5602#true} {5602#true} #53#return; {5602#true} is VALID [2020-07-08 12:25:40,861 INFO L263 TraceCheckUtils]: 4: Hoare triple {5602#true} call #t~ret9 := main(); {5602#true} is VALID [2020-07-08 12:25:40,862 INFO L280 TraceCheckUtils]: 5: Hoare triple {5602#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5647#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:40,862 INFO L280 TraceCheckUtils]: 6: Hoare triple {5647#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5647#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:40,863 INFO L280 TraceCheckUtils]: 7: Hoare triple {5647#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5608#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:40,864 INFO L280 TraceCheckUtils]: 8: Hoare triple {5608#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5608#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:40,865 INFO L280 TraceCheckUtils]: 9: Hoare triple {5608#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5609#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:40,866 INFO L280 TraceCheckUtils]: 10: Hoare triple {5609#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5609#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:40,867 INFO L280 TraceCheckUtils]: 11: Hoare triple {5609#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5610#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:40,867 INFO L280 TraceCheckUtils]: 12: Hoare triple {5610#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5610#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:40,868 INFO L280 TraceCheckUtils]: 13: Hoare triple {5610#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5611#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:40,869 INFO L280 TraceCheckUtils]: 14: Hoare triple {5611#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5611#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:40,870 INFO L280 TraceCheckUtils]: 15: Hoare triple {5611#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5612#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:40,870 INFO L280 TraceCheckUtils]: 16: Hoare triple {5612#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5612#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:40,873 INFO L280 TraceCheckUtils]: 17: Hoare triple {5612#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5613#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:40,874 INFO L280 TraceCheckUtils]: 18: Hoare triple {5613#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5613#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:40,876 INFO L280 TraceCheckUtils]: 19: Hoare triple {5613#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5614#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:40,878 INFO L280 TraceCheckUtils]: 20: Hoare triple {5614#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5614#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:40,880 INFO L280 TraceCheckUtils]: 21: Hoare triple {5614#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5615#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:40,882 INFO L280 TraceCheckUtils]: 22: Hoare triple {5615#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5615#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:40,883 INFO L280 TraceCheckUtils]: 23: Hoare triple {5615#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5616#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:40,884 INFO L280 TraceCheckUtils]: 24: Hoare triple {5616#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5616#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:40,885 INFO L280 TraceCheckUtils]: 25: Hoare triple {5616#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5617#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:40,885 INFO L280 TraceCheckUtils]: 26: Hoare triple {5617#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5617#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:40,886 INFO L280 TraceCheckUtils]: 27: Hoare triple {5617#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5618#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:40,887 INFO L280 TraceCheckUtils]: 28: Hoare triple {5618#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5618#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:40,887 INFO L280 TraceCheckUtils]: 29: Hoare triple {5618#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5619#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:40,888 INFO L280 TraceCheckUtils]: 30: Hoare triple {5619#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5619#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:40,889 INFO L280 TraceCheckUtils]: 31: Hoare triple {5619#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5620#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:40,889 INFO L280 TraceCheckUtils]: 32: Hoare triple {5620#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5620#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:40,890 INFO L280 TraceCheckUtils]: 33: Hoare triple {5620#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5621#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:40,891 INFO L280 TraceCheckUtils]: 34: Hoare triple {5621#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5621#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:40,891 INFO L280 TraceCheckUtils]: 35: Hoare triple {5621#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5622#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:40,892 INFO L280 TraceCheckUtils]: 36: Hoare triple {5622#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5622#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:40,893 INFO L280 TraceCheckUtils]: 37: Hoare triple {5622#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5623#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:40,893 INFO L280 TraceCheckUtils]: 38: Hoare triple {5623#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5623#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:40,894 INFO L280 TraceCheckUtils]: 39: Hoare triple {5623#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5624#(<= main_~j~0 17)} is VALID [2020-07-08 12:25:40,895 INFO L280 TraceCheckUtils]: 40: Hoare triple {5624#(<= main_~j~0 17)} assume !(~j~0 < 20); {5603#false} is VALID [2020-07-08 12:25:40,895 INFO L280 TraceCheckUtils]: 41: Hoare triple {5603#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5603#false} is VALID [2020-07-08 12:25:40,895 INFO L280 TraceCheckUtils]: 42: Hoare triple {5603#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5603#false} is VALID [2020-07-08 12:25:40,895 INFO L280 TraceCheckUtils]: 43: Hoare triple {5603#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5603#false} is VALID [2020-07-08 12:25:40,895 INFO L280 TraceCheckUtils]: 44: Hoare triple {5603#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5603#false} is VALID [2020-07-08 12:25:40,895 INFO L263 TraceCheckUtils]: 45: Hoare triple {5603#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5603#false} is VALID [2020-07-08 12:25:40,896 INFO L280 TraceCheckUtils]: 46: Hoare triple {5603#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5603#false} is VALID [2020-07-08 12:25:40,896 INFO L280 TraceCheckUtils]: 47: Hoare triple {5603#false} assume true; {5603#false} is VALID [2020-07-08 12:25:40,896 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {5603#false} {5603#false} #57#return; {5603#false} is VALID [2020-07-08 12:25:40,896 INFO L280 TraceCheckUtils]: 49: Hoare triple {5603#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5603#false} is VALID [2020-07-08 12:25:40,896 INFO L280 TraceCheckUtils]: 50: Hoare triple {5603#false} assume 0 == #t~ret8;havoc #t~ret8; {5603#false} is VALID [2020-07-08 12:25:40,897 INFO L280 TraceCheckUtils]: 51: Hoare triple {5603#false} assume !false; {5603#false} is VALID [2020-07-08 12:25:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:40,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:40,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 22 [2020-07-08 12:25:40,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756025349] [2020-07-08 12:25:40,900 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 52 [2020-07-08 12:25:40,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:40,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2020-07-08 12:25:40,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:40,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-08 12:25:40,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:40,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-08 12:25:40,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2020-07-08 12:25:40,978 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 22 states. [2020-07-08 12:25:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:41,476 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2020-07-08 12:25:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-08 12:25:41,476 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 52 [2020-07-08 12:25:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-08 12:25:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2020-07-08 12:25:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-08 12:25:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2020-07-08 12:25:41,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 70 transitions. [2020-07-08 12:25:41,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:41,572 INFO L225 Difference]: With dead ends: 68 [2020-07-08 12:25:41,572 INFO L226 Difference]: Without dead ends: 56 [2020-07-08 12:25:41,573 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2020-07-08 12:25:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-08 12:25:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2020-07-08 12:25:41,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:41,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2020-07-08 12:25:41,597 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2020-07-08 12:25:41,597 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2020-07-08 12:25:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:41,599 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-08 12:25:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-08 12:25:41,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:41,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:41,599 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2020-07-08 12:25:41,599 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2020-07-08 12:25:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:41,601 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-08 12:25:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-08 12:25:41,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:41,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:41,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:41,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-08 12:25:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-07-08 12:25:41,603 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2020-07-08 12:25:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:41,603 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-07-08 12:25:41,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-08 12:25:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-07-08 12:25:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-08 12:25:41,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:41,605 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:41,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:41,815 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:41,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:41,815 INFO L82 PathProgramCache]: Analyzing trace with hash 276829359, now seen corresponding path program 18 times [2020-07-08 12:25:41,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:41,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715249301] [2020-07-08 12:25:41,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:42,207 INFO L280 TraceCheckUtils]: 0: Hoare triple {6105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6078#true} is VALID [2020-07-08 12:25:42,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-08 12:25:42,208 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6078#true} {6078#true} #53#return; {6078#true} is VALID [2020-07-08 12:25:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:42,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {6078#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6078#true} is VALID [2020-07-08 12:25:42,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-08 12:25:42,213 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6078#true} {6079#false} #57#return; {6079#false} is VALID [2020-07-08 12:25:42,214 INFO L263 TraceCheckUtils]: 0: Hoare triple {6078#true} call ULTIMATE.init(); {6105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:42,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {6105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6078#true} is VALID [2020-07-08 12:25:42,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-08 12:25:42,214 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6078#true} {6078#true} #53#return; {6078#true} is VALID [2020-07-08 12:25:42,214 INFO L263 TraceCheckUtils]: 4: Hoare triple {6078#true} call #t~ret9 := main(); {6078#true} is VALID [2020-07-08 12:25:42,215 INFO L280 TraceCheckUtils]: 5: Hoare triple {6078#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {6083#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:42,215 INFO L280 TraceCheckUtils]: 6: Hoare triple {6083#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6083#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:42,216 INFO L280 TraceCheckUtils]: 7: Hoare triple {6083#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6084#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:42,217 INFO L280 TraceCheckUtils]: 8: Hoare triple {6084#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6084#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:42,217 INFO L280 TraceCheckUtils]: 9: Hoare triple {6084#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6085#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:42,218 INFO L280 TraceCheckUtils]: 10: Hoare triple {6085#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6085#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:42,219 INFO L280 TraceCheckUtils]: 11: Hoare triple {6085#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6086#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:42,220 INFO L280 TraceCheckUtils]: 12: Hoare triple {6086#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6086#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:42,221 INFO L280 TraceCheckUtils]: 13: Hoare triple {6086#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6087#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:42,221 INFO L280 TraceCheckUtils]: 14: Hoare triple {6087#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6087#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:42,222 INFO L280 TraceCheckUtils]: 15: Hoare triple {6087#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6088#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:42,222 INFO L280 TraceCheckUtils]: 16: Hoare triple {6088#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6088#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:42,223 INFO L280 TraceCheckUtils]: 17: Hoare triple {6088#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6089#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:42,223 INFO L280 TraceCheckUtils]: 18: Hoare triple {6089#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6089#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:42,224 INFO L280 TraceCheckUtils]: 19: Hoare triple {6089#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6090#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:42,224 INFO L280 TraceCheckUtils]: 20: Hoare triple {6090#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6090#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:42,224 INFO L280 TraceCheckUtils]: 21: Hoare triple {6090#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6091#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:42,225 INFO L280 TraceCheckUtils]: 22: Hoare triple {6091#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6091#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:42,225 INFO L280 TraceCheckUtils]: 23: Hoare triple {6091#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6092#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:42,226 INFO L280 TraceCheckUtils]: 24: Hoare triple {6092#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6092#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:42,226 INFO L280 TraceCheckUtils]: 25: Hoare triple {6092#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6093#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:42,227 INFO L280 TraceCheckUtils]: 26: Hoare triple {6093#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6093#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:42,227 INFO L280 TraceCheckUtils]: 27: Hoare triple {6093#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6094#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:42,228 INFO L280 TraceCheckUtils]: 28: Hoare triple {6094#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6094#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:42,228 INFO L280 TraceCheckUtils]: 29: Hoare triple {6094#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6095#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:42,229 INFO L280 TraceCheckUtils]: 30: Hoare triple {6095#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6095#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:42,229 INFO L280 TraceCheckUtils]: 31: Hoare triple {6095#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6096#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:42,230 INFO L280 TraceCheckUtils]: 32: Hoare triple {6096#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6096#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:42,231 INFO L280 TraceCheckUtils]: 33: Hoare triple {6096#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6097#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:42,231 INFO L280 TraceCheckUtils]: 34: Hoare triple {6097#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6097#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:42,232 INFO L280 TraceCheckUtils]: 35: Hoare triple {6097#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6098#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:42,232 INFO L280 TraceCheckUtils]: 36: Hoare triple {6098#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6098#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:42,233 INFO L280 TraceCheckUtils]: 37: Hoare triple {6098#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6099#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:42,233 INFO L280 TraceCheckUtils]: 38: Hoare triple {6099#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6099#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:42,234 INFO L280 TraceCheckUtils]: 39: Hoare triple {6099#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6100#(<= main_~j~0 17)} is VALID [2020-07-08 12:25:42,234 INFO L280 TraceCheckUtils]: 40: Hoare triple {6100#(<= main_~j~0 17)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6100#(<= main_~j~0 17)} is VALID [2020-07-08 12:25:42,235 INFO L280 TraceCheckUtils]: 41: Hoare triple {6100#(<= main_~j~0 17)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6101#(<= main_~j~0 18)} is VALID [2020-07-08 12:25:42,235 INFO L280 TraceCheckUtils]: 42: Hoare triple {6101#(<= main_~j~0 18)} assume !(~j~0 < 20); {6079#false} is VALID [2020-07-08 12:25:42,235 INFO L280 TraceCheckUtils]: 43: Hoare triple {6079#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {6079#false} is VALID [2020-07-08 12:25:42,235 INFO L280 TraceCheckUtils]: 44: Hoare triple {6079#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {6079#false} is VALID [2020-07-08 12:25:42,236 INFO L280 TraceCheckUtils]: 45: Hoare triple {6079#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {6079#false} is VALID [2020-07-08 12:25:42,236 INFO L280 TraceCheckUtils]: 46: Hoare triple {6079#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6079#false} is VALID [2020-07-08 12:25:42,236 INFO L263 TraceCheckUtils]: 47: Hoare triple {6079#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {6078#true} is VALID [2020-07-08 12:25:42,236 INFO L280 TraceCheckUtils]: 48: Hoare triple {6078#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6078#true} is VALID [2020-07-08 12:25:42,236 INFO L280 TraceCheckUtils]: 49: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-08 12:25:42,236 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {6078#true} {6079#false} #57#return; {6079#false} is VALID [2020-07-08 12:25:42,236 INFO L280 TraceCheckUtils]: 51: Hoare triple {6079#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6079#false} is VALID [2020-07-08 12:25:42,236 INFO L280 TraceCheckUtils]: 52: Hoare triple {6079#false} assume 0 == #t~ret8;havoc #t~ret8; {6079#false} is VALID [2020-07-08 12:25:42,237 INFO L280 TraceCheckUtils]: 53: Hoare triple {6079#false} assume !false; {6079#false} is VALID [2020-07-08 12:25:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:42,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715249301] [2020-07-08 12:25:42,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116749235] [2020-07-08 12:25:42,240 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:49,680 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2020-07-08 12:25:49,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:25:49,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-08 12:25:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:49,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:49,947 INFO L263 TraceCheckUtils]: 0: Hoare triple {6078#true} call ULTIMATE.init(); {6078#true} is VALID [2020-07-08 12:25:49,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {6078#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6078#true} is VALID [2020-07-08 12:25:49,947 INFO L280 TraceCheckUtils]: 2: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-08 12:25:49,948 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6078#true} {6078#true} #53#return; {6078#true} is VALID [2020-07-08 12:25:49,948 INFO L263 TraceCheckUtils]: 4: Hoare triple {6078#true} call #t~ret9 := main(); {6078#true} is VALID [2020-07-08 12:25:49,949 INFO L280 TraceCheckUtils]: 5: Hoare triple {6078#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {6124#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:49,949 INFO L280 TraceCheckUtils]: 6: Hoare triple {6124#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6124#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:49,956 INFO L280 TraceCheckUtils]: 7: Hoare triple {6124#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6084#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:49,957 INFO L280 TraceCheckUtils]: 8: Hoare triple {6084#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6084#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:49,957 INFO L280 TraceCheckUtils]: 9: Hoare triple {6084#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6085#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:49,958 INFO L280 TraceCheckUtils]: 10: Hoare triple {6085#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6085#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:49,958 INFO L280 TraceCheckUtils]: 11: Hoare triple {6085#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6086#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:49,959 INFO L280 TraceCheckUtils]: 12: Hoare triple {6086#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6086#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:49,960 INFO L280 TraceCheckUtils]: 13: Hoare triple {6086#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6087#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:49,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {6087#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6087#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:49,961 INFO L280 TraceCheckUtils]: 15: Hoare triple {6087#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6088#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:49,961 INFO L280 TraceCheckUtils]: 16: Hoare triple {6088#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6088#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:49,962 INFO L280 TraceCheckUtils]: 17: Hoare triple {6088#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6089#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:49,962 INFO L280 TraceCheckUtils]: 18: Hoare triple {6089#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6089#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:49,963 INFO L280 TraceCheckUtils]: 19: Hoare triple {6089#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6090#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:49,963 INFO L280 TraceCheckUtils]: 20: Hoare triple {6090#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6090#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:49,964 INFO L280 TraceCheckUtils]: 21: Hoare triple {6090#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6091#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:49,964 INFO L280 TraceCheckUtils]: 22: Hoare triple {6091#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6091#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:49,965 INFO L280 TraceCheckUtils]: 23: Hoare triple {6091#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6092#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:49,965 INFO L280 TraceCheckUtils]: 24: Hoare triple {6092#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6092#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:49,966 INFO L280 TraceCheckUtils]: 25: Hoare triple {6092#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6093#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:49,966 INFO L280 TraceCheckUtils]: 26: Hoare triple {6093#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6093#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:49,966 INFO L280 TraceCheckUtils]: 27: Hoare triple {6093#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6094#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:49,967 INFO L280 TraceCheckUtils]: 28: Hoare triple {6094#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6094#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:49,967 INFO L280 TraceCheckUtils]: 29: Hoare triple {6094#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6095#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:49,968 INFO L280 TraceCheckUtils]: 30: Hoare triple {6095#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6095#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:49,968 INFO L280 TraceCheckUtils]: 31: Hoare triple {6095#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6096#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:49,969 INFO L280 TraceCheckUtils]: 32: Hoare triple {6096#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6096#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:49,969 INFO L280 TraceCheckUtils]: 33: Hoare triple {6096#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6097#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:49,969 INFO L280 TraceCheckUtils]: 34: Hoare triple {6097#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6097#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:49,970 INFO L280 TraceCheckUtils]: 35: Hoare triple {6097#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6098#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:49,970 INFO L280 TraceCheckUtils]: 36: Hoare triple {6098#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6098#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:49,971 INFO L280 TraceCheckUtils]: 37: Hoare triple {6098#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6099#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:49,971 INFO L280 TraceCheckUtils]: 38: Hoare triple {6099#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6099#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:49,972 INFO L280 TraceCheckUtils]: 39: Hoare triple {6099#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6100#(<= main_~j~0 17)} is VALID [2020-07-08 12:25:49,972 INFO L280 TraceCheckUtils]: 40: Hoare triple {6100#(<= main_~j~0 17)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6100#(<= main_~j~0 17)} is VALID [2020-07-08 12:25:49,973 INFO L280 TraceCheckUtils]: 41: Hoare triple {6100#(<= main_~j~0 17)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6101#(<= main_~j~0 18)} is VALID [2020-07-08 12:25:49,973 INFO L280 TraceCheckUtils]: 42: Hoare triple {6101#(<= main_~j~0 18)} assume !(~j~0 < 20); {6079#false} is VALID [2020-07-08 12:25:49,973 INFO L280 TraceCheckUtils]: 43: Hoare triple {6079#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {6079#false} is VALID [2020-07-08 12:25:49,973 INFO L280 TraceCheckUtils]: 44: Hoare triple {6079#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {6079#false} is VALID [2020-07-08 12:25:49,974 INFO L280 TraceCheckUtils]: 45: Hoare triple {6079#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {6079#false} is VALID [2020-07-08 12:25:49,974 INFO L280 TraceCheckUtils]: 46: Hoare triple {6079#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6079#false} is VALID [2020-07-08 12:25:49,974 INFO L263 TraceCheckUtils]: 47: Hoare triple {6079#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {6079#false} is VALID [2020-07-08 12:25:49,974 INFO L280 TraceCheckUtils]: 48: Hoare triple {6079#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6079#false} is VALID [2020-07-08 12:25:49,974 INFO L280 TraceCheckUtils]: 49: Hoare triple {6079#false} assume true; {6079#false} is VALID [2020-07-08 12:25:49,974 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {6079#false} {6079#false} #57#return; {6079#false} is VALID [2020-07-08 12:25:49,974 INFO L280 TraceCheckUtils]: 51: Hoare triple {6079#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6079#false} is VALID [2020-07-08 12:25:49,974 INFO L280 TraceCheckUtils]: 52: Hoare triple {6079#false} assume 0 == #t~ret8;havoc #t~ret8; {6079#false} is VALID [2020-07-08 12:25:49,975 INFO L280 TraceCheckUtils]: 53: Hoare triple {6079#false} assume !false; {6079#false} is VALID [2020-07-08 12:25:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:49,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:49,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 23 [2020-07-08 12:25:49,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372957813] [2020-07-08 12:25:49,978 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2020-07-08 12:25:49,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:49,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2020-07-08 12:25:50,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:50,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-08 12:25:50,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:50,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-08 12:25:50,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2020-07-08 12:25:50,062 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 23 states. [2020-07-08 12:25:50,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:50,591 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-07-08 12:25:50,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-08 12:25:50,591 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2020-07-08 12:25:50,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 12:25:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2020-07-08 12:25:50,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 12:25:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2020-07-08 12:25:50,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 72 transitions. [2020-07-08 12:25:50,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:50,695 INFO L225 Difference]: With dead ends: 70 [2020-07-08 12:25:50,695 INFO L226 Difference]: Without dead ends: 58 [2020-07-08 12:25:50,696 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2020-07-08 12:25:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-08 12:25:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-07-08 12:25:50,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:50,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2020-07-08 12:25:50,721 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2020-07-08 12:25:50,721 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2020-07-08 12:25:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:50,725 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-07-08 12:25:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-08 12:25:50,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:50,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:50,726 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2020-07-08 12:25:50,726 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2020-07-08 12:25:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:50,727 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-07-08 12:25:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-08 12:25:50,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:50,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:50,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:50,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:50,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-08 12:25:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-07-08 12:25:50,731 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2020-07-08 12:25:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:50,732 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-07-08 12:25:50,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-08 12:25:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-08 12:25:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-08 12:25:50,733 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:50,733 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:50,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:50,944 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:50,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:50,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1886121553, now seen corresponding path program 19 times [2020-07-08 12:25:50,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:50,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41515059] [2020-07-08 12:25:50,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:51,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {6599#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6571#true} is VALID [2020-07-08 12:25:51,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-08 12:25:51,308 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6571#true} {6571#true} #53#return; {6571#true} is VALID [2020-07-08 12:25:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:51,312 INFO L280 TraceCheckUtils]: 0: Hoare triple {6571#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6571#true} is VALID [2020-07-08 12:25:51,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-08 12:25:51,313 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6571#true} {6572#false} #57#return; {6572#false} is VALID [2020-07-08 12:25:51,314 INFO L263 TraceCheckUtils]: 0: Hoare triple {6571#true} call ULTIMATE.init(); {6599#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:51,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {6599#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6571#true} is VALID [2020-07-08 12:25:51,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-08 12:25:51,314 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6571#true} {6571#true} #53#return; {6571#true} is VALID [2020-07-08 12:25:51,315 INFO L263 TraceCheckUtils]: 4: Hoare triple {6571#true} call #t~ret9 := main(); {6571#true} is VALID [2020-07-08 12:25:51,316 INFO L280 TraceCheckUtils]: 5: Hoare triple {6571#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {6576#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:51,316 INFO L280 TraceCheckUtils]: 6: Hoare triple {6576#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6576#(= 0 main_~j~0)} is VALID [2020-07-08 12:25:51,317 INFO L280 TraceCheckUtils]: 7: Hoare triple {6576#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6577#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:51,317 INFO L280 TraceCheckUtils]: 8: Hoare triple {6577#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6577#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:51,318 INFO L280 TraceCheckUtils]: 9: Hoare triple {6577#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6578#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:51,319 INFO L280 TraceCheckUtils]: 10: Hoare triple {6578#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6578#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:51,319 INFO L280 TraceCheckUtils]: 11: Hoare triple {6578#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6579#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:51,320 INFO L280 TraceCheckUtils]: 12: Hoare triple {6579#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6579#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:51,321 INFO L280 TraceCheckUtils]: 13: Hoare triple {6579#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6580#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:51,321 INFO L280 TraceCheckUtils]: 14: Hoare triple {6580#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6580#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:51,322 INFO L280 TraceCheckUtils]: 15: Hoare triple {6580#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6581#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:51,323 INFO L280 TraceCheckUtils]: 16: Hoare triple {6581#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6581#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:51,323 INFO L280 TraceCheckUtils]: 17: Hoare triple {6581#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6582#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:51,324 INFO L280 TraceCheckUtils]: 18: Hoare triple {6582#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6582#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:51,324 INFO L280 TraceCheckUtils]: 19: Hoare triple {6582#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6583#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:51,325 INFO L280 TraceCheckUtils]: 20: Hoare triple {6583#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6583#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:51,326 INFO L280 TraceCheckUtils]: 21: Hoare triple {6583#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6584#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:51,326 INFO L280 TraceCheckUtils]: 22: Hoare triple {6584#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6584#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:51,327 INFO L280 TraceCheckUtils]: 23: Hoare triple {6584#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6585#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:51,328 INFO L280 TraceCheckUtils]: 24: Hoare triple {6585#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6585#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:51,328 INFO L280 TraceCheckUtils]: 25: Hoare triple {6585#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6586#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:51,329 INFO L280 TraceCheckUtils]: 26: Hoare triple {6586#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6586#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:51,330 INFO L280 TraceCheckUtils]: 27: Hoare triple {6586#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6587#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:51,330 INFO L280 TraceCheckUtils]: 28: Hoare triple {6587#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6587#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:51,331 INFO L280 TraceCheckUtils]: 29: Hoare triple {6587#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6588#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:51,331 INFO L280 TraceCheckUtils]: 30: Hoare triple {6588#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6588#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:51,332 INFO L280 TraceCheckUtils]: 31: Hoare triple {6588#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6589#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:51,333 INFO L280 TraceCheckUtils]: 32: Hoare triple {6589#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6589#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:51,333 INFO L280 TraceCheckUtils]: 33: Hoare triple {6589#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6590#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:51,334 INFO L280 TraceCheckUtils]: 34: Hoare triple {6590#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6590#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:51,335 INFO L280 TraceCheckUtils]: 35: Hoare triple {6590#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6591#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:51,335 INFO L280 TraceCheckUtils]: 36: Hoare triple {6591#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6591#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:51,336 INFO L280 TraceCheckUtils]: 37: Hoare triple {6591#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6592#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:51,336 INFO L280 TraceCheckUtils]: 38: Hoare triple {6592#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6592#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:51,337 INFO L280 TraceCheckUtils]: 39: Hoare triple {6592#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6593#(<= main_~j~0 17)} is VALID [2020-07-08 12:25:51,338 INFO L280 TraceCheckUtils]: 40: Hoare triple {6593#(<= main_~j~0 17)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6593#(<= main_~j~0 17)} is VALID [2020-07-08 12:25:51,341 INFO L280 TraceCheckUtils]: 41: Hoare triple {6593#(<= main_~j~0 17)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6594#(<= main_~j~0 18)} is VALID [2020-07-08 12:25:51,342 INFO L280 TraceCheckUtils]: 42: Hoare triple {6594#(<= main_~j~0 18)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6594#(<= main_~j~0 18)} is VALID [2020-07-08 12:25:51,343 INFO L280 TraceCheckUtils]: 43: Hoare triple {6594#(<= main_~j~0 18)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6595#(<= main_~j~0 19)} is VALID [2020-07-08 12:25:51,343 INFO L280 TraceCheckUtils]: 44: Hoare triple {6595#(<= main_~j~0 19)} assume !(~j~0 < 20); {6572#false} is VALID [2020-07-08 12:25:51,344 INFO L280 TraceCheckUtils]: 45: Hoare triple {6572#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {6572#false} is VALID [2020-07-08 12:25:51,344 INFO L280 TraceCheckUtils]: 46: Hoare triple {6572#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {6572#false} is VALID [2020-07-08 12:25:51,344 INFO L280 TraceCheckUtils]: 47: Hoare triple {6572#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {6572#false} is VALID [2020-07-08 12:25:51,344 INFO L280 TraceCheckUtils]: 48: Hoare triple {6572#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6572#false} is VALID [2020-07-08 12:25:51,344 INFO L263 TraceCheckUtils]: 49: Hoare triple {6572#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {6571#true} is VALID [2020-07-08 12:25:51,345 INFO L280 TraceCheckUtils]: 50: Hoare triple {6571#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6571#true} is VALID [2020-07-08 12:25:51,345 INFO L280 TraceCheckUtils]: 51: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-08 12:25:51,345 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {6571#true} {6572#false} #57#return; {6572#false} is VALID [2020-07-08 12:25:51,345 INFO L280 TraceCheckUtils]: 53: Hoare triple {6572#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6572#false} is VALID [2020-07-08 12:25:51,345 INFO L280 TraceCheckUtils]: 54: Hoare triple {6572#false} assume 0 == #t~ret8;havoc #t~ret8; {6572#false} is VALID [2020-07-08 12:25:51,345 INFO L280 TraceCheckUtils]: 55: Hoare triple {6572#false} assume !false; {6572#false} is VALID [2020-07-08 12:25:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:51,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41515059] [2020-07-08 12:25:51,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030465040] [2020-07-08 12:25:51,349 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:51,411 INFO L264 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-08 12:25:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:51,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:25:51,619 INFO L263 TraceCheckUtils]: 0: Hoare triple {6571#true} call ULTIMATE.init(); {6571#true} is VALID [2020-07-08 12:25:51,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {6571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6571#true} is VALID [2020-07-08 12:25:51,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-08 12:25:51,619 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6571#true} {6571#true} #53#return; {6571#true} is VALID [2020-07-08 12:25:51,619 INFO L263 TraceCheckUtils]: 4: Hoare triple {6571#true} call #t~ret9 := main(); {6571#true} is VALID [2020-07-08 12:25:51,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {6571#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {6618#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:51,621 INFO L280 TraceCheckUtils]: 6: Hoare triple {6618#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6618#(<= main_~j~0 0)} is VALID [2020-07-08 12:25:51,622 INFO L280 TraceCheckUtils]: 7: Hoare triple {6618#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6577#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:51,622 INFO L280 TraceCheckUtils]: 8: Hoare triple {6577#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6577#(<= main_~j~0 1)} is VALID [2020-07-08 12:25:51,623 INFO L280 TraceCheckUtils]: 9: Hoare triple {6577#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6578#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:51,623 INFO L280 TraceCheckUtils]: 10: Hoare triple {6578#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6578#(<= main_~j~0 2)} is VALID [2020-07-08 12:25:51,624 INFO L280 TraceCheckUtils]: 11: Hoare triple {6578#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6579#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:51,625 INFO L280 TraceCheckUtils]: 12: Hoare triple {6579#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6579#(<= main_~j~0 3)} is VALID [2020-07-08 12:25:51,625 INFO L280 TraceCheckUtils]: 13: Hoare triple {6579#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6580#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:51,626 INFO L280 TraceCheckUtils]: 14: Hoare triple {6580#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6580#(<= main_~j~0 4)} is VALID [2020-07-08 12:25:51,626 INFO L280 TraceCheckUtils]: 15: Hoare triple {6580#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6581#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:51,627 INFO L280 TraceCheckUtils]: 16: Hoare triple {6581#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6581#(<= main_~j~0 5)} is VALID [2020-07-08 12:25:51,628 INFO L280 TraceCheckUtils]: 17: Hoare triple {6581#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6582#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:51,628 INFO L280 TraceCheckUtils]: 18: Hoare triple {6582#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6582#(<= main_~j~0 6)} is VALID [2020-07-08 12:25:51,629 INFO L280 TraceCheckUtils]: 19: Hoare triple {6582#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6583#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:51,629 INFO L280 TraceCheckUtils]: 20: Hoare triple {6583#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6583#(<= main_~j~0 7)} is VALID [2020-07-08 12:25:51,630 INFO L280 TraceCheckUtils]: 21: Hoare triple {6583#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6584#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:51,631 INFO L280 TraceCheckUtils]: 22: Hoare triple {6584#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6584#(<= main_~j~0 8)} is VALID [2020-07-08 12:25:51,631 INFO L280 TraceCheckUtils]: 23: Hoare triple {6584#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6585#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:51,632 INFO L280 TraceCheckUtils]: 24: Hoare triple {6585#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6585#(<= main_~j~0 9)} is VALID [2020-07-08 12:25:51,633 INFO L280 TraceCheckUtils]: 25: Hoare triple {6585#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6586#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:51,633 INFO L280 TraceCheckUtils]: 26: Hoare triple {6586#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6586#(<= main_~j~0 10)} is VALID [2020-07-08 12:25:51,634 INFO L280 TraceCheckUtils]: 27: Hoare triple {6586#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6587#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:51,635 INFO L280 TraceCheckUtils]: 28: Hoare triple {6587#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6587#(<= main_~j~0 11)} is VALID [2020-07-08 12:25:51,635 INFO L280 TraceCheckUtils]: 29: Hoare triple {6587#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6588#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:51,636 INFO L280 TraceCheckUtils]: 30: Hoare triple {6588#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6588#(<= main_~j~0 12)} is VALID [2020-07-08 12:25:51,636 INFO L280 TraceCheckUtils]: 31: Hoare triple {6588#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6589#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:51,637 INFO L280 TraceCheckUtils]: 32: Hoare triple {6589#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6589#(<= main_~j~0 13)} is VALID [2020-07-08 12:25:51,638 INFO L280 TraceCheckUtils]: 33: Hoare triple {6589#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6590#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:51,638 INFO L280 TraceCheckUtils]: 34: Hoare triple {6590#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6590#(<= main_~j~0 14)} is VALID [2020-07-08 12:25:51,639 INFO L280 TraceCheckUtils]: 35: Hoare triple {6590#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6591#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:51,639 INFO L280 TraceCheckUtils]: 36: Hoare triple {6591#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6591#(<= main_~j~0 15)} is VALID [2020-07-08 12:25:51,640 INFO L280 TraceCheckUtils]: 37: Hoare triple {6591#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6592#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:51,641 INFO L280 TraceCheckUtils]: 38: Hoare triple {6592#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6592#(<= main_~j~0 16)} is VALID [2020-07-08 12:25:51,641 INFO L280 TraceCheckUtils]: 39: Hoare triple {6592#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6593#(<= main_~j~0 17)} is VALID [2020-07-08 12:25:51,642 INFO L280 TraceCheckUtils]: 40: Hoare triple {6593#(<= main_~j~0 17)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6593#(<= main_~j~0 17)} is VALID [2020-07-08 12:25:51,643 INFO L280 TraceCheckUtils]: 41: Hoare triple {6593#(<= main_~j~0 17)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6594#(<= main_~j~0 18)} is VALID [2020-07-08 12:25:51,643 INFO L280 TraceCheckUtils]: 42: Hoare triple {6594#(<= main_~j~0 18)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6594#(<= main_~j~0 18)} is VALID [2020-07-08 12:25:51,644 INFO L280 TraceCheckUtils]: 43: Hoare triple {6594#(<= main_~j~0 18)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6595#(<= main_~j~0 19)} is VALID [2020-07-08 12:25:51,645 INFO L280 TraceCheckUtils]: 44: Hoare triple {6595#(<= main_~j~0 19)} assume !(~j~0 < 20); {6572#false} is VALID [2020-07-08 12:25:51,645 INFO L280 TraceCheckUtils]: 45: Hoare triple {6572#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {6572#false} is VALID [2020-07-08 12:25:51,645 INFO L280 TraceCheckUtils]: 46: Hoare triple {6572#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {6572#false} is VALID [2020-07-08 12:25:51,645 INFO L280 TraceCheckUtils]: 47: Hoare triple {6572#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {6572#false} is VALID [2020-07-08 12:25:51,645 INFO L280 TraceCheckUtils]: 48: Hoare triple {6572#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6572#false} is VALID [2020-07-08 12:25:51,646 INFO L263 TraceCheckUtils]: 49: Hoare triple {6572#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {6572#false} is VALID [2020-07-08 12:25:51,646 INFO L280 TraceCheckUtils]: 50: Hoare triple {6572#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6572#false} is VALID [2020-07-08 12:25:51,646 INFO L280 TraceCheckUtils]: 51: Hoare triple {6572#false} assume true; {6572#false} is VALID [2020-07-08 12:25:51,646 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {6572#false} {6572#false} #57#return; {6572#false} is VALID [2020-07-08 12:25:51,646 INFO L280 TraceCheckUtils]: 53: Hoare triple {6572#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6572#false} is VALID [2020-07-08 12:25:51,646 INFO L280 TraceCheckUtils]: 54: Hoare triple {6572#false} assume 0 == #t~ret8;havoc #t~ret8; {6572#false} is VALID [2020-07-08 12:25:51,647 INFO L280 TraceCheckUtils]: 55: Hoare triple {6572#false} assume !false; {6572#false} is VALID [2020-07-08 12:25:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:25:51,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:25:51,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 24 [2020-07-08 12:25:51,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489199894] [2020-07-08 12:25:51,653 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2020-07-08 12:25:51,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:51,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2020-07-08 12:25:51,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:51,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-08 12:25:51,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:51,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-08 12:25:51,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2020-07-08 12:25:51,736 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 24 states. [2020-07-08 12:25:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:52,008 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2020-07-08 12:25:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-08 12:25:52,008 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2020-07-08 12:25:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:25:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2020-07-08 12:25:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:25:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2020-07-08 12:25:52,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 73 transitions. [2020-07-08 12:25:52,120 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-08 12:25:52,121 INFO L225 Difference]: With dead ends: 71 [2020-07-08 12:25:52,121 INFO L226 Difference]: Without dead ends: 59 [2020-07-08 12:25:52,122 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2020-07-08 12:25:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-08 12:25:52,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-08 12:25:52,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:52,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-08 12:25:52,146 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-08 12:25:52,147 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-08 12:25:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:52,149 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-08 12:25:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-08 12:25:52,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:52,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:52,150 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-08 12:25:52,150 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-08 12:25:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:52,153 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-08 12:25:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-08 12:25:52,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:52,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:52,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:52,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-08 12:25:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-07-08 12:25:52,155 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2020-07-08 12:25:52,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:52,156 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-07-08 12:25:52,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-08 12:25:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-08 12:25:52,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-08 12:25:52,157 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:52,157 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:52,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:25:52,358 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:52,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:52,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2067273869, now seen corresponding path program 20 times [2020-07-08 12:25:52,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:52,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611854693] [2020-07-08 12:25:52,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:25:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:25:52,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:25:52,607 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:25:52,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-08 12:25:52,656 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:25:52,657 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:25:52,657 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:25:52,657 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:25:52,657 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2020-07-08 12:25:52,657 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:25:52,657 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:25:52,657 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:25:52,657 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-08 12:25:52,658 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-08 12:25:52,658 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-08 12:25:52,658 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2020-07-08 12:25:52,658 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:25:52,658 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:25:52,658 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2020-07-08 12:25:52,658 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-08 12:25:52,658 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-08 12:25:52,658 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:25:52,658 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:25:52,659 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 12:25:52,659 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2020-07-08 12:25:52,659 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2020-07-08 12:25:52,659 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-08 12:25:52,659 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-08 12:25:52,659 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-08 12:25:52,659 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-08 12:25:52,659 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-08 12:25:52,659 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-08 12:25:52,659 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-08 12:25:52,660 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:25:52,660 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 12:25:52,660 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 12:25:52,660 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:25:52,660 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-08 12:25:52,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:25:52 BoogieIcfgContainer [2020-07-08 12:25:52,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:25:52,666 INFO L168 Benchmark]: Toolchain (without parser) took 34885.21 ms. Allocated memory was 137.9 MB in the beginning and 397.9 MB in the end (delta: 260.0 MB). Free memory was 102.1 MB in the beginning and 219.0 MB in the end (delta: -116.9 MB). Peak memory consumption was 143.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:52,666 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:25:52,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.89 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 180.6 MB in the end (delta: -78.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:52,667 INFO L168 Benchmark]: Boogie Preprocessor took 51.42 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 178.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:52,668 INFO L168 Benchmark]: RCFGBuilder took 463.28 ms. Allocated memory is still 201.9 MB. Free memory was 178.3 MB in the beginning and 157.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:52,668 INFO L168 Benchmark]: TraceAbstraction took 34001.28 ms. Allocated memory was 201.9 MB in the beginning and 397.9 MB in the end (delta: 196.1 MB). Free memory was 156.3 MB in the beginning and 219.0 MB in the end (delta: -62.7 MB). Peak memory consumption was 133.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:52,670 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 363.89 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 180.6 MB in the end (delta: -78.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.42 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 178.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 463.28 ms. Allocated memory is still 201.9 MB. Free memory was 178.3 MB in the beginning and 157.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34001.28 ms. Allocated memory was 201.9 MB in the beginning and 397.9 MB in the end (delta: 196.1 MB). Free memory was 156.3 MB in the beginning and 219.0 MB in the end (delta: -62.7 MB). Peak memory consumption was 133.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] struct dummy ad1[20], *ad2; [L16] int i, j, *pa; [L17] j=0 VAL [ad1={2:0}, j=0] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=1] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=2] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=3] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=4] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=5] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=6] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=7] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=8] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=9] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=10] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=11] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=12] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=13] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=14] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=15] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=16] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=17] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=18] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=19] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=20] [L17] COND FALSE !(j<20) VAL [ad1={2:0}, j=20] [L21] i = __VERIFIER_nondet_int() [L22] COND TRUE i >= 0 && i < 10 [L23] ad2 = ad1 [L24] ad1[i].a = i [L25] pa = &ad1[i].a [L26] EXPR ad2[i].a [L26] i = ad2[i].a + 10 [L27] EXPR \read(*pa) VAL [\read(*pa)=0, ad1={2:0}, ad2={2:0}, i=10, j=20, pa={2:0}] [L27] COND FALSE !(i < *pa) [L30] CALL, EXPR check(ad1, i) VAL [\old(b)=10, ad1={2:0}] [L10] EXPR ad1[b].a [L10] return ad1[b].a == b; [L30] RET, EXPR check(ad1, i) VAL [ad1={2:0}, ad2={2:0}, check(ad1, i)=0, i=10, j=20, pa={2:0}] [L30] COND TRUE !check(ad1, i) [L37] __VERIFIER_error() VAL [ad1={2:0}, ad2={2:0}, i=10, j=20, pa={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 33.8s, OverallIterations: 22, TraceHistogramMax: 20, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 365 SDtfs, 252 SDslu, 2312 SDs, 0 SdLazy, 1465 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1039 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 19 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 11.4s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 1439 ConstructedInterpolants, 0 QuantifiedInterpolants, 131957 SizeOfPredicates, 19 NumberOfNonLiveVariables, 3097 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4940 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...