/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-8fc6572 [2020-07-10 15:06:51,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:06:51,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:06:51,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:06:51,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:06:51,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:06:51,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:06:51,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:06:51,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:06:51,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:06:51,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:06:51,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:06:51,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:06:51,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:06:51,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:06:51,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:06:51,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:06:51,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:06:51,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:06:51,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:06:51,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:06:51,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:06:51,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:06:51,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:06:51,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:06:51,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:06:51,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:06:51,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:06:51,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:06:51,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:06:51,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:06:51,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:06:51,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:06:51,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:06:51,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:06:51,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:06:51,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:06:51,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:06:51,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:06:51,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:06:51,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:06:51,369 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-10 15:06:51,383 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:06:51,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:06:51,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:06:51,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:06:51,385 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:06:51,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:06:51,386 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:06:51,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:06:51,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:06:51,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:06:51,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:06:51,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:06:51,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:06:51,387 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:06:51,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:06:51,388 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:06:51,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:06:51,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:06:51,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:06:51,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:06:51,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:06:51,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:06:51,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:06:51,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:06:51,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:06:51,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:06:51,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:06:51,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:06:51,390 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:06:51,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:06:51,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:06:51,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:06:51,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:06:51,710 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:06:51,710 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:06:51,711 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-10 15:06:51,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143e7ab5f/6f59bf0a04654b258da82617eed5af97/FLAGde29f2509 [2020-07-10 15:06:52,325 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:06:52,325 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test24-2.c [2020-07-10 15:06:52,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143e7ab5f/6f59bf0a04654b258da82617eed5af97/FLAGde29f2509 [2020-07-10 15:06:52,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143e7ab5f/6f59bf0a04654b258da82617eed5af97 [2020-07-10 15:06:52,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:06:52,693 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:06:52,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:06:52,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:06:52,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:06:52,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:06:52" (1/1) ... [2020-07-10 15:06:52,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f18f3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:52, skipping insertion in model container [2020-07-10 15:06:52,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:06:52" (1/1) ... [2020-07-10 15:06:52,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:06:52,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:06:52,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:06:52,943 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:06:52,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:06:52,984 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:06:52,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:52 WrapperNode [2020-07-10 15:06:52,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:06:52,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:06:52,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:06:52,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:06:53,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:52" (1/1) ... [2020-07-10 15:06:53,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:52" (1/1) ... [2020-07-10 15:06:53,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:52" (1/1) ... [2020-07-10 15:06:53,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:52" (1/1) ... [2020-07-10 15:06:53,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:52" (1/1) ... [2020-07-10 15:06:53,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:52" (1/1) ... [2020-07-10 15:06:53,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:52" (1/1) ... [2020-07-10 15:06:53,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:06:53,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:06:53,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:06:53,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:06:53,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:06:53,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:06:53,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:06:53,194 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-10 15:06:53,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:06:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:06:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:06:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-10 15:06:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:06:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:06:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:06:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:06:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:06:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:06:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:06:53,569 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:06:53,570 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:06:53,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:06:53 BoogieIcfgContainer [2020-07-10 15:06:53,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:06:53,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:06:53,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:06:53,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:06:53,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:06:52" (1/3) ... [2020-07-10 15:06:53,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:06:53, skipping insertion in model container [2020-07-10 15:06:53,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:52" (2/3) ... [2020-07-10 15:06:53,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:06:53, skipping insertion in model container [2020-07-10 15:06:53,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:06:53" (3/3) ... [2020-07-10 15:06:53,584 INFO L109 eAbstractionObserver]: Analyzing ICFG test24-2.c [2020-07-10 15:06:53,596 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:06:53,604 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:06:53,618 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:06:53,639 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:06:53,639 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:06:53,640 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:06:53,640 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:06:53,640 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:06:53,640 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:06:53,640 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:06:53,641 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:06:53,658 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-10 15:06:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:06:53,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:53,664 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:06:53,665 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:53,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:53,671 INFO L82 PathProgramCache]: Analyzing trace with hash 855240046, now seen corresponding path program 1 times [2020-07-10 15:06:53,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:53,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99104677] [2020-07-10 15:06:53,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:53,897 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-10 15:06:53,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-10 15:06:53,899 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #53#return; {28#true} is VALID [2020-07-10 15:06:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:53,928 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-10 15:06:53,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-10 15:06:53,929 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {29#false} #57#return; {29#false} is VALID [2020-07-10 15:06:53,932 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-10 15:06:53,933 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-10 15:06:53,933 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-10 15:06:53,933 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #53#return; {28#true} is VALID [2020-07-10 15:06:53,934 INFO L263 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2020-07-10 15:06:53,934 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-10 15:06:53,936 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2020-07-10 15:06:53,936 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-10 15:06:53,937 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-10 15:06:53,937 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#false} assume !true; {29#false} is VALID [2020-07-10 15:06:53,938 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-10 15:06:53,938 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-10 15:06:53,939 INFO L280 TraceCheckUtils]: 12: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-10 15:06:53,939 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {28#true} {29#false} #57#return; {29#false} is VALID [2020-07-10 15:06:53,939 INFO L280 TraceCheckUtils]: 14: Hoare triple {29#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {29#false} is VALID [2020-07-10 15:06:53,940 INFO L280 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == #t~ret8;havoc #t~ret8; {29#false} is VALID [2020-07-10 15:06:53,940 INFO L280 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-10 15:06:53,944 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-10 15:06:53,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99104677] [2020-07-10 15:06:53,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:53,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:06:53,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514158988] [2020-07-10 15:06:53,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:06:53,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:53,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:06:54,027 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-10 15:06:54,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:06:54,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:54,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:06:54,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:06:54,039 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-07-10 15:06:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:54,208 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2020-07-10 15:06:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:06:54,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:06:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:06:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2020-07-10 15:06:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:06:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2020-07-10 15:06:54,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2020-07-10 15:06:54,324 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-10 15:06:54,336 INFO L225 Difference]: With dead ends: 42 [2020-07-10 15:06:54,337 INFO L226 Difference]: Without dead ends: 20 [2020-07-10 15:06:54,341 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-10 15:06:54,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-10 15:06:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-10 15:06:54,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:54,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-10 15:06:54,394 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 15:06:54,394 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 15:06:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:54,398 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-10 15:06:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-10 15:06:54,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:54,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:54,399 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 15:06:54,399 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 15:06:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:54,404 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-10 15:06:54,404 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-10 15:06:54,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:54,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:54,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:54,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:06:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-10 15:06:54,410 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2020-07-10 15:06:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:54,411 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-10 15:06:54,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:06:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-10 15:06:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:06:54,412 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:54,413 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-10 15:06:54,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:06:54,414 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:54,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:54,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1631497781, now seen corresponding path program 1 times [2020-07-10 15:06:54,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:54,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638058854] [2020-07-10 15:06:54,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:54,509 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-10 15:06:54,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-10 15:06:54,510 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #53#return; {163#true} is VALID [2020-07-10 15:06:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:54,521 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-10 15:06:54,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-10 15:06:54,522 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {163#true} {164#false} #57#return; {164#false} is VALID [2020-07-10 15:06:54,524 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-10 15:06:54,524 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-10 15:06:54,525 INFO L280 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-10 15:06:54,525 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #53#return; {163#true} is VALID [2020-07-10 15:06:54,525 INFO L263 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret9 := main(); {163#true} is VALID [2020-07-10 15:06:54,527 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-10 15:06:54,528 INFO L280 TraceCheckUtils]: 6: Hoare triple {168#(= 0 main_~j~0)} assume !(~j~0 < 20); {164#false} is VALID [2020-07-10 15:06:54,528 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-10 15:06:54,528 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-10 15:06:54,529 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-10 15:06:54,529 INFO L280 TraceCheckUtils]: 10: Hoare triple {164#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {164#false} is VALID [2020-07-10 15:06:54,530 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-10 15:06:54,530 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-10 15:06:54,530 INFO L280 TraceCheckUtils]: 13: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-10 15:06:54,531 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {163#true} {164#false} #57#return; {164#false} is VALID [2020-07-10 15:06:54,531 INFO L280 TraceCheckUtils]: 15: Hoare triple {164#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {164#false} is VALID [2020-07-10 15:06:54,531 INFO L280 TraceCheckUtils]: 16: Hoare triple {164#false} assume 0 == #t~ret8;havoc #t~ret8; {164#false} is VALID [2020-07-10 15:06:54,532 INFO L280 TraceCheckUtils]: 17: Hoare triple {164#false} assume !false; {164#false} is VALID [2020-07-10 15:06:54,533 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-10 15:06:54,534 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638058854] [2020-07-10 15:06:54,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:54,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:06:54,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543321482] [2020-07-10 15:06:54,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-10 15:06:54,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:54,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:06:54,582 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-10 15:06:54,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:06:54,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:54,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:06:54,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:06:54,583 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2020-07-10 15:06:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:54,723 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-10 15:06:54,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:06:54,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-10 15:06:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:06:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2020-07-10 15:06:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:06:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2020-07-10 15:06:54,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2020-07-10 15:06:54,788 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-10 15:06:54,790 INFO L225 Difference]: With dead ends: 34 [2020-07-10 15:06:54,790 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 15:06:54,791 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-10 15:06:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 15:06:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-10 15:06:54,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:54,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-10 15:06:54,816 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-10 15:06:54,816 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-10 15:06:54,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:54,820 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:06:54,820 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:06:54,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:54,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:54,821 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-10 15:06:54,822 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-10 15:06:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:54,826 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:06:54,827 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:06:54,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:54,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:54,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:54,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:06:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-10 15:06:54,832 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2020-07-10 15:06:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:54,833 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-10 15:06:54,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:06:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-10 15:06:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:06:54,835 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:54,835 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-10 15:06:54,835 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:06:54,835 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1934775405, now seen corresponding path program 1 times [2020-07-10 15:06:54,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:54,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028781127] [2020-07-10 15:06:54,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:54,971 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-10 15:06:54,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-10 15:06:54,972 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {298#true} {298#true} #53#return; {298#true} is VALID [2020-07-10 15:06:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:54,981 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-10 15:06:54,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-10 15:06:54,982 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {298#true} {299#false} #57#return; {299#false} is VALID [2020-07-10 15:06:54,983 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-10 15:06:54,984 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-10 15:06:54,984 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-10 15:06:54,984 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {298#true} {298#true} #53#return; {298#true} is VALID [2020-07-10 15:06:54,984 INFO L263 TraceCheckUtils]: 4: Hoare triple {298#true} call #t~ret9 := main(); {298#true} is VALID [2020-07-10 15:06:54,986 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-10 15:06:54,987 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-10 15:06:54,988 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-10 15:06:54,989 INFO L280 TraceCheckUtils]: 8: Hoare triple {304#(<= main_~j~0 1)} assume !(~j~0 < 20); {299#false} is VALID [2020-07-10 15:06:54,990 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-10 15:06:54,990 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-10 15:06:54,990 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-10 15:06:54,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {299#false} is VALID [2020-07-10 15:06:54,991 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-10 15:06:54,991 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-10 15:06:54,992 INFO L280 TraceCheckUtils]: 15: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-10 15:06:54,992 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {298#true} {299#false} #57#return; {299#false} is VALID [2020-07-10 15:06:54,992 INFO L280 TraceCheckUtils]: 17: Hoare triple {299#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {299#false} is VALID [2020-07-10 15:06:54,992 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#false} assume 0 == #t~ret8;havoc #t~ret8; {299#false} is VALID [2020-07-10 15:06:54,993 INFO L280 TraceCheckUtils]: 19: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-10 15:06:54,994 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-10 15:06:54,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028781127] [2020-07-10 15:06:54,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770702507] [2020-07-10 15:06:54,995 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-10 15:06:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:55,052 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:06:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:55,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:06:55,154 INFO L263 TraceCheckUtils]: 0: Hoare triple {298#true} call ULTIMATE.init(); {298#true} is VALID [2020-07-10 15:06:55,155 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-10 15:06:55,155 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-10 15:06:55,156 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {298#true} {298#true} #53#return; {298#true} is VALID [2020-07-10 15:06:55,156 INFO L263 TraceCheckUtils]: 4: Hoare triple {298#true} call #t~ret9 := main(); {298#true} is VALID [2020-07-10 15:06:55,157 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-10 15:06:55,158 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-10 15:06:55,159 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-10 15:06:55,160 INFO L280 TraceCheckUtils]: 8: Hoare triple {304#(<= main_~j~0 1)} assume !(~j~0 < 20); {299#false} is VALID [2020-07-10 15:06:55,160 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-10 15:06:55,161 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-10 15:06:55,161 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-10 15:06:55,161 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {299#false} is VALID [2020-07-10 15:06:55,161 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-10 15:06:55,162 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-10 15:06:55,162 INFO L280 TraceCheckUtils]: 15: Hoare triple {299#false} assume true; {299#false} is VALID [2020-07-10 15:06:55,162 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {299#false} {299#false} #57#return; {299#false} is VALID [2020-07-10 15:06:55,163 INFO L280 TraceCheckUtils]: 17: Hoare triple {299#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {299#false} is VALID [2020-07-10 15:06:55,163 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#false} assume 0 == #t~ret8;havoc #t~ret8; {299#false} is VALID [2020-07-10 15:06:55,163 INFO L280 TraceCheckUtils]: 19: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-10 15:06:55,164 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-10 15:06:55,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:06:55,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-10 15:06:55,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858309782] [2020-07-10 15:06:55,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-10 15:06:55,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:55,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:06:55,211 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-10 15:06:55,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:06:55,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:55,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:06:55,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:06:55,212 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2020-07-10 15:06:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:55,348 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-10 15:06:55,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:06:55,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-10 15:06:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:06:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-10 15:06:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:06:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-10 15:06:55,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2020-07-10 15:06:55,418 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-10 15:06:55,420 INFO L225 Difference]: With dead ends: 36 [2020-07-10 15:06:55,420 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 15:06:55,420 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-10 15:06:55,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 15:06:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-10 15:06:55,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:55,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-10 15:06:55,440 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-10 15:06:55,440 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-10 15:06:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:55,442 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-10 15:06:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 15:06:55,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:55,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:55,443 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-10 15:06:55,444 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-10 15:06:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:55,446 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-10 15:06:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 15:06:55,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:55,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:55,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:55,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 15:06:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-10 15:06:55,450 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2020-07-10 15:06:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:55,450 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-10 15:06:55,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:06:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-10 15:06:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:06:55,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:55,452 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-10 15:06:55,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:06:55,666 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:55,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1739404943, now seen corresponding path program 2 times [2020-07-10 15:06:55,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:55,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813020019] [2020-07-10 15:06:55,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:55,762 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-10 15:06:55,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-10 15:06:55,762 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {502#true} {502#true} #53#return; {502#true} is VALID [2020-07-10 15:06:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:55,770 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-10 15:06:55,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-10 15:06:55,771 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {502#true} {503#false} #57#return; {503#false} is VALID [2020-07-10 15:06:55,773 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-10 15:06:55,773 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-10 15:06:55,773 INFO L280 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-10 15:06:55,774 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #53#return; {502#true} is VALID [2020-07-10 15:06:55,774 INFO L263 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret9 := main(); {502#true} is VALID [2020-07-10 15:06:55,775 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-10 15:06:55,776 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-10 15:06:55,777 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-10 15:06:55,777 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-10 15:06:55,778 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-10 15:06:55,779 INFO L280 TraceCheckUtils]: 10: Hoare triple {509#(<= main_~j~0 2)} assume !(~j~0 < 20); {503#false} is VALID [2020-07-10 15:06:55,780 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-10 15:06:55,780 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-10 15:06:55,780 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-10 15:06:55,781 INFO L280 TraceCheckUtils]: 14: Hoare triple {503#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {503#false} is VALID [2020-07-10 15:06:55,781 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-10 15:06:55,781 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-10 15:06:55,782 INFO L280 TraceCheckUtils]: 17: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-10 15:06:55,782 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {502#true} {503#false} #57#return; {503#false} is VALID [2020-07-10 15:06:55,782 INFO L280 TraceCheckUtils]: 19: Hoare triple {503#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {503#false} is VALID [2020-07-10 15:06:55,782 INFO L280 TraceCheckUtils]: 20: Hoare triple {503#false} assume 0 == #t~ret8;havoc #t~ret8; {503#false} is VALID [2020-07-10 15:06:55,783 INFO L280 TraceCheckUtils]: 21: Hoare triple {503#false} assume !false; {503#false} is VALID [2020-07-10 15:06:55,784 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-10 15:06:55,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813020019] [2020-07-10 15:06:55,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185846659] [2020-07-10 15:06:55,785 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-10 15:06:55,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:06:55,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:06:55,832 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:06:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:55,854 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:06:55,906 INFO L263 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2020-07-10 15:06:55,906 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-10 15:06:55,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-10 15:06:55,907 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #53#return; {502#true} is VALID [2020-07-10 15:06:55,907 INFO L263 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret9 := main(); {502#true} is VALID [2020-07-10 15:06:55,908 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-10 15:06:55,909 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-10 15:06:55,910 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-10 15:06:55,911 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-10 15:06:55,911 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-10 15:06:55,912 INFO L280 TraceCheckUtils]: 10: Hoare triple {509#(<= main_~j~0 2)} assume !(~j~0 < 20); {503#false} is VALID [2020-07-10 15:06:55,912 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-10 15:06:55,913 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-10 15:06:55,913 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-10 15:06:55,913 INFO L280 TraceCheckUtils]: 14: Hoare triple {503#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {503#false} is VALID [2020-07-10 15:06:55,914 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-10 15:06:55,914 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-10 15:06:55,914 INFO L280 TraceCheckUtils]: 17: Hoare triple {503#false} assume true; {503#false} is VALID [2020-07-10 15:06:55,914 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {503#false} {503#false} #57#return; {503#false} is VALID [2020-07-10 15:06:55,915 INFO L280 TraceCheckUtils]: 19: Hoare triple {503#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {503#false} is VALID [2020-07-10 15:06:55,915 INFO L280 TraceCheckUtils]: 20: Hoare triple {503#false} assume 0 == #t~ret8;havoc #t~ret8; {503#false} is VALID [2020-07-10 15:06:55,915 INFO L280 TraceCheckUtils]: 21: Hoare triple {503#false} assume !false; {503#false} is VALID [2020-07-10 15:06:55,916 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-10 15:06:55,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:06:55,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-10 15:06:55,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840000104] [2020-07-10 15:06:55,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-10 15:06:55,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:55,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:06:55,958 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-10 15:06:55,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:06:55,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:55,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:06:55,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:06:55,959 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2020-07-10 15:06:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:56,140 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-10 15:06:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:06:56,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-10 15:06:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:06:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-10 15:06:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:06:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-10 15:06:56,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2020-07-10 15:06:56,200 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-10 15:06:56,202 INFO L225 Difference]: With dead ends: 38 [2020-07-10 15:06:56,202 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 15:06:56,203 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-10 15:06:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 15:06:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-10 15:06:56,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:56,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-10 15:06:56,217 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-10 15:06:56,217 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-10 15:06:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:56,220 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-10 15:06:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-10 15:06:56,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:56,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:56,221 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-10 15:06:56,221 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-10 15:06:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:56,223 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-10 15:06:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-10 15:06:56,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:56,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:56,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:56,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:06:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-10 15:06:56,226 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2020-07-10 15:06:56,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:56,227 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-10 15:06:56,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:06:56,227 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 15:06:56,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:06:56,228 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:56,228 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-10 15:06:56,441 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:06:56,442 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:56,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1328015311, now seen corresponding path program 3 times [2020-07-10 15:06:56,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:56,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316683779] [2020-07-10 15:06:56,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:56,531 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-10 15:06:56,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-10 15:06:56,532 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {723#true} {723#true} #53#return; {723#true} is VALID [2020-07-10 15:06:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:56,538 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-10 15:06:56,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-10 15:06:56,539 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {723#true} {724#false} #57#return; {724#false} is VALID [2020-07-10 15:06:56,540 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-10 15:06:56,540 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-10 15:06:56,540 INFO L280 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-10 15:06:56,541 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #53#return; {723#true} is VALID [2020-07-10 15:06:56,541 INFO L263 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret9 := main(); {723#true} is VALID [2020-07-10 15:06:56,542 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-10 15:06:56,542 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-10 15:06:56,543 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-10 15:06:56,544 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-10 15:06:56,544 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-10 15:06:56,545 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-10 15:06:56,546 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-10 15:06:56,547 INFO L280 TraceCheckUtils]: 12: Hoare triple {731#(<= main_~j~0 3)} assume !(~j~0 < 20); {724#false} is VALID [2020-07-10 15:06:56,547 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-10 15:06:56,547 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-10 15:06:56,548 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-10 15:06:56,548 INFO L280 TraceCheckUtils]: 16: Hoare triple {724#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {724#false} is VALID [2020-07-10 15:06:56,548 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-10 15:06:56,548 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-10 15:06:56,549 INFO L280 TraceCheckUtils]: 19: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-10 15:06:56,549 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {723#true} {724#false} #57#return; {724#false} is VALID [2020-07-10 15:06:56,549 INFO L280 TraceCheckUtils]: 21: Hoare triple {724#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {724#false} is VALID [2020-07-10 15:06:56,549 INFO L280 TraceCheckUtils]: 22: Hoare triple {724#false} assume 0 == #t~ret8;havoc #t~ret8; {724#false} is VALID [2020-07-10 15:06:56,550 INFO L280 TraceCheckUtils]: 23: Hoare triple {724#false} assume !false; {724#false} is VALID [2020-07-10 15:06:56,550 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-10 15:06:56,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316683779] [2020-07-10 15:06:56,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479696572] [2020-07-10 15:06:56,551 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-10 15:06:56,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-10 15:06:56,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:06:56,605 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:06:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:56,617 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:06:56,670 INFO L263 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2020-07-10 15:06:56,670 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-10 15:06:56,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-10 15:06:56,671 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #53#return; {723#true} is VALID [2020-07-10 15:06:56,671 INFO L263 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret9 := main(); {723#true} is VALID [2020-07-10 15:06:56,672 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-10 15:06:56,673 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-10 15:06:56,674 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-10 15:06:56,675 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-10 15:06:56,676 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-10 15:06:56,676 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-10 15:06:56,677 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-10 15:06:56,678 INFO L280 TraceCheckUtils]: 12: Hoare triple {731#(<= main_~j~0 3)} assume !(~j~0 < 20); {724#false} is VALID [2020-07-10 15:06:56,678 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-10 15:06:56,679 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-10 15:06:56,679 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-10 15:06:56,679 INFO L280 TraceCheckUtils]: 16: Hoare triple {724#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {724#false} is VALID [2020-07-10 15:06:56,679 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-10 15:06:56,680 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-10 15:06:56,680 INFO L280 TraceCheckUtils]: 19: Hoare triple {724#false} assume true; {724#false} is VALID [2020-07-10 15:06:56,680 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {724#false} {724#false} #57#return; {724#false} is VALID [2020-07-10 15:06:56,680 INFO L280 TraceCheckUtils]: 21: Hoare triple {724#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {724#false} is VALID [2020-07-10 15:06:56,681 INFO L280 TraceCheckUtils]: 22: Hoare triple {724#false} assume 0 == #t~ret8;havoc #t~ret8; {724#false} is VALID [2020-07-10 15:06:56,681 INFO L280 TraceCheckUtils]: 23: Hoare triple {724#false} assume !false; {724#false} is VALID [2020-07-10 15:06:56,682 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-10 15:06:56,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:06:56,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-10 15:06:56,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676245579] [2020-07-10 15:06:56,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-10 15:06:56,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:56,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:06:56,724 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-10 15:06:56,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:06:56,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:56,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:06:56,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:06:56,726 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2020-07-10 15:06:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:56,914 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-10 15:06:56,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:06:56,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-10 15:06:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:06:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2020-07-10 15:06:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:06:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2020-07-10 15:06:56,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2020-07-10 15:06:56,981 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-10 15:06:56,982 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:06:56,982 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:06:56,983 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-10 15:06:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:06:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-10 15:06:57,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:57,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-10 15:06:57,004 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-10 15:06:57,004 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-10 15:06:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:57,006 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 15:06:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 15:06:57,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:57,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:57,007 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-10 15:06:57,008 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-10 15:06:57,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:57,010 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 15:06:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 15:06:57,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:57,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:57,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:57,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:06:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-10 15:06:57,013 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2020-07-10 15:06:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:57,013 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-10 15:06:57,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:06:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-10 15:06:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:06:57,014 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:57,014 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-10 15:06:57,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:06:57,229 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:57,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1523652947, now seen corresponding path program 4 times [2020-07-10 15:06:57,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:57,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800962725] [2020-07-10 15:06:57,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:57,343 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-10 15:06:57,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-10 15:06:57,344 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {961#true} {961#true} #53#return; {961#true} is VALID [2020-07-10 15:06:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:57,349 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-10 15:06:57,349 INFO L280 TraceCheckUtils]: 1: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-10 15:06:57,350 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {961#true} {962#false} #57#return; {962#false} is VALID [2020-07-10 15:06:57,351 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-10 15:06:57,351 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-10 15:06:57,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-10 15:06:57,352 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {961#true} {961#true} #53#return; {961#true} is VALID [2020-07-10 15:06:57,352 INFO L263 TraceCheckUtils]: 4: Hoare triple {961#true} call #t~ret9 := main(); {961#true} is VALID [2020-07-10 15:06:57,353 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-10 15:06:57,353 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-10 15:06:57,354 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-10 15:06:57,355 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-10 15:06:57,356 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-10 15:06:57,356 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-10 15:06:57,357 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-10 15:06:57,358 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-10 15:06:57,359 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-10 15:06:57,359 INFO L280 TraceCheckUtils]: 14: Hoare triple {970#(<= main_~j~0 4)} assume !(~j~0 < 20); {962#false} is VALID [2020-07-10 15:06:57,359 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-10 15:06:57,360 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-10 15:06:57,360 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-10 15:06:57,360 INFO L280 TraceCheckUtils]: 18: Hoare triple {962#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {962#false} is VALID [2020-07-10 15:06:57,361 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-10 15:06:57,361 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-10 15:06:57,361 INFO L280 TraceCheckUtils]: 21: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-10 15:06:57,361 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {961#true} {962#false} #57#return; {962#false} is VALID [2020-07-10 15:06:57,362 INFO L280 TraceCheckUtils]: 23: Hoare triple {962#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {962#false} is VALID [2020-07-10 15:06:57,362 INFO L280 TraceCheckUtils]: 24: Hoare triple {962#false} assume 0 == #t~ret8;havoc #t~ret8; {962#false} is VALID [2020-07-10 15:06:57,362 INFO L280 TraceCheckUtils]: 25: Hoare triple {962#false} assume !false; {962#false} is VALID [2020-07-10 15:06:57,363 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-10 15:06:57,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800962725] [2020-07-10 15:06:57,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954350645] [2020-07-10 15:06:57,364 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-10 15:06:57,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 15:06:57,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:06:57,410 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:06:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:57,429 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:06:57,507 INFO L263 TraceCheckUtils]: 0: Hoare triple {961#true} call ULTIMATE.init(); {961#true} is VALID [2020-07-10 15:06:57,508 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-10 15:06:57,508 INFO L280 TraceCheckUtils]: 2: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-10 15:06:57,508 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {961#true} {961#true} #53#return; {961#true} is VALID [2020-07-10 15:06:57,509 INFO L263 TraceCheckUtils]: 4: Hoare triple {961#true} call #t~ret9 := main(); {961#true} is VALID [2020-07-10 15:06:57,510 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-10 15:06:57,510 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-10 15:06:57,511 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-10 15:06:57,512 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-10 15:06:57,512 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-10 15:06:57,516 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-10 15:06:57,518 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-10 15:06:57,518 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-10 15:06:57,520 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-10 15:06:57,521 INFO L280 TraceCheckUtils]: 14: Hoare triple {970#(<= main_~j~0 4)} assume !(~j~0 < 20); {962#false} is VALID [2020-07-10 15:06:57,521 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-10 15:06:57,522 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-10 15:06:57,522 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-10 15:06:57,522 INFO L280 TraceCheckUtils]: 18: Hoare triple {962#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {962#false} is VALID [2020-07-10 15:06:57,522 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-10 15:06:57,523 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-10 15:06:57,523 INFO L280 TraceCheckUtils]: 21: Hoare triple {962#false} assume true; {962#false} is VALID [2020-07-10 15:06:57,523 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {962#false} {962#false} #57#return; {962#false} is VALID [2020-07-10 15:06:57,523 INFO L280 TraceCheckUtils]: 23: Hoare triple {962#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {962#false} is VALID [2020-07-10 15:06:57,524 INFO L280 TraceCheckUtils]: 24: Hoare triple {962#false} assume 0 == #t~ret8;havoc #t~ret8; {962#false} is VALID [2020-07-10 15:06:57,524 INFO L280 TraceCheckUtils]: 25: Hoare triple {962#false} assume !false; {962#false} is VALID [2020-07-10 15:06:57,525 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-10 15:06:57,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:06:57,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-10 15:06:57,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333832640] [2020-07-10 15:06:57,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-10 15:06:57,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:57,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:06:57,577 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-10 15:06:57,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:06:57,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:57,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:06:57,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:06:57,579 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-07-10 15:06:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:57,782 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2020-07-10 15:06:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:06:57,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-10 15:06:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:06:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-10 15:06:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:06:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-10 15:06:57,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2020-07-10 15:06:57,838 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-10 15:06:57,839 INFO L225 Difference]: With dead ends: 42 [2020-07-10 15:06:57,839 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:06:57,840 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-10 15:06:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:06:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-10 15:06:57,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:57,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-10 15:06:57,867 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-10 15:06:57,867 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-10 15:06:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:57,869 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-10 15:06:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-10 15:06:57,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:57,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:57,870 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-10 15:06:57,872 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-10 15:06:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:57,876 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-10 15:06:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-10 15:06:57,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:57,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:57,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:57,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:06:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-10 15:06:57,879 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2020-07-10 15:06:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:57,879 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-10 15:06:57,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:06:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-10 15:06:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:06:57,879 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:57,880 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-10 15:06:58,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:06:58,081 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1787714037, now seen corresponding path program 5 times [2020-07-10 15:06:58,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:58,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993170067] [2020-07-10 15:06:58,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:58,228 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-10 15:06:58,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-10 15:06:58,229 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1216#true} {1216#true} #53#return; {1216#true} is VALID [2020-07-10 15:06:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:58,250 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-10 15:06:58,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-10 15:06:58,250 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1216#true} {1217#false} #57#return; {1217#false} is VALID [2020-07-10 15:06:58,252 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-10 15:06:58,252 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-10 15:06:58,252 INFO L280 TraceCheckUtils]: 2: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-10 15:06:58,252 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1216#true} {1216#true} #53#return; {1216#true} is VALID [2020-07-10 15:06:58,253 INFO L263 TraceCheckUtils]: 4: Hoare triple {1216#true} call #t~ret9 := main(); {1216#true} is VALID [2020-07-10 15:06:58,254 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-10 15:06:58,254 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-10 15:06:58,255 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-10 15:06:58,256 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-10 15:06:58,259 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-10 15:06:58,264 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-10 15:06:58,265 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-10 15:06:58,266 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-10 15:06:58,276 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-10 15:06:58,277 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-10 15:06:58,278 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-10 15:06:58,279 INFO L280 TraceCheckUtils]: 16: Hoare triple {1226#(<= main_~j~0 5)} assume !(~j~0 < 20); {1217#false} is VALID [2020-07-10 15:06:58,280 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-10 15:06:58,280 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-10 15:06:58,280 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-10 15:06:58,280 INFO L280 TraceCheckUtils]: 20: Hoare triple {1217#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1217#false} is VALID [2020-07-10 15:06:58,281 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-10 15:06:58,281 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-10 15:06:58,281 INFO L280 TraceCheckUtils]: 23: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-10 15:06:58,281 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1216#true} {1217#false} #57#return; {1217#false} is VALID [2020-07-10 15:06:58,282 INFO L280 TraceCheckUtils]: 25: Hoare triple {1217#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1217#false} is VALID [2020-07-10 15:06:58,282 INFO L280 TraceCheckUtils]: 26: Hoare triple {1217#false} assume 0 == #t~ret8;havoc #t~ret8; {1217#false} is VALID [2020-07-10 15:06:58,282 INFO L280 TraceCheckUtils]: 27: Hoare triple {1217#false} assume !false; {1217#false} is VALID [2020-07-10 15:06:58,283 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-10 15:06:58,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993170067] [2020-07-10 15:06:58,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412995876] [2020-07-10 15:06:58,284 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-10 15:06:58,346 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-10 15:06:58,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:06:58,348 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:06:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:58,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:06:58,436 INFO L263 TraceCheckUtils]: 0: Hoare triple {1216#true} call ULTIMATE.init(); {1216#true} is VALID [2020-07-10 15:06:58,436 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-10 15:06:58,437 INFO L280 TraceCheckUtils]: 2: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-10 15:06:58,437 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1216#true} {1216#true} #53#return; {1216#true} is VALID [2020-07-10 15:06:58,437 INFO L263 TraceCheckUtils]: 4: Hoare triple {1216#true} call #t~ret9 := main(); {1216#true} is VALID [2020-07-10 15:06:58,438 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-10 15:06:58,439 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-10 15:06:58,439 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-10 15:06:58,440 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-10 15:06:58,441 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-10 15:06:58,442 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-10 15:06:58,442 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-10 15:06:58,443 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-10 15:06:58,444 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-10 15:06:58,445 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-10 15:06:58,446 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-10 15:06:58,446 INFO L280 TraceCheckUtils]: 16: Hoare triple {1226#(<= main_~j~0 5)} assume !(~j~0 < 20); {1217#false} is VALID [2020-07-10 15:06:58,447 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-10 15:06:58,447 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-10 15:06:58,447 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-10 15:06:58,447 INFO L280 TraceCheckUtils]: 20: Hoare triple {1217#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1217#false} is VALID [2020-07-10 15:06:58,448 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-10 15:06:58,448 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-10 15:06:58,448 INFO L280 TraceCheckUtils]: 23: Hoare triple {1217#false} assume true; {1217#false} is VALID [2020-07-10 15:06:58,448 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1217#false} {1217#false} #57#return; {1217#false} is VALID [2020-07-10 15:06:58,449 INFO L280 TraceCheckUtils]: 25: Hoare triple {1217#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1217#false} is VALID [2020-07-10 15:06:58,449 INFO L280 TraceCheckUtils]: 26: Hoare triple {1217#false} assume 0 == #t~ret8;havoc #t~ret8; {1217#false} is VALID [2020-07-10 15:06:58,449 INFO L280 TraceCheckUtils]: 27: Hoare triple {1217#false} assume !false; {1217#false} is VALID [2020-07-10 15:06:58,450 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-10 15:06:58,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:06:58,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-07-10 15:06:58,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745395554] [2020-07-10 15:06:58,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-10 15:06:58,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:58,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:06:58,496 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-10 15:06:58,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:06:58,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:58,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:06:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:06:58,498 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 10 states. [2020-07-10 15:06:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:58,707 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-10 15:06:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:06:58,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-10 15:06:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:06:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2020-07-10 15:06:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:06:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2020-07-10 15:06:58,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2020-07-10 15:06:58,783 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-10 15:06:58,784 INFO L225 Difference]: With dead ends: 44 [2020-07-10 15:06:58,785 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 15:06:58,785 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-10 15:06:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 15:06:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-07-10 15:06:58,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:58,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2020-07-10 15:06:58,806 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2020-07-10 15:06:58,807 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2020-07-10 15:06:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:58,808 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-10 15:06:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-10 15:06:58,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:58,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:58,809 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2020-07-10 15:06:58,809 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2020-07-10 15:06:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:58,811 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-10 15:06:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-10 15:06:58,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:58,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:58,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:58,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 15:06:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-07-10 15:06:58,814 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2020-07-10 15:06:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:58,814 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-07-10 15:06:58,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:06:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-10 15:06:58,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:06:58,815 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:58,815 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-10 15:06:59,016 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-10 15:06:59,016 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:59,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2147351063, now seen corresponding path program 6 times [2020-07-10 15:06:59,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:59,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361134714] [2020-07-10 15:06:59,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:59,177 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-10 15:06:59,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-10 15:06:59,177 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1488#true} {1488#true} #53#return; {1488#true} is VALID [2020-07-10 15:06:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:59,183 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-10 15:06:59,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-10 15:06:59,183 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1488#true} {1489#false} #57#return; {1489#false} is VALID [2020-07-10 15:06:59,184 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-10 15:06:59,185 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-10 15:06:59,185 INFO L280 TraceCheckUtils]: 2: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-10 15:06:59,185 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1488#true} {1488#true} #53#return; {1488#true} is VALID [2020-07-10 15:06:59,185 INFO L263 TraceCheckUtils]: 4: Hoare triple {1488#true} call #t~ret9 := main(); {1488#true} is VALID [2020-07-10 15:06:59,187 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-10 15:06:59,189 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-10 15:06:59,190 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-10 15:06:59,191 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-10 15:06:59,192 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-10 15:06:59,192 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-10 15:06:59,193 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-10 15:06:59,194 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-10 15:06:59,195 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-10 15:06:59,195 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-10 15:06:59,196 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-10 15:06:59,197 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-10 15:06:59,197 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-10 15:06:59,198 INFO L280 TraceCheckUtils]: 18: Hoare triple {1499#(<= main_~j~0 6)} assume !(~j~0 < 20); {1489#false} is VALID [2020-07-10 15:06:59,198 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-10 15:06:59,199 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-10 15:06:59,199 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-10 15:06:59,199 INFO L280 TraceCheckUtils]: 22: Hoare triple {1489#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1489#false} is VALID [2020-07-10 15:06:59,199 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-10 15:06:59,199 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-10 15:06:59,200 INFO L280 TraceCheckUtils]: 25: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-10 15:06:59,200 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1488#true} {1489#false} #57#return; {1489#false} is VALID [2020-07-10 15:06:59,200 INFO L280 TraceCheckUtils]: 27: Hoare triple {1489#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1489#false} is VALID [2020-07-10 15:06:59,200 INFO L280 TraceCheckUtils]: 28: Hoare triple {1489#false} assume 0 == #t~ret8;havoc #t~ret8; {1489#false} is VALID [2020-07-10 15:06:59,201 INFO L280 TraceCheckUtils]: 29: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2020-07-10 15:06:59,202 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-10 15:06:59,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361134714] [2020-07-10 15:06:59,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806907785] [2020-07-10 15:06:59,202 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-10 15:06:59,305 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-10 15:06:59,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:06:59,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:06:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:59,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:06:59,421 INFO L263 TraceCheckUtils]: 0: Hoare triple {1488#true} call ULTIMATE.init(); {1488#true} is VALID [2020-07-10 15:06:59,421 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-10 15:06:59,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-10 15:06:59,422 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1488#true} {1488#true} #53#return; {1488#true} is VALID [2020-07-10 15:06:59,422 INFO L263 TraceCheckUtils]: 4: Hoare triple {1488#true} call #t~ret9 := main(); {1488#true} is VALID [2020-07-10 15:06:59,423 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-10 15:06:59,424 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-10 15:06:59,425 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-10 15:06:59,425 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-10 15:06:59,426 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-10 15:06:59,427 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-10 15:06:59,435 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-10 15:06:59,436 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-10 15:06:59,436 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-10 15:06:59,437 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-10 15:06:59,438 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-10 15:06:59,438 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-10 15:06:59,439 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-10 15:06:59,439 INFO L280 TraceCheckUtils]: 18: Hoare triple {1499#(<= main_~j~0 6)} assume !(~j~0 < 20); {1489#false} is VALID [2020-07-10 15:06:59,439 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-10 15:06:59,440 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-10 15:06:59,440 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-10 15:06:59,440 INFO L280 TraceCheckUtils]: 22: Hoare triple {1489#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1489#false} is VALID [2020-07-10 15:06:59,440 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-10 15:06:59,441 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-10 15:06:59,441 INFO L280 TraceCheckUtils]: 25: Hoare triple {1489#false} assume true; {1489#false} is VALID [2020-07-10 15:06:59,442 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1489#false} {1489#false} #57#return; {1489#false} is VALID [2020-07-10 15:06:59,442 INFO L280 TraceCheckUtils]: 27: Hoare triple {1489#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1489#false} is VALID [2020-07-10 15:06:59,442 INFO L280 TraceCheckUtils]: 28: Hoare triple {1489#false} assume 0 == #t~ret8;havoc #t~ret8; {1489#false} is VALID [2020-07-10 15:06:59,443 INFO L280 TraceCheckUtils]: 29: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2020-07-10 15:06:59,444 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-10 15:06:59,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:06:59,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-07-10 15:06:59,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098753709] [2020-07-10 15:06:59,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-10 15:06:59,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:59,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:06:59,500 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-10 15:06:59,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:06:59,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:59,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:06:59,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:06:59,501 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 11 states. [2020-07-10 15:06:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:59,784 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-07-10 15:06:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:06:59,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-10 15:06:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:06:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-10 15:06:59,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:06:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-10 15:06:59,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2020-07-10 15:06:59,845 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-10 15:06:59,846 INFO L225 Difference]: With dead ends: 46 [2020-07-10 15:06:59,846 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 15:06:59,847 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-10 15:06:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 15:06:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-10 15:06:59,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:59,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-10 15:06:59,869 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-10 15:06:59,870 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-10 15:06:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:59,871 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-10 15:06:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-10 15:06:59,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:59,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:59,872 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-10 15:06:59,872 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-10 15:06:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:59,876 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-10 15:06:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-10 15:06:59,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:59,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:59,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:59,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 15:06:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-10 15:06:59,878 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2020-07-10 15:06:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:59,879 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-10 15:06:59,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:06:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-10 15:06:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 15:06:59,880 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:59,880 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-10 15:07:00,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:07:00,091 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:00,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash -133817927, now seen corresponding path program 7 times [2020-07-10 15:07:00,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:00,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480540440] [2020-07-10 15:07:00,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:00,233 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-10 15:07:00,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-10 15:07:00,236 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1777#true} {1777#true} #53#return; {1777#true} is VALID [2020-07-10 15:07:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:00,245 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-10 15:07:00,245 INFO L280 TraceCheckUtils]: 1: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-10 15:07:00,246 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1777#true} {1778#false} #57#return; {1778#false} is VALID [2020-07-10 15:07:00,248 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-10 15:07:00,249 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-10 15:07:00,249 INFO L280 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-10 15:07:00,249 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #53#return; {1777#true} is VALID [2020-07-10 15:07:00,249 INFO L263 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret9 := main(); {1777#true} is VALID [2020-07-10 15:07:00,251 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-10 15:07:00,251 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-10 15:07:00,252 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-10 15:07:00,253 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-10 15:07:00,253 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-10 15:07:00,254 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-10 15:07:00,255 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-10 15:07:00,255 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-10 15:07:00,256 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-10 15:07:00,256 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-10 15:07:00,257 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-10 15:07:00,258 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-10 15:07:00,258 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-10 15:07:00,259 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-10 15:07:00,260 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-10 15:07:00,260 INFO L280 TraceCheckUtils]: 20: Hoare triple {1789#(<= main_~j~0 7)} assume !(~j~0 < 20); {1778#false} is VALID [2020-07-10 15:07:00,260 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-10 15:07:00,261 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-10 15:07:00,261 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-10 15:07:00,261 INFO L280 TraceCheckUtils]: 24: Hoare triple {1778#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1778#false} is VALID [2020-07-10 15:07:00,261 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-10 15:07:00,261 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-10 15:07:00,262 INFO L280 TraceCheckUtils]: 27: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-10 15:07:00,262 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1777#true} {1778#false} #57#return; {1778#false} is VALID [2020-07-10 15:07:00,262 INFO L280 TraceCheckUtils]: 29: Hoare triple {1778#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1778#false} is VALID [2020-07-10 15:07:00,262 INFO L280 TraceCheckUtils]: 30: Hoare triple {1778#false} assume 0 == #t~ret8;havoc #t~ret8; {1778#false} is VALID [2020-07-10 15:07:00,262 INFO L280 TraceCheckUtils]: 31: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2020-07-10 15:07:00,264 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-10 15:07:00,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480540440] [2020-07-10 15:07:00,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838646580] [2020-07-10 15:07:00,265 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-10 15:07:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:00,309 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:07:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:00,323 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:00,427 INFO L263 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1777#true} is VALID [2020-07-10 15:07:00,428 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-10 15:07:00,428 INFO L280 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-10 15:07:00,428 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #53#return; {1777#true} is VALID [2020-07-10 15:07:00,428 INFO L263 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret9 := main(); {1777#true} is VALID [2020-07-10 15:07:00,431 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-10 15:07:00,433 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-10 15:07:00,436 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-10 15:07:00,437 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-10 15:07:00,438 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-10 15:07:00,438 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-10 15:07:00,439 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-10 15:07:00,439 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-10 15:07:00,440 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-10 15:07:00,440 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-10 15:07:00,441 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-10 15:07:00,441 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-10 15:07:00,442 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-10 15:07:00,442 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-10 15:07:00,443 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-10 15:07:00,443 INFO L280 TraceCheckUtils]: 20: Hoare triple {1789#(<= main_~j~0 7)} assume !(~j~0 < 20); {1778#false} is VALID [2020-07-10 15:07:00,444 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-10 15:07:00,444 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-10 15:07:00,444 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-10 15:07:00,444 INFO L280 TraceCheckUtils]: 24: Hoare triple {1778#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1778#false} is VALID [2020-07-10 15:07:00,444 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-10 15:07:00,444 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-10 15:07:00,444 INFO L280 TraceCheckUtils]: 27: Hoare triple {1778#false} assume true; {1778#false} is VALID [2020-07-10 15:07:00,445 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1778#false} {1778#false} #57#return; {1778#false} is VALID [2020-07-10 15:07:00,445 INFO L280 TraceCheckUtils]: 29: Hoare triple {1778#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1778#false} is VALID [2020-07-10 15:07:00,445 INFO L280 TraceCheckUtils]: 30: Hoare triple {1778#false} assume 0 == #t~ret8;havoc #t~ret8; {1778#false} is VALID [2020-07-10 15:07:00,445 INFO L280 TraceCheckUtils]: 31: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2020-07-10 15:07:00,449 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-10 15:07:00,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:00,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2020-07-10 15:07:00,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698462585] [2020-07-10 15:07:00,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-10 15:07:00,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:00,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 15:07:00,492 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-10 15:07:00,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 15:07:00,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:00,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 15:07:00,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:07:00,494 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 12 states. [2020-07-10 15:07:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:00,782 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2020-07-10 15:07:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:07:00,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-10 15:07:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:07:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-10 15:07:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:07:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-10 15:07:00,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2020-07-10 15:07:00,839 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-10 15:07:00,840 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:07:00,840 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 15:07:00,841 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-10 15:07:00,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 15:07:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-10 15:07:00,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:00,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-10 15:07:00,859 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-10 15:07:00,859 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-10 15:07:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:00,861 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-10 15:07:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-10 15:07:00,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:00,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:00,862 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-10 15:07:00,862 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-10 15:07:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:00,864 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-10 15:07:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-10 15:07:00,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:00,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:00,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:00,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:07:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-07-10 15:07:00,867 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2020-07-10 15:07:00,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:00,867 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-07-10 15:07:00,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 15:07:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-10 15:07:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 15:07:00,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:00,868 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-10 15:07:01,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:07:01,081 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:01,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:01,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1903896357, now seen corresponding path program 8 times [2020-07-10 15:07:01,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:01,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324792568] [2020-07-10 15:07:01,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:01,264 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-10 15:07:01,265 INFO L280 TraceCheckUtils]: 1: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-10 15:07:01,265 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2083#true} {2083#true} #53#return; {2083#true} is VALID [2020-07-10 15:07:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:01,269 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-10 15:07:01,270 INFO L280 TraceCheckUtils]: 1: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-10 15:07:01,270 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2083#true} {2084#false} #57#return; {2084#false} is VALID [2020-07-10 15:07:01,271 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-10 15:07:01,271 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-10 15:07:01,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-10 15:07:01,271 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2083#true} {2083#true} #53#return; {2083#true} is VALID [2020-07-10 15:07:01,272 INFO L263 TraceCheckUtils]: 4: Hoare triple {2083#true} call #t~ret9 := main(); {2083#true} is VALID [2020-07-10 15:07:01,273 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-10 15:07:01,273 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-10 15:07:01,274 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-10 15:07:01,274 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-10 15:07:01,275 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-10 15:07:01,276 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-10 15:07:01,277 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-10 15:07:01,277 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-10 15:07:01,278 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-10 15:07:01,278 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-10 15:07:01,278 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-10 15:07:01,279 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-10 15:07:01,280 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-10 15:07:01,280 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-10 15:07:01,283 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-10 15:07:01,284 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-10 15:07:01,287 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-10 15:07:01,288 INFO L280 TraceCheckUtils]: 22: Hoare triple {2096#(<= main_~j~0 8)} assume !(~j~0 < 20); {2084#false} is VALID [2020-07-10 15:07:01,288 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-10 15:07:01,288 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-10 15:07:01,288 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-10 15:07:01,288 INFO L280 TraceCheckUtils]: 26: Hoare triple {2084#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2084#false} is VALID [2020-07-10 15:07:01,288 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-10 15:07:01,288 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-10 15:07:01,289 INFO L280 TraceCheckUtils]: 29: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-10 15:07:01,289 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2083#true} {2084#false} #57#return; {2084#false} is VALID [2020-07-10 15:07:01,289 INFO L280 TraceCheckUtils]: 31: Hoare triple {2084#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2084#false} is VALID [2020-07-10 15:07:01,289 INFO L280 TraceCheckUtils]: 32: Hoare triple {2084#false} assume 0 == #t~ret8;havoc #t~ret8; {2084#false} is VALID [2020-07-10 15:07:01,289 INFO L280 TraceCheckUtils]: 33: Hoare triple {2084#false} assume !false; {2084#false} is VALID [2020-07-10 15:07:01,290 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-10 15:07:01,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324792568] [2020-07-10 15:07:01,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840915270] [2020-07-10 15:07:01,290 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-10 15:07:01,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:07:01,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:07:01,332 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-10 15:07:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:01,346 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:01,449 INFO L263 TraceCheckUtils]: 0: Hoare triple {2083#true} call ULTIMATE.init(); {2083#true} is VALID [2020-07-10 15:07:01,449 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-10 15:07:01,449 INFO L280 TraceCheckUtils]: 2: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-10 15:07:01,450 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2083#true} {2083#true} #53#return; {2083#true} is VALID [2020-07-10 15:07:01,450 INFO L263 TraceCheckUtils]: 4: Hoare triple {2083#true} call #t~ret9 := main(); {2083#true} is VALID [2020-07-10 15:07:01,450 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-10 15:07:01,451 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-10 15:07:01,451 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-10 15:07:01,452 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-10 15:07:01,452 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-10 15:07:01,453 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-10 15:07:01,453 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-10 15:07:01,454 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-10 15:07:01,454 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-10 15:07:01,455 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-10 15:07:01,455 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-10 15:07:01,455 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-10 15:07:01,456 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-10 15:07:01,457 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-10 15:07:01,458 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-10 15:07:01,460 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-10 15:07:01,463 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-10 15:07:01,465 INFO L280 TraceCheckUtils]: 22: Hoare triple {2096#(<= main_~j~0 8)} assume !(~j~0 < 20); {2084#false} is VALID [2020-07-10 15:07:01,465 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-10 15:07:01,465 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-10 15:07:01,465 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-10 15:07:01,465 INFO L280 TraceCheckUtils]: 26: Hoare triple {2084#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2084#false} is VALID [2020-07-10 15:07:01,466 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-10 15:07:01,466 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-10 15:07:01,466 INFO L280 TraceCheckUtils]: 29: Hoare triple {2084#false} assume true; {2084#false} is VALID [2020-07-10 15:07:01,466 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2084#false} {2084#false} #57#return; {2084#false} is VALID [2020-07-10 15:07:01,466 INFO L280 TraceCheckUtils]: 31: Hoare triple {2084#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2084#false} is VALID [2020-07-10 15:07:01,467 INFO L280 TraceCheckUtils]: 32: Hoare triple {2084#false} assume 0 == #t~ret8;havoc #t~ret8; {2084#false} is VALID [2020-07-10 15:07:01,467 INFO L280 TraceCheckUtils]: 33: Hoare triple {2084#false} assume !false; {2084#false} is VALID [2020-07-10 15:07:01,468 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-10 15:07:01,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:01,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2020-07-10 15:07:01,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378316086] [2020-07-10 15:07:01,469 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-07-10 15:07:01,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:01,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:07:01,525 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-10 15:07:01,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:07:01,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:01,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:07:01,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:07:01,526 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2020-07-10 15:07:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:01,688 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2020-07-10 15:07:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:07:01,688 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-07-10 15:07:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:07:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-10 15:07:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:07:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-10 15:07:01,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2020-07-10 15:07:01,764 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-10 15:07:01,766 INFO L225 Difference]: With dead ends: 50 [2020-07-10 15:07:01,766 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 15:07:01,767 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:07:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 15:07:01,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-10 15:07:01,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:01,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2020-07-10 15:07:01,789 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2020-07-10 15:07:01,789 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2020-07-10 15:07:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:01,791 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-10 15:07:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-10 15:07:01,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:01,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:01,792 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2020-07-10 15:07:01,792 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2020-07-10 15:07:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:01,793 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-10 15:07:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-10 15:07:01,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:01,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:01,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:01,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 15:07:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-07-10 15:07:01,795 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2020-07-10 15:07:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:01,796 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-07-10 15:07:01,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:07:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-07-10 15:07:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 15:07:01,796 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:01,797 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-10 15:07:02,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-10 15:07:02,008 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:02,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2142218371, now seen corresponding path program 9 times [2020-07-10 15:07:02,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:02,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688918397] [2020-07-10 15:07:02,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,184 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-10 15:07:02,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-10 15:07:02,184 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2406#true} {2406#true} #53#return; {2406#true} is VALID [2020-07-10 15:07:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,194 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-10 15:07:02,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-10 15:07:02,195 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2406#true} {2407#false} #57#return; {2407#false} is VALID [2020-07-10 15:07:02,196 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-10 15:07:02,196 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-10 15:07:02,196 INFO L280 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-10 15:07:02,196 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #53#return; {2406#true} is VALID [2020-07-10 15:07:02,197 INFO L263 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret9 := main(); {2406#true} is VALID [2020-07-10 15:07:02,197 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-10 15:07:02,198 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-10 15:07:02,198 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-10 15:07:02,199 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-10 15:07:02,200 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-10 15:07:02,200 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-10 15:07:02,201 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-10 15:07:02,202 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-10 15:07:02,202 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-10 15:07:02,203 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-10 15:07:02,204 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-10 15:07:02,204 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-10 15:07:02,205 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-10 15:07:02,205 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-10 15:07:02,206 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-10 15:07:02,207 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-10 15:07:02,207 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-10 15:07:02,208 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-10 15:07:02,209 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-10 15:07:02,210 INFO L280 TraceCheckUtils]: 24: Hoare triple {2420#(<= main_~j~0 9)} assume !(~j~0 < 20); {2407#false} is VALID [2020-07-10 15:07:02,210 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-10 15:07:02,210 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-10 15:07:02,210 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-10 15:07:02,210 INFO L280 TraceCheckUtils]: 28: Hoare triple {2407#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2407#false} is VALID [2020-07-10 15:07:02,210 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-10 15:07:02,211 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-10 15:07:02,211 INFO L280 TraceCheckUtils]: 31: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-10 15:07:02,211 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2406#true} {2407#false} #57#return; {2407#false} is VALID [2020-07-10 15:07:02,211 INFO L280 TraceCheckUtils]: 33: Hoare triple {2407#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2407#false} is VALID [2020-07-10 15:07:02,211 INFO L280 TraceCheckUtils]: 34: Hoare triple {2407#false} assume 0 == #t~ret8;havoc #t~ret8; {2407#false} is VALID [2020-07-10 15:07:02,212 INFO L280 TraceCheckUtils]: 35: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2020-07-10 15:07:02,213 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-10 15:07:02,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688918397] [2020-07-10 15:07:02,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304549920] [2020-07-10 15:07:02,214 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-10 15:07:02,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-07-10 15:07:02,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:07:02,369 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-10 15:07:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,383 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:02,497 INFO L263 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2406#true} is VALID [2020-07-10 15:07:02,498 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-10 15:07:02,498 INFO L280 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-10 15:07:02,498 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #53#return; {2406#true} is VALID [2020-07-10 15:07:02,499 INFO L263 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret9 := main(); {2406#true} is VALID [2020-07-10 15:07:02,500 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-10 15:07:02,500 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-10 15:07:02,501 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-10 15:07:02,502 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-10 15:07:02,502 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-10 15:07:02,503 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-10 15:07:02,504 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-10 15:07:02,505 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-10 15:07:02,506 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-10 15:07:02,507 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-10 15:07:02,508 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-10 15:07:02,509 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-10 15:07:02,513 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-10 15:07:02,514 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-10 15:07:02,515 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-10 15:07:02,516 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-10 15:07:02,516 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-10 15:07:02,517 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-10 15:07:02,517 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-10 15:07:02,518 INFO L280 TraceCheckUtils]: 24: Hoare triple {2420#(<= main_~j~0 9)} assume !(~j~0 < 20); {2407#false} is VALID [2020-07-10 15:07:02,518 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-10 15:07:02,518 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-10 15:07:02,518 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-10 15:07:02,519 INFO L280 TraceCheckUtils]: 28: Hoare triple {2407#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2407#false} is VALID [2020-07-10 15:07:02,519 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-10 15:07:02,519 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-10 15:07:02,519 INFO L280 TraceCheckUtils]: 31: Hoare triple {2407#false} assume true; {2407#false} is VALID [2020-07-10 15:07:02,519 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2407#false} {2407#false} #57#return; {2407#false} is VALID [2020-07-10 15:07:02,519 INFO L280 TraceCheckUtils]: 33: Hoare triple {2407#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2407#false} is VALID [2020-07-10 15:07:02,520 INFO L280 TraceCheckUtils]: 34: Hoare triple {2407#false} assume 0 == #t~ret8;havoc #t~ret8; {2407#false} is VALID [2020-07-10 15:07:02,520 INFO L280 TraceCheckUtils]: 35: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2020-07-10 15:07:02,521 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-10 15:07:02,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:02,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2020-07-10 15:07:02,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805879530] [2020-07-10 15:07:02,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-10 15:07:02,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:02,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 15:07:02,584 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-10 15:07:02,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 15:07:02,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:02,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 15:07:02,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:07:02,586 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 14 states. [2020-07-10 15:07:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:02,823 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-10 15:07:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 15:07:02,824 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-10 15:07:02,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:07:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2020-07-10 15:07:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:07:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2020-07-10 15:07:02,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2020-07-10 15:07:02,896 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-10 15:07:02,897 INFO L225 Difference]: With dead ends: 52 [2020-07-10 15:07:02,897 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 15:07:02,898 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-10 15:07:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 15:07:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-10 15:07:02,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:02,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-10 15:07:02,921 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-10 15:07:02,921 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-10 15:07:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:02,922 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-07-10 15:07:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-10 15:07:02,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:02,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:02,923 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-10 15:07:02,923 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-10 15:07:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:02,924 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-07-10 15:07:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-10 15:07:02,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:02,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:02,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:02,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 15:07:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-07-10 15:07:02,927 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-07-10 15:07:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:02,927 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-07-10 15:07:02,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 15:07:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-07-10 15:07:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:07:02,928 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:02,928 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-10 15:07:03,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:07:03,137 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:03,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:03,138 INFO L82 PathProgramCache]: Analyzing trace with hash 758560159, now seen corresponding path program 10 times [2020-07-10 15:07:03,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:03,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050453197] [2020-07-10 15:07:03,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:03,316 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-10 15:07:03,317 INFO L280 TraceCheckUtils]: 1: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-10 15:07:03,317 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2746#true} {2746#true} #53#return; {2746#true} is VALID [2020-07-10 15:07:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:03,322 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-10 15:07:03,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-10 15:07:03,322 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2746#true} {2747#false} #57#return; {2747#false} is VALID [2020-07-10 15:07:03,323 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-10 15:07:03,323 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-10 15:07:03,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-10 15:07:03,324 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2746#true} {2746#true} #53#return; {2746#true} is VALID [2020-07-10 15:07:03,324 INFO L263 TraceCheckUtils]: 4: Hoare triple {2746#true} call #t~ret9 := main(); {2746#true} is VALID [2020-07-10 15:07:03,325 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-10 15:07:03,325 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-10 15:07:03,326 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-10 15:07:03,326 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-10 15:07:03,327 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-10 15:07:03,328 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-10 15:07:03,329 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-10 15:07:03,329 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-10 15:07:03,330 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-10 15:07:03,331 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-10 15:07:03,331 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-10 15:07:03,332 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-10 15:07:03,332 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-10 15:07:03,333 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-10 15:07:03,334 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-10 15:07:03,334 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-10 15:07:03,335 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-10 15:07:03,335 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-10 15:07:03,336 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-10 15:07:03,336 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-10 15:07:03,337 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-10 15:07:03,338 INFO L280 TraceCheckUtils]: 26: Hoare triple {2761#(<= main_~j~0 10)} assume !(~j~0 < 20); {2747#false} is VALID [2020-07-10 15:07:03,338 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-10 15:07:03,338 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-10 15:07:03,338 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-10 15:07:03,339 INFO L280 TraceCheckUtils]: 30: Hoare triple {2747#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2747#false} is VALID [2020-07-10 15:07:03,339 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-10 15:07:03,339 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-10 15:07:03,339 INFO L280 TraceCheckUtils]: 33: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-10 15:07:03,339 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2746#true} {2747#false} #57#return; {2747#false} is VALID [2020-07-10 15:07:03,340 INFO L280 TraceCheckUtils]: 35: Hoare triple {2747#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2747#false} is VALID [2020-07-10 15:07:03,340 INFO L280 TraceCheckUtils]: 36: Hoare triple {2747#false} assume 0 == #t~ret8;havoc #t~ret8; {2747#false} is VALID [2020-07-10 15:07:03,340 INFO L280 TraceCheckUtils]: 37: Hoare triple {2747#false} assume !false; {2747#false} is VALID [2020-07-10 15:07:03,341 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-10 15:07:03,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050453197] [2020-07-10 15:07:03,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706997670] [2020-07-10 15:07:03,342 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-10 15:07:03,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 15:07:03,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:07:03,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-10 15:07:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:03,419 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:03,536 INFO L263 TraceCheckUtils]: 0: Hoare triple {2746#true} call ULTIMATE.init(); {2746#true} is VALID [2020-07-10 15:07:03,536 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-10 15:07:03,537 INFO L280 TraceCheckUtils]: 2: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-10 15:07:03,537 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2746#true} {2746#true} #53#return; {2746#true} is VALID [2020-07-10 15:07:03,537 INFO L263 TraceCheckUtils]: 4: Hoare triple {2746#true} call #t~ret9 := main(); {2746#true} is VALID [2020-07-10 15:07:03,539 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-10 15:07:03,542 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-10 15:07:03,546 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-10 15:07:03,547 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-10 15:07:03,548 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-10 15:07:03,549 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-10 15:07:03,550 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-10 15:07:03,550 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-10 15:07:03,551 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-10 15:07:03,552 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-10 15:07:03,552 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-10 15:07:03,553 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-10 15:07:03,553 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-10 15:07:03,553 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-10 15:07:03,554 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-10 15:07:03,555 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-10 15:07:03,557 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-10 15:07:03,559 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-10 15:07:03,560 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-10 15:07:03,560 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-10 15:07:03,561 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-10 15:07:03,561 INFO L280 TraceCheckUtils]: 26: Hoare triple {2761#(<= main_~j~0 10)} assume !(~j~0 < 20); {2747#false} is VALID [2020-07-10 15:07:03,561 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-10 15:07:03,561 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-10 15:07:03,562 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-10 15:07:03,562 INFO L280 TraceCheckUtils]: 30: Hoare triple {2747#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2747#false} is VALID [2020-07-10 15:07:03,562 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-10 15:07:03,562 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-10 15:07:03,562 INFO L280 TraceCheckUtils]: 33: Hoare triple {2747#false} assume true; {2747#false} is VALID [2020-07-10 15:07:03,563 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2747#false} {2747#false} #57#return; {2747#false} is VALID [2020-07-10 15:07:03,563 INFO L280 TraceCheckUtils]: 35: Hoare triple {2747#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2747#false} is VALID [2020-07-10 15:07:03,563 INFO L280 TraceCheckUtils]: 36: Hoare triple {2747#false} assume 0 == #t~ret8;havoc #t~ret8; {2747#false} is VALID [2020-07-10 15:07:03,563 INFO L280 TraceCheckUtils]: 37: Hoare triple {2747#false} assume !false; {2747#false} is VALID [2020-07-10 15:07:03,565 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-10 15:07:03,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:03,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2020-07-10 15:07:03,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52046736] [2020-07-10 15:07:03,566 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2020-07-10 15:07:03,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:03,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 15:07:03,617 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-10 15:07:03,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 15:07:03,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:03,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 15:07:03,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2020-07-10 15:07:03,619 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 15 states. [2020-07-10 15:07:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:03,945 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-07-10 15:07:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 15:07:03,945 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2020-07-10 15:07:03,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:07:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-10 15:07:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:07:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-10 15:07:03,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2020-07-10 15:07:04,031 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-10 15:07:04,032 INFO L225 Difference]: With dead ends: 54 [2020-07-10 15:07:04,032 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 15:07:04,033 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-10 15:07:04,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 15:07:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-10 15:07:04,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:04,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2020-07-10 15:07:04,058 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2020-07-10 15:07:04,058 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2020-07-10 15:07:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:04,060 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-10 15:07:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-10 15:07:04,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:04,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:04,060 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2020-07-10 15:07:04,060 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2020-07-10 15:07:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:04,061 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-10 15:07:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-10 15:07:04,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:04,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:04,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:04,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 15:07:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2020-07-10 15:07:04,063 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2020-07-10 15:07:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:04,063 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2020-07-10 15:07:04,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 15:07:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-07-10 15:07:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 15:07:04,064 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:04,064 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-10 15:07:04,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:07:04,269 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:04,270 INFO L82 PathProgramCache]: Analyzing trace with hash 972952385, now seen corresponding path program 11 times [2020-07-10 15:07:04,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:04,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485647232] [2020-07-10 15:07:04,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:04,466 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-10 15:07:04,466 INFO L280 TraceCheckUtils]: 1: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-10 15:07:04,466 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3103#true} {3103#true} #53#return; {3103#true} is VALID [2020-07-10 15:07:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:04,471 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-10 15:07:04,472 INFO L280 TraceCheckUtils]: 1: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-10 15:07:04,472 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3103#true} {3104#false} #57#return; {3104#false} is VALID [2020-07-10 15:07:04,473 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-10 15:07:04,473 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-10 15:07:04,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-10 15:07:04,473 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3103#true} {3103#true} #53#return; {3103#true} is VALID [2020-07-10 15:07:04,474 INFO L263 TraceCheckUtils]: 4: Hoare triple {3103#true} call #t~ret9 := main(); {3103#true} is VALID [2020-07-10 15:07:04,474 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-10 15:07:04,475 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-10 15:07:04,476 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-10 15:07:04,476 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-10 15:07:04,477 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-10 15:07:04,477 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-10 15:07:04,478 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-10 15:07:04,479 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-10 15:07:04,479 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-10 15:07:04,480 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-10 15:07:04,481 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-10 15:07:04,481 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-10 15:07:04,482 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-10 15:07:04,482 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-10 15:07:04,483 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-10 15:07:04,484 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-10 15:07:04,484 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-10 15:07:04,485 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-10 15:07:04,485 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-10 15:07:04,486 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-10 15:07:04,487 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-10 15:07:04,487 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-10 15:07:04,488 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-10 15:07:04,489 INFO L280 TraceCheckUtils]: 28: Hoare triple {3119#(<= main_~j~0 11)} assume !(~j~0 < 20); {3104#false} is VALID [2020-07-10 15:07:04,489 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-10 15:07:04,489 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-10 15:07:04,489 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-10 15:07:04,489 INFO L280 TraceCheckUtils]: 32: Hoare triple {3104#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3104#false} is VALID [2020-07-10 15:07:04,490 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-10 15:07:04,490 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-10 15:07:04,490 INFO L280 TraceCheckUtils]: 35: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-10 15:07:04,490 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3103#true} {3104#false} #57#return; {3104#false} is VALID [2020-07-10 15:07:04,490 INFO L280 TraceCheckUtils]: 37: Hoare triple {3104#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3104#false} is VALID [2020-07-10 15:07:04,491 INFO L280 TraceCheckUtils]: 38: Hoare triple {3104#false} assume 0 == #t~ret8;havoc #t~ret8; {3104#false} is VALID [2020-07-10 15:07:04,491 INFO L280 TraceCheckUtils]: 39: Hoare triple {3104#false} assume !false; {3104#false} is VALID [2020-07-10 15:07:04,493 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-10 15:07:04,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485647232] [2020-07-10 15:07:04,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816599776] [2020-07-10 15:07:04,494 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-10 15:07:04,757 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2020-07-10 15:07:04,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:07:04,761 INFO L264 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-10 15:07:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:04,777 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:04,907 INFO L263 TraceCheckUtils]: 0: Hoare triple {3103#true} call ULTIMATE.init(); {3103#true} is VALID [2020-07-10 15:07:04,907 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-10 15:07:04,908 INFO L280 TraceCheckUtils]: 2: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-10 15:07:04,908 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3103#true} {3103#true} #53#return; {3103#true} is VALID [2020-07-10 15:07:04,908 INFO L263 TraceCheckUtils]: 4: Hoare triple {3103#true} call #t~ret9 := main(); {3103#true} is VALID [2020-07-10 15:07:04,909 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-10 15:07:04,909 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-10 15:07:04,910 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-10 15:07:04,910 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-10 15:07:04,910 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-10 15:07:04,911 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-10 15:07:04,911 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-10 15:07:04,912 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-10 15:07:04,912 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-10 15:07:04,913 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-10 15:07:04,913 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-10 15:07:04,914 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-10 15:07:04,914 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-10 15:07:04,914 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-10 15:07:04,915 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-10 15:07:04,915 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-10 15:07:04,916 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-10 15:07:04,916 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-10 15:07:04,917 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-10 15:07:04,917 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-10 15:07:04,918 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-10 15:07:04,918 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-10 15:07:04,919 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-10 15:07:04,919 INFO L280 TraceCheckUtils]: 28: Hoare triple {3119#(<= main_~j~0 11)} assume !(~j~0 < 20); {3104#false} is VALID [2020-07-10 15:07:04,919 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-10 15:07:04,919 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-10 15:07:04,920 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-10 15:07:04,920 INFO L280 TraceCheckUtils]: 32: Hoare triple {3104#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3104#false} is VALID [2020-07-10 15:07:04,920 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-10 15:07:04,920 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-10 15:07:04,920 INFO L280 TraceCheckUtils]: 35: Hoare triple {3104#false} assume true; {3104#false} is VALID [2020-07-10 15:07:04,920 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3104#false} {3104#false} #57#return; {3104#false} is VALID [2020-07-10 15:07:04,920 INFO L280 TraceCheckUtils]: 37: Hoare triple {3104#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3104#false} is VALID [2020-07-10 15:07:04,920 INFO L280 TraceCheckUtils]: 38: Hoare triple {3104#false} assume 0 == #t~ret8;havoc #t~ret8; {3104#false} is VALID [2020-07-10 15:07:04,921 INFO L280 TraceCheckUtils]: 39: Hoare triple {3104#false} assume !false; {3104#false} is VALID [2020-07-10 15:07:04,922 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-10 15:07:04,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:04,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2020-07-10 15:07:04,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528669325] [2020-07-10 15:07:04,923 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-10 15:07:04,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:04,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 15:07:04,985 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-10 15:07:04,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-10 15:07:04,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:04,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-10 15:07:04,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:07:04,987 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 16 states. [2020-07-10 15:07:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:05,367 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-07-10 15:07:05,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 15:07:05,367 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-10 15:07:05,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:07:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2020-07-10 15:07:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:07:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2020-07-10 15:07:05,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2020-07-10 15:07:05,445 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-10 15:07:05,447 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:07:05,447 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 15:07:05,448 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-10 15:07:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 15:07:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-10 15:07:05,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:05,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2020-07-10 15:07:05,476 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2020-07-10 15:07:05,476 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2020-07-10 15:07:05,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:05,478 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-10 15:07:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-10 15:07:05,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:05,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:05,479 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2020-07-10 15:07:05,479 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2020-07-10 15:07:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:05,481 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-10 15:07:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-10 15:07:05,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:05,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:05,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:05,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 15:07:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-07-10 15:07:05,483 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2020-07-10 15:07:05,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:05,483 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-07-10 15:07:05,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-10 15:07:05,483 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-10 15:07:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 15:07:05,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:05,484 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-10 15:07:05,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-10 15:07:05,696 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:05,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:05,697 INFO L82 PathProgramCache]: Analyzing trace with hash 845451363, now seen corresponding path program 12 times [2020-07-10 15:07:05,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:05,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426999488] [2020-07-10 15:07:05,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:05,948 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-10 15:07:05,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-10 15:07:05,949 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3477#true} {3477#true} #53#return; {3477#true} is VALID [2020-07-10 15:07:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:05,953 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-10 15:07:05,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-10 15:07:05,954 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3477#true} {3478#false} #57#return; {3478#false} is VALID [2020-07-10 15:07:05,956 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-10 15:07:05,956 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-10 15:07:05,957 INFO L280 TraceCheckUtils]: 2: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-10 15:07:05,957 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3477#true} {3477#true} #53#return; {3477#true} is VALID [2020-07-10 15:07:05,957 INFO L263 TraceCheckUtils]: 4: Hoare triple {3477#true} call #t~ret9 := main(); {3477#true} is VALID [2020-07-10 15:07:05,958 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-10 15:07:05,958 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-10 15:07:05,959 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-10 15:07:05,960 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-10 15:07:05,960 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-10 15:07:05,961 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-10 15:07:05,962 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-10 15:07:05,962 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-10 15:07:05,963 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-10 15:07:05,964 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-10 15:07:05,964 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-10 15:07:05,965 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-10 15:07:05,966 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-10 15:07:05,966 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-10 15:07:05,967 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-10 15:07:05,967 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-10 15:07:05,968 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-10 15:07:05,969 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-10 15:07:05,969 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-10 15:07:05,970 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-10 15:07:05,971 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-10 15:07:05,971 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-10 15:07:05,972 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-10 15:07:05,972 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-10 15:07:05,973 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-10 15:07:05,974 INFO L280 TraceCheckUtils]: 30: Hoare triple {3494#(<= main_~j~0 12)} assume !(~j~0 < 20); {3478#false} is VALID [2020-07-10 15:07:05,974 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-10 15:07:05,974 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-10 15:07:05,974 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-10 15:07:05,974 INFO L280 TraceCheckUtils]: 34: Hoare triple {3478#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3478#false} is VALID [2020-07-10 15:07:05,975 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-10 15:07:05,975 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-10 15:07:05,975 INFO L280 TraceCheckUtils]: 37: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-10 15:07:05,975 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3477#true} {3478#false} #57#return; {3478#false} is VALID [2020-07-10 15:07:05,975 INFO L280 TraceCheckUtils]: 39: Hoare triple {3478#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3478#false} is VALID [2020-07-10 15:07:05,976 INFO L280 TraceCheckUtils]: 40: Hoare triple {3478#false} assume 0 == #t~ret8;havoc #t~ret8; {3478#false} is VALID [2020-07-10 15:07:05,976 INFO L280 TraceCheckUtils]: 41: Hoare triple {3478#false} assume !false; {3478#false} is VALID [2020-07-10 15:07:05,978 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-10 15:07:05,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426999488] [2020-07-10 15:07:05,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999907806] [2020-07-10 15:07:05,978 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-10 15:07:06,568 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2020-07-10 15:07:06,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:07:06,574 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-10 15:07:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:06,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:06,717 INFO L263 TraceCheckUtils]: 0: Hoare triple {3477#true} call ULTIMATE.init(); {3477#true} is VALID [2020-07-10 15:07:06,718 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-10 15:07:06,718 INFO L280 TraceCheckUtils]: 2: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-10 15:07:06,718 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3477#true} {3477#true} #53#return; {3477#true} is VALID [2020-07-10 15:07:06,718 INFO L263 TraceCheckUtils]: 4: Hoare triple {3477#true} call #t~ret9 := main(); {3477#true} is VALID [2020-07-10 15:07:06,719 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-10 15:07:06,719 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-10 15:07:06,720 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-10 15:07:06,720 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-10 15:07:06,720 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-10 15:07:06,721 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-10 15:07:06,721 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-10 15:07:06,722 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-10 15:07:06,722 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-10 15:07:06,723 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-10 15:07:06,723 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-10 15:07:06,724 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-10 15:07:06,724 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-10 15:07:06,725 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-10 15:07:06,725 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-10 15:07:06,725 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-10 15:07:06,726 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-10 15:07:06,726 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-10 15:07:06,727 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-10 15:07:06,727 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-10 15:07:06,728 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-10 15:07:06,728 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-10 15:07:06,729 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-10 15:07:06,730 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-10 15:07:06,731 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-10 15:07:06,731 INFO L280 TraceCheckUtils]: 30: Hoare triple {3494#(<= main_~j~0 12)} assume !(~j~0 < 20); {3478#false} is VALID [2020-07-10 15:07:06,731 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-10 15:07:06,731 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-10 15:07:06,731 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-10 15:07:06,732 INFO L280 TraceCheckUtils]: 34: Hoare triple {3478#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3478#false} is VALID [2020-07-10 15:07:06,732 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-10 15:07:06,732 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-10 15:07:06,732 INFO L280 TraceCheckUtils]: 37: Hoare triple {3478#false} assume true; {3478#false} is VALID [2020-07-10 15:07:06,732 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3478#false} {3478#false} #57#return; {3478#false} is VALID [2020-07-10 15:07:06,732 INFO L280 TraceCheckUtils]: 39: Hoare triple {3478#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3478#false} is VALID [2020-07-10 15:07:06,732 INFO L280 TraceCheckUtils]: 40: Hoare triple {3478#false} assume 0 == #t~ret8;havoc #t~ret8; {3478#false} is VALID [2020-07-10 15:07:06,732 INFO L280 TraceCheckUtils]: 41: Hoare triple {3478#false} assume !false; {3478#false} is VALID [2020-07-10 15:07:06,734 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-10 15:07:06,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:06,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 17 [2020-07-10 15:07:06,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002236642] [2020-07-10 15:07:06,735 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2020-07-10 15:07:06,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:06,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-10 15:07:06,801 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-10 15:07:06,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-10 15:07:06,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:06,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-10 15:07:06,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:07:06,802 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 17 states. [2020-07-10 15:07:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:07,096 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2020-07-10 15:07:07,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 15:07:07,096 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2020-07-10 15:07:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:07:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 60 transitions. [2020-07-10 15:07:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:07:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 60 transitions. [2020-07-10 15:07:07,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 60 transitions. [2020-07-10 15:07:07,172 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-10 15:07:07,173 INFO L225 Difference]: With dead ends: 58 [2020-07-10 15:07:07,173 INFO L226 Difference]: Without dead ends: 46 [2020-07-10 15:07:07,174 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-10 15:07:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-10 15:07:07,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-10 15:07:07,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:07,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2020-07-10 15:07:07,197 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2020-07-10 15:07:07,197 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2020-07-10 15:07:07,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:07,199 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-10 15:07:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-07-10 15:07:07,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:07,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:07,200 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2020-07-10 15:07:07,200 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2020-07-10 15:07:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:07,201 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-10 15:07:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-07-10 15:07:07,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:07,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:07,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:07,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-10 15:07:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-07-10 15:07:07,204 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2020-07-10 15:07:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:07,204 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-07-10 15:07:07,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-10 15:07:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-10 15:07:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 15:07:07,204 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:07,204 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-10 15:07:07,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-10 15:07:07,405 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:07,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:07,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1423946491, now seen corresponding path program 13 times [2020-07-10 15:07:07,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:07,407 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982376575] [2020-07-10 15:07:07,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:07,686 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-10 15:07:07,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-10 15:07:07,687 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3868#true} {3868#true} #53#return; {3868#true} is VALID [2020-07-10 15:07:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:07,691 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-10 15:07:07,691 INFO L280 TraceCheckUtils]: 1: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-10 15:07:07,692 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3868#true} {3869#false} #57#return; {3869#false} is VALID [2020-07-10 15:07:07,692 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-10 15:07:07,693 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-10 15:07:07,693 INFO L280 TraceCheckUtils]: 2: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-10 15:07:07,693 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3868#true} {3868#true} #53#return; {3868#true} is VALID [2020-07-10 15:07:07,693 INFO L263 TraceCheckUtils]: 4: Hoare triple {3868#true} call #t~ret9 := main(); {3868#true} is VALID [2020-07-10 15:07:07,694 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-10 15:07:07,695 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-10 15:07:07,695 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-10 15:07:07,696 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-10 15:07:07,697 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-10 15:07:07,697 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-10 15:07:07,698 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-10 15:07:07,698 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-10 15:07:07,699 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-10 15:07:07,699 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-10 15:07:07,700 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-10 15:07:07,701 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-10 15:07:07,702 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-10 15:07:07,702 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-10 15:07:07,703 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-10 15:07:07,704 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-10 15:07:07,704 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-10 15:07:07,705 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-10 15:07:07,706 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-10 15:07:07,706 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-10 15:07:07,707 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-10 15:07:07,708 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-10 15:07:07,709 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-10 15:07:07,709 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-10 15:07:07,710 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-10 15:07:07,711 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-10 15:07:07,712 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-10 15:07:07,712 INFO L280 TraceCheckUtils]: 32: Hoare triple {3886#(<= main_~j~0 13)} assume !(~j~0 < 20); {3869#false} is VALID [2020-07-10 15:07:07,712 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-10 15:07:07,713 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-10 15:07:07,713 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-10 15:07:07,713 INFO L280 TraceCheckUtils]: 36: Hoare triple {3869#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3869#false} is VALID [2020-07-10 15:07:07,713 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-10 15:07:07,714 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-10 15:07:07,714 INFO L280 TraceCheckUtils]: 39: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-10 15:07:07,714 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3868#true} {3869#false} #57#return; {3869#false} is VALID [2020-07-10 15:07:07,714 INFO L280 TraceCheckUtils]: 41: Hoare triple {3869#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3869#false} is VALID [2020-07-10 15:07:07,714 INFO L280 TraceCheckUtils]: 42: Hoare triple {3869#false} assume 0 == #t~ret8;havoc #t~ret8; {3869#false} is VALID [2020-07-10 15:07:07,715 INFO L280 TraceCheckUtils]: 43: Hoare triple {3869#false} assume !false; {3869#false} is VALID [2020-07-10 15:07:07,717 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-10 15:07:07,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982376575] [2020-07-10 15:07:07,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174284033] [2020-07-10 15:07:07,717 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-10 15:07:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:07,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-10 15:07:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:07,799 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:07,965 INFO L263 TraceCheckUtils]: 0: Hoare triple {3868#true} call ULTIMATE.init(); {3868#true} is VALID [2020-07-10 15:07:07,966 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-10 15:07:07,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-10 15:07:07,966 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3868#true} {3868#true} #53#return; {3868#true} is VALID [2020-07-10 15:07:07,967 INFO L263 TraceCheckUtils]: 4: Hoare triple {3868#true} call #t~ret9 := main(); {3868#true} is VALID [2020-07-10 15:07:07,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; {3909#(<= main_~j~0 0)} is VALID [2020-07-10 15:07:07,969 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-10 15:07:07,970 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-10 15:07:07,971 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-10 15:07:07,972 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-10 15:07:07,973 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-10 15:07:07,974 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-10 15:07:07,975 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-10 15:07:07,976 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-10 15:07:07,977 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-10 15:07:07,978 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-10 15:07:07,978 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-10 15:07:07,979 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-10 15:07:07,980 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-10 15:07:07,981 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-10 15:07:07,982 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-10 15:07:07,983 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-10 15:07:07,984 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-10 15:07:07,985 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-10 15:07:07,986 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-10 15:07:07,986 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-10 15:07:07,987 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-10 15:07:07,988 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-10 15:07:07,988 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-10 15:07:07,989 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-10 15:07:07,990 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-10 15:07:07,991 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-10 15:07:07,992 INFO L280 TraceCheckUtils]: 32: Hoare triple {3886#(<= main_~j~0 13)} assume !(~j~0 < 20); {3869#false} is VALID [2020-07-10 15:07:07,992 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-10 15:07:07,992 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-10 15:07:07,993 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-10 15:07:07,993 INFO L280 TraceCheckUtils]: 36: Hoare triple {3869#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3869#false} is VALID [2020-07-10 15:07:07,993 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-10 15:07:07,993 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-10 15:07:07,994 INFO L280 TraceCheckUtils]: 39: Hoare triple {3869#false} assume true; {3869#false} is VALID [2020-07-10 15:07:07,994 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3869#false} {3869#false} #57#return; {3869#false} is VALID [2020-07-10 15:07:07,994 INFO L280 TraceCheckUtils]: 41: Hoare triple {3869#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3869#false} is VALID [2020-07-10 15:07:07,994 INFO L280 TraceCheckUtils]: 42: Hoare triple {3869#false} assume 0 == #t~ret8;havoc #t~ret8; {3869#false} is VALID [2020-07-10 15:07:07,995 INFO L280 TraceCheckUtils]: 43: Hoare triple {3869#false} assume !false; {3869#false} is VALID [2020-07-10 15:07:07,998 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-10 15:07:07,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:07,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 18 [2020-07-10 15:07:08,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044992283] [2020-07-10 15:07:08,001 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2020-07-10 15:07:08,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:08,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-10 15:07:08,080 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-10 15:07:08,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-10 15:07:08,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:08,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-10 15:07:08,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2020-07-10 15:07:08,082 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 18 states. [2020-07-10 15:07:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:08,502 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-07-10 15:07:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 15:07:08,502 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2020-07-10 15:07:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:07:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2020-07-10 15:07:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:07:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2020-07-10 15:07:08,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 62 transitions. [2020-07-10 15:07:08,579 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-10 15:07:08,580 INFO L225 Difference]: With dead ends: 60 [2020-07-10 15:07:08,580 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 15:07:08,584 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-10 15:07:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 15:07:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-10 15:07:08,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:08,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-10 15:07:08,610 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-10 15:07:08,611 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-10 15:07:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:08,613 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2020-07-10 15:07:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-10 15:07:08,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:08,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:08,614 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-10 15:07:08,614 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-10 15:07:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:08,616 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2020-07-10 15:07:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-10 15:07:08,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:08,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:08,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:08,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 15:07:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-07-10 15:07:08,620 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2020-07-10 15:07:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:08,620 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-07-10 15:07:08,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-10 15:07:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-07-10 15:07:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-10 15:07:08,621 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:08,622 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-10 15:07:08,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-10 15:07:08,834 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash -471897817, now seen corresponding path program 14 times [2020-07-10 15:07:08,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:08,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63426151] [2020-07-10 15:07:08,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:09,106 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-10 15:07:09,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-10 15:07:09,107 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4276#true} {4276#true} #53#return; {4276#true} is VALID [2020-07-10 15:07:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:09,111 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-10 15:07:09,112 INFO L280 TraceCheckUtils]: 1: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-10 15:07:09,112 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4276#true} {4277#false} #57#return; {4277#false} is VALID [2020-07-10 15:07:09,113 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-10 15:07:09,113 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-10 15:07:09,114 INFO L280 TraceCheckUtils]: 2: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-10 15:07:09,114 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4276#true} {4276#true} #53#return; {4276#true} is VALID [2020-07-10 15:07:09,114 INFO L263 TraceCheckUtils]: 4: Hoare triple {4276#true} call #t~ret9 := main(); {4276#true} is VALID [2020-07-10 15:07:09,115 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-10 15:07:09,116 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-10 15:07:09,117 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-10 15:07:09,118 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-10 15:07:09,119 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-10 15:07:09,120 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-10 15:07:09,121 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-10 15:07:09,122 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-10 15:07:09,122 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-10 15:07:09,123 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-10 15:07:09,124 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-10 15:07:09,124 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-10 15:07:09,125 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-10 15:07:09,126 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-10 15:07:09,127 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-10 15:07:09,127 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-10 15:07:09,128 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-10 15:07:09,128 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-10 15:07:09,129 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-10 15:07:09,130 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-10 15:07:09,130 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-10 15:07:09,131 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-10 15:07:09,132 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-10 15:07:09,132 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-10 15:07:09,133 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-10 15:07:09,134 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-10 15:07:09,135 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-10 15:07:09,136 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-10 15:07:09,137 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-10 15:07:09,138 INFO L280 TraceCheckUtils]: 34: Hoare triple {4295#(<= main_~j~0 14)} assume !(~j~0 < 20); {4277#false} is VALID [2020-07-10 15:07:09,138 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-10 15:07:09,138 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-10 15:07:09,138 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-10 15:07:09,138 INFO L280 TraceCheckUtils]: 38: Hoare triple {4277#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4277#false} is VALID [2020-07-10 15:07:09,139 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-10 15:07:09,139 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-10 15:07:09,139 INFO L280 TraceCheckUtils]: 41: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-10 15:07:09,140 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {4276#true} {4277#false} #57#return; {4277#false} is VALID [2020-07-10 15:07:09,140 INFO L280 TraceCheckUtils]: 43: Hoare triple {4277#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4277#false} is VALID [2020-07-10 15:07:09,140 INFO L280 TraceCheckUtils]: 44: Hoare triple {4277#false} assume 0 == #t~ret8;havoc #t~ret8; {4277#false} is VALID [2020-07-10 15:07:09,140 INFO L280 TraceCheckUtils]: 45: Hoare triple {4277#false} assume !false; {4277#false} is VALID [2020-07-10 15:07:09,144 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-10 15:07:09,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63426151] [2020-07-10 15:07:09,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615429669] [2020-07-10 15:07:09,145 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-10 15:07:09,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:07:09,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:07:09,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-10 15:07:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:09,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:09,379 INFO L263 TraceCheckUtils]: 0: Hoare triple {4276#true} call ULTIMATE.init(); {4276#true} is VALID [2020-07-10 15:07:09,380 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-10 15:07:09,380 INFO L280 TraceCheckUtils]: 2: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-10 15:07:09,380 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4276#true} {4276#true} #53#return; {4276#true} is VALID [2020-07-10 15:07:09,380 INFO L263 TraceCheckUtils]: 4: Hoare triple {4276#true} call #t~ret9 := main(); {4276#true} is VALID [2020-07-10 15:07:09,381 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-10 15:07:09,382 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-10 15:07:09,383 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-10 15:07:09,383 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-10 15:07:09,384 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-10 15:07:09,384 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-10 15:07:09,385 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-10 15:07:09,386 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-10 15:07:09,387 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-10 15:07:09,387 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-10 15:07:09,388 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-10 15:07:09,389 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-10 15:07:09,389 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-10 15:07:09,390 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-10 15:07:09,391 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-10 15:07:09,392 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-10 15:07:09,393 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-10 15:07:09,393 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-10 15:07:09,394 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-10 15:07:09,394 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-10 15:07:09,395 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-10 15:07:09,396 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-10 15:07:09,396 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-10 15:07:09,397 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-10 15:07:09,398 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-10 15:07:09,398 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-10 15:07:09,399 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-10 15:07:09,400 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-10 15:07:09,400 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-10 15:07:09,401 INFO L280 TraceCheckUtils]: 34: Hoare triple {4295#(<= main_~j~0 14)} assume !(~j~0 < 20); {4277#false} is VALID [2020-07-10 15:07:09,401 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-10 15:07:09,401 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-10 15:07:09,402 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-10 15:07:09,402 INFO L280 TraceCheckUtils]: 38: Hoare triple {4277#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4277#false} is VALID [2020-07-10 15:07:09,402 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-10 15:07:09,402 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-10 15:07:09,402 INFO L280 TraceCheckUtils]: 41: Hoare triple {4277#false} assume true; {4277#false} is VALID [2020-07-10 15:07:09,402 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {4277#false} {4277#false} #57#return; {4277#false} is VALID [2020-07-10 15:07:09,403 INFO L280 TraceCheckUtils]: 43: Hoare triple {4277#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4277#false} is VALID [2020-07-10 15:07:09,403 INFO L280 TraceCheckUtils]: 44: Hoare triple {4277#false} assume 0 == #t~ret8;havoc #t~ret8; {4277#false} is VALID [2020-07-10 15:07:09,403 INFO L280 TraceCheckUtils]: 45: Hoare triple {4277#false} assume !false; {4277#false} is VALID [2020-07-10 15:07:09,405 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-10 15:07:09,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:09,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 19 [2020-07-10 15:07:09,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005788339] [2020-07-10 15:07:09,407 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2020-07-10 15:07:09,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:09,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-10 15:07:09,481 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-10 15:07:09,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-10 15:07:09,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:09,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-10 15:07:09,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:07:09,483 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 19 states. [2020-07-10 15:07:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:09,824 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2020-07-10 15:07:09,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-10 15:07:09,825 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2020-07-10 15:07:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:07:09,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 64 transitions. [2020-07-10 15:07:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:07:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 64 transitions. [2020-07-10 15:07:09,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 64 transitions. [2020-07-10 15:07:09,912 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-10 15:07:09,913 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:07:09,914 INFO L226 Difference]: Without dead ends: 50 [2020-07-10 15:07:09,914 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:07:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-10 15:07:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2020-07-10 15:07:09,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:09,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2020-07-10 15:07:09,941 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2020-07-10 15:07:09,941 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2020-07-10 15:07:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:09,942 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-07-10 15:07:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-10 15:07:09,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:09,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:09,943 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2020-07-10 15:07:09,943 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2020-07-10 15:07:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:09,946 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-07-10 15:07:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-10 15:07:09,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:09,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:09,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:09,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 15:07:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-07-10 15:07:09,949 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2020-07-10 15:07:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:09,949 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-07-10 15:07:09,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-10 15:07:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-07-10 15:07:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 15:07:09,951 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:09,951 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-10 15:07:10,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:07:10,163 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:10,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:10,163 INFO L82 PathProgramCache]: Analyzing trace with hash -381156151, now seen corresponding path program 15 times [2020-07-10 15:07:10,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:10,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746322125] [2020-07-10 15:07:10,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:10,464 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-10 15:07:10,464 INFO L280 TraceCheckUtils]: 1: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-10 15:07:10,465 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4701#true} {4701#true} #53#return; {4701#true} is VALID [2020-07-10 15:07:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:10,468 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-10 15:07:10,468 INFO L280 TraceCheckUtils]: 1: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-10 15:07:10,468 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4701#true} {4702#false} #57#return; {4702#false} is VALID [2020-07-10 15:07:10,469 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-10 15:07:10,469 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-10 15:07:10,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-10 15:07:10,469 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4701#true} {4701#true} #53#return; {4701#true} is VALID [2020-07-10 15:07:10,470 INFO L263 TraceCheckUtils]: 4: Hoare triple {4701#true} call #t~ret9 := main(); {4701#true} is VALID [2020-07-10 15:07:10,471 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-10 15:07:10,471 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-10 15:07:10,472 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-10 15:07:10,473 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-10 15:07:10,473 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-10 15:07:10,474 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-10 15:07:10,474 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-10 15:07:10,475 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-10 15:07:10,475 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-10 15:07:10,476 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-10 15:07:10,477 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-10 15:07:10,477 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-10 15:07:10,478 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-10 15:07:10,478 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-10 15:07:10,479 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-10 15:07:10,479 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-10 15:07:10,480 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-10 15:07:10,481 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-10 15:07:10,481 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-10 15:07:10,482 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-10 15:07:10,482 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-10 15:07:10,483 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-10 15:07:10,483 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-10 15:07:10,484 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-10 15:07:10,484 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-10 15:07:10,485 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-10 15:07:10,485 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-10 15:07:10,485 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-10 15:07:10,486 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-10 15:07:10,486 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-10 15:07:10,487 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-10 15:07:10,487 INFO L280 TraceCheckUtils]: 36: Hoare triple {4721#(<= main_~j~0 15)} assume !(~j~0 < 20); {4702#false} is VALID [2020-07-10 15:07:10,488 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-10 15:07:10,488 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-10 15:07:10,488 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-10 15:07:10,488 INFO L280 TraceCheckUtils]: 40: Hoare triple {4702#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4702#false} is VALID [2020-07-10 15:07:10,488 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-10 15:07:10,488 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-10 15:07:10,488 INFO L280 TraceCheckUtils]: 43: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-10 15:07:10,489 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4701#true} {4702#false} #57#return; {4702#false} is VALID [2020-07-10 15:07:10,489 INFO L280 TraceCheckUtils]: 45: Hoare triple {4702#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4702#false} is VALID [2020-07-10 15:07:10,489 INFO L280 TraceCheckUtils]: 46: Hoare triple {4702#false} assume 0 == #t~ret8;havoc #t~ret8; {4702#false} is VALID [2020-07-10 15:07:10,489 INFO L280 TraceCheckUtils]: 47: Hoare triple {4702#false} assume !false; {4702#false} is VALID [2020-07-10 15:07:10,491 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-10 15:07:10,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746322125] [2020-07-10 15:07:10,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827130573] [2020-07-10 15:07:10,492 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-10 15:07:11,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2020-07-10 15:07:11,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:07:11,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-10 15:07:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:11,223 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:11,370 INFO L263 TraceCheckUtils]: 0: Hoare triple {4701#true} call ULTIMATE.init(); {4701#true} is VALID [2020-07-10 15:07:11,370 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-10 15:07:11,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-10 15:07:11,370 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4701#true} {4701#true} #53#return; {4701#true} is VALID [2020-07-10 15:07:11,370 INFO L263 TraceCheckUtils]: 4: Hoare triple {4701#true} call #t~ret9 := main(); {4701#true} is VALID [2020-07-10 15:07:11,371 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-10 15:07:11,372 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-10 15:07:11,373 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-10 15:07:11,373 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-10 15:07:11,374 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-10 15:07:11,374 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-10 15:07:11,374 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-10 15:07:11,375 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-10 15:07:11,375 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-10 15:07:11,376 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-10 15:07:11,376 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-10 15:07:11,378 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-10 15:07:11,382 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-10 15:07:11,384 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-10 15:07:11,385 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-10 15:07:11,386 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-10 15:07:11,386 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-10 15:07:11,386 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-10 15:07:11,387 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-10 15:07:11,387 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-10 15:07:11,388 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-10 15:07:11,388 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-10 15:07:11,389 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-10 15:07:11,389 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-10 15:07:11,390 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-10 15:07:11,390 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-10 15:07:11,391 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-10 15:07:11,391 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-10 15:07:11,392 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-10 15:07:11,392 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-10 15:07:11,393 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-10 15:07:11,394 INFO L280 TraceCheckUtils]: 36: Hoare triple {4721#(<= main_~j~0 15)} assume !(~j~0 < 20); {4702#false} is VALID [2020-07-10 15:07:11,394 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-10 15:07:11,394 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-10 15:07:11,394 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-10 15:07:11,394 INFO L280 TraceCheckUtils]: 40: Hoare triple {4702#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4702#false} is VALID [2020-07-10 15:07:11,395 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-10 15:07:11,395 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-10 15:07:11,395 INFO L280 TraceCheckUtils]: 43: Hoare triple {4702#false} assume true; {4702#false} is VALID [2020-07-10 15:07:11,395 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4702#false} {4702#false} #57#return; {4702#false} is VALID [2020-07-10 15:07:11,395 INFO L280 TraceCheckUtils]: 45: Hoare triple {4702#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4702#false} is VALID [2020-07-10 15:07:11,395 INFO L280 TraceCheckUtils]: 46: Hoare triple {4702#false} assume 0 == #t~ret8;havoc #t~ret8; {4702#false} is VALID [2020-07-10 15:07:11,395 INFO L280 TraceCheckUtils]: 47: Hoare triple {4702#false} assume !false; {4702#false} is VALID [2020-07-10 15:07:11,397 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-10 15:07:11,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:11,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 20 [2020-07-10 15:07:11,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758188566] [2020-07-10 15:07:11,398 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2020-07-10 15:07:11,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:11,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-10 15:07:11,475 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-10 15:07:11,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-10 15:07:11,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:11,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-10 15:07:11,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2020-07-10 15:07:11,476 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 20 states. [2020-07-10 15:07:11,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:11,959 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2020-07-10 15:07:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 15:07:11,959 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2020-07-10 15:07:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:07:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2020-07-10 15:07:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:07:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2020-07-10 15:07:11,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2020-07-10 15:07:12,046 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-10 15:07:12,048 INFO L225 Difference]: With dead ends: 64 [2020-07-10 15:07:12,048 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 15:07:12,049 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-10 15:07:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 15:07:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-07-10 15:07:12,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:12,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2020-07-10 15:07:12,074 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2020-07-10 15:07:12,074 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2020-07-10 15:07:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:12,076 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-07-10 15:07:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-07-10 15:07:12,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:12,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:12,076 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2020-07-10 15:07:12,076 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2020-07-10 15:07:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:12,078 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-07-10 15:07:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-07-10 15:07:12,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:12,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:12,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:12,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-10 15:07:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-07-10 15:07:12,080 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2020-07-10 15:07:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:12,081 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-07-10 15:07:12,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-10 15:07:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-07-10 15:07:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 15:07:12,081 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:12,082 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-10 15:07:12,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-10 15:07:12,292 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash 922238955, now seen corresponding path program 16 times [2020-07-10 15:07:12,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:12,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990459101] [2020-07-10 15:07:12,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:12,612 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-10 15:07:12,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-10 15:07:12,613 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5143#true} {5143#true} #53#return; {5143#true} is VALID [2020-07-10 15:07:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:12,617 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-10 15:07:12,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-10 15:07:12,617 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5143#true} {5144#false} #57#return; {5144#false} is VALID [2020-07-10 15:07:12,618 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-10 15:07:12,618 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-10 15:07:12,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-10 15:07:12,619 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #53#return; {5143#true} is VALID [2020-07-10 15:07:12,619 INFO L263 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret9 := main(); {5143#true} is VALID [2020-07-10 15:07:12,620 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-10 15:07:12,620 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-10 15:07:12,621 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-10 15:07:12,621 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-10 15:07:12,622 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-10 15:07:12,623 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-10 15:07:12,623 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-10 15:07:12,624 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-10 15:07:12,625 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-10 15:07:12,625 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-10 15:07:12,626 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-10 15:07:12,626 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-10 15:07:12,627 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-10 15:07:12,628 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-10 15:07:12,628 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-10 15:07:12,629 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-10 15:07:12,629 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-10 15:07:12,630 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-10 15:07:12,631 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-10 15:07:12,631 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-10 15:07:12,632 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-10 15:07:12,632 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-10 15:07:12,633 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-10 15:07:12,634 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-10 15:07:12,634 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-10 15:07:12,635 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-10 15:07:12,636 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-10 15:07:12,636 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-10 15:07:12,637 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-10 15:07:12,637 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-10 15:07:12,638 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-10 15:07:12,638 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-10 15:07:12,639 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-10 15:07:12,640 INFO L280 TraceCheckUtils]: 38: Hoare triple {5164#(<= main_~j~0 16)} assume !(~j~0 < 20); {5144#false} is VALID [2020-07-10 15:07:12,640 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-10 15:07:12,640 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-10 15:07:12,640 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-10 15:07:12,641 INFO L280 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5144#false} is VALID [2020-07-10 15:07:12,641 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-10 15:07:12,641 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-10 15:07:12,641 INFO L280 TraceCheckUtils]: 45: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-10 15:07:12,641 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {5143#true} {5144#false} #57#return; {5144#false} is VALID [2020-07-10 15:07:12,642 INFO L280 TraceCheckUtils]: 47: Hoare triple {5144#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5144#false} is VALID [2020-07-10 15:07:12,642 INFO L280 TraceCheckUtils]: 48: Hoare triple {5144#false} assume 0 == #t~ret8;havoc #t~ret8; {5144#false} is VALID [2020-07-10 15:07:12,642 INFO L280 TraceCheckUtils]: 49: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2020-07-10 15:07:12,645 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-10 15:07:12,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990459101] [2020-07-10 15:07:12,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880581161] [2020-07-10 15:07:12,645 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-10 15:07:12,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 15:07:12,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:07:12,705 INFO L264 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-10 15:07:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:12,719 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:12,873 INFO L263 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5143#true} is VALID [2020-07-10 15:07:12,873 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-10 15:07:12,873 INFO L280 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-10 15:07:12,873 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #53#return; {5143#true} is VALID [2020-07-10 15:07:12,873 INFO L263 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret9 := main(); {5143#true} is VALID [2020-07-10 15:07:12,876 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-10 15:07:12,876 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-10 15:07:12,877 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-10 15:07:12,877 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-10 15:07:12,878 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-10 15:07:12,878 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-10 15:07:12,879 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-10 15:07:12,880 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-10 15:07:12,881 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-10 15:07:12,881 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-10 15:07:12,882 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-10 15:07:12,882 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-10 15:07:12,883 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-10 15:07:12,883 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-10 15:07:12,884 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-10 15:07:12,885 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-10 15:07:12,886 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-10 15:07:12,886 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-10 15:07:12,887 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-10 15:07:12,888 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-10 15:07:12,889 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-10 15:07:12,889 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-10 15:07:12,890 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-10 15:07:12,890 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-10 15:07:12,891 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-10 15:07:12,891 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-10 15:07:12,892 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-10 15:07:12,892 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-10 15:07:12,893 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-10 15:07:12,893 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-10 15:07:12,893 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-10 15:07:12,894 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-10 15:07:12,894 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-10 15:07:12,895 INFO L280 TraceCheckUtils]: 38: Hoare triple {5164#(<= main_~j~0 16)} assume !(~j~0 < 20); {5144#false} is VALID [2020-07-10 15:07:12,895 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-10 15:07:12,895 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-10 15:07:12,895 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-10 15:07:12,895 INFO L280 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5144#false} is VALID [2020-07-10 15:07:12,895 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-10 15:07:12,896 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-10 15:07:12,896 INFO L280 TraceCheckUtils]: 45: Hoare triple {5144#false} assume true; {5144#false} is VALID [2020-07-10 15:07:12,896 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {5144#false} {5144#false} #57#return; {5144#false} is VALID [2020-07-10 15:07:12,896 INFO L280 TraceCheckUtils]: 47: Hoare triple {5144#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5144#false} is VALID [2020-07-10 15:07:12,896 INFO L280 TraceCheckUtils]: 48: Hoare triple {5144#false} assume 0 == #t~ret8;havoc #t~ret8; {5144#false} is VALID [2020-07-10 15:07:12,896 INFO L280 TraceCheckUtils]: 49: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2020-07-10 15:07:12,898 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-10 15:07:12,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:12,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 21 [2020-07-10 15:07:12,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802428533] [2020-07-10 15:07:12,899 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2020-07-10 15:07:12,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:12,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-10 15:07:12,973 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-10 15:07:12,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-10 15:07:12,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:12,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-10 15:07:12,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2020-07-10 15:07:12,974 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 21 states. [2020-07-10 15:07:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:13,387 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2020-07-10 15:07:13,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-10 15:07:13,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2020-07-10 15:07:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:07:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2020-07-10 15:07:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:07:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2020-07-10 15:07:13,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 68 transitions. [2020-07-10 15:07:13,484 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-10 15:07:13,486 INFO L225 Difference]: With dead ends: 66 [2020-07-10 15:07:13,486 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 15:07:13,487 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-10 15:07:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 15:07:13,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2020-07-10 15:07:13,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:13,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2020-07-10 15:07:13,523 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2020-07-10 15:07:13,524 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2020-07-10 15:07:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:13,527 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-10 15:07:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-10 15:07:13,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:13,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:13,528 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2020-07-10 15:07:13,529 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2020-07-10 15:07:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:13,530 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-10 15:07:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-10 15:07:13,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:13,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:13,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:13,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-10 15:07:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-07-10 15:07:13,533 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2020-07-10 15:07:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:13,533 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-07-10 15:07:13,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-10 15:07:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-07-10 15:07:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 15:07:13,534 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:13,535 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-10 15:07:13,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-10 15:07:13,736 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:13,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash -645514611, now seen corresponding path program 17 times [2020-07-10 15:07:13,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:13,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793900058] [2020-07-10 15:07:13,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:14,104 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-10 15:07:14,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-10 15:07:14,104 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5602#true} {5602#true} #53#return; {5602#true} is VALID [2020-07-10 15:07:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:14,113 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-10 15:07:14,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-10 15:07:14,113 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5602#true} {5603#false} #57#return; {5603#false} is VALID [2020-07-10 15:07:14,115 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-10 15:07:14,115 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-10 15:07:14,116 INFO L280 TraceCheckUtils]: 2: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-10 15:07:14,116 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5602#true} {5602#true} #53#return; {5602#true} is VALID [2020-07-10 15:07:14,116 INFO L263 TraceCheckUtils]: 4: Hoare triple {5602#true} call #t~ret9 := main(); {5602#true} is VALID [2020-07-10 15:07:14,116 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-10 15:07:14,117 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-10 15:07:14,117 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-10 15:07:14,118 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-10 15:07:14,118 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-10 15:07:14,119 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-10 15:07:14,119 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-10 15:07:14,120 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-10 15:07:14,120 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-10 15:07:14,121 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-10 15:07:14,121 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-10 15:07:14,121 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-10 15:07:14,122 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-10 15:07:14,122 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-10 15:07:14,123 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-10 15:07:14,123 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-10 15:07:14,124 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-10 15:07:14,124 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-10 15:07:14,125 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-10 15:07:14,125 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-10 15:07:14,126 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-10 15:07:14,126 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-10 15:07:14,126 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-10 15:07:14,127 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-10 15:07:14,127 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-10 15:07:14,128 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-10 15:07:14,128 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-10 15:07:14,129 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-10 15:07:14,129 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-10 15:07:14,130 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-10 15:07:14,130 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-10 15:07:14,130 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-10 15:07:14,131 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-10 15:07:14,131 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-10 15:07:14,132 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-10 15:07:14,134 INFO L280 TraceCheckUtils]: 40: Hoare triple {5624#(<= main_~j~0 17)} assume !(~j~0 < 20); {5603#false} is VALID [2020-07-10 15:07:14,134 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-10 15:07:14,135 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-10 15:07:14,135 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-10 15:07:14,135 INFO L280 TraceCheckUtils]: 44: Hoare triple {5603#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5603#false} is VALID [2020-07-10 15:07:14,136 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-10 15:07:14,136 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-10 15:07:14,136 INFO L280 TraceCheckUtils]: 47: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-10 15:07:14,137 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {5602#true} {5603#false} #57#return; {5603#false} is VALID [2020-07-10 15:07:14,137 INFO L280 TraceCheckUtils]: 49: Hoare triple {5603#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5603#false} is VALID [2020-07-10 15:07:14,137 INFO L280 TraceCheckUtils]: 50: Hoare triple {5603#false} assume 0 == #t~ret8;havoc #t~ret8; {5603#false} is VALID [2020-07-10 15:07:14,137 INFO L280 TraceCheckUtils]: 51: Hoare triple {5603#false} assume !false; {5603#false} is VALID [2020-07-10 15:07:14,140 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-10 15:07:14,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793900058] [2020-07-10 15:07:14,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388585061] [2020-07-10 15:07:14,141 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-10 15:07:15,511 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2020-07-10 15:07:15,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:07:15,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-10 15:07:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:15,536 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:15,695 INFO L263 TraceCheckUtils]: 0: Hoare triple {5602#true} call ULTIMATE.init(); {5602#true} is VALID [2020-07-10 15:07:15,695 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-10 15:07:15,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-10 15:07:15,695 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5602#true} {5602#true} #53#return; {5602#true} is VALID [2020-07-10 15:07:15,696 INFO L263 TraceCheckUtils]: 4: Hoare triple {5602#true} call #t~ret9 := main(); {5602#true} is VALID [2020-07-10 15:07:15,696 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-10 15:07:15,697 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-10 15:07:15,697 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-10 15:07:15,698 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-10 15:07:15,698 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-10 15:07:15,699 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-10 15:07:15,699 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-10 15:07:15,700 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-10 15:07:15,700 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-10 15:07:15,701 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-10 15:07:15,701 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-10 15:07:15,702 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-10 15:07:15,704 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-10 15:07:15,711 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-10 15:07:15,713 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-10 15:07:15,713 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-10 15:07:15,714 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-10 15:07:15,715 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-10 15:07:15,715 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-10 15:07:15,716 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-10 15:07:15,717 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-10 15:07:15,717 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-10 15:07:15,718 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-10 15:07:15,719 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-10 15:07:15,719 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-10 15:07:15,720 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-10 15:07:15,721 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-10 15:07:15,721 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-10 15:07:15,722 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-10 15:07:15,722 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-10 15:07:15,723 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-10 15:07:15,724 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-10 15:07:15,724 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-10 15:07:15,725 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-10 15:07:15,726 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-10 15:07:15,726 INFO L280 TraceCheckUtils]: 40: Hoare triple {5624#(<= main_~j~0 17)} assume !(~j~0 < 20); {5603#false} is VALID [2020-07-10 15:07:15,727 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-10 15:07:15,727 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-10 15:07:15,727 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-10 15:07:15,727 INFO L280 TraceCheckUtils]: 44: Hoare triple {5603#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5603#false} is VALID [2020-07-10 15:07:15,727 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-10 15:07:15,728 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-10 15:07:15,728 INFO L280 TraceCheckUtils]: 47: Hoare triple {5603#false} assume true; {5603#false} is VALID [2020-07-10 15:07:15,728 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {5603#false} {5603#false} #57#return; {5603#false} is VALID [2020-07-10 15:07:15,728 INFO L280 TraceCheckUtils]: 49: Hoare triple {5603#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5603#false} is VALID [2020-07-10 15:07:15,728 INFO L280 TraceCheckUtils]: 50: Hoare triple {5603#false} assume 0 == #t~ret8;havoc #t~ret8; {5603#false} is VALID [2020-07-10 15:07:15,728 INFO L280 TraceCheckUtils]: 51: Hoare triple {5603#false} assume !false; {5603#false} is VALID [2020-07-10 15:07:15,731 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-10 15:07:15,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:15,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 22 [2020-07-10 15:07:15,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554685483] [2020-07-10 15:07:15,733 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 52 [2020-07-10 15:07:15,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:15,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2020-07-10 15:07:15,809 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-10 15:07:15,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-10 15:07:15,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:15,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-10 15:07:15,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2020-07-10 15:07:15,811 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 22 states. [2020-07-10 15:07:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:16,333 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2020-07-10 15:07:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-10 15:07:16,333 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 52 [2020-07-10 15:07:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 15:07:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2020-07-10 15:07:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 15:07:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2020-07-10 15:07:16,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 70 transitions. [2020-07-10 15:07:16,428 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-10 15:07:16,429 INFO L225 Difference]: With dead ends: 68 [2020-07-10 15:07:16,429 INFO L226 Difference]: Without dead ends: 56 [2020-07-10 15:07:16,430 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-10 15:07:16,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-10 15:07:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2020-07-10 15:07:16,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:16,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2020-07-10 15:07:16,463 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2020-07-10 15:07:16,463 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2020-07-10 15:07:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:16,465 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-10 15:07:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-10 15:07:16,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:16,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:16,466 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2020-07-10 15:07:16,466 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2020-07-10 15:07:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:16,467 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-10 15:07:16,467 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-10 15:07:16,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:16,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:16,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:16,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 15:07:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-07-10 15:07:16,470 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2020-07-10 15:07:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:16,470 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-07-10 15:07:16,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-10 15:07:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-07-10 15:07:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-10 15:07:16,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:16,471 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-10 15:07:16,684 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:07:16,685 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:16,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:16,685 INFO L82 PathProgramCache]: Analyzing trace with hash 276829359, now seen corresponding path program 18 times [2020-07-10 15:07:16,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:16,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294021751] [2020-07-10 15:07:16,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:17,083 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-10 15:07:17,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-10 15:07:17,084 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6078#true} {6078#true} #53#return; {6078#true} is VALID [2020-07-10 15:07:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:17,088 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-10 15:07:17,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-10 15:07:17,089 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6078#true} {6079#false} #57#return; {6079#false} is VALID [2020-07-10 15:07:17,089 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-10 15:07:17,090 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-10 15:07:17,090 INFO L280 TraceCheckUtils]: 2: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-10 15:07:17,090 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6078#true} {6078#true} #53#return; {6078#true} is VALID [2020-07-10 15:07:17,090 INFO L263 TraceCheckUtils]: 4: Hoare triple {6078#true} call #t~ret9 := main(); {6078#true} is VALID [2020-07-10 15:07:17,091 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-10 15:07:17,092 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-10 15:07:17,092 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-10 15:07:17,093 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-10 15:07:17,094 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-10 15:07:17,094 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-10 15:07:17,095 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-10 15:07:17,095 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-10 15:07:17,096 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-10 15:07:17,096 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-10 15:07:17,096 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-10 15:07:17,097 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-10 15:07:17,097 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-10 15:07:17,098 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-10 15:07:17,098 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-10 15:07:17,099 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-10 15:07:17,099 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-10 15:07:17,100 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-10 15:07:17,100 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-10 15:07:17,101 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-10 15:07:17,101 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-10 15:07:17,102 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-10 15:07:17,102 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-10 15:07:17,102 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-10 15:07:17,103 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-10 15:07:17,104 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-10 15:07:17,105 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-10 15:07:17,106 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-10 15:07:17,106 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-10 15:07:17,107 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-10 15:07:17,107 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-10 15:07:17,108 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-10 15:07:17,108 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-10 15:07:17,108 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-10 15:07:17,109 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-10 15:07:17,109 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-10 15:07:17,110 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-10 15:07:17,110 INFO L280 TraceCheckUtils]: 42: Hoare triple {6101#(<= main_~j~0 18)} assume !(~j~0 < 20); {6079#false} is VALID [2020-07-10 15:07:17,111 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-10 15:07:17,111 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-10 15:07:17,111 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-10 15:07:17,111 INFO L280 TraceCheckUtils]: 46: Hoare triple {6079#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6079#false} is VALID [2020-07-10 15:07:17,111 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-10 15:07:17,111 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-10 15:07:17,111 INFO L280 TraceCheckUtils]: 49: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-10 15:07:17,111 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {6078#true} {6079#false} #57#return; {6079#false} is VALID [2020-07-10 15:07:17,112 INFO L280 TraceCheckUtils]: 51: Hoare triple {6079#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6079#false} is VALID [2020-07-10 15:07:17,112 INFO L280 TraceCheckUtils]: 52: Hoare triple {6079#false} assume 0 == #t~ret8;havoc #t~ret8; {6079#false} is VALID [2020-07-10 15:07:17,112 INFO L280 TraceCheckUtils]: 53: Hoare triple {6079#false} assume !false; {6079#false} is VALID [2020-07-10 15:07:17,114 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-10 15:07:17,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294021751] [2020-07-10 15:07:17,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778888031] [2020-07-10 15:07:17,115 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-10 15:07:21,359 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2020-07-10 15:07:21,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:07:21,390 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-10 15:07:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:21,405 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:21,565 INFO L263 TraceCheckUtils]: 0: Hoare triple {6078#true} call ULTIMATE.init(); {6078#true} is VALID [2020-07-10 15:07:21,565 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-10 15:07:21,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-10 15:07:21,566 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6078#true} {6078#true} #53#return; {6078#true} is VALID [2020-07-10 15:07:21,566 INFO L263 TraceCheckUtils]: 4: Hoare triple {6078#true} call #t~ret9 := main(); {6078#true} is VALID [2020-07-10 15:07:21,567 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-10 15:07:21,567 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-10 15:07:21,568 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-10 15:07:21,569 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-10 15:07:21,571 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-10 15:07:21,574 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-10 15:07:21,574 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-10 15:07:21,575 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-10 15:07:21,576 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-10 15:07:21,576 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-10 15:07:21,577 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-10 15:07:21,578 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-10 15:07:21,578 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-10 15:07:21,579 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-10 15:07:21,580 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-10 15:07:21,580 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-10 15:07:21,581 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-10 15:07:21,581 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-10 15:07:21,582 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-10 15:07:21,583 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-10 15:07:21,584 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-10 15:07:21,584 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-10 15:07:21,585 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-10 15:07:21,585 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-10 15:07:21,586 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-10 15:07:21,587 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-10 15:07:21,587 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-10 15:07:21,588 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-10 15:07:21,589 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-10 15:07:21,589 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-10 15:07:21,590 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-10 15:07:21,590 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-10 15:07:21,591 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-10 15:07:21,591 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-10 15:07:21,592 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-10 15:07:21,592 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-10 15:07:21,593 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-10 15:07:21,593 INFO L280 TraceCheckUtils]: 42: Hoare triple {6101#(<= main_~j~0 18)} assume !(~j~0 < 20); {6079#false} is VALID [2020-07-10 15:07:21,593 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-10 15:07:21,593 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-10 15:07:21,593 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-10 15:07:21,594 INFO L280 TraceCheckUtils]: 46: Hoare triple {6079#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6079#false} is VALID [2020-07-10 15:07:21,594 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-10 15:07:21,594 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-10 15:07:21,594 INFO L280 TraceCheckUtils]: 49: Hoare triple {6079#false} assume true; {6079#false} is VALID [2020-07-10 15:07:21,594 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {6079#false} {6079#false} #57#return; {6079#false} is VALID [2020-07-10 15:07:21,594 INFO L280 TraceCheckUtils]: 51: Hoare triple {6079#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6079#false} is VALID [2020-07-10 15:07:21,594 INFO L280 TraceCheckUtils]: 52: Hoare triple {6079#false} assume 0 == #t~ret8;havoc #t~ret8; {6079#false} is VALID [2020-07-10 15:07:21,594 INFO L280 TraceCheckUtils]: 53: Hoare triple {6079#false} assume !false; {6079#false} is VALID [2020-07-10 15:07:21,597 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-10 15:07:21,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:21,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 23 [2020-07-10 15:07:21,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743517923] [2020-07-10 15:07:21,598 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2020-07-10 15:07:21,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:21,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2020-07-10 15:07:21,679 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-10 15:07:21,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-10 15:07:21,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:21,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-10 15:07:21,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2020-07-10 15:07:21,680 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 23 states. [2020-07-10 15:07:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:22,217 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-07-10 15:07:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-10 15:07:22,217 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2020-07-10 15:07:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 15:07:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2020-07-10 15:07:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 15:07:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2020-07-10 15:07:22,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 72 transitions. [2020-07-10 15:07:22,316 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-10 15:07:22,317 INFO L225 Difference]: With dead ends: 70 [2020-07-10 15:07:22,318 INFO L226 Difference]: Without dead ends: 58 [2020-07-10 15:07:22,318 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-10 15:07:22,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-10 15:07:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-07-10 15:07:22,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:22,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2020-07-10 15:07:22,341 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2020-07-10 15:07:22,341 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2020-07-10 15:07:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:22,343 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-07-10 15:07:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-10 15:07:22,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:22,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:22,345 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2020-07-10 15:07:22,345 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2020-07-10 15:07:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:22,346 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-07-10 15:07:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-10 15:07:22,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:22,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:22,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:22,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-10 15:07:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-07-10 15:07:22,350 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2020-07-10 15:07:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:22,351 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-07-10 15:07:22,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-10 15:07:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-10 15:07:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-10 15:07:22,352 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:22,352 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-10 15:07:22,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:07:22,553 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:22,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1886121553, now seen corresponding path program 19 times [2020-07-10 15:07:22,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:22,554 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716447617] [2020-07-10 15:07:22,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:22,979 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-10 15:07:22,980 INFO L280 TraceCheckUtils]: 1: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-10 15:07:22,980 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6571#true} {6571#true} #53#return; {6571#true} is VALID [2020-07-10 15:07:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:22,983 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-10 15:07:22,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-10 15:07:22,984 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6571#true} {6572#false} #57#return; {6572#false} is VALID [2020-07-10 15:07:22,984 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-10 15:07:22,985 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-10 15:07:22,985 INFO L280 TraceCheckUtils]: 2: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-10 15:07:22,985 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6571#true} {6571#true} #53#return; {6571#true} is VALID [2020-07-10 15:07:22,985 INFO L263 TraceCheckUtils]: 4: Hoare triple {6571#true} call #t~ret9 := main(); {6571#true} is VALID [2020-07-10 15:07:22,986 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-10 15:07:22,987 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-10 15:07:22,987 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-10 15:07:22,988 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-10 15:07:22,989 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-10 15:07:22,989 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-10 15:07:22,990 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-10 15:07:22,991 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-10 15:07:22,991 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-10 15:07:22,992 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-10 15:07:22,993 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-10 15:07:22,993 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-10 15:07:22,994 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-10 15:07:22,994 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-10 15:07:22,994 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-10 15:07:22,995 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-10 15:07:22,995 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-10 15:07:22,996 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-10 15:07:22,996 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-10 15:07:22,997 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-10 15:07:22,997 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-10 15:07:22,997 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-10 15:07:22,998 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-10 15:07:22,998 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-10 15:07:22,999 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-10 15:07:22,999 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-10 15:07:23,000 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-10 15:07:23,000 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-10 15:07:23,001 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-10 15:07:23,001 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-10 15:07:23,002 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-10 15:07:23,002 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-10 15:07:23,002 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-10 15:07:23,003 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-10 15:07:23,003 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-10 15:07:23,004 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-10 15:07:23,004 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-10 15:07:23,005 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-10 15:07:23,006 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-10 15:07:23,006 INFO L280 TraceCheckUtils]: 44: Hoare triple {6595#(<= main_~j~0 19)} assume !(~j~0 < 20); {6572#false} is VALID [2020-07-10 15:07:23,006 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-10 15:07:23,006 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-10 15:07:23,007 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-10 15:07:23,007 INFO L280 TraceCheckUtils]: 48: Hoare triple {6572#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6572#false} is VALID [2020-07-10 15:07:23,007 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-10 15:07:23,007 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-10 15:07:23,007 INFO L280 TraceCheckUtils]: 51: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-10 15:07:23,007 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {6571#true} {6572#false} #57#return; {6572#false} is VALID [2020-07-10 15:07:23,007 INFO L280 TraceCheckUtils]: 53: Hoare triple {6572#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6572#false} is VALID [2020-07-10 15:07:23,007 INFO L280 TraceCheckUtils]: 54: Hoare triple {6572#false} assume 0 == #t~ret8;havoc #t~ret8; {6572#false} is VALID [2020-07-10 15:07:23,008 INFO L280 TraceCheckUtils]: 55: Hoare triple {6572#false} assume !false; {6572#false} is VALID [2020-07-10 15:07:23,010 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-10 15:07:23,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716447617] [2020-07-10 15:07:23,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797176871] [2020-07-10 15:07:23,011 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-10 15:07:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:23,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-10 15:07:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:23,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:23,265 INFO L263 TraceCheckUtils]: 0: Hoare triple {6571#true} call ULTIMATE.init(); {6571#true} is VALID [2020-07-10 15:07:23,266 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-10 15:07:23,266 INFO L280 TraceCheckUtils]: 2: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-10 15:07:23,266 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6571#true} {6571#true} #53#return; {6571#true} is VALID [2020-07-10 15:07:23,266 INFO L263 TraceCheckUtils]: 4: Hoare triple {6571#true} call #t~ret9 := main(); {6571#true} is VALID [2020-07-10 15:07:23,267 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-10 15:07:23,267 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-10 15:07:23,268 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-10 15:07:23,268 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-10 15:07:23,268 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-10 15:07:23,269 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-10 15:07:23,269 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-10 15:07:23,270 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-10 15:07:23,270 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-10 15:07:23,274 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-10 15:07:23,278 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-10 15:07:23,279 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-10 15:07:23,280 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-10 15:07:23,280 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-10 15:07:23,281 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-10 15:07:23,281 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-10 15:07:23,282 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-10 15:07:23,282 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-10 15:07:23,283 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-10 15:07:23,283 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-10 15:07:23,284 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-10 15:07:23,284 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-10 15:07:23,285 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-10 15:07:23,285 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-10 15:07:23,286 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-10 15:07:23,286 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-10 15:07:23,287 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-10 15:07:23,287 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-10 15:07:23,288 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-10 15:07:23,289 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-10 15:07:23,289 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-10 15:07:23,289 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-10 15:07:23,290 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-10 15:07:23,291 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-10 15:07:23,291 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-10 15:07:23,292 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-10 15:07:23,293 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-10 15:07:23,293 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-10 15:07:23,294 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-10 15:07:23,294 INFO L280 TraceCheckUtils]: 44: Hoare triple {6595#(<= main_~j~0 19)} assume !(~j~0 < 20); {6572#false} is VALID [2020-07-10 15:07:23,295 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-10 15:07:23,295 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-10 15:07:23,295 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-10 15:07:23,295 INFO L280 TraceCheckUtils]: 48: Hoare triple {6572#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6572#false} is VALID [2020-07-10 15:07:23,295 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-10 15:07:23,295 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-10 15:07:23,295 INFO L280 TraceCheckUtils]: 51: Hoare triple {6572#false} assume true; {6572#false} is VALID [2020-07-10 15:07:23,295 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {6572#false} {6572#false} #57#return; {6572#false} is VALID [2020-07-10 15:07:23,296 INFO L280 TraceCheckUtils]: 53: Hoare triple {6572#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6572#false} is VALID [2020-07-10 15:07:23,296 INFO L280 TraceCheckUtils]: 54: Hoare triple {6572#false} assume 0 == #t~ret8;havoc #t~ret8; {6572#false} is VALID [2020-07-10 15:07:23,296 INFO L280 TraceCheckUtils]: 55: Hoare triple {6572#false} assume !false; {6572#false} is VALID [2020-07-10 15:07:23,298 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-10 15:07:23,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:23,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 24 [2020-07-10 15:07:23,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490144406] [2020-07-10 15:07:23,299 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2020-07-10 15:07:23,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:23,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2020-07-10 15:07:23,383 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-10 15:07:23,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-10 15:07:23,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:23,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-10 15:07:23,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2020-07-10 15:07:23,385 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 24 states. [2020-07-10 15:07:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:23,667 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2020-07-10 15:07:23,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-10 15:07:23,668 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2020-07-10 15:07:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 15:07:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2020-07-10 15:07:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 15:07:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2020-07-10 15:07:23,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 73 transitions. [2020-07-10 15:07:23,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:07:23,782 INFO L225 Difference]: With dead ends: 71 [2020-07-10 15:07:23,782 INFO L226 Difference]: Without dead ends: 59 [2020-07-10 15:07:23,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2020-07-10 15:07:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-10 15:07:23,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-10 15:07:23,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:23,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-10 15:07:23,815 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-10 15:07:23,815 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-10 15:07:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:23,817 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-10 15:07:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-10 15:07:23,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:23,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:23,818 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-10 15:07:23,818 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-10 15:07:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:23,825 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-10 15:07:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-10 15:07:23,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:23,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:23,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:23,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 15:07:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-07-10 15:07:23,832 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2020-07-10 15:07:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:23,833 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-07-10 15:07:23,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-10 15:07:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-10 15:07:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-10 15:07:23,834 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:23,834 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-10 15:07:24,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:07:24,049 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:24,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2067273869, now seen corresponding path program 20 times [2020-07-10 15:07:24,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:24,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052660723] [2020-07-10 15:07:24,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:07:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:07:24,284 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:07:24,285 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:07:24,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-10 15:07:24,379 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:07:24,379 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:07:24,379 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:07:24,379 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:07:24,379 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2020-07-10 15:07:24,379 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:07:24,379 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:07:24,379 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:07:24,379 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-10 15:07:24,380 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-10 15:07:24,380 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-10 15:07:24,380 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2020-07-10 15:07:24,380 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:07:24,380 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:07:24,380 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2020-07-10 15:07:24,380 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-10 15:07:24,380 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-10 15:07:24,380 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:07:24,381 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:07:24,382 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:07:24,382 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:07:24,382 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:07:24,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:07:24 BoogieIcfgContainer [2020-07-10 15:07:24,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:07:24,386 INFO L168 Benchmark]: Toolchain (without parser) took 31693.90 ms. Allocated memory was 136.3 MB in the beginning and 410.0 MB in the end (delta: 273.7 MB). Free memory was 99.9 MB in the beginning and 167.1 MB in the end (delta: -67.2 MB). Peak memory consumption was 206.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:24,388 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:07:24,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.93 ms. Allocated memory is still 136.3 MB. Free memory was 99.5 MB in the beginning and 88.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:24,389 INFO L168 Benchmark]: Boogie Preprocessor took 144.36 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 88.8 MB in the beginning and 177.7 MB in the end (delta: -88.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:24,389 INFO L168 Benchmark]: RCFGBuilder took 444.33 ms. Allocated memory is still 200.3 MB. Free memory was 177.7 MB in the beginning and 155.9 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:24,390 INFO L168 Benchmark]: TraceAbstraction took 30806.93 ms. Allocated memory was 200.3 MB in the beginning and 410.0 MB in the end (delta: 209.7 MB). Free memory was 155.3 MB in the beginning and 167.1 MB in the end (delta: -11.9 MB). Peak memory consumption was 197.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:24,392 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.54 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.93 ms. Allocated memory is still 136.3 MB. Free memory was 99.5 MB in the beginning and 88.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.36 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 88.8 MB in the beginning and 177.7 MB in the end (delta: -88.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 444.33 ms. Allocated memory is still 200.3 MB. Free memory was 177.7 MB in the beginning and 155.9 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30806.93 ms. Allocated memory was 200.3 MB in the beginning and 410.0 MB in the end (delta: 209.7 MB). Free memory was 155.3 MB in the beginning and 167.1 MB in the end (delta: -11.9 MB). Peak memory consumption was 197.8 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: 30.6s, 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.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 19 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 8.0s 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...