java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_09_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:46:41,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:46:41,070 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:46:41,087 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:46:41,089 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:46:41,090 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:46:41,091 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:46:41,094 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:46:41,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:46:41,104 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:46:41,105 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:46:41,105 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:46:41,106 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:46:41,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:46:41,115 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:46:41,116 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:46:41,117 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:46:41,120 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:46:41,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:46:41,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:46:41,131 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:46:41,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:46:41,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:46:41,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:46:41,138 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:46:41,140 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:46:41,141 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:46:41,143 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:46:41,144 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:46:41,145 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:46:41,146 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:46:41,149 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:46:41,149 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:46:41,149 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:46:41,150 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:46:41,151 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:46:41,152 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:46:41,181 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:46:41,181 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:46:41,182 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:46:41,182 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:46:41,184 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:46:41,184 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:46:41,184 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:46:41,184 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:46:41,185 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:46:41,185 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:46:41,185 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:46:41,185 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:46:41,185 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:46:41,187 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:46:41,187 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:46:41,187 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:46:41,187 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:46:41,187 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:46:41,188 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:46:41,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:46:41,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:46:41,189 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:46:41,189 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:46:41,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:46:41,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:46:41,190 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:46:41,190 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:46:41,191 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:46:41,191 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:46:41,191 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:46:41,192 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:46:41,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:46:41,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:46:41,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:46:41,287 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:46:41,288 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:46:41,288 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_09_true-unreach-call.i [2018-11-14 18:46:41,357 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5cd51a2/5ed2fce9d508410ca1bac4e26168888c/FLAG1925941b6 [2018-11-14 18:46:41,785 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:46:41,786 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_09_true-unreach-call.i [2018-11-14 18:46:41,792 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5cd51a2/5ed2fce9d508410ca1bac4e26168888c/FLAG1925941b6 [2018-11-14 18:46:41,809 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5cd51a2/5ed2fce9d508410ca1bac4e26168888c [2018-11-14 18:46:41,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:46:41,820 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:46:41,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:46:41,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:46:41,825 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:46:41,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:46:41" (1/1) ... [2018-11-14 18:46:41,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c9066c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:41, skipping insertion in model container [2018-11-14 18:46:41,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:46:41" (1/1) ... [2018-11-14 18:46:41,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:46:41,867 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:46:42,082 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:46:42,087 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:46:42,114 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:46:42,137 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:46:42,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:42 WrapperNode [2018-11-14 18:46:42,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:46:42,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:46:42,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:46:42,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:46:42,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:42" (1/1) ... [2018-11-14 18:46:42,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:42" (1/1) ... [2018-11-14 18:46:42,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:42" (1/1) ... [2018-11-14 18:46:42,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:42" (1/1) ... [2018-11-14 18:46:42,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:42" (1/1) ... [2018-11-14 18:46:42,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:42" (1/1) ... [2018-11-14 18:46:42,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:42" (1/1) ... [2018-11-14 18:46:42,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:46:42,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:46:42,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:46:42,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:46:42,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:42" (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 [2018-11-14 18:46:42,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:46:42,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:46:42,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:46:42,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:46:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:46:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:46:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:46:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:46:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:46:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:46:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:46:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:46:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:46:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:46:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:46:42,858 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:46:42,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:46:42 BoogieIcfgContainer [2018-11-14 18:46:42,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:46:42,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:46:42,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:46:42,863 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:46:42,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:46:41" (1/3) ... [2018-11-14 18:46:42,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111c5b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:46:42, skipping insertion in model container [2018-11-14 18:46:42,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:46:42" (2/3) ... [2018-11-14 18:46:42,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111c5b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:46:42, skipping insertion in model container [2018-11-14 18:46:42,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:46:42" (3/3) ... [2018-11-14 18:46:42,867 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_09_true-unreach-call.i [2018-11-14 18:46:42,876 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:46:42,885 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:46:42,900 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:46:42,932 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:46:42,933 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:46:42,933 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:46:42,934 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:46:42,934 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:46:42,934 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:46:42,934 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:46:42,934 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:46:42,935 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:46:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-14 18:46:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:46:42,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:42,962 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:42,965 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:42,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:42,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1015131587, now seen corresponding path program 1 times [2018-11-14 18:46:42,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:42,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:43,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:43,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:43,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:43,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-14 18:46:43,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-14 18:46:43,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-14 18:46:43,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-14 18:46:43,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret4 := main(); {30#true} is VALID [2018-11-14 18:46:43,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {30#true} is VALID [2018-11-14 18:46:43,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-14 18:46:43,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~i~0 := 1; {31#false} is VALID [2018-11-14 18:46:43,120 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !true; {31#false} is VALID [2018-11-14 18:46:43,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 1;~j~0 := 0; {31#false} is VALID [2018-11-14 18:46:43,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume true; {31#false} is VALID [2018-11-14 18:46:43,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {31#false} is VALID [2018-11-14 18:46:43,122 INFO L256 TraceCheckUtils]: 12: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {31#false} is VALID [2018-11-14 18:46:43,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-14 18:46:43,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume ~cond == 0; {31#false} is VALID [2018-11-14 18:46:43,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-14 18:46:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:46:43,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:46:43,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:46:43,135 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:46:43,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:43,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:46:43,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:43,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:46:43,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:46:43,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:46:43,299 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-14 18:46:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:43,578 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-14 18:46:43,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:46:43,578 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:46:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:46:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 18:46:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:46:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 18:46:43,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-14 18:46:43,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:43,781 INFO L225 Difference]: With dead ends: 46 [2018-11-14 18:46:43,781 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 18:46:43,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:46:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 18:46:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 18:46:43,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:43,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 18:46:43,822 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 18:46:43,822 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 18:46:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:43,826 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 18:46:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 18:46:43,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:43,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:43,827 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 18:46:43,827 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 18:46:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:43,831 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 18:46:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 18:46:43,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:43,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:43,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:43,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:46:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-14 18:46:43,844 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2018-11-14 18:46:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:43,844 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-14 18:46:43,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:46:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 18:46:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:46:43,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:43,845 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:43,846 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:43,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash -669754579, now seen corresponding path program 1 times [2018-11-14 18:46:43,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:43,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:43,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:43,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:43,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:44,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2018-11-14 18:46:44,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {168#true} is VALID [2018-11-14 18:46:44,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2018-11-14 18:46:44,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #63#return; {168#true} is VALID [2018-11-14 18:46:44,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret4 := main(); {168#true} is VALID [2018-11-14 18:46:44,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {168#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {170#(= main_~i~0 0)} is VALID [2018-11-14 18:46:44,152 INFO L273 TraceCheckUtils]: 6: Hoare triple {170#(= main_~i~0 0)} assume true; {170#(= main_~i~0 0)} is VALID [2018-11-14 18:46:44,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {170#(= main_~i~0 0)} assume !(~i~0 < 100000); {169#false} is VALID [2018-11-14 18:46:44,153 INFO L273 TraceCheckUtils]: 8: Hoare triple {169#false} ~i~0 := 1; {169#false} is VALID [2018-11-14 18:46:44,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {169#false} assume true; {169#false} is VALID [2018-11-14 18:46:44,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {169#false} assume !(~i~0 < 100000); {169#false} is VALID [2018-11-14 18:46:44,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {169#false} ~i~0 := 1;~j~0 := 0; {169#false} is VALID [2018-11-14 18:46:44,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {169#false} assume true; {169#false} is VALID [2018-11-14 18:46:44,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {169#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {169#false} is VALID [2018-11-14 18:46:44,155 INFO L256 TraceCheckUtils]: 14: Hoare triple {169#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {169#false} is VALID [2018-11-14 18:46:44,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2018-11-14 18:46:44,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {169#false} assume ~cond == 0; {169#false} is VALID [2018-11-14 18:46:44,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {169#false} assume !false; {169#false} is VALID [2018-11-14 18:46:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:46:44,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:46:44,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:46:44,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:46:44,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:44,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:46:44,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:44,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:46:44,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:46:44,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:46:44,212 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-14 18:46:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:44,354 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 18:46:44,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:46:44,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:46:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:46:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 18:46:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:46:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 18:46:44,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-14 18:46:44,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:44,697 INFO L225 Difference]: With dead ends: 38 [2018-11-14 18:46:44,697 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 18:46:44,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:46:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 18:46:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 18:46:44,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:44,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 18:46:44,840 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 18:46:44,840 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 18:46:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:44,848 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 18:46:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 18:46:44,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:44,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:44,849 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 18:46:44,849 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 18:46:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:44,852 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 18:46:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 18:46:44,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:44,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:44,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:44,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:46:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-14 18:46:44,859 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2018-11-14 18:46:44,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:44,860 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-14 18:46:44,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:46:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 18:46:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:46:44,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:44,861 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:44,861 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:44,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:44,862 INFO L82 PathProgramCache]: Analyzing trace with hash 619123155, now seen corresponding path program 1 times [2018-11-14 18:46:44,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:44,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:44,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:44,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:44,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:44,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2018-11-14 18:46:44,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {307#true} is VALID [2018-11-14 18:46:44,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-14 18:46:44,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #63#return; {307#true} is VALID [2018-11-14 18:46:44,954 INFO L256 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret4 := main(); {307#true} is VALID [2018-11-14 18:46:44,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {307#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {307#true} is VALID [2018-11-14 18:46:44,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-14 18:46:44,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {307#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {307#true} is VALID [2018-11-14 18:46:44,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-14 18:46:44,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {307#true} assume !(~i~0 < 100000); {307#true} is VALID [2018-11-14 18:46:44,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {307#true} ~i~0 := 1; {309#(= main_~i~0 1)} is VALID [2018-11-14 18:46:44,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {309#(= main_~i~0 1)} assume true; {309#(= main_~i~0 1)} is VALID [2018-11-14 18:46:44,959 INFO L273 TraceCheckUtils]: 12: Hoare triple {309#(= main_~i~0 1)} assume !(~i~0 < 100000); {308#false} is VALID [2018-11-14 18:46:44,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {308#false} ~i~0 := 1;~j~0 := 0; {308#false} is VALID [2018-11-14 18:46:44,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {308#false} assume true; {308#false} is VALID [2018-11-14 18:46:44,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {308#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {308#false} is VALID [2018-11-14 18:46:44,960 INFO L256 TraceCheckUtils]: 16: Hoare triple {308#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {308#false} is VALID [2018-11-14 18:46:44,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2018-11-14 18:46:44,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {308#false} assume ~cond == 0; {308#false} is VALID [2018-11-14 18:46:44,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {308#false} assume !false; {308#false} is VALID [2018-11-14 18:46:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:46:44,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:46:44,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:46:44,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:46:44,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:44,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:46:45,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:45,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:46:45,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:46:45,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:46:45,028 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 3 states. [2018-11-14 18:46:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:45,272 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-14 18:46:45,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:46:45,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:46:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:46:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 18:46:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:46:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 18:46:45,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-14 18:46:45,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:45,384 INFO L225 Difference]: With dead ends: 41 [2018-11-14 18:46:45,384 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 18:46:45,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:46:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 18:46:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-14 18:46:45,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:45,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 26 states. [2018-11-14 18:46:45,401 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 26 states. [2018-11-14 18:46:45,401 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 26 states. [2018-11-14 18:46:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:45,406 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 18:46:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 18:46:45,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:45,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:45,407 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 30 states. [2018-11-14 18:46:45,407 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 30 states. [2018-11-14 18:46:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:45,410 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 18:46:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 18:46:45,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:45,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:45,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:45,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:46:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-14 18:46:45,418 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2018-11-14 18:46:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:45,418 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-14 18:46:45,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:46:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-14 18:46:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:46:45,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:45,420 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:45,420 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:45,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1402898029, now seen corresponding path program 1 times [2018-11-14 18:46:45,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:45,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:45,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:45,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-14 18:46:45,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {466#true} is VALID [2018-11-14 18:46:45,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-14 18:46:45,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #63#return; {466#true} is VALID [2018-11-14 18:46:45,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret4 := main(); {466#true} is VALID [2018-11-14 18:46:45,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {468#(= main_~i~0 0)} is VALID [2018-11-14 18:46:45,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {468#(= main_~i~0 0)} assume true; {468#(= main_~i~0 0)} is VALID [2018-11-14 18:46:45,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {468#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {469#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:45,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(<= main_~i~0 1)} assume true; {469#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:45,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {469#(<= main_~i~0 1)} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-14 18:46:45,552 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#false} ~i~0 := 1; {467#false} is VALID [2018-11-14 18:46:45,552 INFO L273 TraceCheckUtils]: 11: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 18:46:45,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {467#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {467#false} is VALID [2018-11-14 18:46:45,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 18:46:45,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {467#false} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-14 18:46:45,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {467#false} ~i~0 := 1;~j~0 := 0; {467#false} is VALID [2018-11-14 18:46:45,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 18:46:45,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {467#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {467#false} is VALID [2018-11-14 18:46:45,554 INFO L256 TraceCheckUtils]: 18: Hoare triple {467#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {467#false} is VALID [2018-11-14 18:46:45,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2018-11-14 18:46:45,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {467#false} assume ~cond == 0; {467#false} is VALID [2018-11-14 18:46:45,555 INFO L273 TraceCheckUtils]: 21: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-14 18:46:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:46:45,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:45,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:46:45,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:45,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:45,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-14 18:46:45,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {466#true} is VALID [2018-11-14 18:46:45,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-14 18:46:45,908 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #63#return; {466#true} is VALID [2018-11-14 18:46:45,908 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret4 := main(); {466#true} is VALID [2018-11-14 18:46:45,909 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {488#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:45,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {488#(<= main_~i~0 0)} assume true; {488#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:45,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {469#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:45,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(<= main_~i~0 1)} assume true; {469#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:45,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {469#(<= main_~i~0 1)} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-14 18:46:45,912 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#false} ~i~0 := 1; {467#false} is VALID [2018-11-14 18:46:45,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 18:46:45,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {467#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {467#false} is VALID [2018-11-14 18:46:45,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 18:46:45,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {467#false} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-14 18:46:45,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {467#false} ~i~0 := 1;~j~0 := 0; {467#false} is VALID [2018-11-14 18:46:45,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 18:46:45,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {467#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {467#false} is VALID [2018-11-14 18:46:45,916 INFO L256 TraceCheckUtils]: 18: Hoare triple {467#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {467#false} is VALID [2018-11-14 18:46:45,916 INFO L273 TraceCheckUtils]: 19: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2018-11-14 18:46:45,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {467#false} assume ~cond == 0; {467#false} is VALID [2018-11-14 18:46:45,917 INFO L273 TraceCheckUtils]: 21: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-14 18:46:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:46:45,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:45,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:46:45,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 18:46:45,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:45,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:46:46,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:46,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:46:46,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:46:46,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:46:46,003 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-14 18:46:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:46,405 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 18:46:46,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:46:46,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 18:46:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:46:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-14 18:46:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:46:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-14 18:46:46,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-14 18:46:46,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:46,504 INFO L225 Difference]: With dead ends: 48 [2018-11-14 18:46:46,504 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 18:46:46,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:46:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 18:46:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-11-14 18:46:46,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:46,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2018-11-14 18:46:46,535 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2018-11-14 18:46:46,535 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2018-11-14 18:46:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:46,537 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 18:46:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 18:46:46,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:46,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:46,539 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2018-11-14 18:46:46,539 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2018-11-14 18:46:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:46,542 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 18:46:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 18:46:46,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:46,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:46,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:46,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:46:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-14 18:46:46,545 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2018-11-14 18:46:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:46,546 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-14 18:46:46,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:46:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 18:46:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:46:46,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:46,547 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:46,547 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:46,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash -179733997, now seen corresponding path program 2 times [2018-11-14 18:46:46,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:46,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:46,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:46,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:46,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:46,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2018-11-14 18:46:46,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {707#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {707#true} is VALID [2018-11-14 18:46:46,705 INFO L273 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2018-11-14 18:46:46,706 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #63#return; {707#true} is VALID [2018-11-14 18:46:46,706 INFO L256 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret4 := main(); {707#true} is VALID [2018-11-14 18:46:46,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {707#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {709#(= main_~i~0 0)} is VALID [2018-11-14 18:46:46,707 INFO L273 TraceCheckUtils]: 6: Hoare triple {709#(= main_~i~0 0)} assume true; {709#(= main_~i~0 0)} is VALID [2018-11-14 18:46:46,708 INFO L273 TraceCheckUtils]: 7: Hoare triple {709#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {710#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:46,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#(<= main_~i~0 1)} assume true; {710#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:46,715 INFO L273 TraceCheckUtils]: 9: Hoare triple {710#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {711#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:46,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#(<= main_~i~0 2)} assume true; {711#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:46,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#(<= main_~i~0 2)} assume !(~i~0 < 100000); {708#false} is VALID [2018-11-14 18:46:46,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {708#false} ~i~0 := 1; {708#false} is VALID [2018-11-14 18:46:46,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 18:46:46,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {708#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {708#false} is VALID [2018-11-14 18:46:46,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 18:46:46,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {708#false} assume !(~i~0 < 100000); {708#false} is VALID [2018-11-14 18:46:46,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {708#false} ~i~0 := 1;~j~0 := 0; {708#false} is VALID [2018-11-14 18:46:46,721 INFO L273 TraceCheckUtils]: 18: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 18:46:46,721 INFO L273 TraceCheckUtils]: 19: Hoare triple {708#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {708#false} is VALID [2018-11-14 18:46:46,722 INFO L256 TraceCheckUtils]: 20: Hoare triple {708#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {708#false} is VALID [2018-11-14 18:46:46,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {708#false} ~cond := #in~cond; {708#false} is VALID [2018-11-14 18:46:46,722 INFO L273 TraceCheckUtils]: 22: Hoare triple {708#false} assume ~cond == 0; {708#false} is VALID [2018-11-14 18:46:46,722 INFO L273 TraceCheckUtils]: 23: Hoare triple {708#false} assume !false; {708#false} is VALID [2018-11-14 18:46:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:46:46,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:46,724 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:46:46,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:46:46,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:46:46,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:46,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:46,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2018-11-14 18:46:46,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {707#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {707#true} is VALID [2018-11-14 18:46:46,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2018-11-14 18:46:46,883 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #63#return; {707#true} is VALID [2018-11-14 18:46:46,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret4 := main(); {707#true} is VALID [2018-11-14 18:46:46,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {707#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {730#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:46,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {730#(<= main_~i~0 0)} assume true; {730#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:46,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {730#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {710#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:46,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#(<= main_~i~0 1)} assume true; {710#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:46,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {710#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {711#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:46,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#(<= main_~i~0 2)} assume true; {711#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:46,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#(<= main_~i~0 2)} assume !(~i~0 < 100000); {708#false} is VALID [2018-11-14 18:46:46,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {708#false} ~i~0 := 1; {708#false} is VALID [2018-11-14 18:46:46,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 18:46:46,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {708#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {708#false} is VALID [2018-11-14 18:46:46,896 INFO L273 TraceCheckUtils]: 15: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 18:46:46,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {708#false} assume !(~i~0 < 100000); {708#false} is VALID [2018-11-14 18:46:46,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {708#false} ~i~0 := 1;~j~0 := 0; {708#false} is VALID [2018-11-14 18:46:46,897 INFO L273 TraceCheckUtils]: 18: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 18:46:46,897 INFO L273 TraceCheckUtils]: 19: Hoare triple {708#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {708#false} is VALID [2018-11-14 18:46:46,897 INFO L256 TraceCheckUtils]: 20: Hoare triple {708#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {708#false} is VALID [2018-11-14 18:46:46,897 INFO L273 TraceCheckUtils]: 21: Hoare triple {708#false} ~cond := #in~cond; {708#false} is VALID [2018-11-14 18:46:46,897 INFO L273 TraceCheckUtils]: 22: Hoare triple {708#false} assume ~cond == 0; {708#false} is VALID [2018-11-14 18:46:46,898 INFO L273 TraceCheckUtils]: 23: Hoare triple {708#false} assume !false; {708#false} is VALID [2018-11-14 18:46:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:46:46,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:46,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 18:46:46,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 18:46:46,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:46,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:46:47,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:47,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:46:47,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:46:47,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:46:47,002 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2018-11-14 18:46:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:47,233 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-14 18:46:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:46:47,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 18:46:47,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:46:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 18:46:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:46:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 18:46:47,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-14 18:46:47,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:47,331 INFO L225 Difference]: With dead ends: 50 [2018-11-14 18:46:47,331 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:46:47,332 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:46:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:46:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-11-14 18:46:47,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:47,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 30 states. [2018-11-14 18:46:47,344 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 30 states. [2018-11-14 18:46:47,344 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 30 states. [2018-11-14 18:46:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:47,347 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 18:46:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:46:47,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:47,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:47,348 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 34 states. [2018-11-14 18:46:47,348 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 34 states. [2018-11-14 18:46:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:47,351 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 18:46:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:46:47,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:47,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:47,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:47,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:46:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-14 18:46:47,354 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2018-11-14 18:46:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:47,355 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-14 18:46:47,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:46:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-14 18:46:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:46:47,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:47,356 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:47,356 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:47,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:47,357 INFO L82 PathProgramCache]: Analyzing trace with hash -670688199, now seen corresponding path program 3 times [2018-11-14 18:46:47,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:47,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:47,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:47,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {965#true} call ULTIMATE.init(); {965#true} is VALID [2018-11-14 18:46:47,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {965#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {965#true} is VALID [2018-11-14 18:46:47,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 18:46:47,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {965#true} {965#true} #63#return; {965#true} is VALID [2018-11-14 18:46:47,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {965#true} call #t~ret4 := main(); {965#true} is VALID [2018-11-14 18:46:47,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {965#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {967#(= main_~i~0 0)} is VALID [2018-11-14 18:46:47,502 INFO L273 TraceCheckUtils]: 6: Hoare triple {967#(= main_~i~0 0)} assume true; {967#(= main_~i~0 0)} is VALID [2018-11-14 18:46:47,503 INFO L273 TraceCheckUtils]: 7: Hoare triple {967#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {968#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:47,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {968#(<= main_~i~0 1)} assume true; {968#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:47,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {968#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {969#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:47,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {969#(<= main_~i~0 2)} assume true; {969#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:47,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {969#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {970#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:47,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {970#(<= main_~i~0 3)} assume true; {970#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:47,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {970#(<= main_~i~0 3)} assume !(~i~0 < 100000); {966#false} is VALID [2018-11-14 18:46:47,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {966#false} ~i~0 := 1; {966#false} is VALID [2018-11-14 18:46:47,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 18:46:47,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {966#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {966#false} is VALID [2018-11-14 18:46:47,512 INFO L273 TraceCheckUtils]: 17: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 18:46:47,512 INFO L273 TraceCheckUtils]: 18: Hoare triple {966#false} assume !(~i~0 < 100000); {966#false} is VALID [2018-11-14 18:46:47,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {966#false} ~i~0 := 1;~j~0 := 0; {966#false} is VALID [2018-11-14 18:46:47,513 INFO L273 TraceCheckUtils]: 20: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 18:46:47,513 INFO L273 TraceCheckUtils]: 21: Hoare triple {966#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {966#false} is VALID [2018-11-14 18:46:47,513 INFO L256 TraceCheckUtils]: 22: Hoare triple {966#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {966#false} is VALID [2018-11-14 18:46:47,513 INFO L273 TraceCheckUtils]: 23: Hoare triple {966#false} ~cond := #in~cond; {966#false} is VALID [2018-11-14 18:46:47,514 INFO L273 TraceCheckUtils]: 24: Hoare triple {966#false} assume ~cond == 0; {966#false} is VALID [2018-11-14 18:46:47,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {966#false} assume !false; {966#false} is VALID [2018-11-14 18:46:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:46:47,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:47,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:46:47,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:46:47,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 18:46:47,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:47,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:47,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {965#true} call ULTIMATE.init(); {965#true} is VALID [2018-11-14 18:46:47,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {965#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {965#true} is VALID [2018-11-14 18:46:47,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 18:46:47,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {965#true} {965#true} #63#return; {965#true} is VALID [2018-11-14 18:46:47,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {965#true} call #t~ret4 := main(); {965#true} is VALID [2018-11-14 18:46:47,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {965#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {965#true} is VALID [2018-11-14 18:46:47,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 18:46:47,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {965#true} is VALID [2018-11-14 18:46:47,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 18:46:47,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {965#true} is VALID [2018-11-14 18:46:47,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 18:46:47,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {965#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {965#true} is VALID [2018-11-14 18:46:47,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 18:46:47,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {965#true} assume !(~i~0 < 100000); {965#true} is VALID [2018-11-14 18:46:47,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {965#true} ~i~0 := 1; {968#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:47,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {968#(<= main_~i~0 1)} assume true; {968#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:47,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {968#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {1022#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:47,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {1022#(<= main_~i~0 10)} assume true; {1022#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:47,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {1022#(<= main_~i~0 10)} assume !(~i~0 < 100000); {966#false} is VALID [2018-11-14 18:46:47,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {966#false} ~i~0 := 1;~j~0 := 0; {966#false} is VALID [2018-11-14 18:46:47,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 18:46:47,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {966#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {966#false} is VALID [2018-11-14 18:46:47,627 INFO L256 TraceCheckUtils]: 22: Hoare triple {966#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {966#false} is VALID [2018-11-14 18:46:47,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {966#false} ~cond := #in~cond; {966#false} is VALID [2018-11-14 18:46:47,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {966#false} assume ~cond == 0; {966#false} is VALID [2018-11-14 18:46:47,629 INFO L273 TraceCheckUtils]: 25: Hoare triple {966#false} assume !false; {966#false} is VALID [2018-11-14 18:46:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:46:47,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:47,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-11-14 18:46:47,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-14 18:46:47,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:47,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:46:47,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:47,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:46:47,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:46:47,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:46:47,786 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 7 states. [2018-11-14 18:46:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:48,030 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-14 18:46:48,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:46:48,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-14 18:46:48,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:46:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-14 18:46:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:46:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-14 18:46:48,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2018-11-14 18:46:48,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:48,115 INFO L225 Difference]: With dead ends: 60 [2018-11-14 18:46:48,115 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 18:46:48,116 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:46:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 18:46:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-11-14 18:46:48,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:48,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 36 states. [2018-11-14 18:46:48,161 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 36 states. [2018-11-14 18:46:48,161 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 36 states. [2018-11-14 18:46:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:48,164 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 18:46:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 18:46:48,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:48,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:48,165 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 44 states. [2018-11-14 18:46:48,165 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 44 states. [2018-11-14 18:46:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:48,168 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 18:46:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 18:46:48,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:48,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:48,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:48,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:46:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-14 18:46:48,172 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2018-11-14 18:46:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:48,172 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-14 18:46:48,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:46:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 18:46:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:46:48,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:48,174 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:48,174 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:48,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1044356127, now seen corresponding path program 4 times [2018-11-14 18:46:48,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:48,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:48,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:48,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:48,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {1274#true} call ULTIMATE.init(); {1274#true} is VALID [2018-11-14 18:46:48,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {1274#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1274#true} is VALID [2018-11-14 18:46:48,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 18:46:48,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1274#true} {1274#true} #63#return; {1274#true} is VALID [2018-11-14 18:46:48,409 INFO L256 TraceCheckUtils]: 4: Hoare triple {1274#true} call #t~ret4 := main(); {1274#true} is VALID [2018-11-14 18:46:48,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {1274#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1276#(= main_~i~0 0)} is VALID [2018-11-14 18:46:48,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {1276#(= main_~i~0 0)} assume true; {1276#(= main_~i~0 0)} is VALID [2018-11-14 18:46:48,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {1276#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1277#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:48,418 INFO L273 TraceCheckUtils]: 8: Hoare triple {1277#(<= main_~i~0 1)} assume true; {1277#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:48,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {1277#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1278#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:48,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {1278#(<= main_~i~0 2)} assume true; {1278#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:48,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {1278#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1279#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:48,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {1279#(<= main_~i~0 3)} assume true; {1279#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:48,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {1279#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1280#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:48,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {1280#(<= main_~i~0 4)} assume true; {1280#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:48,429 INFO L273 TraceCheckUtils]: 15: Hoare triple {1280#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1281#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:48,429 INFO L273 TraceCheckUtils]: 16: Hoare triple {1281#(<= main_~i~0 5)} assume true; {1281#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:48,430 INFO L273 TraceCheckUtils]: 17: Hoare triple {1281#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1275#false} is VALID [2018-11-14 18:46:48,430 INFO L273 TraceCheckUtils]: 18: Hoare triple {1275#false} ~i~0 := 1; {1275#false} is VALID [2018-11-14 18:46:48,430 INFO L273 TraceCheckUtils]: 19: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 18:46:48,431 INFO L273 TraceCheckUtils]: 20: Hoare triple {1275#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {1275#false} is VALID [2018-11-14 18:46:48,431 INFO L273 TraceCheckUtils]: 21: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 18:46:48,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {1275#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {1275#false} is VALID [2018-11-14 18:46:48,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 18:46:48,432 INFO L273 TraceCheckUtils]: 24: Hoare triple {1275#false} assume !(~i~0 < 100000); {1275#false} is VALID [2018-11-14 18:46:48,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {1275#false} ~i~0 := 1;~j~0 := 0; {1275#false} is VALID [2018-11-14 18:46:48,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 18:46:48,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {1275#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {1275#false} is VALID [2018-11-14 18:46:48,433 INFO L256 TraceCheckUtils]: 28: Hoare triple {1275#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1275#false} is VALID [2018-11-14 18:46:48,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {1275#false} ~cond := #in~cond; {1275#false} is VALID [2018-11-14 18:46:48,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {1275#false} assume ~cond == 0; {1275#false} is VALID [2018-11-14 18:46:48,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2018-11-14 18:46:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 18:46:48,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:48,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:46:48,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:46:48,488 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:46:48,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:48,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:48,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {1274#true} call ULTIMATE.init(); {1274#true} is VALID [2018-11-14 18:46:48,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {1274#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1274#true} is VALID [2018-11-14 18:46:48,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 18:46:48,687 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1274#true} {1274#true} #63#return; {1274#true} is VALID [2018-11-14 18:46:48,687 INFO L256 TraceCheckUtils]: 4: Hoare triple {1274#true} call #t~ret4 := main(); {1274#true} is VALID [2018-11-14 18:46:48,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {1274#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1274#true} is VALID [2018-11-14 18:46:48,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 18:46:48,688 INFO L273 TraceCheckUtils]: 7: Hoare triple {1274#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1274#true} is VALID [2018-11-14 18:46:48,688 INFO L273 TraceCheckUtils]: 8: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 18:46:48,689 INFO L273 TraceCheckUtils]: 9: Hoare triple {1274#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1274#true} is VALID [2018-11-14 18:46:48,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 18:46:48,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {1274#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1274#true} is VALID [2018-11-14 18:46:48,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 18:46:48,689 INFO L273 TraceCheckUtils]: 13: Hoare triple {1274#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1274#true} is VALID [2018-11-14 18:46:48,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 18:46:48,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {1274#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1274#true} is VALID [2018-11-14 18:46:48,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 18:46:48,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {1274#true} assume !(~i~0 < 100000); {1274#true} is VALID [2018-11-14 18:46:48,691 INFO L273 TraceCheckUtils]: 18: Hoare triple {1274#true} ~i~0 := 1; {1277#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:48,691 INFO L273 TraceCheckUtils]: 19: Hoare triple {1277#(<= main_~i~0 1)} assume true; {1277#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:48,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {1277#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {1345#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:48,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {1345#(<= main_~i~0 10)} assume true; {1345#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:48,695 INFO L273 TraceCheckUtils]: 22: Hoare triple {1345#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {1352#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:48,697 INFO L273 TraceCheckUtils]: 23: Hoare triple {1352#(<= main_~i~0 19)} assume true; {1352#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:48,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {1352#(<= main_~i~0 19)} assume !(~i~0 < 100000); {1275#false} is VALID [2018-11-14 18:46:48,701 INFO L273 TraceCheckUtils]: 25: Hoare triple {1275#false} ~i~0 := 1;~j~0 := 0; {1275#false} is VALID [2018-11-14 18:46:48,701 INFO L273 TraceCheckUtils]: 26: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 18:46:48,701 INFO L273 TraceCheckUtils]: 27: Hoare triple {1275#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {1275#false} is VALID [2018-11-14 18:46:48,702 INFO L256 TraceCheckUtils]: 28: Hoare triple {1275#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1275#false} is VALID [2018-11-14 18:46:48,702 INFO L273 TraceCheckUtils]: 29: Hoare triple {1275#false} ~cond := #in~cond; {1275#false} is VALID [2018-11-14 18:46:48,702 INFO L273 TraceCheckUtils]: 30: Hoare triple {1275#false} assume ~cond == 0; {1275#false} is VALID [2018-11-14 18:46:48,702 INFO L273 TraceCheckUtils]: 31: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2018-11-14 18:46:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 18:46:48,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:48,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-11-14 18:46:48,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-14 18:46:48,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:48,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:46:48,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:48,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:46:48,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:46:48,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:46:48,804 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-11-14 18:46:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:49,116 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-14 18:46:49,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:46:49,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-14 18:46:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:46:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-14 18:46:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:46:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-14 18:46:49,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2018-11-14 18:46:49,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:49,335 INFO L225 Difference]: With dead ends: 74 [2018-11-14 18:46:49,335 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 18:46:49,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:46:49,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 18:46:49,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2018-11-14 18:46:49,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:49,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 44 states. [2018-11-14 18:46:49,445 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 44 states. [2018-11-14 18:46:49,445 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 44 states. [2018-11-14 18:46:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:49,448 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-14 18:46:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-14 18:46:49,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:49,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:49,449 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 56 states. [2018-11-14 18:46:49,449 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 56 states. [2018-11-14 18:46:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:49,452 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-14 18:46:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-14 18:46:49,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:49,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:49,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:49,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:46:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-14 18:46:49,455 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 32 [2018-11-14 18:46:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:49,456 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-14 18:46:49,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:46:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-14 18:46:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 18:46:49,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:49,457 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:49,457 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:49,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:49,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2019436245, now seen corresponding path program 5 times [2018-11-14 18:46:49,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:49,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:49,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:49,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:49,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:49,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1661#true} is VALID [2018-11-14 18:46:49,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {1661#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1661#true} is VALID [2018-11-14 18:46:49,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {1661#true} assume true; {1661#true} is VALID [2018-11-14 18:46:49,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1661#true} {1661#true} #63#return; {1661#true} is VALID [2018-11-14 18:46:49,713 INFO L256 TraceCheckUtils]: 4: Hoare triple {1661#true} call #t~ret4 := main(); {1661#true} is VALID [2018-11-14 18:46:49,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {1661#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1663#(= main_~i~0 0)} is VALID [2018-11-14 18:46:49,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {1663#(= main_~i~0 0)} assume true; {1663#(= main_~i~0 0)} is VALID [2018-11-14 18:46:49,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {1663#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1664#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:49,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {1664#(<= main_~i~0 1)} assume true; {1664#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:49,721 INFO L273 TraceCheckUtils]: 9: Hoare triple {1664#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1665#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:49,721 INFO L273 TraceCheckUtils]: 10: Hoare triple {1665#(<= main_~i~0 2)} assume true; {1665#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:49,722 INFO L273 TraceCheckUtils]: 11: Hoare triple {1665#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1666#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:49,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {1666#(<= main_~i~0 3)} assume true; {1666#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:49,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {1666#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1667#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:49,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {1667#(<= main_~i~0 4)} assume true; {1667#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:49,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {1667#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1668#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:49,727 INFO L273 TraceCheckUtils]: 16: Hoare triple {1668#(<= main_~i~0 5)} assume true; {1668#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:49,728 INFO L273 TraceCheckUtils]: 17: Hoare triple {1668#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1669#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:49,729 INFO L273 TraceCheckUtils]: 18: Hoare triple {1669#(<= main_~i~0 6)} assume true; {1669#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:49,730 INFO L273 TraceCheckUtils]: 19: Hoare triple {1669#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1670#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:49,731 INFO L273 TraceCheckUtils]: 20: Hoare triple {1670#(<= main_~i~0 7)} assume true; {1670#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:49,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {1670#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1671#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:49,733 INFO L273 TraceCheckUtils]: 22: Hoare triple {1671#(<= main_~i~0 8)} assume true; {1671#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:49,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {1671#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1662#false} is VALID [2018-11-14 18:46:49,735 INFO L273 TraceCheckUtils]: 24: Hoare triple {1662#false} ~i~0 := 1; {1662#false} is VALID [2018-11-14 18:46:49,735 INFO L273 TraceCheckUtils]: 25: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 18:46:49,735 INFO L273 TraceCheckUtils]: 26: Hoare triple {1662#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {1662#false} is VALID [2018-11-14 18:46:49,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 18:46:49,736 INFO L273 TraceCheckUtils]: 28: Hoare triple {1662#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {1662#false} is VALID [2018-11-14 18:46:49,736 INFO L273 TraceCheckUtils]: 29: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 18:46:49,737 INFO L273 TraceCheckUtils]: 30: Hoare triple {1662#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {1662#false} is VALID [2018-11-14 18:46:49,737 INFO L273 TraceCheckUtils]: 31: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 18:46:49,737 INFO L273 TraceCheckUtils]: 32: Hoare triple {1662#false} assume !(~i~0 < 100000); {1662#false} is VALID [2018-11-14 18:46:49,738 INFO L273 TraceCheckUtils]: 33: Hoare triple {1662#false} ~i~0 := 1;~j~0 := 0; {1662#false} is VALID [2018-11-14 18:46:49,738 INFO L273 TraceCheckUtils]: 34: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 18:46:49,738 INFO L273 TraceCheckUtils]: 35: Hoare triple {1662#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {1662#false} is VALID [2018-11-14 18:46:49,738 INFO L256 TraceCheckUtils]: 36: Hoare triple {1662#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1662#false} is VALID [2018-11-14 18:46:49,738 INFO L273 TraceCheckUtils]: 37: Hoare triple {1662#false} ~cond := #in~cond; {1662#false} is VALID [2018-11-14 18:46:49,738 INFO L273 TraceCheckUtils]: 38: Hoare triple {1662#false} assume ~cond == 0; {1662#false} is VALID [2018-11-14 18:46:49,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2018-11-14 18:46:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:46:49,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:49,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:46:49,752 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:46:49,846 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-14 18:46:49,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:49,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:50,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1661#true} is VALID [2018-11-14 18:46:50,006 INFO L273 TraceCheckUtils]: 1: Hoare triple {1661#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1661#true} is VALID [2018-11-14 18:46:50,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {1661#true} assume true; {1661#true} is VALID [2018-11-14 18:46:50,007 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1661#true} {1661#true} #63#return; {1661#true} is VALID [2018-11-14 18:46:50,007 INFO L256 TraceCheckUtils]: 4: Hoare triple {1661#true} call #t~ret4 := main(); {1661#true} is VALID [2018-11-14 18:46:50,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {1661#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1690#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:50,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {1690#(<= main_~i~0 0)} assume true; {1690#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:50,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {1690#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1664#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:50,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {1664#(<= main_~i~0 1)} assume true; {1664#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:50,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {1664#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1665#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:50,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {1665#(<= main_~i~0 2)} assume true; {1665#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:50,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {1665#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1666#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:50,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {1666#(<= main_~i~0 3)} assume true; {1666#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:50,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {1666#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1667#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:50,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {1667#(<= main_~i~0 4)} assume true; {1667#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:50,016 INFO L273 TraceCheckUtils]: 15: Hoare triple {1667#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1668#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:50,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {1668#(<= main_~i~0 5)} assume true; {1668#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:50,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {1668#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1669#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:50,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {1669#(<= main_~i~0 6)} assume true; {1669#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:50,020 INFO L273 TraceCheckUtils]: 19: Hoare triple {1669#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1670#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:50,021 INFO L273 TraceCheckUtils]: 20: Hoare triple {1670#(<= main_~i~0 7)} assume true; {1670#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:50,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {1670#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1671#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:50,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {1671#(<= main_~i~0 8)} assume true; {1671#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:50,023 INFO L273 TraceCheckUtils]: 23: Hoare triple {1671#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1662#false} is VALID [2018-11-14 18:46:50,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {1662#false} ~i~0 := 1; {1662#false} is VALID [2018-11-14 18:46:50,024 INFO L273 TraceCheckUtils]: 25: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 18:46:50,024 INFO L273 TraceCheckUtils]: 26: Hoare triple {1662#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {1662#false} is VALID [2018-11-14 18:46:50,024 INFO L273 TraceCheckUtils]: 27: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 18:46:50,025 INFO L273 TraceCheckUtils]: 28: Hoare triple {1662#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {1662#false} is VALID [2018-11-14 18:46:50,025 INFO L273 TraceCheckUtils]: 29: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 18:46:50,025 INFO L273 TraceCheckUtils]: 30: Hoare triple {1662#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {1662#false} is VALID [2018-11-14 18:46:50,026 INFO L273 TraceCheckUtils]: 31: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 18:46:50,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {1662#false} assume !(~i~0 < 100000); {1662#false} is VALID [2018-11-14 18:46:50,026 INFO L273 TraceCheckUtils]: 33: Hoare triple {1662#false} ~i~0 := 1;~j~0 := 0; {1662#false} is VALID [2018-11-14 18:46:50,027 INFO L273 TraceCheckUtils]: 34: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 18:46:50,027 INFO L273 TraceCheckUtils]: 35: Hoare triple {1662#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {1662#false} is VALID [2018-11-14 18:46:50,027 INFO L256 TraceCheckUtils]: 36: Hoare triple {1662#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1662#false} is VALID [2018-11-14 18:46:50,027 INFO L273 TraceCheckUtils]: 37: Hoare triple {1662#false} ~cond := #in~cond; {1662#false} is VALID [2018-11-14 18:46:50,028 INFO L273 TraceCheckUtils]: 38: Hoare triple {1662#false} assume ~cond == 0; {1662#false} is VALID [2018-11-14 18:46:50,028 INFO L273 TraceCheckUtils]: 39: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2018-11-14 18:46:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:46:50,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:50,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 18:46:50,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-14 18:46:50,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:50,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:46:50,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:50,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:46:50,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:46:50,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:46:50,144 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2018-11-14 18:46:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:50,791 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-14 18:46:50,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:46:50,791 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-14 18:46:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:46:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2018-11-14 18:46:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:46:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2018-11-14 18:46:50,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 65 transitions. [2018-11-14 18:46:50,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:50,919 INFO L225 Difference]: With dead ends: 70 [2018-11-14 18:46:50,919 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 18:46:50,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:46:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 18:46:50,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-14 18:46:50,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:50,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 46 states. [2018-11-14 18:46:50,951 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 46 states. [2018-11-14 18:46:50,951 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 46 states. [2018-11-14 18:46:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:50,954 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-14 18:46:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 18:46:50,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:50,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:50,955 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 50 states. [2018-11-14 18:46:50,955 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 50 states. [2018-11-14 18:46:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:50,957 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-14 18:46:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 18:46:50,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:50,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:50,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:50,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 18:46:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-14 18:46:50,960 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 40 [2018-11-14 18:46:50,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:50,960 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-14 18:46:50,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:46:50,960 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 18:46:50,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 18:46:50,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:50,961 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:50,962 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:50,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:50,962 INFO L82 PathProgramCache]: Analyzing trace with hash -367956143, now seen corresponding path program 6 times [2018-11-14 18:46:50,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:50,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:50,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:50,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:50,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:51,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {2059#true} call ULTIMATE.init(); {2059#true} is VALID [2018-11-14 18:46:51,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {2059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2059#true} is VALID [2018-11-14 18:46:51,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 18:46:51,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2059#true} {2059#true} #63#return; {2059#true} is VALID [2018-11-14 18:46:51,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {2059#true} call #t~ret4 := main(); {2059#true} is VALID [2018-11-14 18:46:51,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {2059#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2061#(= main_~i~0 0)} is VALID [2018-11-14 18:46:51,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {2061#(= main_~i~0 0)} assume true; {2061#(= main_~i~0 0)} is VALID [2018-11-14 18:46:51,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {2061#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2062#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:51,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {2062#(<= main_~i~0 1)} assume true; {2062#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:51,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {2062#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2063#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:51,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {2063#(<= main_~i~0 2)} assume true; {2063#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:51,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {2063#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2064#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:51,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {2064#(<= main_~i~0 3)} assume true; {2064#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:51,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {2064#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2065#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:51,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {2065#(<= main_~i~0 4)} assume true; {2065#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:51,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {2065#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2066#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:51,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {2066#(<= main_~i~0 5)} assume true; {2066#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:51,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {2066#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2067#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:51,276 INFO L273 TraceCheckUtils]: 18: Hoare triple {2067#(<= main_~i~0 6)} assume true; {2067#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:51,277 INFO L273 TraceCheckUtils]: 19: Hoare triple {2067#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2068#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:51,278 INFO L273 TraceCheckUtils]: 20: Hoare triple {2068#(<= main_~i~0 7)} assume true; {2068#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:51,279 INFO L273 TraceCheckUtils]: 21: Hoare triple {2068#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2069#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:51,279 INFO L273 TraceCheckUtils]: 22: Hoare triple {2069#(<= main_~i~0 8)} assume true; {2069#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:51,280 INFO L273 TraceCheckUtils]: 23: Hoare triple {2069#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2070#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:51,281 INFO L273 TraceCheckUtils]: 24: Hoare triple {2070#(<= main_~i~0 9)} assume true; {2070#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:51,281 INFO L273 TraceCheckUtils]: 25: Hoare triple {2070#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2060#false} is VALID [2018-11-14 18:46:51,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {2060#false} ~i~0 := 1; {2060#false} is VALID [2018-11-14 18:46:51,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {2060#false} assume true; {2060#false} is VALID [2018-11-14 18:46:51,282 INFO L273 TraceCheckUtils]: 28: Hoare triple {2060#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2060#false} is VALID [2018-11-14 18:46:51,282 INFO L273 TraceCheckUtils]: 29: Hoare triple {2060#false} assume true; {2060#false} is VALID [2018-11-14 18:46:51,283 INFO L273 TraceCheckUtils]: 30: Hoare triple {2060#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2060#false} is VALID [2018-11-14 18:46:51,283 INFO L273 TraceCheckUtils]: 31: Hoare triple {2060#false} assume true; {2060#false} is VALID [2018-11-14 18:46:51,283 INFO L273 TraceCheckUtils]: 32: Hoare triple {2060#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2060#false} is VALID [2018-11-14 18:46:51,283 INFO L273 TraceCheckUtils]: 33: Hoare triple {2060#false} assume true; {2060#false} is VALID [2018-11-14 18:46:51,283 INFO L273 TraceCheckUtils]: 34: Hoare triple {2060#false} assume !(~i~0 < 100000); {2060#false} is VALID [2018-11-14 18:46:51,284 INFO L273 TraceCheckUtils]: 35: Hoare triple {2060#false} ~i~0 := 1;~j~0 := 0; {2060#false} is VALID [2018-11-14 18:46:51,284 INFO L273 TraceCheckUtils]: 36: Hoare triple {2060#false} assume true; {2060#false} is VALID [2018-11-14 18:46:51,284 INFO L273 TraceCheckUtils]: 37: Hoare triple {2060#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {2060#false} is VALID [2018-11-14 18:46:51,285 INFO L256 TraceCheckUtils]: 38: Hoare triple {2060#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2060#false} is VALID [2018-11-14 18:46:51,285 INFO L273 TraceCheckUtils]: 39: Hoare triple {2060#false} ~cond := #in~cond; {2060#false} is VALID [2018-11-14 18:46:51,285 INFO L273 TraceCheckUtils]: 40: Hoare triple {2060#false} assume ~cond == 0; {2060#false} is VALID [2018-11-14 18:46:51,285 INFO L273 TraceCheckUtils]: 41: Hoare triple {2060#false} assume !false; {2060#false} is VALID [2018-11-14 18:46:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:46:51,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:51,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:46:51,297 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:46:51,409 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 18:46:51,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:51,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:52,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {2059#true} call ULTIMATE.init(); {2059#true} is VALID [2018-11-14 18:46:52,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {2059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2059#true} is VALID [2018-11-14 18:46:52,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 18:46:52,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2059#true} {2059#true} #63#return; {2059#true} is VALID [2018-11-14 18:46:52,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {2059#true} call #t~ret4 := main(); {2059#true} is VALID [2018-11-14 18:46:52,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {2059#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2059#true} is VALID [2018-11-14 18:46:52,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 18:46:52,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {2059#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2059#true} is VALID [2018-11-14 18:46:52,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 18:46:52,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {2059#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2059#true} is VALID [2018-11-14 18:46:52,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 18:46:52,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {2059#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2059#true} is VALID [2018-11-14 18:46:52,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 18:46:52,062 INFO L273 TraceCheckUtils]: 13: Hoare triple {2059#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2059#true} is VALID [2018-11-14 18:46:52,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 18:46:52,062 INFO L273 TraceCheckUtils]: 15: Hoare triple {2059#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2059#true} is VALID [2018-11-14 18:46:52,062 INFO L273 TraceCheckUtils]: 16: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 18:46:52,063 INFO L273 TraceCheckUtils]: 17: Hoare triple {2059#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2059#true} is VALID [2018-11-14 18:46:52,063 INFO L273 TraceCheckUtils]: 18: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 18:46:52,063 INFO L273 TraceCheckUtils]: 19: Hoare triple {2059#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2059#true} is VALID [2018-11-14 18:46:52,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 18:46:52,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {2059#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2059#true} is VALID [2018-11-14 18:46:52,064 INFO L273 TraceCheckUtils]: 22: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 18:46:52,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {2059#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2059#true} is VALID [2018-11-14 18:46:52,064 INFO L273 TraceCheckUtils]: 24: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 18:46:52,064 INFO L273 TraceCheckUtils]: 25: Hoare triple {2059#true} assume !(~i~0 < 100000); {2059#true} is VALID [2018-11-14 18:46:52,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {2059#true} ~i~0 := 1; {2062#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:52,073 INFO L273 TraceCheckUtils]: 27: Hoare triple {2062#(<= main_~i~0 1)} assume true; {2062#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:52,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {2062#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2158#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:52,074 INFO L273 TraceCheckUtils]: 29: Hoare triple {2158#(<= main_~i~0 10)} assume true; {2158#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:52,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {2158#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2165#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:52,075 INFO L273 TraceCheckUtils]: 31: Hoare triple {2165#(<= main_~i~0 19)} assume true; {2165#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:52,075 INFO L273 TraceCheckUtils]: 32: Hoare triple {2165#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2172#(<= main_~i~0 28)} is VALID [2018-11-14 18:46:52,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {2172#(<= main_~i~0 28)} assume true; {2172#(<= main_~i~0 28)} is VALID [2018-11-14 18:46:52,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {2172#(<= main_~i~0 28)} assume !(~i~0 < 100000); {2060#false} is VALID [2018-11-14 18:46:52,076 INFO L273 TraceCheckUtils]: 35: Hoare triple {2060#false} ~i~0 := 1;~j~0 := 0; {2060#false} is VALID [2018-11-14 18:46:52,076 INFO L273 TraceCheckUtils]: 36: Hoare triple {2060#false} assume true; {2060#false} is VALID [2018-11-14 18:46:52,077 INFO L273 TraceCheckUtils]: 37: Hoare triple {2060#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {2060#false} is VALID [2018-11-14 18:46:52,077 INFO L256 TraceCheckUtils]: 38: Hoare triple {2060#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2060#false} is VALID [2018-11-14 18:46:52,077 INFO L273 TraceCheckUtils]: 39: Hoare triple {2060#false} ~cond := #in~cond; {2060#false} is VALID [2018-11-14 18:46:52,077 INFO L273 TraceCheckUtils]: 40: Hoare triple {2060#false} assume ~cond == 0; {2060#false} is VALID [2018-11-14 18:46:52,077 INFO L273 TraceCheckUtils]: 41: Hoare triple {2060#false} assume !false; {2060#false} is VALID [2018-11-14 18:46:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-14 18:46:52,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:52,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 15 [2018-11-14 18:46:52,099 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-11-14 18:46:52,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:52,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 18:46:52,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:52,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 18:46:52,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 18:46:52,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:46:52,163 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 15 states. [2018-11-14 18:46:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:52,653 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-11-14 18:46:52,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 18:46:52,654 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-11-14 18:46:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:46:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 98 transitions. [2018-11-14 18:46:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:46:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 98 transitions. [2018-11-14 18:46:52,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 98 transitions. [2018-11-14 18:46:52,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:52,769 INFO L225 Difference]: With dead ends: 92 [2018-11-14 18:46:52,769 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 18:46:52,770 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:46:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 18:46:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2018-11-14 18:46:52,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:52,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 56 states. [2018-11-14 18:46:52,799 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 56 states. [2018-11-14 18:46:52,799 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 56 states. [2018-11-14 18:46:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:52,802 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-14 18:46:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-11-14 18:46:52,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:52,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:52,803 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 72 states. [2018-11-14 18:46:52,803 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 72 states. [2018-11-14 18:46:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:52,806 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-14 18:46:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-11-14 18:46:52,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:52,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:52,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:52,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 18:46:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-14 18:46:52,810 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 42 [2018-11-14 18:46:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:52,810 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-14 18:46:52,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 18:46:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-14 18:46:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 18:46:52,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:52,812 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:52,812 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:52,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:52,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1081597949, now seen corresponding path program 7 times [2018-11-14 18:46:52,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:52,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:52,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:52,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:52,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:53,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {2558#true} call ULTIMATE.init(); {2558#true} is VALID [2018-11-14 18:46:53,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {2558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2558#true} is VALID [2018-11-14 18:46:53,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {2558#true} assume true; {2558#true} is VALID [2018-11-14 18:46:53,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2558#true} {2558#true} #63#return; {2558#true} is VALID [2018-11-14 18:46:53,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {2558#true} call #t~ret4 := main(); {2558#true} is VALID [2018-11-14 18:46:53,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {2558#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2560#(= main_~i~0 0)} is VALID [2018-11-14 18:46:53,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {2560#(= main_~i~0 0)} assume true; {2560#(= main_~i~0 0)} is VALID [2018-11-14 18:46:53,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {2560#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2561#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:53,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {2561#(<= main_~i~0 1)} assume true; {2561#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:53,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {2561#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2562#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:53,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {2562#(<= main_~i~0 2)} assume true; {2562#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:53,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {2562#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2563#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:53,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {2563#(<= main_~i~0 3)} assume true; {2563#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:53,300 INFO L273 TraceCheckUtils]: 13: Hoare triple {2563#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2564#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:53,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {2564#(<= main_~i~0 4)} assume true; {2564#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:53,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {2564#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2565#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:53,304 INFO L273 TraceCheckUtils]: 16: Hoare triple {2565#(<= main_~i~0 5)} assume true; {2565#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:53,305 INFO L273 TraceCheckUtils]: 17: Hoare triple {2565#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2566#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:53,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {2566#(<= main_~i~0 6)} assume true; {2566#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:53,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {2566#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2567#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:53,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {2567#(<= main_~i~0 7)} assume true; {2567#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:53,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {2567#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2568#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:53,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {2568#(<= main_~i~0 8)} assume true; {2568#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:53,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {2568#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2569#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:53,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {2569#(<= main_~i~0 9)} assume true; {2569#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:53,312 INFO L273 TraceCheckUtils]: 25: Hoare triple {2569#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2570#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:53,312 INFO L273 TraceCheckUtils]: 26: Hoare triple {2570#(<= main_~i~0 10)} assume true; {2570#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:53,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {2570#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2571#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:53,314 INFO L273 TraceCheckUtils]: 28: Hoare triple {2571#(<= main_~i~0 11)} assume true; {2571#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:53,315 INFO L273 TraceCheckUtils]: 29: Hoare triple {2571#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2572#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:53,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {2572#(<= main_~i~0 12)} assume true; {2572#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:53,317 INFO L273 TraceCheckUtils]: 31: Hoare triple {2572#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2573#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:53,317 INFO L273 TraceCheckUtils]: 32: Hoare triple {2573#(<= main_~i~0 13)} assume true; {2573#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:53,323 INFO L273 TraceCheckUtils]: 33: Hoare triple {2573#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2559#false} is VALID [2018-11-14 18:46:53,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {2559#false} ~i~0 := 1; {2559#false} is VALID [2018-11-14 18:46:53,324 INFO L273 TraceCheckUtils]: 35: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 18:46:53,324 INFO L273 TraceCheckUtils]: 36: Hoare triple {2559#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2559#false} is VALID [2018-11-14 18:46:53,324 INFO L273 TraceCheckUtils]: 37: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 18:46:53,324 INFO L273 TraceCheckUtils]: 38: Hoare triple {2559#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2559#false} is VALID [2018-11-14 18:46:53,325 INFO L273 TraceCheckUtils]: 39: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 18:46:53,325 INFO L273 TraceCheckUtils]: 40: Hoare triple {2559#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2559#false} is VALID [2018-11-14 18:46:53,325 INFO L273 TraceCheckUtils]: 41: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 18:46:53,325 INFO L273 TraceCheckUtils]: 42: Hoare triple {2559#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2559#false} is VALID [2018-11-14 18:46:53,325 INFO L273 TraceCheckUtils]: 43: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 18:46:53,325 INFO L273 TraceCheckUtils]: 44: Hoare triple {2559#false} assume !(~i~0 < 100000); {2559#false} is VALID [2018-11-14 18:46:53,325 INFO L273 TraceCheckUtils]: 45: Hoare triple {2559#false} ~i~0 := 1;~j~0 := 0; {2559#false} is VALID [2018-11-14 18:46:53,325 INFO L273 TraceCheckUtils]: 46: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 18:46:53,326 INFO L273 TraceCheckUtils]: 47: Hoare triple {2559#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {2559#false} is VALID [2018-11-14 18:46:53,326 INFO L256 TraceCheckUtils]: 48: Hoare triple {2559#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2559#false} is VALID [2018-11-14 18:46:53,326 INFO L273 TraceCheckUtils]: 49: Hoare triple {2559#false} ~cond := #in~cond; {2559#false} is VALID [2018-11-14 18:46:53,326 INFO L273 TraceCheckUtils]: 50: Hoare triple {2559#false} assume ~cond == 0; {2559#false} is VALID [2018-11-14 18:46:53,326 INFO L273 TraceCheckUtils]: 51: Hoare triple {2559#false} assume !false; {2559#false} is VALID [2018-11-14 18:46:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:46:53,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:53,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:46:53,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:53,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:53,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {2558#true} call ULTIMATE.init(); {2558#true} is VALID [2018-11-14 18:46:53,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {2558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2558#true} is VALID [2018-11-14 18:46:53,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {2558#true} assume true; {2558#true} is VALID [2018-11-14 18:46:53,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2558#true} {2558#true} #63#return; {2558#true} is VALID [2018-11-14 18:46:53,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {2558#true} call #t~ret4 := main(); {2558#true} is VALID [2018-11-14 18:46:53,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {2558#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2592#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:53,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {2592#(<= main_~i~0 0)} assume true; {2592#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:53,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {2592#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2561#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:53,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {2561#(<= main_~i~0 1)} assume true; {2561#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:53,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {2561#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2562#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:53,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {2562#(<= main_~i~0 2)} assume true; {2562#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:53,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {2562#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2563#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:53,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {2563#(<= main_~i~0 3)} assume true; {2563#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:53,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {2563#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2564#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:53,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {2564#(<= main_~i~0 4)} assume true; {2564#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:53,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {2564#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2565#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:53,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {2565#(<= main_~i~0 5)} assume true; {2565#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:53,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {2565#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2566#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:53,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {2566#(<= main_~i~0 6)} assume true; {2566#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:53,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {2566#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2567#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:53,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {2567#(<= main_~i~0 7)} assume true; {2567#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:53,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {2567#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2568#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:53,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {2568#(<= main_~i~0 8)} assume true; {2568#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:53,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {2568#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2569#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:53,763 INFO L273 TraceCheckUtils]: 24: Hoare triple {2569#(<= main_~i~0 9)} assume true; {2569#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:53,764 INFO L273 TraceCheckUtils]: 25: Hoare triple {2569#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2570#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:53,765 INFO L273 TraceCheckUtils]: 26: Hoare triple {2570#(<= main_~i~0 10)} assume true; {2570#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:53,766 INFO L273 TraceCheckUtils]: 27: Hoare triple {2570#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2571#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:53,766 INFO L273 TraceCheckUtils]: 28: Hoare triple {2571#(<= main_~i~0 11)} assume true; {2571#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:53,767 INFO L273 TraceCheckUtils]: 29: Hoare triple {2571#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2572#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:53,768 INFO L273 TraceCheckUtils]: 30: Hoare triple {2572#(<= main_~i~0 12)} assume true; {2572#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:53,769 INFO L273 TraceCheckUtils]: 31: Hoare triple {2572#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2573#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:53,769 INFO L273 TraceCheckUtils]: 32: Hoare triple {2573#(<= main_~i~0 13)} assume true; {2573#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:53,770 INFO L273 TraceCheckUtils]: 33: Hoare triple {2573#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2559#false} is VALID [2018-11-14 18:46:53,771 INFO L273 TraceCheckUtils]: 34: Hoare triple {2559#false} ~i~0 := 1; {2559#false} is VALID [2018-11-14 18:46:53,771 INFO L273 TraceCheckUtils]: 35: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 18:46:53,771 INFO L273 TraceCheckUtils]: 36: Hoare triple {2559#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2559#false} is VALID [2018-11-14 18:46:53,772 INFO L273 TraceCheckUtils]: 37: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 18:46:53,772 INFO L273 TraceCheckUtils]: 38: Hoare triple {2559#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2559#false} is VALID [2018-11-14 18:46:53,772 INFO L273 TraceCheckUtils]: 39: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 18:46:53,773 INFO L273 TraceCheckUtils]: 40: Hoare triple {2559#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2559#false} is VALID [2018-11-14 18:46:53,773 INFO L273 TraceCheckUtils]: 41: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 18:46:53,773 INFO L273 TraceCheckUtils]: 42: Hoare triple {2559#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {2559#false} is VALID [2018-11-14 18:46:53,773 INFO L273 TraceCheckUtils]: 43: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 18:46:53,774 INFO L273 TraceCheckUtils]: 44: Hoare triple {2559#false} assume !(~i~0 < 100000); {2559#false} is VALID [2018-11-14 18:46:53,774 INFO L273 TraceCheckUtils]: 45: Hoare triple {2559#false} ~i~0 := 1;~j~0 := 0; {2559#false} is VALID [2018-11-14 18:46:53,774 INFO L273 TraceCheckUtils]: 46: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 18:46:53,774 INFO L273 TraceCheckUtils]: 47: Hoare triple {2559#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {2559#false} is VALID [2018-11-14 18:46:53,774 INFO L256 TraceCheckUtils]: 48: Hoare triple {2559#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2559#false} is VALID [2018-11-14 18:46:53,775 INFO L273 TraceCheckUtils]: 49: Hoare triple {2559#false} ~cond := #in~cond; {2559#false} is VALID [2018-11-14 18:46:53,775 INFO L273 TraceCheckUtils]: 50: Hoare triple {2559#false} assume ~cond == 0; {2559#false} is VALID [2018-11-14 18:46:53,775 INFO L273 TraceCheckUtils]: 51: Hoare triple {2559#false} assume !false; {2559#false} is VALID [2018-11-14 18:46:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:46:53,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:53,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 18:46:53,800 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-14 18:46:53,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:53,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:46:53,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:53,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:46:53,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:46:53,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:46:53,933 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 17 states. [2018-11-14 18:46:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:54,523 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-14 18:46:54,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:46:54,523 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-14 18:46:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:46:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 82 transitions. [2018-11-14 18:46:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:46:54,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 82 transitions. [2018-11-14 18:46:54,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 82 transitions. [2018-11-14 18:46:54,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:54,655 INFO L225 Difference]: With dead ends: 88 [2018-11-14 18:46:54,655 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 18:46:54,655 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:46:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 18:46:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-11-14 18:46:54,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:54,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 58 states. [2018-11-14 18:46:54,727 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 58 states. [2018-11-14 18:46:54,727 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 58 states. [2018-11-14 18:46:54,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:54,730 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 18:46:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 18:46:54,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:54,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:54,731 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 66 states. [2018-11-14 18:46:54,731 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 66 states. [2018-11-14 18:46:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:54,733 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 18:46:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 18:46:54,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:54,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:54,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:54,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 18:46:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-14 18:46:54,735 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 52 [2018-11-14 18:46:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:54,735 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-14 18:46:54,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:46:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-14 18:46:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 18:46:54,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:54,736 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:54,737 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:54,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash 549039401, now seen corresponding path program 8 times [2018-11-14 18:46:54,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:54,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:54,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:54,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:46:54,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:55,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {3074#true} call ULTIMATE.init(); {3074#true} is VALID [2018-11-14 18:46:55,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {3074#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3074#true} is VALID [2018-11-14 18:46:55,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2018-11-14 18:46:55,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3074#true} #63#return; {3074#true} is VALID [2018-11-14 18:46:55,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {3074#true} call #t~ret4 := main(); {3074#true} is VALID [2018-11-14 18:46:55,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {3074#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3076#(= main_~i~0 0)} is VALID [2018-11-14 18:46:55,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {3076#(= main_~i~0 0)} assume true; {3076#(= main_~i~0 0)} is VALID [2018-11-14 18:46:55,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {3076#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3077#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:55,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {3077#(<= main_~i~0 1)} assume true; {3077#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:55,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {3077#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3078#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:55,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {3078#(<= main_~i~0 2)} assume true; {3078#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:55,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {3078#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3079#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:55,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {3079#(<= main_~i~0 3)} assume true; {3079#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:55,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {3079#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3080#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:55,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {3080#(<= main_~i~0 4)} assume true; {3080#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:55,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {3080#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3081#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:55,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {3081#(<= main_~i~0 5)} assume true; {3081#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:55,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {3081#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3082#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:55,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {3082#(<= main_~i~0 6)} assume true; {3082#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:55,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {3082#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3083#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:55,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {3083#(<= main_~i~0 7)} assume true; {3083#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:55,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {3083#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3084#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:55,160 INFO L273 TraceCheckUtils]: 22: Hoare triple {3084#(<= main_~i~0 8)} assume true; {3084#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:55,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {3084#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3085#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:55,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {3085#(<= main_~i~0 9)} assume true; {3085#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:55,181 INFO L273 TraceCheckUtils]: 25: Hoare triple {3085#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3086#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:55,181 INFO L273 TraceCheckUtils]: 26: Hoare triple {3086#(<= main_~i~0 10)} assume true; {3086#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:55,182 INFO L273 TraceCheckUtils]: 27: Hoare triple {3086#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3087#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:55,182 INFO L273 TraceCheckUtils]: 28: Hoare triple {3087#(<= main_~i~0 11)} assume true; {3087#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:55,183 INFO L273 TraceCheckUtils]: 29: Hoare triple {3087#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3088#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:55,183 INFO L273 TraceCheckUtils]: 30: Hoare triple {3088#(<= main_~i~0 12)} assume true; {3088#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:55,184 INFO L273 TraceCheckUtils]: 31: Hoare triple {3088#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3089#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:55,184 INFO L273 TraceCheckUtils]: 32: Hoare triple {3089#(<= main_~i~0 13)} assume true; {3089#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:55,185 INFO L273 TraceCheckUtils]: 33: Hoare triple {3089#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3090#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:55,185 INFO L273 TraceCheckUtils]: 34: Hoare triple {3090#(<= main_~i~0 14)} assume true; {3090#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:55,186 INFO L273 TraceCheckUtils]: 35: Hoare triple {3090#(<= main_~i~0 14)} assume !(~i~0 < 100000); {3075#false} is VALID [2018-11-14 18:46:55,186 INFO L273 TraceCheckUtils]: 36: Hoare triple {3075#false} ~i~0 := 1; {3075#false} is VALID [2018-11-14 18:46:55,186 INFO L273 TraceCheckUtils]: 37: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 18:46:55,187 INFO L273 TraceCheckUtils]: 38: Hoare triple {3075#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3075#false} is VALID [2018-11-14 18:46:55,187 INFO L273 TraceCheckUtils]: 39: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 18:46:55,187 INFO L273 TraceCheckUtils]: 40: Hoare triple {3075#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3075#false} is VALID [2018-11-14 18:46:55,187 INFO L273 TraceCheckUtils]: 41: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 18:46:55,188 INFO L273 TraceCheckUtils]: 42: Hoare triple {3075#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3075#false} is VALID [2018-11-14 18:46:55,188 INFO L273 TraceCheckUtils]: 43: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 18:46:55,188 INFO L273 TraceCheckUtils]: 44: Hoare triple {3075#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3075#false} is VALID [2018-11-14 18:46:55,188 INFO L273 TraceCheckUtils]: 45: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 18:46:55,189 INFO L273 TraceCheckUtils]: 46: Hoare triple {3075#false} assume !(~i~0 < 100000); {3075#false} is VALID [2018-11-14 18:46:55,189 INFO L273 TraceCheckUtils]: 47: Hoare triple {3075#false} ~i~0 := 1;~j~0 := 0; {3075#false} is VALID [2018-11-14 18:46:55,189 INFO L273 TraceCheckUtils]: 48: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 18:46:55,189 INFO L273 TraceCheckUtils]: 49: Hoare triple {3075#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {3075#false} is VALID [2018-11-14 18:46:55,190 INFO L256 TraceCheckUtils]: 50: Hoare triple {3075#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3075#false} is VALID [2018-11-14 18:46:55,190 INFO L273 TraceCheckUtils]: 51: Hoare triple {3075#false} ~cond := #in~cond; {3075#false} is VALID [2018-11-14 18:46:55,190 INFO L273 TraceCheckUtils]: 52: Hoare triple {3075#false} assume ~cond == 0; {3075#false} is VALID [2018-11-14 18:46:55,190 INFO L273 TraceCheckUtils]: 53: Hoare triple {3075#false} assume !false; {3075#false} is VALID [2018-11-14 18:46:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:46:55,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:55,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:46:55,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:46:55,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:46:55,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:55,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:55,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {3074#true} call ULTIMATE.init(); {3074#true} is VALID [2018-11-14 18:46:55,410 INFO L273 TraceCheckUtils]: 1: Hoare triple {3074#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3074#true} is VALID [2018-11-14 18:46:55,411 INFO L273 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2018-11-14 18:46:55,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3074#true} #63#return; {3074#true} is VALID [2018-11-14 18:46:55,411 INFO L256 TraceCheckUtils]: 4: Hoare triple {3074#true} call #t~ret4 := main(); {3074#true} is VALID [2018-11-14 18:46:55,411 INFO L273 TraceCheckUtils]: 5: Hoare triple {3074#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3109#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:55,412 INFO L273 TraceCheckUtils]: 6: Hoare triple {3109#(<= main_~i~0 0)} assume true; {3109#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:55,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {3109#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3077#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:55,413 INFO L273 TraceCheckUtils]: 8: Hoare triple {3077#(<= main_~i~0 1)} assume true; {3077#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:55,414 INFO L273 TraceCheckUtils]: 9: Hoare triple {3077#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3078#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:55,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {3078#(<= main_~i~0 2)} assume true; {3078#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:55,416 INFO L273 TraceCheckUtils]: 11: Hoare triple {3078#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3079#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:55,416 INFO L273 TraceCheckUtils]: 12: Hoare triple {3079#(<= main_~i~0 3)} assume true; {3079#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:55,417 INFO L273 TraceCheckUtils]: 13: Hoare triple {3079#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3080#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:55,418 INFO L273 TraceCheckUtils]: 14: Hoare triple {3080#(<= main_~i~0 4)} assume true; {3080#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:55,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {3080#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3081#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:55,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {3081#(<= main_~i~0 5)} assume true; {3081#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:55,421 INFO L273 TraceCheckUtils]: 17: Hoare triple {3081#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3082#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:55,421 INFO L273 TraceCheckUtils]: 18: Hoare triple {3082#(<= main_~i~0 6)} assume true; {3082#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:55,422 INFO L273 TraceCheckUtils]: 19: Hoare triple {3082#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3083#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:55,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {3083#(<= main_~i~0 7)} assume true; {3083#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:55,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {3083#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3084#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:55,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {3084#(<= main_~i~0 8)} assume true; {3084#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:55,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {3084#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3085#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:55,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {3085#(<= main_~i~0 9)} assume true; {3085#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:55,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {3085#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3086#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:55,431 INFO L273 TraceCheckUtils]: 26: Hoare triple {3086#(<= main_~i~0 10)} assume true; {3086#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:55,448 INFO L273 TraceCheckUtils]: 27: Hoare triple {3086#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3087#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:55,449 INFO L273 TraceCheckUtils]: 28: Hoare triple {3087#(<= main_~i~0 11)} assume true; {3087#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:55,449 INFO L273 TraceCheckUtils]: 29: Hoare triple {3087#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3088#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:55,451 INFO L273 TraceCheckUtils]: 30: Hoare triple {3088#(<= main_~i~0 12)} assume true; {3088#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:55,451 INFO L273 TraceCheckUtils]: 31: Hoare triple {3088#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3089#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:55,452 INFO L273 TraceCheckUtils]: 32: Hoare triple {3089#(<= main_~i~0 13)} assume true; {3089#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:55,452 INFO L273 TraceCheckUtils]: 33: Hoare triple {3089#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3090#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:55,453 INFO L273 TraceCheckUtils]: 34: Hoare triple {3090#(<= main_~i~0 14)} assume true; {3090#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:55,457 INFO L273 TraceCheckUtils]: 35: Hoare triple {3090#(<= main_~i~0 14)} assume !(~i~0 < 100000); {3075#false} is VALID [2018-11-14 18:46:55,457 INFO L273 TraceCheckUtils]: 36: Hoare triple {3075#false} ~i~0 := 1; {3075#false} is VALID [2018-11-14 18:46:55,457 INFO L273 TraceCheckUtils]: 37: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 18:46:55,458 INFO L273 TraceCheckUtils]: 38: Hoare triple {3075#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3075#false} is VALID [2018-11-14 18:46:55,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 18:46:55,458 INFO L273 TraceCheckUtils]: 40: Hoare triple {3075#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3075#false} is VALID [2018-11-14 18:46:55,458 INFO L273 TraceCheckUtils]: 41: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 18:46:55,458 INFO L273 TraceCheckUtils]: 42: Hoare triple {3075#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3075#false} is VALID [2018-11-14 18:46:55,458 INFO L273 TraceCheckUtils]: 43: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 18:46:55,458 INFO L273 TraceCheckUtils]: 44: Hoare triple {3075#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3075#false} is VALID [2018-11-14 18:46:55,458 INFO L273 TraceCheckUtils]: 45: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 18:46:55,459 INFO L273 TraceCheckUtils]: 46: Hoare triple {3075#false} assume !(~i~0 < 100000); {3075#false} is VALID [2018-11-14 18:46:55,459 INFO L273 TraceCheckUtils]: 47: Hoare triple {3075#false} ~i~0 := 1;~j~0 := 0; {3075#false} is VALID [2018-11-14 18:46:55,459 INFO L273 TraceCheckUtils]: 48: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 18:46:55,459 INFO L273 TraceCheckUtils]: 49: Hoare triple {3075#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {3075#false} is VALID [2018-11-14 18:46:55,459 INFO L256 TraceCheckUtils]: 50: Hoare triple {3075#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3075#false} is VALID [2018-11-14 18:46:55,459 INFO L273 TraceCheckUtils]: 51: Hoare triple {3075#false} ~cond := #in~cond; {3075#false} is VALID [2018-11-14 18:46:55,459 INFO L273 TraceCheckUtils]: 52: Hoare triple {3075#false} assume ~cond == 0; {3075#false} is VALID [2018-11-14 18:46:55,459 INFO L273 TraceCheckUtils]: 53: Hoare triple {3075#false} assume !false; {3075#false} is VALID [2018-11-14 18:46:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:46:55,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:55,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 18:46:55,482 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-11-14 18:46:55,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:55,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:46:55,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:55,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:46:55,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:46:55,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:46:55,555 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 18 states. [2018-11-14 18:46:56,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:56,012 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-11-14 18:46:56,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 18:46:56,012 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-11-14 18:46:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:46:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2018-11-14 18:46:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:46:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2018-11-14 18:46:56,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 84 transitions. [2018-11-14 18:46:56,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:56,137 INFO L225 Difference]: With dead ends: 90 [2018-11-14 18:46:56,138 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 18:46:56,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:46:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 18:46:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-11-14 18:46:56,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:56,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 60 states. [2018-11-14 18:46:56,173 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 60 states. [2018-11-14 18:46:56,173 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 60 states. [2018-11-14 18:46:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:56,175 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-14 18:46:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 18:46:56,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:56,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:56,175 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 68 states. [2018-11-14 18:46:56,175 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 68 states. [2018-11-14 18:46:56,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:56,177 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-14 18:46:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 18:46:56,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:56,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:56,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:56,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 18:46:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-14 18:46:56,179 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 54 [2018-11-14 18:46:56,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:56,180 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-14 18:46:56,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:46:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-14 18:46:56,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 18:46:56,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:56,180 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:56,181 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:56,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:56,181 INFO L82 PathProgramCache]: Analyzing trace with hash -71530289, now seen corresponding path program 9 times [2018-11-14 18:46:56,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:56,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:56,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:56,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:56,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:56,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {3607#true} call ULTIMATE.init(); {3607#true} is VALID [2018-11-14 18:46:56,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {3607#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3607#true} is VALID [2018-11-14 18:46:56,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3607#true} {3607#true} #63#return; {3607#true} is VALID [2018-11-14 18:46:56,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {3607#true} call #t~ret4 := main(); {3607#true} is VALID [2018-11-14 18:46:56,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {3607#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3609#(= main_~i~0 0)} is VALID [2018-11-14 18:46:56,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {3609#(= main_~i~0 0)} assume true; {3609#(= main_~i~0 0)} is VALID [2018-11-14 18:46:56,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {3609#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3610#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:56,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {3610#(<= main_~i~0 1)} assume true; {3610#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:56,566 INFO L273 TraceCheckUtils]: 9: Hoare triple {3610#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3611#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:56,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {3611#(<= main_~i~0 2)} assume true; {3611#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:56,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {3611#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3612#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:56,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {3612#(<= main_~i~0 3)} assume true; {3612#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:56,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {3612#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3613#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:56,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {3613#(<= main_~i~0 4)} assume true; {3613#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:56,569 INFO L273 TraceCheckUtils]: 15: Hoare triple {3613#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3614#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:56,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {3614#(<= main_~i~0 5)} assume true; {3614#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:56,571 INFO L273 TraceCheckUtils]: 17: Hoare triple {3614#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3615#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:56,571 INFO L273 TraceCheckUtils]: 18: Hoare triple {3615#(<= main_~i~0 6)} assume true; {3615#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:56,572 INFO L273 TraceCheckUtils]: 19: Hoare triple {3615#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3616#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:56,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {3616#(<= main_~i~0 7)} assume true; {3616#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:56,573 INFO L273 TraceCheckUtils]: 21: Hoare triple {3616#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3617#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:56,574 INFO L273 TraceCheckUtils]: 22: Hoare triple {3617#(<= main_~i~0 8)} assume true; {3617#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:56,575 INFO L273 TraceCheckUtils]: 23: Hoare triple {3617#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3618#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:56,576 INFO L273 TraceCheckUtils]: 24: Hoare triple {3618#(<= main_~i~0 9)} assume true; {3618#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:56,577 INFO L273 TraceCheckUtils]: 25: Hoare triple {3618#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3619#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:56,577 INFO L273 TraceCheckUtils]: 26: Hoare triple {3619#(<= main_~i~0 10)} assume true; {3619#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:56,578 INFO L273 TraceCheckUtils]: 27: Hoare triple {3619#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3620#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:56,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {3620#(<= main_~i~0 11)} assume true; {3620#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:56,580 INFO L273 TraceCheckUtils]: 29: Hoare triple {3620#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3621#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:56,581 INFO L273 TraceCheckUtils]: 30: Hoare triple {3621#(<= main_~i~0 12)} assume true; {3621#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:56,582 INFO L273 TraceCheckUtils]: 31: Hoare triple {3621#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3622#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:56,583 INFO L273 TraceCheckUtils]: 32: Hoare triple {3622#(<= main_~i~0 13)} assume true; {3622#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:56,584 INFO L273 TraceCheckUtils]: 33: Hoare triple {3622#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3623#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:56,584 INFO L273 TraceCheckUtils]: 34: Hoare triple {3623#(<= main_~i~0 14)} assume true; {3623#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:56,585 INFO L273 TraceCheckUtils]: 35: Hoare triple {3623#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3624#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:56,586 INFO L273 TraceCheckUtils]: 36: Hoare triple {3624#(<= main_~i~0 15)} assume true; {3624#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:56,587 INFO L273 TraceCheckUtils]: 37: Hoare triple {3624#(<= main_~i~0 15)} assume !(~i~0 < 100000); {3608#false} is VALID [2018-11-14 18:46:56,587 INFO L273 TraceCheckUtils]: 38: Hoare triple {3608#false} ~i~0 := 1; {3608#false} is VALID [2018-11-14 18:46:56,587 INFO L273 TraceCheckUtils]: 39: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 18:46:56,587 INFO L273 TraceCheckUtils]: 40: Hoare triple {3608#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3608#false} is VALID [2018-11-14 18:46:56,587 INFO L273 TraceCheckUtils]: 41: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 18:46:56,588 INFO L273 TraceCheckUtils]: 42: Hoare triple {3608#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3608#false} is VALID [2018-11-14 18:46:56,588 INFO L273 TraceCheckUtils]: 43: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 18:46:56,588 INFO L273 TraceCheckUtils]: 44: Hoare triple {3608#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3608#false} is VALID [2018-11-14 18:46:56,588 INFO L273 TraceCheckUtils]: 45: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 18:46:56,588 INFO L273 TraceCheckUtils]: 46: Hoare triple {3608#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3608#false} is VALID [2018-11-14 18:46:56,589 INFO L273 TraceCheckUtils]: 47: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 18:46:56,589 INFO L273 TraceCheckUtils]: 48: Hoare triple {3608#false} assume !(~i~0 < 100000); {3608#false} is VALID [2018-11-14 18:46:56,589 INFO L273 TraceCheckUtils]: 49: Hoare triple {3608#false} ~i~0 := 1;~j~0 := 0; {3608#false} is VALID [2018-11-14 18:46:56,590 INFO L273 TraceCheckUtils]: 50: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 18:46:56,590 INFO L273 TraceCheckUtils]: 51: Hoare triple {3608#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {3608#false} is VALID [2018-11-14 18:46:56,590 INFO L256 TraceCheckUtils]: 52: Hoare triple {3608#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3608#false} is VALID [2018-11-14 18:46:56,590 INFO L273 TraceCheckUtils]: 53: Hoare triple {3608#false} ~cond := #in~cond; {3608#false} is VALID [2018-11-14 18:46:56,591 INFO L273 TraceCheckUtils]: 54: Hoare triple {3608#false} assume ~cond == 0; {3608#false} is VALID [2018-11-14 18:46:56,591 INFO L273 TraceCheckUtils]: 55: Hoare triple {3608#false} assume !false; {3608#false} is VALID [2018-11-14 18:46:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:46:56,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:56,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:46:56,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:46:56,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 18:46:56,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:56,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:56,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {3607#true} call ULTIMATE.init(); {3607#true} is VALID [2018-11-14 18:46:56,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {3607#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3607#true} is VALID [2018-11-14 18:46:56,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3607#true} {3607#true} #63#return; {3607#true} is VALID [2018-11-14 18:46:56,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {3607#true} call #t~ret4 := main(); {3607#true} is VALID [2018-11-14 18:46:56,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {3607#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3607#true} is VALID [2018-11-14 18:46:56,807 INFO L273 TraceCheckUtils]: 6: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,809 INFO L273 TraceCheckUtils]: 15: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,809 INFO L273 TraceCheckUtils]: 17: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,810 INFO L273 TraceCheckUtils]: 19: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,810 INFO L273 TraceCheckUtils]: 21: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,810 INFO L273 TraceCheckUtils]: 22: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,811 INFO L273 TraceCheckUtils]: 27: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,812 INFO L273 TraceCheckUtils]: 28: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,812 INFO L273 TraceCheckUtils]: 29: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,812 INFO L273 TraceCheckUtils]: 32: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,813 INFO L273 TraceCheckUtils]: 33: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,813 INFO L273 TraceCheckUtils]: 34: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,813 INFO L273 TraceCheckUtils]: 35: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3607#true} is VALID [2018-11-14 18:46:56,813 INFO L273 TraceCheckUtils]: 36: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 18:46:56,813 INFO L273 TraceCheckUtils]: 37: Hoare triple {3607#true} assume !(~i~0 < 100000); {3607#true} is VALID [2018-11-14 18:46:56,816 INFO L273 TraceCheckUtils]: 38: Hoare triple {3607#true} ~i~0 := 1; {3610#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:56,816 INFO L273 TraceCheckUtils]: 39: Hoare triple {3610#(<= main_~i~0 1)} assume true; {3610#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:56,818 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3619#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:56,818 INFO L273 TraceCheckUtils]: 41: Hoare triple {3619#(<= main_~i~0 10)} assume true; {3619#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:56,820 INFO L273 TraceCheckUtils]: 42: Hoare triple {3619#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3754#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:56,831 INFO L273 TraceCheckUtils]: 43: Hoare triple {3754#(<= main_~i~0 19)} assume true; {3754#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:56,832 INFO L273 TraceCheckUtils]: 44: Hoare triple {3754#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3761#(<= main_~i~0 28)} is VALID [2018-11-14 18:46:56,833 INFO L273 TraceCheckUtils]: 45: Hoare triple {3761#(<= main_~i~0 28)} assume true; {3761#(<= main_~i~0 28)} is VALID [2018-11-14 18:46:56,833 INFO L273 TraceCheckUtils]: 46: Hoare triple {3761#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {3768#(<= main_~i~0 37)} is VALID [2018-11-14 18:46:56,835 INFO L273 TraceCheckUtils]: 47: Hoare triple {3768#(<= main_~i~0 37)} assume true; {3768#(<= main_~i~0 37)} is VALID [2018-11-14 18:46:56,835 INFO L273 TraceCheckUtils]: 48: Hoare triple {3768#(<= main_~i~0 37)} assume !(~i~0 < 100000); {3608#false} is VALID [2018-11-14 18:46:56,836 INFO L273 TraceCheckUtils]: 49: Hoare triple {3608#false} ~i~0 := 1;~j~0 := 0; {3608#false} is VALID [2018-11-14 18:46:56,836 INFO L273 TraceCheckUtils]: 50: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 18:46:56,836 INFO L273 TraceCheckUtils]: 51: Hoare triple {3608#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {3608#false} is VALID [2018-11-14 18:46:56,836 INFO L256 TraceCheckUtils]: 52: Hoare triple {3608#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3608#false} is VALID [2018-11-14 18:46:56,837 INFO L273 TraceCheckUtils]: 53: Hoare triple {3608#false} ~cond := #in~cond; {3608#false} is VALID [2018-11-14 18:46:56,837 INFO L273 TraceCheckUtils]: 54: Hoare triple {3608#false} assume ~cond == 0; {3608#false} is VALID [2018-11-14 18:46:56,837 INFO L273 TraceCheckUtils]: 55: Hoare triple {3608#false} assume !false; {3608#false} is VALID [2018-11-14 18:46:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-11-14 18:46:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 21 [2018-11-14 18:46:56,861 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-11-14 18:46:56,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:56,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 18:46:56,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:56,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 18:46:56,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 18:46:56,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:46:56,933 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 21 states. [2018-11-14 18:46:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:57,735 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-11-14 18:46:57,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 18:46:57,736 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-11-14 18:46:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:46:57,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:46:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 117 transitions. [2018-11-14 18:46:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:46:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 117 transitions. [2018-11-14 18:46:57,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 117 transitions. [2018-11-14 18:46:57,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:57,903 INFO L225 Difference]: With dead ends: 112 [2018-11-14 18:46:57,904 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 18:46:57,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:46:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 18:46:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-11-14 18:46:57,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:46:57,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 70 states. [2018-11-14 18:46:57,961 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 70 states. [2018-11-14 18:46:57,961 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 70 states. [2018-11-14 18:46:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:57,964 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-11-14 18:46:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-11-14 18:46:57,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:57,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:57,965 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 90 states. [2018-11-14 18:46:57,965 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 90 states. [2018-11-14 18:46:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:46:57,968 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-11-14 18:46:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-11-14 18:46:57,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:46:57,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:46:57,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:46:57,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:46:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 18:46:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-11-14 18:46:57,970 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 56 [2018-11-14 18:46:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:46:57,970 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-14 18:46:57,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 18:46:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-14 18:46:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-14 18:46:57,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:46:57,972 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:46:57,972 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:46:57,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:46:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash -641685503, now seen corresponding path program 10 times [2018-11-14 18:46:57,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:46:57,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:46:57,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:57,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:46:57,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:46:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:59,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {4241#true} call ULTIMATE.init(); {4241#true} is VALID [2018-11-14 18:46:59,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {4241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4241#true} is VALID [2018-11-14 18:46:59,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {4241#true} assume true; {4241#true} is VALID [2018-11-14 18:46:59,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4241#true} {4241#true} #63#return; {4241#true} is VALID [2018-11-14 18:46:59,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {4241#true} call #t~ret4 := main(); {4241#true} is VALID [2018-11-14 18:46:59,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {4241#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4243#(= main_~i~0 0)} is VALID [2018-11-14 18:46:59,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {4243#(= main_~i~0 0)} assume true; {4243#(= main_~i~0 0)} is VALID [2018-11-14 18:46:59,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {4243#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4244#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:59,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {4244#(<= main_~i~0 1)} assume true; {4244#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:59,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {4244#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4245#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:59,159 INFO L273 TraceCheckUtils]: 10: Hoare triple {4245#(<= main_~i~0 2)} assume true; {4245#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:59,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {4245#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4246#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:59,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {4246#(<= main_~i~0 3)} assume true; {4246#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:59,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {4246#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4247#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:59,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {4247#(<= main_~i~0 4)} assume true; {4247#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:59,163 INFO L273 TraceCheckUtils]: 15: Hoare triple {4247#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4248#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:59,164 INFO L273 TraceCheckUtils]: 16: Hoare triple {4248#(<= main_~i~0 5)} assume true; {4248#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:59,165 INFO L273 TraceCheckUtils]: 17: Hoare triple {4248#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4249#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:59,165 INFO L273 TraceCheckUtils]: 18: Hoare triple {4249#(<= main_~i~0 6)} assume true; {4249#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:59,166 INFO L273 TraceCheckUtils]: 19: Hoare triple {4249#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4250#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:59,167 INFO L273 TraceCheckUtils]: 20: Hoare triple {4250#(<= main_~i~0 7)} assume true; {4250#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:59,168 INFO L273 TraceCheckUtils]: 21: Hoare triple {4250#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4251#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:59,168 INFO L273 TraceCheckUtils]: 22: Hoare triple {4251#(<= main_~i~0 8)} assume true; {4251#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:59,169 INFO L273 TraceCheckUtils]: 23: Hoare triple {4251#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4252#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:59,170 INFO L273 TraceCheckUtils]: 24: Hoare triple {4252#(<= main_~i~0 9)} assume true; {4252#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:59,171 INFO L273 TraceCheckUtils]: 25: Hoare triple {4252#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4253#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:59,172 INFO L273 TraceCheckUtils]: 26: Hoare triple {4253#(<= main_~i~0 10)} assume true; {4253#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:59,192 INFO L273 TraceCheckUtils]: 27: Hoare triple {4253#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4254#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:59,205 INFO L273 TraceCheckUtils]: 28: Hoare triple {4254#(<= main_~i~0 11)} assume true; {4254#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:59,221 INFO L273 TraceCheckUtils]: 29: Hoare triple {4254#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4255#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:59,230 INFO L273 TraceCheckUtils]: 30: Hoare triple {4255#(<= main_~i~0 12)} assume true; {4255#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:59,244 INFO L273 TraceCheckUtils]: 31: Hoare triple {4255#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4256#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:59,246 INFO L273 TraceCheckUtils]: 32: Hoare triple {4256#(<= main_~i~0 13)} assume true; {4256#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:59,246 INFO L273 TraceCheckUtils]: 33: Hoare triple {4256#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4257#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:59,249 INFO L273 TraceCheckUtils]: 34: Hoare triple {4257#(<= main_~i~0 14)} assume true; {4257#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:59,266 INFO L273 TraceCheckUtils]: 35: Hoare triple {4257#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4258#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:59,275 INFO L273 TraceCheckUtils]: 36: Hoare triple {4258#(<= main_~i~0 15)} assume true; {4258#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:59,285 INFO L273 TraceCheckUtils]: 37: Hoare triple {4258#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4259#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:59,285 INFO L273 TraceCheckUtils]: 38: Hoare triple {4259#(<= main_~i~0 16)} assume true; {4259#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:59,289 INFO L273 TraceCheckUtils]: 39: Hoare triple {4259#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4260#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:59,289 INFO L273 TraceCheckUtils]: 40: Hoare triple {4260#(<= main_~i~0 17)} assume true; {4260#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:59,290 INFO L273 TraceCheckUtils]: 41: Hoare triple {4260#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4261#(<= main_~i~0 18)} is VALID [2018-11-14 18:46:59,290 INFO L273 TraceCheckUtils]: 42: Hoare triple {4261#(<= main_~i~0 18)} assume true; {4261#(<= main_~i~0 18)} is VALID [2018-11-14 18:46:59,291 INFO L273 TraceCheckUtils]: 43: Hoare triple {4261#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4262#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:59,291 INFO L273 TraceCheckUtils]: 44: Hoare triple {4262#(<= main_~i~0 19)} assume true; {4262#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:59,291 INFO L273 TraceCheckUtils]: 45: Hoare triple {4262#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4242#false} is VALID [2018-11-14 18:46:59,292 INFO L273 TraceCheckUtils]: 46: Hoare triple {4242#false} ~i~0 := 1; {4242#false} is VALID [2018-11-14 18:46:59,292 INFO L273 TraceCheckUtils]: 47: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,292 INFO L273 TraceCheckUtils]: 48: Hoare triple {4242#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:46:59,292 INFO L273 TraceCheckUtils]: 49: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,292 INFO L273 TraceCheckUtils]: 50: Hoare triple {4242#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:46:59,292 INFO L273 TraceCheckUtils]: 51: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,292 INFO L273 TraceCheckUtils]: 52: Hoare triple {4242#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:46:59,292 INFO L273 TraceCheckUtils]: 53: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,292 INFO L273 TraceCheckUtils]: 54: Hoare triple {4242#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:46:59,293 INFO L273 TraceCheckUtils]: 55: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,293 INFO L273 TraceCheckUtils]: 56: Hoare triple {4242#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:46:59,293 INFO L273 TraceCheckUtils]: 57: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,293 INFO L273 TraceCheckUtils]: 58: Hoare triple {4242#false} assume !(~i~0 < 100000); {4242#false} is VALID [2018-11-14 18:46:59,293 INFO L273 TraceCheckUtils]: 59: Hoare triple {4242#false} ~i~0 := 1;~j~0 := 0; {4242#false} is VALID [2018-11-14 18:46:59,293 INFO L273 TraceCheckUtils]: 60: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,293 INFO L273 TraceCheckUtils]: 61: Hoare triple {4242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {4242#false} is VALID [2018-11-14 18:46:59,294 INFO L256 TraceCheckUtils]: 62: Hoare triple {4242#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4242#false} is VALID [2018-11-14 18:46:59,294 INFO L273 TraceCheckUtils]: 63: Hoare triple {4242#false} ~cond := #in~cond; {4242#false} is VALID [2018-11-14 18:46:59,294 INFO L273 TraceCheckUtils]: 64: Hoare triple {4242#false} assume ~cond == 0; {4242#false} is VALID [2018-11-14 18:46:59,294 INFO L273 TraceCheckUtils]: 65: Hoare triple {4242#false} assume !false; {4242#false} is VALID [2018-11-14 18:46:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 18:46:59,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:46:59,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:46:59,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:46:59,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:46:59,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:46:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:46:59,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:46:59,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {4241#true} call ULTIMATE.init(); {4241#true} is VALID [2018-11-14 18:46:59,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {4241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4241#true} is VALID [2018-11-14 18:46:59,705 INFO L273 TraceCheckUtils]: 2: Hoare triple {4241#true} assume true; {4241#true} is VALID [2018-11-14 18:46:59,705 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4241#true} {4241#true} #63#return; {4241#true} is VALID [2018-11-14 18:46:59,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {4241#true} call #t~ret4 := main(); {4241#true} is VALID [2018-11-14 18:46:59,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {4241#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4281#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:59,707 INFO L273 TraceCheckUtils]: 6: Hoare triple {4281#(<= main_~i~0 0)} assume true; {4281#(<= main_~i~0 0)} is VALID [2018-11-14 18:46:59,707 INFO L273 TraceCheckUtils]: 7: Hoare triple {4281#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4244#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:59,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {4244#(<= main_~i~0 1)} assume true; {4244#(<= main_~i~0 1)} is VALID [2018-11-14 18:46:59,709 INFO L273 TraceCheckUtils]: 9: Hoare triple {4244#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4245#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:59,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {4245#(<= main_~i~0 2)} assume true; {4245#(<= main_~i~0 2)} is VALID [2018-11-14 18:46:59,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {4245#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4246#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:59,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {4246#(<= main_~i~0 3)} assume true; {4246#(<= main_~i~0 3)} is VALID [2018-11-14 18:46:59,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {4246#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4247#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:59,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {4247#(<= main_~i~0 4)} assume true; {4247#(<= main_~i~0 4)} is VALID [2018-11-14 18:46:59,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {4247#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4248#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:59,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {4248#(<= main_~i~0 5)} assume true; {4248#(<= main_~i~0 5)} is VALID [2018-11-14 18:46:59,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {4248#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4249#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:59,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {4249#(<= main_~i~0 6)} assume true; {4249#(<= main_~i~0 6)} is VALID [2018-11-14 18:46:59,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {4249#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4250#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:59,727 INFO L273 TraceCheckUtils]: 20: Hoare triple {4250#(<= main_~i~0 7)} assume true; {4250#(<= main_~i~0 7)} is VALID [2018-11-14 18:46:59,728 INFO L273 TraceCheckUtils]: 21: Hoare triple {4250#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4251#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:59,729 INFO L273 TraceCheckUtils]: 22: Hoare triple {4251#(<= main_~i~0 8)} assume true; {4251#(<= main_~i~0 8)} is VALID [2018-11-14 18:46:59,730 INFO L273 TraceCheckUtils]: 23: Hoare triple {4251#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4252#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:59,730 INFO L273 TraceCheckUtils]: 24: Hoare triple {4252#(<= main_~i~0 9)} assume true; {4252#(<= main_~i~0 9)} is VALID [2018-11-14 18:46:59,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {4252#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4253#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:59,732 INFO L273 TraceCheckUtils]: 26: Hoare triple {4253#(<= main_~i~0 10)} assume true; {4253#(<= main_~i~0 10)} is VALID [2018-11-14 18:46:59,734 INFO L273 TraceCheckUtils]: 27: Hoare triple {4253#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4254#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:59,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {4254#(<= main_~i~0 11)} assume true; {4254#(<= main_~i~0 11)} is VALID [2018-11-14 18:46:59,736 INFO L273 TraceCheckUtils]: 29: Hoare triple {4254#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4255#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:59,736 INFO L273 TraceCheckUtils]: 30: Hoare triple {4255#(<= main_~i~0 12)} assume true; {4255#(<= main_~i~0 12)} is VALID [2018-11-14 18:46:59,738 INFO L273 TraceCheckUtils]: 31: Hoare triple {4255#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4256#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:59,738 INFO L273 TraceCheckUtils]: 32: Hoare triple {4256#(<= main_~i~0 13)} assume true; {4256#(<= main_~i~0 13)} is VALID [2018-11-14 18:46:59,739 INFO L273 TraceCheckUtils]: 33: Hoare triple {4256#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4257#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:59,740 INFO L273 TraceCheckUtils]: 34: Hoare triple {4257#(<= main_~i~0 14)} assume true; {4257#(<= main_~i~0 14)} is VALID [2018-11-14 18:46:59,745 INFO L273 TraceCheckUtils]: 35: Hoare triple {4257#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4258#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:59,748 INFO L273 TraceCheckUtils]: 36: Hoare triple {4258#(<= main_~i~0 15)} assume true; {4258#(<= main_~i~0 15)} is VALID [2018-11-14 18:46:59,748 INFO L273 TraceCheckUtils]: 37: Hoare triple {4258#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4259#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:59,750 INFO L273 TraceCheckUtils]: 38: Hoare triple {4259#(<= main_~i~0 16)} assume true; {4259#(<= main_~i~0 16)} is VALID [2018-11-14 18:46:59,750 INFO L273 TraceCheckUtils]: 39: Hoare triple {4259#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4260#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:59,752 INFO L273 TraceCheckUtils]: 40: Hoare triple {4260#(<= main_~i~0 17)} assume true; {4260#(<= main_~i~0 17)} is VALID [2018-11-14 18:46:59,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {4260#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4261#(<= main_~i~0 18)} is VALID [2018-11-14 18:46:59,753 INFO L273 TraceCheckUtils]: 42: Hoare triple {4261#(<= main_~i~0 18)} assume true; {4261#(<= main_~i~0 18)} is VALID [2018-11-14 18:46:59,754 INFO L273 TraceCheckUtils]: 43: Hoare triple {4261#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4262#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:59,755 INFO L273 TraceCheckUtils]: 44: Hoare triple {4262#(<= main_~i~0 19)} assume true; {4262#(<= main_~i~0 19)} is VALID [2018-11-14 18:46:59,755 INFO L273 TraceCheckUtils]: 45: Hoare triple {4262#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4242#false} is VALID [2018-11-14 18:46:59,756 INFO L273 TraceCheckUtils]: 46: Hoare triple {4242#false} ~i~0 := 1; {4242#false} is VALID [2018-11-14 18:46:59,756 INFO L273 TraceCheckUtils]: 47: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,756 INFO L273 TraceCheckUtils]: 48: Hoare triple {4242#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:46:59,756 INFO L273 TraceCheckUtils]: 49: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,757 INFO L273 TraceCheckUtils]: 50: Hoare triple {4242#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:46:59,757 INFO L273 TraceCheckUtils]: 51: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,757 INFO L273 TraceCheckUtils]: 52: Hoare triple {4242#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:46:59,757 INFO L273 TraceCheckUtils]: 53: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {4242#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:46:59,758 INFO L273 TraceCheckUtils]: 55: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,758 INFO L273 TraceCheckUtils]: 56: Hoare triple {4242#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:46:59,758 INFO L273 TraceCheckUtils]: 57: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,758 INFO L273 TraceCheckUtils]: 58: Hoare triple {4242#false} assume !(~i~0 < 100000); {4242#false} is VALID [2018-11-14 18:46:59,758 INFO L273 TraceCheckUtils]: 59: Hoare triple {4242#false} ~i~0 := 1;~j~0 := 0; {4242#false} is VALID [2018-11-14 18:46:59,758 INFO L273 TraceCheckUtils]: 60: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:46:59,759 INFO L273 TraceCheckUtils]: 61: Hoare triple {4242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {4242#false} is VALID [2018-11-14 18:46:59,759 INFO L256 TraceCheckUtils]: 62: Hoare triple {4242#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4242#false} is VALID [2018-11-14 18:46:59,759 INFO L273 TraceCheckUtils]: 63: Hoare triple {4242#false} ~cond := #in~cond; {4242#false} is VALID [2018-11-14 18:46:59,759 INFO L273 TraceCheckUtils]: 64: Hoare triple {4242#false} assume ~cond == 0; {4242#false} is VALID [2018-11-14 18:46:59,759 INFO L273 TraceCheckUtils]: 65: Hoare triple {4242#false} assume !false; {4242#false} is VALID [2018-11-14 18:46:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 18:46:59,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:46:59,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 18:46:59,785 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-11-14 18:46:59,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:46:59,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 18:46:59,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:46:59,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 18:46:59,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 18:46:59,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:46:59,865 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 23 states. [2018-11-14 18:47:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:00,491 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2018-11-14 18:47:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 18:47:00,491 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-11-14 18:47:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:47:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:47:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 101 transitions. [2018-11-14 18:47:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:47:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 101 transitions. [2018-11-14 18:47:00,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 101 transitions. [2018-11-14 18:47:01,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:01,014 INFO L225 Difference]: With dead ends: 108 [2018-11-14 18:47:01,014 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 18:47:01,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:47:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 18:47:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2018-11-14 18:47:01,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:47:01,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 72 states. [2018-11-14 18:47:01,618 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 72 states. [2018-11-14 18:47:01,619 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 72 states. [2018-11-14 18:47:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:01,621 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-14 18:47:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-14 18:47:01,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:01,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:01,622 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 84 states. [2018-11-14 18:47:01,622 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 84 states. [2018-11-14 18:47:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:01,624 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-14 18:47:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-14 18:47:01,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:01,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:01,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:47:01,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:47:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 18:47:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-11-14 18:47:01,627 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 66 [2018-11-14 18:47:01,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:47:01,627 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-11-14 18:47:01,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 18:47:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-14 18:47:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-14 18:47:01,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:47:01,629 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:47:01,629 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:47:01,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:47:01,629 INFO L82 PathProgramCache]: Analyzing trace with hash 21576359, now seen corresponding path program 11 times [2018-11-14 18:47:01,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:47:01,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:47:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:01,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:47:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:02,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {4892#true} call ULTIMATE.init(); {4892#true} is VALID [2018-11-14 18:47:02,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {4892#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4892#true} is VALID [2018-11-14 18:47:02,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:02,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4892#true} {4892#true} #63#return; {4892#true} is VALID [2018-11-14 18:47:02,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {4892#true} call #t~ret4 := main(); {4892#true} is VALID [2018-11-14 18:47:02,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {4892#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4894#(= main_~i~0 0)} is VALID [2018-11-14 18:47:02,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {4894#(= main_~i~0 0)} assume true; {4894#(= main_~i~0 0)} is VALID [2018-11-14 18:47:02,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {4894#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4895#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:02,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {4895#(<= main_~i~0 1)} assume true; {4895#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:02,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {4895#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4896#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:02,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {4896#(<= main_~i~0 2)} assume true; {4896#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:02,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {4896#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4897#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:02,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {4897#(<= main_~i~0 3)} assume true; {4897#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:02,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {4897#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4898#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:02,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {4898#(<= main_~i~0 4)} assume true; {4898#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:02,390 INFO L273 TraceCheckUtils]: 15: Hoare triple {4898#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4899#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:02,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {4899#(<= main_~i~0 5)} assume true; {4899#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:02,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {4899#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4900#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:02,392 INFO L273 TraceCheckUtils]: 18: Hoare triple {4900#(<= main_~i~0 6)} assume true; {4900#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:02,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {4900#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4901#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:02,393 INFO L273 TraceCheckUtils]: 20: Hoare triple {4901#(<= main_~i~0 7)} assume true; {4901#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:02,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {4901#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4902#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:02,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {4902#(<= main_~i~0 8)} assume true; {4902#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:02,396 INFO L273 TraceCheckUtils]: 23: Hoare triple {4902#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4903#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:02,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {4903#(<= main_~i~0 9)} assume true; {4903#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:02,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {4903#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4904#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:02,398 INFO L273 TraceCheckUtils]: 26: Hoare triple {4904#(<= main_~i~0 10)} assume true; {4904#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:02,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {4904#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4905#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:02,400 INFO L273 TraceCheckUtils]: 28: Hoare triple {4905#(<= main_~i~0 11)} assume true; {4905#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:02,401 INFO L273 TraceCheckUtils]: 29: Hoare triple {4905#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4906#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:02,401 INFO L273 TraceCheckUtils]: 30: Hoare triple {4906#(<= main_~i~0 12)} assume true; {4906#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:02,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {4906#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4907#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:02,403 INFO L273 TraceCheckUtils]: 32: Hoare triple {4907#(<= main_~i~0 13)} assume true; {4907#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:02,404 INFO L273 TraceCheckUtils]: 33: Hoare triple {4907#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4908#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:02,404 INFO L273 TraceCheckUtils]: 34: Hoare triple {4908#(<= main_~i~0 14)} assume true; {4908#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:02,405 INFO L273 TraceCheckUtils]: 35: Hoare triple {4908#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4909#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:02,406 INFO L273 TraceCheckUtils]: 36: Hoare triple {4909#(<= main_~i~0 15)} assume true; {4909#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:02,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {4909#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4910#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:02,407 INFO L273 TraceCheckUtils]: 38: Hoare triple {4910#(<= main_~i~0 16)} assume true; {4910#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:02,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {4910#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4911#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:02,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {4911#(<= main_~i~0 17)} assume true; {4911#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:02,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {4911#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4912#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:02,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {4912#(<= main_~i~0 18)} assume true; {4912#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:02,412 INFO L273 TraceCheckUtils]: 43: Hoare triple {4912#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4913#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:02,412 INFO L273 TraceCheckUtils]: 44: Hoare triple {4913#(<= main_~i~0 19)} assume true; {4913#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:02,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {4913#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4914#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:02,414 INFO L273 TraceCheckUtils]: 46: Hoare triple {4914#(<= main_~i~0 20)} assume true; {4914#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:02,414 INFO L273 TraceCheckUtils]: 47: Hoare triple {4914#(<= main_~i~0 20)} assume !(~i~0 < 100000); {4893#false} is VALID [2018-11-14 18:47:02,415 INFO L273 TraceCheckUtils]: 48: Hoare triple {4893#false} ~i~0 := 1; {4893#false} is VALID [2018-11-14 18:47:02,415 INFO L273 TraceCheckUtils]: 49: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 18:47:02,415 INFO L273 TraceCheckUtils]: 50: Hoare triple {4893#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4893#false} is VALID [2018-11-14 18:47:02,415 INFO L273 TraceCheckUtils]: 51: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 18:47:02,415 INFO L273 TraceCheckUtils]: 52: Hoare triple {4893#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4893#false} is VALID [2018-11-14 18:47:02,416 INFO L273 TraceCheckUtils]: 53: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 18:47:02,416 INFO L273 TraceCheckUtils]: 54: Hoare triple {4893#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4893#false} is VALID [2018-11-14 18:47:02,416 INFO L273 TraceCheckUtils]: 55: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 18:47:02,416 INFO L273 TraceCheckUtils]: 56: Hoare triple {4893#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4893#false} is VALID [2018-11-14 18:47:02,417 INFO L273 TraceCheckUtils]: 57: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 18:47:02,417 INFO L273 TraceCheckUtils]: 58: Hoare triple {4893#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4893#false} is VALID [2018-11-14 18:47:02,417 INFO L273 TraceCheckUtils]: 59: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 18:47:02,417 INFO L273 TraceCheckUtils]: 60: Hoare triple {4893#false} assume !(~i~0 < 100000); {4893#false} is VALID [2018-11-14 18:47:02,417 INFO L273 TraceCheckUtils]: 61: Hoare triple {4893#false} ~i~0 := 1;~j~0 := 0; {4893#false} is VALID [2018-11-14 18:47:02,417 INFO L273 TraceCheckUtils]: 62: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 18:47:02,418 INFO L273 TraceCheckUtils]: 63: Hoare triple {4893#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {4893#false} is VALID [2018-11-14 18:47:02,418 INFO L256 TraceCheckUtils]: 64: Hoare triple {4893#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4893#false} is VALID [2018-11-14 18:47:02,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {4893#false} ~cond := #in~cond; {4893#false} is VALID [2018-11-14 18:47:02,418 INFO L273 TraceCheckUtils]: 66: Hoare triple {4893#false} assume ~cond == 0; {4893#false} is VALID [2018-11-14 18:47:02,418 INFO L273 TraceCheckUtils]: 67: Hoare triple {4893#false} assume !false; {4893#false} is VALID [2018-11-14 18:47:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 18:47:02,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:47:02,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:47:02,431 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:47:03,382 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-11-14 18:47:03,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:47:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:03,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:47:03,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {4892#true} call ULTIMATE.init(); {4892#true} is VALID [2018-11-14 18:47:03,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {4892#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4892#true} is VALID [2018-11-14 18:47:03,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,538 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4892#true} {4892#true} #63#return; {4892#true} is VALID [2018-11-14 18:47:03,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {4892#true} call #t~ret4 := main(); {4892#true} is VALID [2018-11-14 18:47:03,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {4892#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4892#true} is VALID [2018-11-14 18:47:03,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,541 INFO L273 TraceCheckUtils]: 16: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,541 INFO L273 TraceCheckUtils]: 22: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,541 INFO L273 TraceCheckUtils]: 24: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,542 INFO L273 TraceCheckUtils]: 25: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,542 INFO L273 TraceCheckUtils]: 26: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,542 INFO L273 TraceCheckUtils]: 28: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,542 INFO L273 TraceCheckUtils]: 29: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,542 INFO L273 TraceCheckUtils]: 30: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,542 INFO L273 TraceCheckUtils]: 31: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,542 INFO L273 TraceCheckUtils]: 32: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,543 INFO L273 TraceCheckUtils]: 33: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,543 INFO L273 TraceCheckUtils]: 34: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,543 INFO L273 TraceCheckUtils]: 35: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,543 INFO L273 TraceCheckUtils]: 36: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,543 INFO L273 TraceCheckUtils]: 37: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,543 INFO L273 TraceCheckUtils]: 38: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,543 INFO L273 TraceCheckUtils]: 39: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,543 INFO L273 TraceCheckUtils]: 40: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,544 INFO L273 TraceCheckUtils]: 41: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,544 INFO L273 TraceCheckUtils]: 42: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,544 INFO L273 TraceCheckUtils]: 43: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,544 INFO L273 TraceCheckUtils]: 44: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,544 INFO L273 TraceCheckUtils]: 45: Hoare triple {4892#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4892#true} is VALID [2018-11-14 18:47:03,544 INFO L273 TraceCheckUtils]: 46: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 18:47:03,544 INFO L273 TraceCheckUtils]: 47: Hoare triple {4892#true} assume !(~i~0 < 100000); {4892#true} is VALID [2018-11-14 18:47:03,545 INFO L273 TraceCheckUtils]: 48: Hoare triple {4892#true} ~i~0 := 1; {4895#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:03,545 INFO L273 TraceCheckUtils]: 49: Hoare triple {4895#(<= main_~i~0 1)} assume true; {4895#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:03,546 INFO L273 TraceCheckUtils]: 50: Hoare triple {4895#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4904#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:03,546 INFO L273 TraceCheckUtils]: 51: Hoare triple {4904#(<= main_~i~0 10)} assume true; {4904#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:03,547 INFO L273 TraceCheckUtils]: 52: Hoare triple {4904#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {4913#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:03,548 INFO L273 TraceCheckUtils]: 53: Hoare triple {4913#(<= main_~i~0 19)} assume true; {4913#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:03,549 INFO L273 TraceCheckUtils]: 54: Hoare triple {4913#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5080#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:03,549 INFO L273 TraceCheckUtils]: 55: Hoare triple {5080#(<= main_~i~0 28)} assume true; {5080#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:03,550 INFO L273 TraceCheckUtils]: 56: Hoare triple {5080#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5087#(<= main_~i~0 37)} is VALID [2018-11-14 18:47:03,551 INFO L273 TraceCheckUtils]: 57: Hoare triple {5087#(<= main_~i~0 37)} assume true; {5087#(<= main_~i~0 37)} is VALID [2018-11-14 18:47:03,552 INFO L273 TraceCheckUtils]: 58: Hoare triple {5087#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5094#(<= main_~i~0 46)} is VALID [2018-11-14 18:47:03,552 INFO L273 TraceCheckUtils]: 59: Hoare triple {5094#(<= main_~i~0 46)} assume true; {5094#(<= main_~i~0 46)} is VALID [2018-11-14 18:47:03,553 INFO L273 TraceCheckUtils]: 60: Hoare triple {5094#(<= main_~i~0 46)} assume !(~i~0 < 100000); {4893#false} is VALID [2018-11-14 18:47:03,553 INFO L273 TraceCheckUtils]: 61: Hoare triple {4893#false} ~i~0 := 1;~j~0 := 0; {4893#false} is VALID [2018-11-14 18:47:03,554 INFO L273 TraceCheckUtils]: 62: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 18:47:03,554 INFO L273 TraceCheckUtils]: 63: Hoare triple {4893#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {4893#false} is VALID [2018-11-14 18:47:03,554 INFO L256 TraceCheckUtils]: 64: Hoare triple {4893#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4893#false} is VALID [2018-11-14 18:47:03,554 INFO L273 TraceCheckUtils]: 65: Hoare triple {4893#false} ~cond := #in~cond; {4893#false} is VALID [2018-11-14 18:47:03,554 INFO L273 TraceCheckUtils]: 66: Hoare triple {4893#false} assume ~cond == 0; {4893#false} is VALID [2018-11-14 18:47:03,555 INFO L273 TraceCheckUtils]: 67: Hoare triple {4893#false} assume !false; {4893#false} is VALID [2018-11-14 18:47:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-14 18:47:03,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:47:03,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8] total 26 [2018-11-14 18:47:03,580 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 68 [2018-11-14 18:47:03,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:47:03,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 18:47:03,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:03,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 18:47:03,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 18:47:03,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:47:03,656 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 26 states. [2018-11-14 18:47:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:04,641 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-11-14 18:47:04,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 18:47:04,641 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 68 [2018-11-14 18:47:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:47:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:47:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 134 transitions. [2018-11-14 18:47:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:47:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 134 transitions. [2018-11-14 18:47:04,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 134 transitions. [2018-11-14 18:47:05,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:05,271 INFO L225 Difference]: With dead ends: 130 [2018-11-14 18:47:05,271 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 18:47:05,272 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:47:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 18:47:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2018-11-14 18:47:05,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:47:05,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 82 states. [2018-11-14 18:47:05,306 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 82 states. [2018-11-14 18:47:05,306 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 82 states. [2018-11-14 18:47:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:05,310 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-14 18:47:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-11-14 18:47:05,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:05,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:05,311 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 106 states. [2018-11-14 18:47:05,311 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 106 states. [2018-11-14 18:47:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:05,314 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-14 18:47:05,315 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-11-14 18:47:05,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:05,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:05,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:47:05,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:47:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 18:47:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-14 18:47:05,317 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 68 [2018-11-14 18:47:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:47:05,318 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-14 18:47:05,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 18:47:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-14 18:47:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-14 18:47:05,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:47:05,319 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:47:05,319 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:47:05,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:47:05,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1975951321, now seen corresponding path program 12 times [2018-11-14 18:47:05,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:47:05,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:47:05,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:05,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:47:05,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:06,221 INFO L256 TraceCheckUtils]: 0: Hoare triple {5644#true} call ULTIMATE.init(); {5644#true} is VALID [2018-11-14 18:47:06,221 INFO L273 TraceCheckUtils]: 1: Hoare triple {5644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5644#true} is VALID [2018-11-14 18:47:06,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:06,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5644#true} {5644#true} #63#return; {5644#true} is VALID [2018-11-14 18:47:06,222 INFO L256 TraceCheckUtils]: 4: Hoare triple {5644#true} call #t~ret4 := main(); {5644#true} is VALID [2018-11-14 18:47:06,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {5644#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5646#(= main_~i~0 0)} is VALID [2018-11-14 18:47:06,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {5646#(= main_~i~0 0)} assume true; {5646#(= main_~i~0 0)} is VALID [2018-11-14 18:47:06,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {5646#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5647#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:06,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {5647#(<= main_~i~0 1)} assume true; {5647#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:06,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {5647#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5648#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:06,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {5648#(<= main_~i~0 2)} assume true; {5648#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:06,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {5648#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5649#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:06,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {5649#(<= main_~i~0 3)} assume true; {5649#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:06,229 INFO L273 TraceCheckUtils]: 13: Hoare triple {5649#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5650#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:06,229 INFO L273 TraceCheckUtils]: 14: Hoare triple {5650#(<= main_~i~0 4)} assume true; {5650#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:06,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {5650#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5651#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:06,231 INFO L273 TraceCheckUtils]: 16: Hoare triple {5651#(<= main_~i~0 5)} assume true; {5651#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:06,232 INFO L273 TraceCheckUtils]: 17: Hoare triple {5651#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5652#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:06,233 INFO L273 TraceCheckUtils]: 18: Hoare triple {5652#(<= main_~i~0 6)} assume true; {5652#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:06,234 INFO L273 TraceCheckUtils]: 19: Hoare triple {5652#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5653#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:06,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {5653#(<= main_~i~0 7)} assume true; {5653#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:06,235 INFO L273 TraceCheckUtils]: 21: Hoare triple {5653#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5654#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:06,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {5654#(<= main_~i~0 8)} assume true; {5654#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:06,237 INFO L273 TraceCheckUtils]: 23: Hoare triple {5654#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5655#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:06,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {5655#(<= main_~i~0 9)} assume true; {5655#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:06,238 INFO L273 TraceCheckUtils]: 25: Hoare triple {5655#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5656#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:06,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {5656#(<= main_~i~0 10)} assume true; {5656#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:06,240 INFO L273 TraceCheckUtils]: 27: Hoare triple {5656#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5657#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:06,240 INFO L273 TraceCheckUtils]: 28: Hoare triple {5657#(<= main_~i~0 11)} assume true; {5657#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:06,241 INFO L273 TraceCheckUtils]: 29: Hoare triple {5657#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5658#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:06,242 INFO L273 TraceCheckUtils]: 30: Hoare triple {5658#(<= main_~i~0 12)} assume true; {5658#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:06,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {5658#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5659#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:06,244 INFO L273 TraceCheckUtils]: 32: Hoare triple {5659#(<= main_~i~0 13)} assume true; {5659#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:06,245 INFO L273 TraceCheckUtils]: 33: Hoare triple {5659#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5660#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:06,245 INFO L273 TraceCheckUtils]: 34: Hoare triple {5660#(<= main_~i~0 14)} assume true; {5660#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:06,246 INFO L273 TraceCheckUtils]: 35: Hoare triple {5660#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5661#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:06,247 INFO L273 TraceCheckUtils]: 36: Hoare triple {5661#(<= main_~i~0 15)} assume true; {5661#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:06,248 INFO L273 TraceCheckUtils]: 37: Hoare triple {5661#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5662#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:06,248 INFO L273 TraceCheckUtils]: 38: Hoare triple {5662#(<= main_~i~0 16)} assume true; {5662#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:06,249 INFO L273 TraceCheckUtils]: 39: Hoare triple {5662#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5663#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:06,250 INFO L273 TraceCheckUtils]: 40: Hoare triple {5663#(<= main_~i~0 17)} assume true; {5663#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:06,251 INFO L273 TraceCheckUtils]: 41: Hoare triple {5663#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5664#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:06,251 INFO L273 TraceCheckUtils]: 42: Hoare triple {5664#(<= main_~i~0 18)} assume true; {5664#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:06,252 INFO L273 TraceCheckUtils]: 43: Hoare triple {5664#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5665#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:06,253 INFO L273 TraceCheckUtils]: 44: Hoare triple {5665#(<= main_~i~0 19)} assume true; {5665#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:06,254 INFO L273 TraceCheckUtils]: 45: Hoare triple {5665#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5666#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:06,254 INFO L273 TraceCheckUtils]: 46: Hoare triple {5666#(<= main_~i~0 20)} assume true; {5666#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:06,255 INFO L273 TraceCheckUtils]: 47: Hoare triple {5666#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5667#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:06,256 INFO L273 TraceCheckUtils]: 48: Hoare triple {5667#(<= main_~i~0 21)} assume true; {5667#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:06,257 INFO L273 TraceCheckUtils]: 49: Hoare triple {5667#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5668#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:06,258 INFO L273 TraceCheckUtils]: 50: Hoare triple {5668#(<= main_~i~0 22)} assume true; {5668#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:06,259 INFO L273 TraceCheckUtils]: 51: Hoare triple {5668#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5669#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:06,259 INFO L273 TraceCheckUtils]: 52: Hoare triple {5669#(<= main_~i~0 23)} assume true; {5669#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:06,260 INFO L273 TraceCheckUtils]: 53: Hoare triple {5669#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5670#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:06,261 INFO L273 TraceCheckUtils]: 54: Hoare triple {5670#(<= main_~i~0 24)} assume true; {5670#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:06,261 INFO L273 TraceCheckUtils]: 55: Hoare triple {5670#(<= main_~i~0 24)} assume !(~i~0 < 100000); {5645#false} is VALID [2018-11-14 18:47:06,262 INFO L273 TraceCheckUtils]: 56: Hoare triple {5645#false} ~i~0 := 1; {5645#false} is VALID [2018-11-14 18:47:06,262 INFO L273 TraceCheckUtils]: 57: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 18:47:06,262 INFO L273 TraceCheckUtils]: 58: Hoare triple {5645#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5645#false} is VALID [2018-11-14 18:47:06,262 INFO L273 TraceCheckUtils]: 59: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 18:47:06,263 INFO L273 TraceCheckUtils]: 60: Hoare triple {5645#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5645#false} is VALID [2018-11-14 18:47:06,263 INFO L273 TraceCheckUtils]: 61: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 18:47:06,263 INFO L273 TraceCheckUtils]: 62: Hoare triple {5645#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5645#false} is VALID [2018-11-14 18:47:06,263 INFO L273 TraceCheckUtils]: 63: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 18:47:06,263 INFO L273 TraceCheckUtils]: 64: Hoare triple {5645#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5645#false} is VALID [2018-11-14 18:47:06,264 INFO L273 TraceCheckUtils]: 65: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 18:47:06,264 INFO L273 TraceCheckUtils]: 66: Hoare triple {5645#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5645#false} is VALID [2018-11-14 18:47:06,264 INFO L273 TraceCheckUtils]: 67: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 18:47:06,264 INFO L273 TraceCheckUtils]: 68: Hoare triple {5645#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5645#false} is VALID [2018-11-14 18:47:06,264 INFO L273 TraceCheckUtils]: 69: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 18:47:06,265 INFO L273 TraceCheckUtils]: 70: Hoare triple {5645#false} assume !(~i~0 < 100000); {5645#false} is VALID [2018-11-14 18:47:06,265 INFO L273 TraceCheckUtils]: 71: Hoare triple {5645#false} ~i~0 := 1;~j~0 := 0; {5645#false} is VALID [2018-11-14 18:47:06,265 INFO L273 TraceCheckUtils]: 72: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 18:47:06,265 INFO L273 TraceCheckUtils]: 73: Hoare triple {5645#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {5645#false} is VALID [2018-11-14 18:47:06,265 INFO L256 TraceCheckUtils]: 74: Hoare triple {5645#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5645#false} is VALID [2018-11-14 18:47:06,266 INFO L273 TraceCheckUtils]: 75: Hoare triple {5645#false} ~cond := #in~cond; {5645#false} is VALID [2018-11-14 18:47:06,266 INFO L273 TraceCheckUtils]: 76: Hoare triple {5645#false} assume ~cond == 0; {5645#false} is VALID [2018-11-14 18:47:06,266 INFO L273 TraceCheckUtils]: 77: Hoare triple {5645#false} assume !false; {5645#false} is VALID [2018-11-14 18:47:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-14 18:47:06,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:47:06,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:47:06,282 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:47:06,853 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 18:47:06,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:47:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:06,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:47:07,078 INFO L256 TraceCheckUtils]: 0: Hoare triple {5644#true} call ULTIMATE.init(); {5644#true} is VALID [2018-11-14 18:47:07,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {5644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5644#true} is VALID [2018-11-14 18:47:07,079 INFO L273 TraceCheckUtils]: 2: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,079 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5644#true} {5644#true} #63#return; {5644#true} is VALID [2018-11-14 18:47:07,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {5644#true} call #t~ret4 := main(); {5644#true} is VALID [2018-11-14 18:47:07,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {5644#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5644#true} is VALID [2018-11-14 18:47:07,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,082 INFO L273 TraceCheckUtils]: 16: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,082 INFO L273 TraceCheckUtils]: 17: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,082 INFO L273 TraceCheckUtils]: 20: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,083 INFO L273 TraceCheckUtils]: 22: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,083 INFO L273 TraceCheckUtils]: 24: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,083 INFO L273 TraceCheckUtils]: 25: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,084 INFO L273 TraceCheckUtils]: 28: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,084 INFO L273 TraceCheckUtils]: 30: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,084 INFO L273 TraceCheckUtils]: 31: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,084 INFO L273 TraceCheckUtils]: 32: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,084 INFO L273 TraceCheckUtils]: 33: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,085 INFO L273 TraceCheckUtils]: 34: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,085 INFO L273 TraceCheckUtils]: 35: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,085 INFO L273 TraceCheckUtils]: 36: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,085 INFO L273 TraceCheckUtils]: 37: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,085 INFO L273 TraceCheckUtils]: 38: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,085 INFO L273 TraceCheckUtils]: 39: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,086 INFO L273 TraceCheckUtils]: 40: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,086 INFO L273 TraceCheckUtils]: 41: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,086 INFO L273 TraceCheckUtils]: 42: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,086 INFO L273 TraceCheckUtils]: 43: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,086 INFO L273 TraceCheckUtils]: 44: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,086 INFO L273 TraceCheckUtils]: 45: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,086 INFO L273 TraceCheckUtils]: 46: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,087 INFO L273 TraceCheckUtils]: 47: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,087 INFO L273 TraceCheckUtils]: 48: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,087 INFO L273 TraceCheckUtils]: 49: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,087 INFO L273 TraceCheckUtils]: 50: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,087 INFO L273 TraceCheckUtils]: 51: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,087 INFO L273 TraceCheckUtils]: 52: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,088 INFO L273 TraceCheckUtils]: 53: Hoare triple {5644#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5644#true} is VALID [2018-11-14 18:47:07,088 INFO L273 TraceCheckUtils]: 54: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 18:47:07,088 INFO L273 TraceCheckUtils]: 55: Hoare triple {5644#true} assume !(~i~0 < 100000); {5644#true} is VALID [2018-11-14 18:47:07,088 INFO L273 TraceCheckUtils]: 56: Hoare triple {5644#true} ~i~0 := 1; {5647#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:07,089 INFO L273 TraceCheckUtils]: 57: Hoare triple {5647#(<= main_~i~0 1)} assume true; {5647#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:07,090 INFO L273 TraceCheckUtils]: 58: Hoare triple {5647#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5656#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:07,090 INFO L273 TraceCheckUtils]: 59: Hoare triple {5656#(<= main_~i~0 10)} assume true; {5656#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:07,091 INFO L273 TraceCheckUtils]: 60: Hoare triple {5656#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5665#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:07,091 INFO L273 TraceCheckUtils]: 61: Hoare triple {5665#(<= main_~i~0 19)} assume true; {5665#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:07,092 INFO L273 TraceCheckUtils]: 62: Hoare triple {5665#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5860#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:07,092 INFO L273 TraceCheckUtils]: 63: Hoare triple {5860#(<= main_~i~0 28)} assume true; {5860#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:07,094 INFO L273 TraceCheckUtils]: 64: Hoare triple {5860#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5867#(<= main_~i~0 37)} is VALID [2018-11-14 18:47:07,094 INFO L273 TraceCheckUtils]: 65: Hoare triple {5867#(<= main_~i~0 37)} assume true; {5867#(<= main_~i~0 37)} is VALID [2018-11-14 18:47:07,095 INFO L273 TraceCheckUtils]: 66: Hoare triple {5867#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5874#(<= main_~i~0 46)} is VALID [2018-11-14 18:47:07,096 INFO L273 TraceCheckUtils]: 67: Hoare triple {5874#(<= main_~i~0 46)} assume true; {5874#(<= main_~i~0 46)} is VALID [2018-11-14 18:47:07,097 INFO L273 TraceCheckUtils]: 68: Hoare triple {5874#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {5881#(<= main_~i~0 55)} is VALID [2018-11-14 18:47:07,098 INFO L273 TraceCheckUtils]: 69: Hoare triple {5881#(<= main_~i~0 55)} assume true; {5881#(<= main_~i~0 55)} is VALID [2018-11-14 18:47:07,099 INFO L273 TraceCheckUtils]: 70: Hoare triple {5881#(<= main_~i~0 55)} assume !(~i~0 < 100000); {5645#false} is VALID [2018-11-14 18:47:07,099 INFO L273 TraceCheckUtils]: 71: Hoare triple {5645#false} ~i~0 := 1;~j~0 := 0; {5645#false} is VALID [2018-11-14 18:47:07,099 INFO L273 TraceCheckUtils]: 72: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 18:47:07,099 INFO L273 TraceCheckUtils]: 73: Hoare triple {5645#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {5645#false} is VALID [2018-11-14 18:47:07,100 INFO L256 TraceCheckUtils]: 74: Hoare triple {5645#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5645#false} is VALID [2018-11-14 18:47:07,100 INFO L273 TraceCheckUtils]: 75: Hoare triple {5645#false} ~cond := #in~cond; {5645#false} is VALID [2018-11-14 18:47:07,100 INFO L273 TraceCheckUtils]: 76: Hoare triple {5645#false} assume ~cond == 0; {5645#false} is VALID [2018-11-14 18:47:07,100 INFO L273 TraceCheckUtils]: 77: Hoare triple {5645#false} assume !false; {5645#false} is VALID [2018-11-14 18:47:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-11-14 18:47:07,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:47:07,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 31 [2018-11-14 18:47:07,127 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2018-11-14 18:47:07,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:47:07,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 18:47:07,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:07,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 18:47:07,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 18:47:07,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:47:07,225 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 31 states. [2018-11-14 18:47:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:09,055 INFO L93 Difference]: Finished difference Result 148 states and 164 transitions. [2018-11-14 18:47:09,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 18:47:09,055 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2018-11-14 18:47:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:47:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:47:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 152 transitions. [2018-11-14 18:47:09,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:47:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 152 transitions. [2018-11-14 18:47:09,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 152 transitions. [2018-11-14 18:47:09,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:09,216 INFO L225 Difference]: With dead ends: 148 [2018-11-14 18:47:09,217 INFO L226 Difference]: Without dead ends: 122 [2018-11-14 18:47:09,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:47:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-14 18:47:09,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2018-11-14 18:47:09,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:47:09,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 94 states. [2018-11-14 18:47:09,260 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 94 states. [2018-11-14 18:47:09,260 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 94 states. [2018-11-14 18:47:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:09,263 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2018-11-14 18:47:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-11-14 18:47:09,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:09,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:09,264 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 122 states. [2018-11-14 18:47:09,264 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 122 states. [2018-11-14 18:47:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:09,267 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2018-11-14 18:47:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-11-14 18:47:09,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:09,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:09,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:47:09,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:47:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 18:47:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-11-14 18:47:09,270 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 78 [2018-11-14 18:47:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:47:09,271 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-11-14 18:47:09,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 18:47:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-11-14 18:47:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-14 18:47:09,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:47:09,272 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:47:09,272 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:47:09,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:47:09,272 INFO L82 PathProgramCache]: Analyzing trace with hash 18601137, now seen corresponding path program 13 times [2018-11-14 18:47:09,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:47:09,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:47:09,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:09,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:47:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:10,227 INFO L256 TraceCheckUtils]: 0: Hoare triple {6508#true} call ULTIMATE.init(); {6508#true} is VALID [2018-11-14 18:47:10,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {6508#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6508#true} is VALID [2018-11-14 18:47:10,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {6508#true} assume true; {6508#true} is VALID [2018-11-14 18:47:10,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6508#true} {6508#true} #63#return; {6508#true} is VALID [2018-11-14 18:47:10,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {6508#true} call #t~ret4 := main(); {6508#true} is VALID [2018-11-14 18:47:10,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {6508#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {6510#(= main_~i~0 0)} is VALID [2018-11-14 18:47:10,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {6510#(= main_~i~0 0)} assume true; {6510#(= main_~i~0 0)} is VALID [2018-11-14 18:47:10,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {6510#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6511#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:10,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {6511#(<= main_~i~0 1)} assume true; {6511#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:10,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {6511#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6512#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:10,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {6512#(<= main_~i~0 2)} assume true; {6512#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:10,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {6512#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6513#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:10,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {6513#(<= main_~i~0 3)} assume true; {6513#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:10,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {6513#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6514#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:10,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {6514#(<= main_~i~0 4)} assume true; {6514#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:10,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {6514#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6515#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:10,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {6515#(<= main_~i~0 5)} assume true; {6515#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:10,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {6515#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6516#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:10,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {6516#(<= main_~i~0 6)} assume true; {6516#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:10,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {6516#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6517#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:10,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {6517#(<= main_~i~0 7)} assume true; {6517#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:10,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {6517#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6518#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:10,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {6518#(<= main_~i~0 8)} assume true; {6518#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:10,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {6518#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6519#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:10,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {6519#(<= main_~i~0 9)} assume true; {6519#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:10,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {6519#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6520#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:10,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {6520#(<= main_~i~0 10)} assume true; {6520#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:10,273 INFO L273 TraceCheckUtils]: 27: Hoare triple {6520#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6521#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:10,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {6521#(<= main_~i~0 11)} assume true; {6521#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:10,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {6521#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6522#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:10,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {6522#(<= main_~i~0 12)} assume true; {6522#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:10,276 INFO L273 TraceCheckUtils]: 31: Hoare triple {6522#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6523#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:10,276 INFO L273 TraceCheckUtils]: 32: Hoare triple {6523#(<= main_~i~0 13)} assume true; {6523#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:10,277 INFO L273 TraceCheckUtils]: 33: Hoare triple {6523#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6524#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:10,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {6524#(<= main_~i~0 14)} assume true; {6524#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:10,279 INFO L273 TraceCheckUtils]: 35: Hoare triple {6524#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6525#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:10,279 INFO L273 TraceCheckUtils]: 36: Hoare triple {6525#(<= main_~i~0 15)} assume true; {6525#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:10,280 INFO L273 TraceCheckUtils]: 37: Hoare triple {6525#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6526#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:10,281 INFO L273 TraceCheckUtils]: 38: Hoare triple {6526#(<= main_~i~0 16)} assume true; {6526#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:10,282 INFO L273 TraceCheckUtils]: 39: Hoare triple {6526#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6527#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:10,283 INFO L273 TraceCheckUtils]: 40: Hoare triple {6527#(<= main_~i~0 17)} assume true; {6527#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:10,284 INFO L273 TraceCheckUtils]: 41: Hoare triple {6527#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6528#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:10,284 INFO L273 TraceCheckUtils]: 42: Hoare triple {6528#(<= main_~i~0 18)} assume true; {6528#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:10,285 INFO L273 TraceCheckUtils]: 43: Hoare triple {6528#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6529#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:10,286 INFO L273 TraceCheckUtils]: 44: Hoare triple {6529#(<= main_~i~0 19)} assume true; {6529#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:10,287 INFO L273 TraceCheckUtils]: 45: Hoare triple {6529#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6530#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:10,287 INFO L273 TraceCheckUtils]: 46: Hoare triple {6530#(<= main_~i~0 20)} assume true; {6530#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:10,288 INFO L273 TraceCheckUtils]: 47: Hoare triple {6530#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6531#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:10,289 INFO L273 TraceCheckUtils]: 48: Hoare triple {6531#(<= main_~i~0 21)} assume true; {6531#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:10,290 INFO L273 TraceCheckUtils]: 49: Hoare triple {6531#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6532#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:10,290 INFO L273 TraceCheckUtils]: 50: Hoare triple {6532#(<= main_~i~0 22)} assume true; {6532#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:10,291 INFO L273 TraceCheckUtils]: 51: Hoare triple {6532#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6533#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:10,292 INFO L273 TraceCheckUtils]: 52: Hoare triple {6533#(<= main_~i~0 23)} assume true; {6533#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:10,293 INFO L273 TraceCheckUtils]: 53: Hoare triple {6533#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6534#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:10,293 INFO L273 TraceCheckUtils]: 54: Hoare triple {6534#(<= main_~i~0 24)} assume true; {6534#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:10,294 INFO L273 TraceCheckUtils]: 55: Hoare triple {6534#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6535#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:10,295 INFO L273 TraceCheckUtils]: 56: Hoare triple {6535#(<= main_~i~0 25)} assume true; {6535#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:10,296 INFO L273 TraceCheckUtils]: 57: Hoare triple {6535#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6536#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:10,299 INFO L273 TraceCheckUtils]: 58: Hoare triple {6536#(<= main_~i~0 26)} assume true; {6536#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:10,299 INFO L273 TraceCheckUtils]: 59: Hoare triple {6536#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6537#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:10,300 INFO L273 TraceCheckUtils]: 60: Hoare triple {6537#(<= main_~i~0 27)} assume true; {6537#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:10,300 INFO L273 TraceCheckUtils]: 61: Hoare triple {6537#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6538#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:10,301 INFO L273 TraceCheckUtils]: 62: Hoare triple {6538#(<= main_~i~0 28)} assume true; {6538#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:10,302 INFO L273 TraceCheckUtils]: 63: Hoare triple {6538#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6539#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:10,303 INFO L273 TraceCheckUtils]: 64: Hoare triple {6539#(<= main_~i~0 29)} assume true; {6539#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:10,303 INFO L273 TraceCheckUtils]: 65: Hoare triple {6539#(<= main_~i~0 29)} assume !(~i~0 < 100000); {6509#false} is VALID [2018-11-14 18:47:10,303 INFO L273 TraceCheckUtils]: 66: Hoare triple {6509#false} ~i~0 := 1; {6509#false} is VALID [2018-11-14 18:47:10,304 INFO L273 TraceCheckUtils]: 67: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,304 INFO L273 TraceCheckUtils]: 68: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,304 INFO L273 TraceCheckUtils]: 69: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,304 INFO L273 TraceCheckUtils]: 70: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,304 INFO L273 TraceCheckUtils]: 71: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,305 INFO L273 TraceCheckUtils]: 72: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,305 INFO L273 TraceCheckUtils]: 73: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,305 INFO L273 TraceCheckUtils]: 74: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,305 INFO L273 TraceCheckUtils]: 75: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,305 INFO L273 TraceCheckUtils]: 76: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,305 INFO L273 TraceCheckUtils]: 77: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,306 INFO L273 TraceCheckUtils]: 78: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,306 INFO L273 TraceCheckUtils]: 79: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,306 INFO L273 TraceCheckUtils]: 80: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,306 INFO L273 TraceCheckUtils]: 81: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,306 INFO L273 TraceCheckUtils]: 82: Hoare triple {6509#false} assume !(~i~0 < 100000); {6509#false} is VALID [2018-11-14 18:47:10,306 INFO L273 TraceCheckUtils]: 83: Hoare triple {6509#false} ~i~0 := 1;~j~0 := 0; {6509#false} is VALID [2018-11-14 18:47:10,306 INFO L273 TraceCheckUtils]: 84: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,306 INFO L273 TraceCheckUtils]: 85: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {6509#false} is VALID [2018-11-14 18:47:10,307 INFO L256 TraceCheckUtils]: 86: Hoare triple {6509#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6509#false} is VALID [2018-11-14 18:47:10,307 INFO L273 TraceCheckUtils]: 87: Hoare triple {6509#false} ~cond := #in~cond; {6509#false} is VALID [2018-11-14 18:47:10,307 INFO L273 TraceCheckUtils]: 88: Hoare triple {6509#false} assume ~cond == 0; {6509#false} is VALID [2018-11-14 18:47:10,307 INFO L273 TraceCheckUtils]: 89: Hoare triple {6509#false} assume !false; {6509#false} is VALID [2018-11-14 18:47:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 18:47:10,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:47:10,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:47:10,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:47:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:10,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:47:10,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {6508#true} call ULTIMATE.init(); {6508#true} is VALID [2018-11-14 18:47:10,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {6508#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6508#true} is VALID [2018-11-14 18:47:10,687 INFO L273 TraceCheckUtils]: 2: Hoare triple {6508#true} assume true; {6508#true} is VALID [2018-11-14 18:47:10,687 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6508#true} {6508#true} #63#return; {6508#true} is VALID [2018-11-14 18:47:10,687 INFO L256 TraceCheckUtils]: 4: Hoare triple {6508#true} call #t~ret4 := main(); {6508#true} is VALID [2018-11-14 18:47:10,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {6508#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {6558#(<= main_~i~0 0)} is VALID [2018-11-14 18:47:10,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {6558#(<= main_~i~0 0)} assume true; {6558#(<= main_~i~0 0)} is VALID [2018-11-14 18:47:10,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {6558#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6511#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:10,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {6511#(<= main_~i~0 1)} assume true; {6511#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:10,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {6511#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6512#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:10,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {6512#(<= main_~i~0 2)} assume true; {6512#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:10,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {6512#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6513#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:10,691 INFO L273 TraceCheckUtils]: 12: Hoare triple {6513#(<= main_~i~0 3)} assume true; {6513#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:10,692 INFO L273 TraceCheckUtils]: 13: Hoare triple {6513#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6514#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:10,693 INFO L273 TraceCheckUtils]: 14: Hoare triple {6514#(<= main_~i~0 4)} assume true; {6514#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:10,694 INFO L273 TraceCheckUtils]: 15: Hoare triple {6514#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6515#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:10,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {6515#(<= main_~i~0 5)} assume true; {6515#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:10,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {6515#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6516#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:10,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {6516#(<= main_~i~0 6)} assume true; {6516#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:10,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {6516#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6517#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:10,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {6517#(<= main_~i~0 7)} assume true; {6517#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:10,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {6517#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6518#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:10,699 INFO L273 TraceCheckUtils]: 22: Hoare triple {6518#(<= main_~i~0 8)} assume true; {6518#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:10,700 INFO L273 TraceCheckUtils]: 23: Hoare triple {6518#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6519#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:10,701 INFO L273 TraceCheckUtils]: 24: Hoare triple {6519#(<= main_~i~0 9)} assume true; {6519#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:10,702 INFO L273 TraceCheckUtils]: 25: Hoare triple {6519#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6520#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:10,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {6520#(<= main_~i~0 10)} assume true; {6520#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:10,703 INFO L273 TraceCheckUtils]: 27: Hoare triple {6520#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6521#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:10,704 INFO L273 TraceCheckUtils]: 28: Hoare triple {6521#(<= main_~i~0 11)} assume true; {6521#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:10,705 INFO L273 TraceCheckUtils]: 29: Hoare triple {6521#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6522#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:10,705 INFO L273 TraceCheckUtils]: 30: Hoare triple {6522#(<= main_~i~0 12)} assume true; {6522#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:10,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {6522#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6523#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:10,707 INFO L273 TraceCheckUtils]: 32: Hoare triple {6523#(<= main_~i~0 13)} assume true; {6523#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:10,708 INFO L273 TraceCheckUtils]: 33: Hoare triple {6523#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6524#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:10,708 INFO L273 TraceCheckUtils]: 34: Hoare triple {6524#(<= main_~i~0 14)} assume true; {6524#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:10,709 INFO L273 TraceCheckUtils]: 35: Hoare triple {6524#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6525#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:10,710 INFO L273 TraceCheckUtils]: 36: Hoare triple {6525#(<= main_~i~0 15)} assume true; {6525#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:10,711 INFO L273 TraceCheckUtils]: 37: Hoare triple {6525#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6526#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:10,712 INFO L273 TraceCheckUtils]: 38: Hoare triple {6526#(<= main_~i~0 16)} assume true; {6526#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:10,712 INFO L273 TraceCheckUtils]: 39: Hoare triple {6526#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6527#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:10,713 INFO L273 TraceCheckUtils]: 40: Hoare triple {6527#(<= main_~i~0 17)} assume true; {6527#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:10,714 INFO L273 TraceCheckUtils]: 41: Hoare triple {6527#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6528#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:10,715 INFO L273 TraceCheckUtils]: 42: Hoare triple {6528#(<= main_~i~0 18)} assume true; {6528#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:10,716 INFO L273 TraceCheckUtils]: 43: Hoare triple {6528#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6529#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:10,716 INFO L273 TraceCheckUtils]: 44: Hoare triple {6529#(<= main_~i~0 19)} assume true; {6529#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:10,717 INFO L273 TraceCheckUtils]: 45: Hoare triple {6529#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6530#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:10,718 INFO L273 TraceCheckUtils]: 46: Hoare triple {6530#(<= main_~i~0 20)} assume true; {6530#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:10,719 INFO L273 TraceCheckUtils]: 47: Hoare triple {6530#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6531#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:10,719 INFO L273 TraceCheckUtils]: 48: Hoare triple {6531#(<= main_~i~0 21)} assume true; {6531#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:10,720 INFO L273 TraceCheckUtils]: 49: Hoare triple {6531#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6532#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:10,721 INFO L273 TraceCheckUtils]: 50: Hoare triple {6532#(<= main_~i~0 22)} assume true; {6532#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:10,722 INFO L273 TraceCheckUtils]: 51: Hoare triple {6532#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6533#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:10,722 INFO L273 TraceCheckUtils]: 52: Hoare triple {6533#(<= main_~i~0 23)} assume true; {6533#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:10,723 INFO L273 TraceCheckUtils]: 53: Hoare triple {6533#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6534#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:10,724 INFO L273 TraceCheckUtils]: 54: Hoare triple {6534#(<= main_~i~0 24)} assume true; {6534#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:10,725 INFO L273 TraceCheckUtils]: 55: Hoare triple {6534#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6535#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:10,725 INFO L273 TraceCheckUtils]: 56: Hoare triple {6535#(<= main_~i~0 25)} assume true; {6535#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:10,726 INFO L273 TraceCheckUtils]: 57: Hoare triple {6535#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6536#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:10,727 INFO L273 TraceCheckUtils]: 58: Hoare triple {6536#(<= main_~i~0 26)} assume true; {6536#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:10,728 INFO L273 TraceCheckUtils]: 59: Hoare triple {6536#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6537#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:10,728 INFO L273 TraceCheckUtils]: 60: Hoare triple {6537#(<= main_~i~0 27)} assume true; {6537#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:10,729 INFO L273 TraceCheckUtils]: 61: Hoare triple {6537#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6538#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:10,730 INFO L273 TraceCheckUtils]: 62: Hoare triple {6538#(<= main_~i~0 28)} assume true; {6538#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:10,731 INFO L273 TraceCheckUtils]: 63: Hoare triple {6538#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6539#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:10,732 INFO L273 TraceCheckUtils]: 64: Hoare triple {6539#(<= main_~i~0 29)} assume true; {6539#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:10,732 INFO L273 TraceCheckUtils]: 65: Hoare triple {6539#(<= main_~i~0 29)} assume !(~i~0 < 100000); {6509#false} is VALID [2018-11-14 18:47:10,732 INFO L273 TraceCheckUtils]: 66: Hoare triple {6509#false} ~i~0 := 1; {6509#false} is VALID [2018-11-14 18:47:10,733 INFO L273 TraceCheckUtils]: 67: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,733 INFO L273 TraceCheckUtils]: 68: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,733 INFO L273 TraceCheckUtils]: 69: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,733 INFO L273 TraceCheckUtils]: 70: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,733 INFO L273 TraceCheckUtils]: 71: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,734 INFO L273 TraceCheckUtils]: 72: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,734 INFO L273 TraceCheckUtils]: 73: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,734 INFO L273 TraceCheckUtils]: 74: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,734 INFO L273 TraceCheckUtils]: 75: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,735 INFO L273 TraceCheckUtils]: 76: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,735 INFO L273 TraceCheckUtils]: 77: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,735 INFO L273 TraceCheckUtils]: 78: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,735 INFO L273 TraceCheckUtils]: 79: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,735 INFO L273 TraceCheckUtils]: 80: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {6509#false} is VALID [2018-11-14 18:47:10,735 INFO L273 TraceCheckUtils]: 81: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,736 INFO L273 TraceCheckUtils]: 82: Hoare triple {6509#false} assume !(~i~0 < 100000); {6509#false} is VALID [2018-11-14 18:47:10,736 INFO L273 TraceCheckUtils]: 83: Hoare triple {6509#false} ~i~0 := 1;~j~0 := 0; {6509#false} is VALID [2018-11-14 18:47:10,736 INFO L273 TraceCheckUtils]: 84: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 18:47:10,736 INFO L273 TraceCheckUtils]: 85: Hoare triple {6509#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {6509#false} is VALID [2018-11-14 18:47:10,736 INFO L256 TraceCheckUtils]: 86: Hoare triple {6509#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6509#false} is VALID [2018-11-14 18:47:10,737 INFO L273 TraceCheckUtils]: 87: Hoare triple {6509#false} ~cond := #in~cond; {6509#false} is VALID [2018-11-14 18:47:10,737 INFO L273 TraceCheckUtils]: 88: Hoare triple {6509#false} assume ~cond == 0; {6509#false} is VALID [2018-11-14 18:47:10,737 INFO L273 TraceCheckUtils]: 89: Hoare triple {6509#false} assume !false; {6509#false} is VALID [2018-11-14 18:47:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 18:47:10,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:47:10,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-14 18:47:10,768 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 90 [2018-11-14 18:47:10,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:47:10,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 18:47:10,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:10,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 18:47:10,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 18:47:10,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 18:47:10,852 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 33 states. [2018-11-14 18:47:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:11,510 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-14 18:47:11,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 18:47:11,512 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 90 [2018-11-14 18:47:11,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:47:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:47:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 128 transitions. [2018-11-14 18:47:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:47:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 128 transitions. [2018-11-14 18:47:11,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 128 transitions. [2018-11-14 18:47:11,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:11,919 INFO L225 Difference]: With dead ends: 140 [2018-11-14 18:47:11,919 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 18:47:11,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 18:47:11,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 18:47:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-11-14 18:47:11,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:47:11,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 96 states. [2018-11-14 18:47:11,966 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 96 states. [2018-11-14 18:47:11,967 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 96 states. [2018-11-14 18:47:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:11,970 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-11-14 18:47:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-14 18:47:11,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:11,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:11,971 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 112 states. [2018-11-14 18:47:11,971 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 112 states. [2018-11-14 18:47:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:11,973 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-11-14 18:47:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-14 18:47:11,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:11,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:11,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:47:11,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:47:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-14 18:47:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-11-14 18:47:11,977 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 90 [2018-11-14 18:47:11,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:47:11,977 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-11-14 18:47:11,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 18:47:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-11-14 18:47:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-14 18:47:11,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:47:11,978 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:47:11,979 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:47:11,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:47:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1407210839, now seen corresponding path program 14 times [2018-11-14 18:47:11,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:47:11,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:47:11,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:11,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:47:11,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:13,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {7381#true} call ULTIMATE.init(); {7381#true} is VALID [2018-11-14 18:47:13,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {7381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7381#true} is VALID [2018-11-14 18:47:13,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {7381#true} assume true; {7381#true} is VALID [2018-11-14 18:47:13,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7381#true} {7381#true} #63#return; {7381#true} is VALID [2018-11-14 18:47:13,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {7381#true} call #t~ret4 := main(); {7381#true} is VALID [2018-11-14 18:47:13,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {7381#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7383#(= main_~i~0 0)} is VALID [2018-11-14 18:47:13,553 INFO L273 TraceCheckUtils]: 6: Hoare triple {7383#(= main_~i~0 0)} assume true; {7383#(= main_~i~0 0)} is VALID [2018-11-14 18:47:13,554 INFO L273 TraceCheckUtils]: 7: Hoare triple {7383#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7384#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:13,554 INFO L273 TraceCheckUtils]: 8: Hoare triple {7384#(<= main_~i~0 1)} assume true; {7384#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:13,555 INFO L273 TraceCheckUtils]: 9: Hoare triple {7384#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7385#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:13,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {7385#(<= main_~i~0 2)} assume true; {7385#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:13,556 INFO L273 TraceCheckUtils]: 11: Hoare triple {7385#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7386#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:13,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {7386#(<= main_~i~0 3)} assume true; {7386#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:13,557 INFO L273 TraceCheckUtils]: 13: Hoare triple {7386#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7387#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:13,558 INFO L273 TraceCheckUtils]: 14: Hoare triple {7387#(<= main_~i~0 4)} assume true; {7387#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:13,559 INFO L273 TraceCheckUtils]: 15: Hoare triple {7387#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7388#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:13,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {7388#(<= main_~i~0 5)} assume true; {7388#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:13,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {7388#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7389#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:13,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {7389#(<= main_~i~0 6)} assume true; {7389#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:13,562 INFO L273 TraceCheckUtils]: 19: Hoare triple {7389#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7390#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:13,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {7390#(<= main_~i~0 7)} assume true; {7390#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:13,563 INFO L273 TraceCheckUtils]: 21: Hoare triple {7390#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7391#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:13,564 INFO L273 TraceCheckUtils]: 22: Hoare triple {7391#(<= main_~i~0 8)} assume true; {7391#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:13,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {7391#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7392#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:13,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {7392#(<= main_~i~0 9)} assume true; {7392#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:13,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {7392#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7393#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:13,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {7393#(<= main_~i~0 10)} assume true; {7393#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:13,586 INFO L273 TraceCheckUtils]: 27: Hoare triple {7393#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7394#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:13,599 INFO L273 TraceCheckUtils]: 28: Hoare triple {7394#(<= main_~i~0 11)} assume true; {7394#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:13,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {7394#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7395#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:13,622 INFO L273 TraceCheckUtils]: 30: Hoare triple {7395#(<= main_~i~0 12)} assume true; {7395#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:13,623 INFO L273 TraceCheckUtils]: 31: Hoare triple {7395#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7396#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:13,623 INFO L273 TraceCheckUtils]: 32: Hoare triple {7396#(<= main_~i~0 13)} assume true; {7396#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:13,624 INFO L273 TraceCheckUtils]: 33: Hoare triple {7396#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7397#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:13,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {7397#(<= main_~i~0 14)} assume true; {7397#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:13,625 INFO L273 TraceCheckUtils]: 35: Hoare triple {7397#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7398#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:13,625 INFO L273 TraceCheckUtils]: 36: Hoare triple {7398#(<= main_~i~0 15)} assume true; {7398#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:13,626 INFO L273 TraceCheckUtils]: 37: Hoare triple {7398#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7399#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:13,627 INFO L273 TraceCheckUtils]: 38: Hoare triple {7399#(<= main_~i~0 16)} assume true; {7399#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:13,628 INFO L273 TraceCheckUtils]: 39: Hoare triple {7399#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7400#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:13,628 INFO L273 TraceCheckUtils]: 40: Hoare triple {7400#(<= main_~i~0 17)} assume true; {7400#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:13,629 INFO L273 TraceCheckUtils]: 41: Hoare triple {7400#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7401#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:13,630 INFO L273 TraceCheckUtils]: 42: Hoare triple {7401#(<= main_~i~0 18)} assume true; {7401#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:13,631 INFO L273 TraceCheckUtils]: 43: Hoare triple {7401#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7402#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:13,631 INFO L273 TraceCheckUtils]: 44: Hoare triple {7402#(<= main_~i~0 19)} assume true; {7402#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:13,632 INFO L273 TraceCheckUtils]: 45: Hoare triple {7402#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7403#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:13,633 INFO L273 TraceCheckUtils]: 46: Hoare triple {7403#(<= main_~i~0 20)} assume true; {7403#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:13,634 INFO L273 TraceCheckUtils]: 47: Hoare triple {7403#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7404#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:13,634 INFO L273 TraceCheckUtils]: 48: Hoare triple {7404#(<= main_~i~0 21)} assume true; {7404#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:13,635 INFO L273 TraceCheckUtils]: 49: Hoare triple {7404#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7405#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:13,636 INFO L273 TraceCheckUtils]: 50: Hoare triple {7405#(<= main_~i~0 22)} assume true; {7405#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:13,637 INFO L273 TraceCheckUtils]: 51: Hoare triple {7405#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7406#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:13,638 INFO L273 TraceCheckUtils]: 52: Hoare triple {7406#(<= main_~i~0 23)} assume true; {7406#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:13,639 INFO L273 TraceCheckUtils]: 53: Hoare triple {7406#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7407#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:13,639 INFO L273 TraceCheckUtils]: 54: Hoare triple {7407#(<= main_~i~0 24)} assume true; {7407#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:13,640 INFO L273 TraceCheckUtils]: 55: Hoare triple {7407#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7408#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:13,641 INFO L273 TraceCheckUtils]: 56: Hoare triple {7408#(<= main_~i~0 25)} assume true; {7408#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:13,642 INFO L273 TraceCheckUtils]: 57: Hoare triple {7408#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7409#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:13,642 INFO L273 TraceCheckUtils]: 58: Hoare triple {7409#(<= main_~i~0 26)} assume true; {7409#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:13,643 INFO L273 TraceCheckUtils]: 59: Hoare triple {7409#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7410#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:13,644 INFO L273 TraceCheckUtils]: 60: Hoare triple {7410#(<= main_~i~0 27)} assume true; {7410#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:13,645 INFO L273 TraceCheckUtils]: 61: Hoare triple {7410#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7411#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:13,646 INFO L273 TraceCheckUtils]: 62: Hoare triple {7411#(<= main_~i~0 28)} assume true; {7411#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:13,647 INFO L273 TraceCheckUtils]: 63: Hoare triple {7411#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7412#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:13,647 INFO L273 TraceCheckUtils]: 64: Hoare triple {7412#(<= main_~i~0 29)} assume true; {7412#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:13,648 INFO L273 TraceCheckUtils]: 65: Hoare triple {7412#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7413#(<= main_~i~0 30)} is VALID [2018-11-14 18:47:13,649 INFO L273 TraceCheckUtils]: 66: Hoare triple {7413#(<= main_~i~0 30)} assume true; {7413#(<= main_~i~0 30)} is VALID [2018-11-14 18:47:13,649 INFO L273 TraceCheckUtils]: 67: Hoare triple {7413#(<= main_~i~0 30)} assume !(~i~0 < 100000); {7382#false} is VALID [2018-11-14 18:47:13,649 INFO L273 TraceCheckUtils]: 68: Hoare triple {7382#false} ~i~0 := 1; {7382#false} is VALID [2018-11-14 18:47:13,650 INFO L273 TraceCheckUtils]: 69: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:13,650 INFO L273 TraceCheckUtils]: 70: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:13,650 INFO L273 TraceCheckUtils]: 71: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:13,650 INFO L273 TraceCheckUtils]: 72: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:13,650 INFO L273 TraceCheckUtils]: 73: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:13,651 INFO L273 TraceCheckUtils]: 74: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:13,651 INFO L273 TraceCheckUtils]: 75: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:13,651 INFO L273 TraceCheckUtils]: 76: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:13,651 INFO L273 TraceCheckUtils]: 77: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:13,651 INFO L273 TraceCheckUtils]: 78: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:13,652 INFO L273 TraceCheckUtils]: 79: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:13,652 INFO L273 TraceCheckUtils]: 80: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:13,652 INFO L273 TraceCheckUtils]: 81: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:13,652 INFO L273 TraceCheckUtils]: 82: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:13,652 INFO L273 TraceCheckUtils]: 83: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:13,652 INFO L273 TraceCheckUtils]: 84: Hoare triple {7382#false} assume !(~i~0 < 100000); {7382#false} is VALID [2018-11-14 18:47:13,652 INFO L273 TraceCheckUtils]: 85: Hoare triple {7382#false} ~i~0 := 1;~j~0 := 0; {7382#false} is VALID [2018-11-14 18:47:13,652 INFO L273 TraceCheckUtils]: 86: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:13,653 INFO L273 TraceCheckUtils]: 87: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {7382#false} is VALID [2018-11-14 18:47:13,653 INFO L256 TraceCheckUtils]: 88: Hoare triple {7382#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7382#false} is VALID [2018-11-14 18:47:13,653 INFO L273 TraceCheckUtils]: 89: Hoare triple {7382#false} ~cond := #in~cond; {7382#false} is VALID [2018-11-14 18:47:13,653 INFO L273 TraceCheckUtils]: 90: Hoare triple {7382#false} assume ~cond == 0; {7382#false} is VALID [2018-11-14 18:47:13,653 INFO L273 TraceCheckUtils]: 91: Hoare triple {7382#false} assume !false; {7382#false} is VALID [2018-11-14 18:47:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 18:47:13,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:47:13,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:47:13,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:47:13,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:47:13,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:47:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:13,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:47:14,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {7381#true} call ULTIMATE.init(); {7381#true} is VALID [2018-11-14 18:47:14,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {7381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7381#true} is VALID [2018-11-14 18:47:14,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {7381#true} assume true; {7381#true} is VALID [2018-11-14 18:47:14,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7381#true} {7381#true} #63#return; {7381#true} is VALID [2018-11-14 18:47:14,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {7381#true} call #t~ret4 := main(); {7381#true} is VALID [2018-11-14 18:47:14,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {7381#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7432#(<= main_~i~0 0)} is VALID [2018-11-14 18:47:14,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {7432#(<= main_~i~0 0)} assume true; {7432#(<= main_~i~0 0)} is VALID [2018-11-14 18:47:14,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {7432#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7384#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:14,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {7384#(<= main_~i~0 1)} assume true; {7384#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:14,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {7384#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7385#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:14,293 INFO L273 TraceCheckUtils]: 10: Hoare triple {7385#(<= main_~i~0 2)} assume true; {7385#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:14,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {7385#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7386#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:14,295 INFO L273 TraceCheckUtils]: 12: Hoare triple {7386#(<= main_~i~0 3)} assume true; {7386#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:14,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {7386#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7387#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:14,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {7387#(<= main_~i~0 4)} assume true; {7387#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:14,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {7387#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7388#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:14,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {7388#(<= main_~i~0 5)} assume true; {7388#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:14,299 INFO L273 TraceCheckUtils]: 17: Hoare triple {7388#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7389#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:14,299 INFO L273 TraceCheckUtils]: 18: Hoare triple {7389#(<= main_~i~0 6)} assume true; {7389#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:14,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {7389#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7390#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:14,301 INFO L273 TraceCheckUtils]: 20: Hoare triple {7390#(<= main_~i~0 7)} assume true; {7390#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:14,302 INFO L273 TraceCheckUtils]: 21: Hoare triple {7390#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7391#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:14,302 INFO L273 TraceCheckUtils]: 22: Hoare triple {7391#(<= main_~i~0 8)} assume true; {7391#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:14,303 INFO L273 TraceCheckUtils]: 23: Hoare triple {7391#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7392#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:14,304 INFO L273 TraceCheckUtils]: 24: Hoare triple {7392#(<= main_~i~0 9)} assume true; {7392#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:14,305 INFO L273 TraceCheckUtils]: 25: Hoare triple {7392#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7393#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:14,305 INFO L273 TraceCheckUtils]: 26: Hoare triple {7393#(<= main_~i~0 10)} assume true; {7393#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:14,306 INFO L273 TraceCheckUtils]: 27: Hoare triple {7393#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7394#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:14,307 INFO L273 TraceCheckUtils]: 28: Hoare triple {7394#(<= main_~i~0 11)} assume true; {7394#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:14,308 INFO L273 TraceCheckUtils]: 29: Hoare triple {7394#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7395#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:14,308 INFO L273 TraceCheckUtils]: 30: Hoare triple {7395#(<= main_~i~0 12)} assume true; {7395#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:14,309 INFO L273 TraceCheckUtils]: 31: Hoare triple {7395#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7396#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:14,310 INFO L273 TraceCheckUtils]: 32: Hoare triple {7396#(<= main_~i~0 13)} assume true; {7396#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:14,311 INFO L273 TraceCheckUtils]: 33: Hoare triple {7396#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7397#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:14,311 INFO L273 TraceCheckUtils]: 34: Hoare triple {7397#(<= main_~i~0 14)} assume true; {7397#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:14,312 INFO L273 TraceCheckUtils]: 35: Hoare triple {7397#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7398#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:14,313 INFO L273 TraceCheckUtils]: 36: Hoare triple {7398#(<= main_~i~0 15)} assume true; {7398#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:14,314 INFO L273 TraceCheckUtils]: 37: Hoare triple {7398#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7399#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:14,314 INFO L273 TraceCheckUtils]: 38: Hoare triple {7399#(<= main_~i~0 16)} assume true; {7399#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:14,315 INFO L273 TraceCheckUtils]: 39: Hoare triple {7399#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7400#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:14,316 INFO L273 TraceCheckUtils]: 40: Hoare triple {7400#(<= main_~i~0 17)} assume true; {7400#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:14,317 INFO L273 TraceCheckUtils]: 41: Hoare triple {7400#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7401#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:14,318 INFO L273 TraceCheckUtils]: 42: Hoare triple {7401#(<= main_~i~0 18)} assume true; {7401#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:14,318 INFO L273 TraceCheckUtils]: 43: Hoare triple {7401#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7402#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:14,319 INFO L273 TraceCheckUtils]: 44: Hoare triple {7402#(<= main_~i~0 19)} assume true; {7402#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:14,320 INFO L273 TraceCheckUtils]: 45: Hoare triple {7402#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7403#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:14,321 INFO L273 TraceCheckUtils]: 46: Hoare triple {7403#(<= main_~i~0 20)} assume true; {7403#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:14,322 INFO L273 TraceCheckUtils]: 47: Hoare triple {7403#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7404#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:14,322 INFO L273 TraceCheckUtils]: 48: Hoare triple {7404#(<= main_~i~0 21)} assume true; {7404#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:14,323 INFO L273 TraceCheckUtils]: 49: Hoare triple {7404#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7405#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:14,324 INFO L273 TraceCheckUtils]: 50: Hoare triple {7405#(<= main_~i~0 22)} assume true; {7405#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:14,325 INFO L273 TraceCheckUtils]: 51: Hoare triple {7405#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7406#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:14,325 INFO L273 TraceCheckUtils]: 52: Hoare triple {7406#(<= main_~i~0 23)} assume true; {7406#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:14,326 INFO L273 TraceCheckUtils]: 53: Hoare triple {7406#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7407#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:14,327 INFO L273 TraceCheckUtils]: 54: Hoare triple {7407#(<= main_~i~0 24)} assume true; {7407#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:14,328 INFO L273 TraceCheckUtils]: 55: Hoare triple {7407#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7408#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:14,328 INFO L273 TraceCheckUtils]: 56: Hoare triple {7408#(<= main_~i~0 25)} assume true; {7408#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:14,329 INFO L273 TraceCheckUtils]: 57: Hoare triple {7408#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7409#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:14,330 INFO L273 TraceCheckUtils]: 58: Hoare triple {7409#(<= main_~i~0 26)} assume true; {7409#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:14,331 INFO L273 TraceCheckUtils]: 59: Hoare triple {7409#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7410#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:14,331 INFO L273 TraceCheckUtils]: 60: Hoare triple {7410#(<= main_~i~0 27)} assume true; {7410#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:14,332 INFO L273 TraceCheckUtils]: 61: Hoare triple {7410#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7411#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:14,333 INFO L273 TraceCheckUtils]: 62: Hoare triple {7411#(<= main_~i~0 28)} assume true; {7411#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:14,334 INFO L273 TraceCheckUtils]: 63: Hoare triple {7411#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7412#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:14,334 INFO L273 TraceCheckUtils]: 64: Hoare triple {7412#(<= main_~i~0 29)} assume true; {7412#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:14,335 INFO L273 TraceCheckUtils]: 65: Hoare triple {7412#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7413#(<= main_~i~0 30)} is VALID [2018-11-14 18:47:14,336 INFO L273 TraceCheckUtils]: 66: Hoare triple {7413#(<= main_~i~0 30)} assume true; {7413#(<= main_~i~0 30)} is VALID [2018-11-14 18:47:14,337 INFO L273 TraceCheckUtils]: 67: Hoare triple {7413#(<= main_~i~0 30)} assume !(~i~0 < 100000); {7382#false} is VALID [2018-11-14 18:47:14,337 INFO L273 TraceCheckUtils]: 68: Hoare triple {7382#false} ~i~0 := 1; {7382#false} is VALID [2018-11-14 18:47:14,337 INFO L273 TraceCheckUtils]: 69: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:14,337 INFO L273 TraceCheckUtils]: 70: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:14,337 INFO L273 TraceCheckUtils]: 71: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:14,338 INFO L273 TraceCheckUtils]: 72: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:14,338 INFO L273 TraceCheckUtils]: 73: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:14,338 INFO L273 TraceCheckUtils]: 74: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:14,338 INFO L273 TraceCheckUtils]: 75: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:14,338 INFO L273 TraceCheckUtils]: 76: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:14,339 INFO L273 TraceCheckUtils]: 77: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:14,339 INFO L273 TraceCheckUtils]: 78: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:14,339 INFO L273 TraceCheckUtils]: 79: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:14,339 INFO L273 TraceCheckUtils]: 80: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:14,339 INFO L273 TraceCheckUtils]: 81: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:14,339 INFO L273 TraceCheckUtils]: 82: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {7382#false} is VALID [2018-11-14 18:47:14,339 INFO L273 TraceCheckUtils]: 83: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:14,339 INFO L273 TraceCheckUtils]: 84: Hoare triple {7382#false} assume !(~i~0 < 100000); {7382#false} is VALID [2018-11-14 18:47:14,340 INFO L273 TraceCheckUtils]: 85: Hoare triple {7382#false} ~i~0 := 1;~j~0 := 0; {7382#false} is VALID [2018-11-14 18:47:14,340 INFO L273 TraceCheckUtils]: 86: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 18:47:14,340 INFO L273 TraceCheckUtils]: 87: Hoare triple {7382#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {7382#false} is VALID [2018-11-14 18:47:14,340 INFO L256 TraceCheckUtils]: 88: Hoare triple {7382#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7382#false} is VALID [2018-11-14 18:47:14,340 INFO L273 TraceCheckUtils]: 89: Hoare triple {7382#false} ~cond := #in~cond; {7382#false} is VALID [2018-11-14 18:47:14,340 INFO L273 TraceCheckUtils]: 90: Hoare triple {7382#false} assume ~cond == 0; {7382#false} is VALID [2018-11-14 18:47:14,340 INFO L273 TraceCheckUtils]: 91: Hoare triple {7382#false} assume !false; {7382#false} is VALID [2018-11-14 18:47:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 18:47:14,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:47:14,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-14 18:47:14,367 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 92 [2018-11-14 18:47:14,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:47:14,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 18:47:14,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:14,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 18:47:14,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 18:47:14,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:47:14,451 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 34 states. [2018-11-14 18:47:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:15,576 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2018-11-14 18:47:15,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 18:47:15,576 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 92 [2018-11-14 18:47:15,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:47:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:47:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 130 transitions. [2018-11-14 18:47:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:47:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 130 transitions. [2018-11-14 18:47:15,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 130 transitions. [2018-11-14 18:47:15,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:15,710 INFO L225 Difference]: With dead ends: 142 [2018-11-14 18:47:15,710 INFO L226 Difference]: Without dead ends: 114 [2018-11-14 18:47:15,711 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:47:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-14 18:47:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2018-11-14 18:47:15,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:47:15,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 98 states. [2018-11-14 18:47:15,810 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 98 states. [2018-11-14 18:47:15,810 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 98 states. [2018-11-14 18:47:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:15,813 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-11-14 18:47:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-11-14 18:47:15,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:15,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:15,814 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 114 states. [2018-11-14 18:47:15,814 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 114 states. [2018-11-14 18:47:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:15,816 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-11-14 18:47:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-11-14 18:47:15,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:15,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:15,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:47:15,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:47:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 18:47:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-11-14 18:47:15,819 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 92 [2018-11-14 18:47:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:47:15,820 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-11-14 18:47:15,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 18:47:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-11-14 18:47:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 18:47:15,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:47:15,821 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:47:15,821 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:47:15,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:47:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash 126305405, now seen corresponding path program 15 times [2018-11-14 18:47:15,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:47:15,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:47:15,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:15,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:47:15,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:17,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {8271#true} call ULTIMATE.init(); {8271#true} is VALID [2018-11-14 18:47:17,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {8271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8271#true} is VALID [2018-11-14 18:47:17,496 INFO L273 TraceCheckUtils]: 2: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:17,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8271#true} {8271#true} #63#return; {8271#true} is VALID [2018-11-14 18:47:17,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {8271#true} call #t~ret4 := main(); {8271#true} is VALID [2018-11-14 18:47:17,497 INFO L273 TraceCheckUtils]: 5: Hoare triple {8271#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {8273#(= main_~i~0 0)} is VALID [2018-11-14 18:47:17,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {8273#(= main_~i~0 0)} assume true; {8273#(= main_~i~0 0)} is VALID [2018-11-14 18:47:17,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {8273#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8274#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:17,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {8274#(<= main_~i~0 1)} assume true; {8274#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:17,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {8274#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8275#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:17,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {8275#(<= main_~i~0 2)} assume true; {8275#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:17,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {8275#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8276#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:17,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {8276#(<= main_~i~0 3)} assume true; {8276#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:17,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {8276#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8277#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:17,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {8277#(<= main_~i~0 4)} assume true; {8277#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:17,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {8277#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8278#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:17,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {8278#(<= main_~i~0 5)} assume true; {8278#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:17,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {8278#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8279#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:17,507 INFO L273 TraceCheckUtils]: 18: Hoare triple {8279#(<= main_~i~0 6)} assume true; {8279#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:17,508 INFO L273 TraceCheckUtils]: 19: Hoare triple {8279#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8280#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:17,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {8280#(<= main_~i~0 7)} assume true; {8280#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:17,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {8280#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8281#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:17,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {8281#(<= main_~i~0 8)} assume true; {8281#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:17,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {8281#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8282#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:17,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {8282#(<= main_~i~0 9)} assume true; {8282#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:17,513 INFO L273 TraceCheckUtils]: 25: Hoare triple {8282#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8283#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:17,514 INFO L273 TraceCheckUtils]: 26: Hoare triple {8283#(<= main_~i~0 10)} assume true; {8283#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:17,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {8283#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8284#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:17,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {8284#(<= main_~i~0 11)} assume true; {8284#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:17,516 INFO L273 TraceCheckUtils]: 29: Hoare triple {8284#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8285#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:17,517 INFO L273 TraceCheckUtils]: 30: Hoare triple {8285#(<= main_~i~0 12)} assume true; {8285#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:17,518 INFO L273 TraceCheckUtils]: 31: Hoare triple {8285#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8286#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:17,518 INFO L273 TraceCheckUtils]: 32: Hoare triple {8286#(<= main_~i~0 13)} assume true; {8286#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:17,519 INFO L273 TraceCheckUtils]: 33: Hoare triple {8286#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8287#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:17,520 INFO L273 TraceCheckUtils]: 34: Hoare triple {8287#(<= main_~i~0 14)} assume true; {8287#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:17,521 INFO L273 TraceCheckUtils]: 35: Hoare triple {8287#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8288#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:17,521 INFO L273 TraceCheckUtils]: 36: Hoare triple {8288#(<= main_~i~0 15)} assume true; {8288#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:17,522 INFO L273 TraceCheckUtils]: 37: Hoare triple {8288#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8289#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:17,523 INFO L273 TraceCheckUtils]: 38: Hoare triple {8289#(<= main_~i~0 16)} assume true; {8289#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:17,524 INFO L273 TraceCheckUtils]: 39: Hoare triple {8289#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8290#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:17,524 INFO L273 TraceCheckUtils]: 40: Hoare triple {8290#(<= main_~i~0 17)} assume true; {8290#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:17,525 INFO L273 TraceCheckUtils]: 41: Hoare triple {8290#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8291#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:17,526 INFO L273 TraceCheckUtils]: 42: Hoare triple {8291#(<= main_~i~0 18)} assume true; {8291#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:17,527 INFO L273 TraceCheckUtils]: 43: Hoare triple {8291#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8292#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:17,527 INFO L273 TraceCheckUtils]: 44: Hoare triple {8292#(<= main_~i~0 19)} assume true; {8292#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:17,528 INFO L273 TraceCheckUtils]: 45: Hoare triple {8292#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8293#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:17,529 INFO L273 TraceCheckUtils]: 46: Hoare triple {8293#(<= main_~i~0 20)} assume true; {8293#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:17,530 INFO L273 TraceCheckUtils]: 47: Hoare triple {8293#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8294#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:17,531 INFO L273 TraceCheckUtils]: 48: Hoare triple {8294#(<= main_~i~0 21)} assume true; {8294#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:17,532 INFO L273 TraceCheckUtils]: 49: Hoare triple {8294#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8295#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:17,532 INFO L273 TraceCheckUtils]: 50: Hoare triple {8295#(<= main_~i~0 22)} assume true; {8295#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:17,533 INFO L273 TraceCheckUtils]: 51: Hoare triple {8295#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8296#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:17,534 INFO L273 TraceCheckUtils]: 52: Hoare triple {8296#(<= main_~i~0 23)} assume true; {8296#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:17,535 INFO L273 TraceCheckUtils]: 53: Hoare triple {8296#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8297#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:17,535 INFO L273 TraceCheckUtils]: 54: Hoare triple {8297#(<= main_~i~0 24)} assume true; {8297#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:17,536 INFO L273 TraceCheckUtils]: 55: Hoare triple {8297#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8298#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:17,537 INFO L273 TraceCheckUtils]: 56: Hoare triple {8298#(<= main_~i~0 25)} assume true; {8298#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:17,538 INFO L273 TraceCheckUtils]: 57: Hoare triple {8298#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8299#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:17,538 INFO L273 TraceCheckUtils]: 58: Hoare triple {8299#(<= main_~i~0 26)} assume true; {8299#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:17,539 INFO L273 TraceCheckUtils]: 59: Hoare triple {8299#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8300#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:17,540 INFO L273 TraceCheckUtils]: 60: Hoare triple {8300#(<= main_~i~0 27)} assume true; {8300#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:17,541 INFO L273 TraceCheckUtils]: 61: Hoare triple {8300#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8301#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:17,541 INFO L273 TraceCheckUtils]: 62: Hoare triple {8301#(<= main_~i~0 28)} assume true; {8301#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:17,542 INFO L273 TraceCheckUtils]: 63: Hoare triple {8301#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8302#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:17,543 INFO L273 TraceCheckUtils]: 64: Hoare triple {8302#(<= main_~i~0 29)} assume true; {8302#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:17,544 INFO L273 TraceCheckUtils]: 65: Hoare triple {8302#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8303#(<= main_~i~0 30)} is VALID [2018-11-14 18:47:17,544 INFO L273 TraceCheckUtils]: 66: Hoare triple {8303#(<= main_~i~0 30)} assume true; {8303#(<= main_~i~0 30)} is VALID [2018-11-14 18:47:17,545 INFO L273 TraceCheckUtils]: 67: Hoare triple {8303#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8304#(<= main_~i~0 31)} is VALID [2018-11-14 18:47:17,546 INFO L273 TraceCheckUtils]: 68: Hoare triple {8304#(<= main_~i~0 31)} assume true; {8304#(<= main_~i~0 31)} is VALID [2018-11-14 18:47:17,547 INFO L273 TraceCheckUtils]: 69: Hoare triple {8304#(<= main_~i~0 31)} assume !(~i~0 < 100000); {8272#false} is VALID [2018-11-14 18:47:17,547 INFO L273 TraceCheckUtils]: 70: Hoare triple {8272#false} ~i~0 := 1; {8272#false} is VALID [2018-11-14 18:47:17,547 INFO L273 TraceCheckUtils]: 71: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 18:47:17,547 INFO L273 TraceCheckUtils]: 72: Hoare triple {8272#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8272#false} is VALID [2018-11-14 18:47:17,547 INFO L273 TraceCheckUtils]: 73: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 18:47:17,548 INFO L273 TraceCheckUtils]: 74: Hoare triple {8272#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8272#false} is VALID [2018-11-14 18:47:17,548 INFO L273 TraceCheckUtils]: 75: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 18:47:17,548 INFO L273 TraceCheckUtils]: 76: Hoare triple {8272#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8272#false} is VALID [2018-11-14 18:47:17,548 INFO L273 TraceCheckUtils]: 77: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 18:47:17,548 INFO L273 TraceCheckUtils]: 78: Hoare triple {8272#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8272#false} is VALID [2018-11-14 18:47:17,549 INFO L273 TraceCheckUtils]: 79: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 18:47:17,549 INFO L273 TraceCheckUtils]: 80: Hoare triple {8272#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8272#false} is VALID [2018-11-14 18:47:17,549 INFO L273 TraceCheckUtils]: 81: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 18:47:17,549 INFO L273 TraceCheckUtils]: 82: Hoare triple {8272#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8272#false} is VALID [2018-11-14 18:47:17,549 INFO L273 TraceCheckUtils]: 83: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 18:47:17,550 INFO L273 TraceCheckUtils]: 84: Hoare triple {8272#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8272#false} is VALID [2018-11-14 18:47:17,550 INFO L273 TraceCheckUtils]: 85: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 18:47:17,550 INFO L273 TraceCheckUtils]: 86: Hoare triple {8272#false} assume !(~i~0 < 100000); {8272#false} is VALID [2018-11-14 18:47:17,550 INFO L273 TraceCheckUtils]: 87: Hoare triple {8272#false} ~i~0 := 1;~j~0 := 0; {8272#false} is VALID [2018-11-14 18:47:17,550 INFO L273 TraceCheckUtils]: 88: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 18:47:17,550 INFO L273 TraceCheckUtils]: 89: Hoare triple {8272#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {8272#false} is VALID [2018-11-14 18:47:17,550 INFO L256 TraceCheckUtils]: 90: Hoare triple {8272#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8272#false} is VALID [2018-11-14 18:47:17,551 INFO L273 TraceCheckUtils]: 91: Hoare triple {8272#false} ~cond := #in~cond; {8272#false} is VALID [2018-11-14 18:47:17,551 INFO L273 TraceCheckUtils]: 92: Hoare triple {8272#false} assume ~cond == 0; {8272#false} is VALID [2018-11-14 18:47:17,551 INFO L273 TraceCheckUtils]: 93: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2018-11-14 18:47:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 18:47:17,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:47:17,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:47:17,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:47:17,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-14 18:47:17,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:47:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:17,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:47:18,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {8271#true} call ULTIMATE.init(); {8271#true} is VALID [2018-11-14 18:47:18,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {8271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8271#true} is VALID [2018-11-14 18:47:18,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,062 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8271#true} {8271#true} #63#return; {8271#true} is VALID [2018-11-14 18:47:18,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {8271#true} call #t~ret4 := main(); {8271#true} is VALID [2018-11-14 18:47:18,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {8271#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {8271#true} is VALID [2018-11-14 18:47:18,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,065 INFO L273 TraceCheckUtils]: 17: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,065 INFO L273 TraceCheckUtils]: 18: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,065 INFO L273 TraceCheckUtils]: 19: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,065 INFO L273 TraceCheckUtils]: 21: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,065 INFO L273 TraceCheckUtils]: 22: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,065 INFO L273 TraceCheckUtils]: 23: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,065 INFO L273 TraceCheckUtils]: 24: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,066 INFO L273 TraceCheckUtils]: 26: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,066 INFO L273 TraceCheckUtils]: 27: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,066 INFO L273 TraceCheckUtils]: 28: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,066 INFO L273 TraceCheckUtils]: 29: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,066 INFO L273 TraceCheckUtils]: 30: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,066 INFO L273 TraceCheckUtils]: 31: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,066 INFO L273 TraceCheckUtils]: 32: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,066 INFO L273 TraceCheckUtils]: 33: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,067 INFO L273 TraceCheckUtils]: 34: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,067 INFO L273 TraceCheckUtils]: 35: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,067 INFO L273 TraceCheckUtils]: 36: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,067 INFO L273 TraceCheckUtils]: 37: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,067 INFO L273 TraceCheckUtils]: 38: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,067 INFO L273 TraceCheckUtils]: 39: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,067 INFO L273 TraceCheckUtils]: 40: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,067 INFO L273 TraceCheckUtils]: 41: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,067 INFO L273 TraceCheckUtils]: 42: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,068 INFO L273 TraceCheckUtils]: 43: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,068 INFO L273 TraceCheckUtils]: 44: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,068 INFO L273 TraceCheckUtils]: 45: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,068 INFO L273 TraceCheckUtils]: 46: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,068 INFO L273 TraceCheckUtils]: 47: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,068 INFO L273 TraceCheckUtils]: 48: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,068 INFO L273 TraceCheckUtils]: 49: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,068 INFO L273 TraceCheckUtils]: 50: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,069 INFO L273 TraceCheckUtils]: 51: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,069 INFO L273 TraceCheckUtils]: 52: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,069 INFO L273 TraceCheckUtils]: 53: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,069 INFO L273 TraceCheckUtils]: 54: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,069 INFO L273 TraceCheckUtils]: 55: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,069 INFO L273 TraceCheckUtils]: 56: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,069 INFO L273 TraceCheckUtils]: 57: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,069 INFO L273 TraceCheckUtils]: 58: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,070 INFO L273 TraceCheckUtils]: 59: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,070 INFO L273 TraceCheckUtils]: 60: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,070 INFO L273 TraceCheckUtils]: 61: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,070 INFO L273 TraceCheckUtils]: 62: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,070 INFO L273 TraceCheckUtils]: 63: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,070 INFO L273 TraceCheckUtils]: 64: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,071 INFO L273 TraceCheckUtils]: 65: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,071 INFO L273 TraceCheckUtils]: 66: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,071 INFO L273 TraceCheckUtils]: 67: Hoare triple {8271#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8271#true} is VALID [2018-11-14 18:47:18,071 INFO L273 TraceCheckUtils]: 68: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 18:47:18,071 INFO L273 TraceCheckUtils]: 69: Hoare triple {8271#true} assume !(~i~0 < 100000); {8271#true} is VALID [2018-11-14 18:47:18,081 INFO L273 TraceCheckUtils]: 70: Hoare triple {8271#true} ~i~0 := 1; {8274#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:18,081 INFO L273 TraceCheckUtils]: 71: Hoare triple {8274#(<= main_~i~0 1)} assume true; {8274#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:18,082 INFO L273 TraceCheckUtils]: 72: Hoare triple {8274#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8283#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:18,082 INFO L273 TraceCheckUtils]: 73: Hoare triple {8283#(<= main_~i~0 10)} assume true; {8283#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:18,083 INFO L273 TraceCheckUtils]: 74: Hoare triple {8283#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8292#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:18,083 INFO L273 TraceCheckUtils]: 75: Hoare triple {8292#(<= main_~i~0 19)} assume true; {8292#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:18,084 INFO L273 TraceCheckUtils]: 76: Hoare triple {8292#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8301#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:18,084 INFO L273 TraceCheckUtils]: 77: Hoare triple {8301#(<= main_~i~0 28)} assume true; {8301#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:18,085 INFO L273 TraceCheckUtils]: 78: Hoare triple {8301#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8542#(<= main_~i~0 37)} is VALID [2018-11-14 18:47:18,085 INFO L273 TraceCheckUtils]: 79: Hoare triple {8542#(<= main_~i~0 37)} assume true; {8542#(<= main_~i~0 37)} is VALID [2018-11-14 18:47:18,086 INFO L273 TraceCheckUtils]: 80: Hoare triple {8542#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8549#(<= main_~i~0 46)} is VALID [2018-11-14 18:47:18,087 INFO L273 TraceCheckUtils]: 81: Hoare triple {8549#(<= main_~i~0 46)} assume true; {8549#(<= main_~i~0 46)} is VALID [2018-11-14 18:47:18,088 INFO L273 TraceCheckUtils]: 82: Hoare triple {8549#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8556#(<= main_~i~0 55)} is VALID [2018-11-14 18:47:18,088 INFO L273 TraceCheckUtils]: 83: Hoare triple {8556#(<= main_~i~0 55)} assume true; {8556#(<= main_~i~0 55)} is VALID [2018-11-14 18:47:18,089 INFO L273 TraceCheckUtils]: 84: Hoare triple {8556#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {8563#(<= main_~i~0 64)} is VALID [2018-11-14 18:47:18,090 INFO L273 TraceCheckUtils]: 85: Hoare triple {8563#(<= main_~i~0 64)} assume true; {8563#(<= main_~i~0 64)} is VALID [2018-11-14 18:47:18,091 INFO L273 TraceCheckUtils]: 86: Hoare triple {8563#(<= main_~i~0 64)} assume !(~i~0 < 100000); {8272#false} is VALID [2018-11-14 18:47:18,091 INFO L273 TraceCheckUtils]: 87: Hoare triple {8272#false} ~i~0 := 1;~j~0 := 0; {8272#false} is VALID [2018-11-14 18:47:18,091 INFO L273 TraceCheckUtils]: 88: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 18:47:18,091 INFO L273 TraceCheckUtils]: 89: Hoare triple {8272#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {8272#false} is VALID [2018-11-14 18:47:18,092 INFO L256 TraceCheckUtils]: 90: Hoare triple {8272#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8272#false} is VALID [2018-11-14 18:47:18,092 INFO L273 TraceCheckUtils]: 91: Hoare triple {8272#false} ~cond := #in~cond; {8272#false} is VALID [2018-11-14 18:47:18,092 INFO L273 TraceCheckUtils]: 92: Hoare triple {8272#false} assume ~cond == 0; {8272#false} is VALID [2018-11-14 18:47:18,092 INFO L273 TraceCheckUtils]: 93: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2018-11-14 18:47:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-11-14 18:47:18,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:47:18,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 10] total 38 [2018-11-14 18:47:18,120 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-11-14 18:47:18,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:47:18,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 18:47:18,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:18,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 18:47:18,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 18:47:18,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 18:47:18,221 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 38 states. [2018-11-14 18:47:19,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:19,530 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2018-11-14 18:47:19,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-14 18:47:19,531 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-11-14 18:47:19,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:47:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:47:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 173 transitions. [2018-11-14 18:47:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:47:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 173 transitions. [2018-11-14 18:47:19,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 173 transitions. [2018-11-14 18:47:19,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:19,993 INFO L225 Difference]: With dead ends: 170 [2018-11-14 18:47:19,993 INFO L226 Difference]: Without dead ends: 142 [2018-11-14 18:47:19,994 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 18:47:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-14 18:47:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 110. [2018-11-14 18:47:20,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:47:20,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 110 states. [2018-11-14 18:47:20,095 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 110 states. [2018-11-14 18:47:20,095 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 110 states. [2018-11-14 18:47:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:20,098 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-11-14 18:47:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-11-14 18:47:20,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:20,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:20,098 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 142 states. [2018-11-14 18:47:20,099 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 142 states. [2018-11-14 18:47:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:20,101 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-11-14 18:47:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-11-14 18:47:20,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:20,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:20,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:47:20,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:47:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-14 18:47:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-11-14 18:47:20,104 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 94 [2018-11-14 18:47:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:47:20,104 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-11-14 18:47:20,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-14 18:47:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-11-14 18:47:20,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-14 18:47:20,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:47:20,105 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:47:20,105 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:47:20,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:47:20,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2048482219, now seen corresponding path program 16 times [2018-11-14 18:47:20,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:47:20,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:47:20,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:20,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:47:20,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:21,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {9287#true} call ULTIMATE.init(); {9287#true} is VALID [2018-11-14 18:47:21,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {9287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9287#true} is VALID [2018-11-14 18:47:21,330 INFO L273 TraceCheckUtils]: 2: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9287#true} {9287#true} #63#return; {9287#true} is VALID [2018-11-14 18:47:21,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {9287#true} call #t~ret4 := main(); {9287#true} is VALID [2018-11-14 18:47:21,331 INFO L273 TraceCheckUtils]: 5: Hoare triple {9287#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {9289#(= main_~i~0 0)} is VALID [2018-11-14 18:47:21,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {9289#(= main_~i~0 0)} assume true; {9289#(= main_~i~0 0)} is VALID [2018-11-14 18:47:21,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {9289#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9290#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:21,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {9290#(<= main_~i~0 1)} assume true; {9290#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:21,334 INFO L273 TraceCheckUtils]: 9: Hoare triple {9290#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9291#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:21,334 INFO L273 TraceCheckUtils]: 10: Hoare triple {9291#(<= main_~i~0 2)} assume true; {9291#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:21,335 INFO L273 TraceCheckUtils]: 11: Hoare triple {9291#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9292#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:21,336 INFO L273 TraceCheckUtils]: 12: Hoare triple {9292#(<= main_~i~0 3)} assume true; {9292#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:21,337 INFO L273 TraceCheckUtils]: 13: Hoare triple {9292#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9293#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:21,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {9293#(<= main_~i~0 4)} assume true; {9293#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:21,338 INFO L273 TraceCheckUtils]: 15: Hoare triple {9293#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9294#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:21,339 INFO L273 TraceCheckUtils]: 16: Hoare triple {9294#(<= main_~i~0 5)} assume true; {9294#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:21,340 INFO L273 TraceCheckUtils]: 17: Hoare triple {9294#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9295#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:21,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {9295#(<= main_~i~0 6)} assume true; {9295#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:21,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {9295#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9296#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:21,342 INFO L273 TraceCheckUtils]: 20: Hoare triple {9296#(<= main_~i~0 7)} assume true; {9296#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:21,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {9296#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9297#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:21,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {9297#(<= main_~i~0 8)} assume true; {9297#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:21,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {9297#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9298#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:21,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {9298#(<= main_~i~0 9)} assume true; {9298#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:21,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {9298#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9299#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:21,347 INFO L273 TraceCheckUtils]: 26: Hoare triple {9299#(<= main_~i~0 10)} assume true; {9299#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:21,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {9299#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9300#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:21,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {9300#(<= main_~i~0 11)} assume true; {9300#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:21,349 INFO L273 TraceCheckUtils]: 29: Hoare triple {9300#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9301#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:21,350 INFO L273 TraceCheckUtils]: 30: Hoare triple {9301#(<= main_~i~0 12)} assume true; {9301#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:21,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {9301#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9302#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:21,351 INFO L273 TraceCheckUtils]: 32: Hoare triple {9302#(<= main_~i~0 13)} assume true; {9302#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:21,352 INFO L273 TraceCheckUtils]: 33: Hoare triple {9302#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9303#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:21,353 INFO L273 TraceCheckUtils]: 34: Hoare triple {9303#(<= main_~i~0 14)} assume true; {9303#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:21,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {9303#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9304#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:21,354 INFO L273 TraceCheckUtils]: 36: Hoare triple {9304#(<= main_~i~0 15)} assume true; {9304#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:21,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {9304#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9305#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:21,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {9305#(<= main_~i~0 16)} assume true; {9305#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:21,357 INFO L273 TraceCheckUtils]: 39: Hoare triple {9305#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9306#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:21,357 INFO L273 TraceCheckUtils]: 40: Hoare triple {9306#(<= main_~i~0 17)} assume true; {9306#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:21,358 INFO L273 TraceCheckUtils]: 41: Hoare triple {9306#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9307#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:21,359 INFO L273 TraceCheckUtils]: 42: Hoare triple {9307#(<= main_~i~0 18)} assume true; {9307#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:21,360 INFO L273 TraceCheckUtils]: 43: Hoare triple {9307#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9308#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:21,361 INFO L273 TraceCheckUtils]: 44: Hoare triple {9308#(<= main_~i~0 19)} assume true; {9308#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:21,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {9308#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9309#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:21,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {9309#(<= main_~i~0 20)} assume true; {9309#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:21,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {9309#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9310#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:21,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {9310#(<= main_~i~0 21)} assume true; {9310#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:21,365 INFO L273 TraceCheckUtils]: 49: Hoare triple {9310#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9311#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:21,365 INFO L273 TraceCheckUtils]: 50: Hoare triple {9311#(<= main_~i~0 22)} assume true; {9311#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:21,366 INFO L273 TraceCheckUtils]: 51: Hoare triple {9311#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9312#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:21,367 INFO L273 TraceCheckUtils]: 52: Hoare triple {9312#(<= main_~i~0 23)} assume true; {9312#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:21,368 INFO L273 TraceCheckUtils]: 53: Hoare triple {9312#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9313#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:21,368 INFO L273 TraceCheckUtils]: 54: Hoare triple {9313#(<= main_~i~0 24)} assume true; {9313#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:21,369 INFO L273 TraceCheckUtils]: 55: Hoare triple {9313#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9314#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:21,370 INFO L273 TraceCheckUtils]: 56: Hoare triple {9314#(<= main_~i~0 25)} assume true; {9314#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:21,371 INFO L273 TraceCheckUtils]: 57: Hoare triple {9314#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9315#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:21,371 INFO L273 TraceCheckUtils]: 58: Hoare triple {9315#(<= main_~i~0 26)} assume true; {9315#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:21,372 INFO L273 TraceCheckUtils]: 59: Hoare triple {9315#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9316#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:21,373 INFO L273 TraceCheckUtils]: 60: Hoare triple {9316#(<= main_~i~0 27)} assume true; {9316#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:21,374 INFO L273 TraceCheckUtils]: 61: Hoare triple {9316#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9317#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:21,374 INFO L273 TraceCheckUtils]: 62: Hoare triple {9317#(<= main_~i~0 28)} assume true; {9317#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:21,375 INFO L273 TraceCheckUtils]: 63: Hoare triple {9317#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9318#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:21,376 INFO L273 TraceCheckUtils]: 64: Hoare triple {9318#(<= main_~i~0 29)} assume true; {9318#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:21,377 INFO L273 TraceCheckUtils]: 65: Hoare triple {9318#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9319#(<= main_~i~0 30)} is VALID [2018-11-14 18:47:21,377 INFO L273 TraceCheckUtils]: 66: Hoare triple {9319#(<= main_~i~0 30)} assume true; {9319#(<= main_~i~0 30)} is VALID [2018-11-14 18:47:21,378 INFO L273 TraceCheckUtils]: 67: Hoare triple {9319#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9320#(<= main_~i~0 31)} is VALID [2018-11-14 18:47:21,379 INFO L273 TraceCheckUtils]: 68: Hoare triple {9320#(<= main_~i~0 31)} assume true; {9320#(<= main_~i~0 31)} is VALID [2018-11-14 18:47:21,380 INFO L273 TraceCheckUtils]: 69: Hoare triple {9320#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9321#(<= main_~i~0 32)} is VALID [2018-11-14 18:47:21,380 INFO L273 TraceCheckUtils]: 70: Hoare triple {9321#(<= main_~i~0 32)} assume true; {9321#(<= main_~i~0 32)} is VALID [2018-11-14 18:47:21,381 INFO L273 TraceCheckUtils]: 71: Hoare triple {9321#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9322#(<= main_~i~0 33)} is VALID [2018-11-14 18:47:21,382 INFO L273 TraceCheckUtils]: 72: Hoare triple {9322#(<= main_~i~0 33)} assume true; {9322#(<= main_~i~0 33)} is VALID [2018-11-14 18:47:21,383 INFO L273 TraceCheckUtils]: 73: Hoare triple {9322#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9323#(<= main_~i~0 34)} is VALID [2018-11-14 18:47:21,384 INFO L273 TraceCheckUtils]: 74: Hoare triple {9323#(<= main_~i~0 34)} assume true; {9323#(<= main_~i~0 34)} is VALID [2018-11-14 18:47:21,385 INFO L273 TraceCheckUtils]: 75: Hoare triple {9323#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9324#(<= main_~i~0 35)} is VALID [2018-11-14 18:47:21,385 INFO L273 TraceCheckUtils]: 76: Hoare triple {9324#(<= main_~i~0 35)} assume true; {9324#(<= main_~i~0 35)} is VALID [2018-11-14 18:47:21,386 INFO L273 TraceCheckUtils]: 77: Hoare triple {9324#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9325#(<= main_~i~0 36)} is VALID [2018-11-14 18:47:21,387 INFO L273 TraceCheckUtils]: 78: Hoare triple {9325#(<= main_~i~0 36)} assume true; {9325#(<= main_~i~0 36)} is VALID [2018-11-14 18:47:21,387 INFO L273 TraceCheckUtils]: 79: Hoare triple {9325#(<= main_~i~0 36)} assume !(~i~0 < 100000); {9288#false} is VALID [2018-11-14 18:47:21,388 INFO L273 TraceCheckUtils]: 80: Hoare triple {9288#false} ~i~0 := 1; {9288#false} is VALID [2018-11-14 18:47:21,388 INFO L273 TraceCheckUtils]: 81: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 18:47:21,388 INFO L273 TraceCheckUtils]: 82: Hoare triple {9288#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9288#false} is VALID [2018-11-14 18:47:21,388 INFO L273 TraceCheckUtils]: 83: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 18:47:21,388 INFO L273 TraceCheckUtils]: 84: Hoare triple {9288#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9288#false} is VALID [2018-11-14 18:47:21,389 INFO L273 TraceCheckUtils]: 85: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 18:47:21,389 INFO L273 TraceCheckUtils]: 86: Hoare triple {9288#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9288#false} is VALID [2018-11-14 18:47:21,389 INFO L273 TraceCheckUtils]: 87: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 18:47:21,389 INFO L273 TraceCheckUtils]: 88: Hoare triple {9288#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9288#false} is VALID [2018-11-14 18:47:21,389 INFO L273 TraceCheckUtils]: 89: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 18:47:21,390 INFO L273 TraceCheckUtils]: 90: Hoare triple {9288#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9288#false} is VALID [2018-11-14 18:47:21,390 INFO L273 TraceCheckUtils]: 91: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 18:47:21,390 INFO L273 TraceCheckUtils]: 92: Hoare triple {9288#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9288#false} is VALID [2018-11-14 18:47:21,390 INFO L273 TraceCheckUtils]: 93: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 18:47:21,390 INFO L273 TraceCheckUtils]: 94: Hoare triple {9288#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9288#false} is VALID [2018-11-14 18:47:21,391 INFO L273 TraceCheckUtils]: 95: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 18:47:21,391 INFO L273 TraceCheckUtils]: 96: Hoare triple {9288#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9288#false} is VALID [2018-11-14 18:47:21,391 INFO L273 TraceCheckUtils]: 97: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 18:47:21,391 INFO L273 TraceCheckUtils]: 98: Hoare triple {9288#false} assume !(~i~0 < 100000); {9288#false} is VALID [2018-11-14 18:47:21,391 INFO L273 TraceCheckUtils]: 99: Hoare triple {9288#false} ~i~0 := 1;~j~0 := 0; {9288#false} is VALID [2018-11-14 18:47:21,392 INFO L273 TraceCheckUtils]: 100: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 18:47:21,392 INFO L273 TraceCheckUtils]: 101: Hoare triple {9288#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {9288#false} is VALID [2018-11-14 18:47:21,392 INFO L256 TraceCheckUtils]: 102: Hoare triple {9288#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9288#false} is VALID [2018-11-14 18:47:21,392 INFO L273 TraceCheckUtils]: 103: Hoare triple {9288#false} ~cond := #in~cond; {9288#false} is VALID [2018-11-14 18:47:21,392 INFO L273 TraceCheckUtils]: 104: Hoare triple {9288#false} assume ~cond == 0; {9288#false} is VALID [2018-11-14 18:47:21,392 INFO L273 TraceCheckUtils]: 105: Hoare triple {9288#false} assume !false; {9288#false} is VALID [2018-11-14 18:47:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-14 18:47:21,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:47:21,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:47:21,408 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:47:21,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:47:21,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:47:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:21,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:47:21,762 INFO L256 TraceCheckUtils]: 0: Hoare triple {9287#true} call ULTIMATE.init(); {9287#true} is VALID [2018-11-14 18:47:21,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {9287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9287#true} is VALID [2018-11-14 18:47:21,762 INFO L273 TraceCheckUtils]: 2: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,763 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9287#true} {9287#true} #63#return; {9287#true} is VALID [2018-11-14 18:47:21,763 INFO L256 TraceCheckUtils]: 4: Hoare triple {9287#true} call #t~ret4 := main(); {9287#true} is VALID [2018-11-14 18:47:21,763 INFO L273 TraceCheckUtils]: 5: Hoare triple {9287#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {9287#true} is VALID [2018-11-14 18:47:21,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,763 INFO L273 TraceCheckUtils]: 7: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,764 INFO L273 TraceCheckUtils]: 13: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,764 INFO L273 TraceCheckUtils]: 14: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,764 INFO L273 TraceCheckUtils]: 16: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,764 INFO L273 TraceCheckUtils]: 17: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,765 INFO L273 TraceCheckUtils]: 20: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,765 INFO L273 TraceCheckUtils]: 21: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,765 INFO L273 TraceCheckUtils]: 23: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,765 INFO L273 TraceCheckUtils]: 25: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,765 INFO L273 TraceCheckUtils]: 26: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,765 INFO L273 TraceCheckUtils]: 27: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,765 INFO L273 TraceCheckUtils]: 28: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,766 INFO L273 TraceCheckUtils]: 29: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,766 INFO L273 TraceCheckUtils]: 30: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,766 INFO L273 TraceCheckUtils]: 31: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,766 INFO L273 TraceCheckUtils]: 32: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,766 INFO L273 TraceCheckUtils]: 33: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,766 INFO L273 TraceCheckUtils]: 34: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,766 INFO L273 TraceCheckUtils]: 35: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,766 INFO L273 TraceCheckUtils]: 36: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,766 INFO L273 TraceCheckUtils]: 37: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,767 INFO L273 TraceCheckUtils]: 38: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,767 INFO L273 TraceCheckUtils]: 39: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,767 INFO L273 TraceCheckUtils]: 40: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,767 INFO L273 TraceCheckUtils]: 41: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,767 INFO L273 TraceCheckUtils]: 42: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,767 INFO L273 TraceCheckUtils]: 43: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,767 INFO L273 TraceCheckUtils]: 44: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,767 INFO L273 TraceCheckUtils]: 45: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,768 INFO L273 TraceCheckUtils]: 46: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,768 INFO L273 TraceCheckUtils]: 47: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,768 INFO L273 TraceCheckUtils]: 48: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,768 INFO L273 TraceCheckUtils]: 49: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,768 INFO L273 TraceCheckUtils]: 50: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,768 INFO L273 TraceCheckUtils]: 51: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,768 INFO L273 TraceCheckUtils]: 52: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,768 INFO L273 TraceCheckUtils]: 53: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,768 INFO L273 TraceCheckUtils]: 54: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,769 INFO L273 TraceCheckUtils]: 55: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,769 INFO L273 TraceCheckUtils]: 56: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,769 INFO L273 TraceCheckUtils]: 57: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,769 INFO L273 TraceCheckUtils]: 58: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,769 INFO L273 TraceCheckUtils]: 59: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,769 INFO L273 TraceCheckUtils]: 60: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,769 INFO L273 TraceCheckUtils]: 61: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,769 INFO L273 TraceCheckUtils]: 62: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,769 INFO L273 TraceCheckUtils]: 63: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,770 INFO L273 TraceCheckUtils]: 64: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,770 INFO L273 TraceCheckUtils]: 65: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,770 INFO L273 TraceCheckUtils]: 66: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,770 INFO L273 TraceCheckUtils]: 67: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,770 INFO L273 TraceCheckUtils]: 68: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,770 INFO L273 TraceCheckUtils]: 69: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,770 INFO L273 TraceCheckUtils]: 70: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,770 INFO L273 TraceCheckUtils]: 71: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,771 INFO L273 TraceCheckUtils]: 72: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,771 INFO L273 TraceCheckUtils]: 73: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,771 INFO L273 TraceCheckUtils]: 74: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,771 INFO L273 TraceCheckUtils]: 75: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,771 INFO L273 TraceCheckUtils]: 76: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,771 INFO L273 TraceCheckUtils]: 77: Hoare triple {9287#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9287#true} is VALID [2018-11-14 18:47:21,771 INFO L273 TraceCheckUtils]: 78: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 18:47:21,771 INFO L273 TraceCheckUtils]: 79: Hoare triple {9287#true} assume !(~i~0 < 100000); {9287#true} is VALID [2018-11-14 18:47:21,772 INFO L273 TraceCheckUtils]: 80: Hoare triple {9287#true} ~i~0 := 1; {9290#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:21,772 INFO L273 TraceCheckUtils]: 81: Hoare triple {9290#(<= main_~i~0 1)} assume true; {9290#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:21,773 INFO L273 TraceCheckUtils]: 82: Hoare triple {9290#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9299#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:21,773 INFO L273 TraceCheckUtils]: 83: Hoare triple {9299#(<= main_~i~0 10)} assume true; {9299#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:21,774 INFO L273 TraceCheckUtils]: 84: Hoare triple {9299#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9308#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:21,774 INFO L273 TraceCheckUtils]: 85: Hoare triple {9308#(<= main_~i~0 19)} assume true; {9308#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:21,775 INFO L273 TraceCheckUtils]: 86: Hoare triple {9308#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9317#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:21,775 INFO L273 TraceCheckUtils]: 87: Hoare triple {9317#(<= main_~i~0 28)} assume true; {9317#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:21,776 INFO L273 TraceCheckUtils]: 88: Hoare triple {9317#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9593#(<= main_~i~0 37)} is VALID [2018-11-14 18:47:21,777 INFO L273 TraceCheckUtils]: 89: Hoare triple {9593#(<= main_~i~0 37)} assume true; {9593#(<= main_~i~0 37)} is VALID [2018-11-14 18:47:21,778 INFO L273 TraceCheckUtils]: 90: Hoare triple {9593#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9600#(<= main_~i~0 46)} is VALID [2018-11-14 18:47:21,779 INFO L273 TraceCheckUtils]: 91: Hoare triple {9600#(<= main_~i~0 46)} assume true; {9600#(<= main_~i~0 46)} is VALID [2018-11-14 18:47:21,780 INFO L273 TraceCheckUtils]: 92: Hoare triple {9600#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9607#(<= main_~i~0 55)} is VALID [2018-11-14 18:47:21,780 INFO L273 TraceCheckUtils]: 93: Hoare triple {9607#(<= main_~i~0 55)} assume true; {9607#(<= main_~i~0 55)} is VALID [2018-11-14 18:47:21,781 INFO L273 TraceCheckUtils]: 94: Hoare triple {9607#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9614#(<= main_~i~0 64)} is VALID [2018-11-14 18:47:21,782 INFO L273 TraceCheckUtils]: 95: Hoare triple {9614#(<= main_~i~0 64)} assume true; {9614#(<= main_~i~0 64)} is VALID [2018-11-14 18:47:21,783 INFO L273 TraceCheckUtils]: 96: Hoare triple {9614#(<= main_~i~0 64)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {9621#(<= main_~i~0 73)} is VALID [2018-11-14 18:47:21,783 INFO L273 TraceCheckUtils]: 97: Hoare triple {9621#(<= main_~i~0 73)} assume true; {9621#(<= main_~i~0 73)} is VALID [2018-11-14 18:47:21,784 INFO L273 TraceCheckUtils]: 98: Hoare triple {9621#(<= main_~i~0 73)} assume !(~i~0 < 100000); {9288#false} is VALID [2018-11-14 18:47:21,784 INFO L273 TraceCheckUtils]: 99: Hoare triple {9288#false} ~i~0 := 1;~j~0 := 0; {9288#false} is VALID [2018-11-14 18:47:21,784 INFO L273 TraceCheckUtils]: 100: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 18:47:21,785 INFO L273 TraceCheckUtils]: 101: Hoare triple {9288#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {9288#false} is VALID [2018-11-14 18:47:21,785 INFO L256 TraceCheckUtils]: 102: Hoare triple {9288#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9288#false} is VALID [2018-11-14 18:47:21,785 INFO L273 TraceCheckUtils]: 103: Hoare triple {9288#false} ~cond := #in~cond; {9288#false} is VALID [2018-11-14 18:47:21,785 INFO L273 TraceCheckUtils]: 104: Hoare triple {9288#false} assume ~cond == 0; {9288#false} is VALID [2018-11-14 18:47:21,785 INFO L273 TraceCheckUtils]: 105: Hoare triple {9288#false} assume !false; {9288#false} is VALID [2018-11-14 18:47:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2018-11-14 18:47:21,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:47:21,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 11] total 44 [2018-11-14 18:47:21,813 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 106 [2018-11-14 18:47:21,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:47:21,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-14 18:47:21,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:21,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-14 18:47:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-14 18:47:21,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-14 18:47:21,961 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 44 states. [2018-11-14 18:47:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:23,588 INFO L93 Difference]: Finished difference Result 190 states and 209 transitions. [2018-11-14 18:47:23,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-14 18:47:23,588 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 106 [2018-11-14 18:47:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:47:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:47:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 193 transitions. [2018-11-14 18:47:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:47:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 193 transitions. [2018-11-14 18:47:23,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 193 transitions. [2018-11-14 18:47:25,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:47:25,632 INFO L225 Difference]: With dead ends: 190 [2018-11-14 18:47:25,632 INFO L226 Difference]: Without dead ends: 160 [2018-11-14 18:47:25,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-14 18:47:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-14 18:47:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 124. [2018-11-14 18:47:25,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:47:25,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 124 states. [2018-11-14 18:47:25,695 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 124 states. [2018-11-14 18:47:25,695 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 124 states. [2018-11-14 18:47:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:25,698 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2018-11-14 18:47:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2018-11-14 18:47:25,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:25,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:25,699 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 160 states. [2018-11-14 18:47:25,699 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 160 states. [2018-11-14 18:47:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:47:25,703 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2018-11-14 18:47:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2018-11-14 18:47:25,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:47:25,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:47:25,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:47:25,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:47:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-14 18:47:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-11-14 18:47:25,707 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 106 [2018-11-14 18:47:25,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:47:25,707 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-11-14 18:47:25,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-14 18:47:25,707 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-11-14 18:47:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-14 18:47:25,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:47:25,708 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:47:25,709 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:47:25,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:47:25,709 INFO L82 PathProgramCache]: Analyzing trace with hash 662924499, now seen corresponding path program 17 times [2018-11-14 18:47:25,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:47:25,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:47:25,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:25,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:47:25,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:47:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:47:27,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {10432#true} call ULTIMATE.init(); {10432#true} is VALID [2018-11-14 18:47:27,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {10432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10432#true} is VALID [2018-11-14 18:47:27,240 INFO L273 TraceCheckUtils]: 2: Hoare triple {10432#true} assume true; {10432#true} is VALID [2018-11-14 18:47:27,240 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10432#true} {10432#true} #63#return; {10432#true} is VALID [2018-11-14 18:47:27,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {10432#true} call #t~ret4 := main(); {10432#true} is VALID [2018-11-14 18:47:27,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {10432#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {10434#(= main_~i~0 0)} is VALID [2018-11-14 18:47:27,241 INFO L273 TraceCheckUtils]: 6: Hoare triple {10434#(= main_~i~0 0)} assume true; {10434#(= main_~i~0 0)} is VALID [2018-11-14 18:47:27,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {10434#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10435#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:27,242 INFO L273 TraceCheckUtils]: 8: Hoare triple {10435#(<= main_~i~0 1)} assume true; {10435#(<= main_~i~0 1)} is VALID [2018-11-14 18:47:27,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {10435#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10436#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:27,243 INFO L273 TraceCheckUtils]: 10: Hoare triple {10436#(<= main_~i~0 2)} assume true; {10436#(<= main_~i~0 2)} is VALID [2018-11-14 18:47:27,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {10436#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10437#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:27,244 INFO L273 TraceCheckUtils]: 12: Hoare triple {10437#(<= main_~i~0 3)} assume true; {10437#(<= main_~i~0 3)} is VALID [2018-11-14 18:47:27,245 INFO L273 TraceCheckUtils]: 13: Hoare triple {10437#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10438#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:27,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {10438#(<= main_~i~0 4)} assume true; {10438#(<= main_~i~0 4)} is VALID [2018-11-14 18:47:27,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {10438#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10439#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:27,247 INFO L273 TraceCheckUtils]: 16: Hoare triple {10439#(<= main_~i~0 5)} assume true; {10439#(<= main_~i~0 5)} is VALID [2018-11-14 18:47:27,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {10439#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10440#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:27,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {10440#(<= main_~i~0 6)} assume true; {10440#(<= main_~i~0 6)} is VALID [2018-11-14 18:47:27,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {10440#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10441#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:27,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {10441#(<= main_~i~0 7)} assume true; {10441#(<= main_~i~0 7)} is VALID [2018-11-14 18:47:27,251 INFO L273 TraceCheckUtils]: 21: Hoare triple {10441#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10442#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:27,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {10442#(<= main_~i~0 8)} assume true; {10442#(<= main_~i~0 8)} is VALID [2018-11-14 18:47:27,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {10442#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10443#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:27,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {10443#(<= main_~i~0 9)} assume true; {10443#(<= main_~i~0 9)} is VALID [2018-11-14 18:47:27,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {10443#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10444#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:27,255 INFO L273 TraceCheckUtils]: 26: Hoare triple {10444#(<= main_~i~0 10)} assume true; {10444#(<= main_~i~0 10)} is VALID [2018-11-14 18:47:27,256 INFO L273 TraceCheckUtils]: 27: Hoare triple {10444#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10445#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:27,257 INFO L273 TraceCheckUtils]: 28: Hoare triple {10445#(<= main_~i~0 11)} assume true; {10445#(<= main_~i~0 11)} is VALID [2018-11-14 18:47:27,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {10445#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10446#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:27,258 INFO L273 TraceCheckUtils]: 30: Hoare triple {10446#(<= main_~i~0 12)} assume true; {10446#(<= main_~i~0 12)} is VALID [2018-11-14 18:47:27,259 INFO L273 TraceCheckUtils]: 31: Hoare triple {10446#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10447#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:27,260 INFO L273 TraceCheckUtils]: 32: Hoare triple {10447#(<= main_~i~0 13)} assume true; {10447#(<= main_~i~0 13)} is VALID [2018-11-14 18:47:27,261 INFO L273 TraceCheckUtils]: 33: Hoare triple {10447#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10448#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:27,261 INFO L273 TraceCheckUtils]: 34: Hoare triple {10448#(<= main_~i~0 14)} assume true; {10448#(<= main_~i~0 14)} is VALID [2018-11-14 18:47:27,262 INFO L273 TraceCheckUtils]: 35: Hoare triple {10448#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10449#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:27,263 INFO L273 TraceCheckUtils]: 36: Hoare triple {10449#(<= main_~i~0 15)} assume true; {10449#(<= main_~i~0 15)} is VALID [2018-11-14 18:47:27,264 INFO L273 TraceCheckUtils]: 37: Hoare triple {10449#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10450#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:27,264 INFO L273 TraceCheckUtils]: 38: Hoare triple {10450#(<= main_~i~0 16)} assume true; {10450#(<= main_~i~0 16)} is VALID [2018-11-14 18:47:27,265 INFO L273 TraceCheckUtils]: 39: Hoare triple {10450#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10451#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:27,266 INFO L273 TraceCheckUtils]: 40: Hoare triple {10451#(<= main_~i~0 17)} assume true; {10451#(<= main_~i~0 17)} is VALID [2018-11-14 18:47:27,267 INFO L273 TraceCheckUtils]: 41: Hoare triple {10451#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10452#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:27,268 INFO L273 TraceCheckUtils]: 42: Hoare triple {10452#(<= main_~i~0 18)} assume true; {10452#(<= main_~i~0 18)} is VALID [2018-11-14 18:47:27,268 INFO L273 TraceCheckUtils]: 43: Hoare triple {10452#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10453#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:27,269 INFO L273 TraceCheckUtils]: 44: Hoare triple {10453#(<= main_~i~0 19)} assume true; {10453#(<= main_~i~0 19)} is VALID [2018-11-14 18:47:27,270 INFO L273 TraceCheckUtils]: 45: Hoare triple {10453#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10454#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:27,271 INFO L273 TraceCheckUtils]: 46: Hoare triple {10454#(<= main_~i~0 20)} assume true; {10454#(<= main_~i~0 20)} is VALID [2018-11-14 18:47:27,272 INFO L273 TraceCheckUtils]: 47: Hoare triple {10454#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10455#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:27,272 INFO L273 TraceCheckUtils]: 48: Hoare triple {10455#(<= main_~i~0 21)} assume true; {10455#(<= main_~i~0 21)} is VALID [2018-11-14 18:47:27,273 INFO L273 TraceCheckUtils]: 49: Hoare triple {10455#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10456#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:27,274 INFO L273 TraceCheckUtils]: 50: Hoare triple {10456#(<= main_~i~0 22)} assume true; {10456#(<= main_~i~0 22)} is VALID [2018-11-14 18:47:27,275 INFO L273 TraceCheckUtils]: 51: Hoare triple {10456#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10457#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:27,275 INFO L273 TraceCheckUtils]: 52: Hoare triple {10457#(<= main_~i~0 23)} assume true; {10457#(<= main_~i~0 23)} is VALID [2018-11-14 18:47:27,276 INFO L273 TraceCheckUtils]: 53: Hoare triple {10457#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10458#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:27,277 INFO L273 TraceCheckUtils]: 54: Hoare triple {10458#(<= main_~i~0 24)} assume true; {10458#(<= main_~i~0 24)} is VALID [2018-11-14 18:47:27,278 INFO L273 TraceCheckUtils]: 55: Hoare triple {10458#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10459#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:27,278 INFO L273 TraceCheckUtils]: 56: Hoare triple {10459#(<= main_~i~0 25)} assume true; {10459#(<= main_~i~0 25)} is VALID [2018-11-14 18:47:27,279 INFO L273 TraceCheckUtils]: 57: Hoare triple {10459#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10460#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:27,280 INFO L273 TraceCheckUtils]: 58: Hoare triple {10460#(<= main_~i~0 26)} assume true; {10460#(<= main_~i~0 26)} is VALID [2018-11-14 18:47:27,281 INFO L273 TraceCheckUtils]: 59: Hoare triple {10460#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10461#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:27,281 INFO L273 TraceCheckUtils]: 60: Hoare triple {10461#(<= main_~i~0 27)} assume true; {10461#(<= main_~i~0 27)} is VALID [2018-11-14 18:47:27,282 INFO L273 TraceCheckUtils]: 61: Hoare triple {10461#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10462#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:27,283 INFO L273 TraceCheckUtils]: 62: Hoare triple {10462#(<= main_~i~0 28)} assume true; {10462#(<= main_~i~0 28)} is VALID [2018-11-14 18:47:27,284 INFO L273 TraceCheckUtils]: 63: Hoare triple {10462#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10463#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:27,284 INFO L273 TraceCheckUtils]: 64: Hoare triple {10463#(<= main_~i~0 29)} assume true; {10463#(<= main_~i~0 29)} is VALID [2018-11-14 18:47:27,285 INFO L273 TraceCheckUtils]: 65: Hoare triple {10463#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10464#(<= main_~i~0 30)} is VALID [2018-11-14 18:47:27,286 INFO L273 TraceCheckUtils]: 66: Hoare triple {10464#(<= main_~i~0 30)} assume true; {10464#(<= main_~i~0 30)} is VALID [2018-11-14 18:47:27,287 INFO L273 TraceCheckUtils]: 67: Hoare triple {10464#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10465#(<= main_~i~0 31)} is VALID [2018-11-14 18:47:27,288 INFO L273 TraceCheckUtils]: 68: Hoare triple {10465#(<= main_~i~0 31)} assume true; {10465#(<= main_~i~0 31)} is VALID [2018-11-14 18:47:27,289 INFO L273 TraceCheckUtils]: 69: Hoare triple {10465#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10466#(<= main_~i~0 32)} is VALID [2018-11-14 18:47:27,289 INFO L273 TraceCheckUtils]: 70: Hoare triple {10466#(<= main_~i~0 32)} assume true; {10466#(<= main_~i~0 32)} is VALID [2018-11-14 18:47:27,290 INFO L273 TraceCheckUtils]: 71: Hoare triple {10466#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10467#(<= main_~i~0 33)} is VALID [2018-11-14 18:47:27,291 INFO L273 TraceCheckUtils]: 72: Hoare triple {10467#(<= main_~i~0 33)} assume true; {10467#(<= main_~i~0 33)} is VALID [2018-11-14 18:47:27,292 INFO L273 TraceCheckUtils]: 73: Hoare triple {10467#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10468#(<= main_~i~0 34)} is VALID [2018-11-14 18:47:27,292 INFO L273 TraceCheckUtils]: 74: Hoare triple {10468#(<= main_~i~0 34)} assume true; {10468#(<= main_~i~0 34)} is VALID [2018-11-14 18:47:27,293 INFO L273 TraceCheckUtils]: 75: Hoare triple {10468#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10469#(<= main_~i~0 35)} is VALID [2018-11-14 18:47:27,294 INFO L273 TraceCheckUtils]: 76: Hoare triple {10469#(<= main_~i~0 35)} assume true; {10469#(<= main_~i~0 35)} is VALID [2018-11-14 18:47:27,295 INFO L273 TraceCheckUtils]: 77: Hoare triple {10469#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10470#(<= main_~i~0 36)} is VALID [2018-11-14 18:47:27,295 INFO L273 TraceCheckUtils]: 78: Hoare triple {10470#(<= main_~i~0 36)} assume true; {10470#(<= main_~i~0 36)} is VALID [2018-11-14 18:47:27,296 INFO L273 TraceCheckUtils]: 79: Hoare triple {10470#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10471#(<= main_~i~0 37)} is VALID [2018-11-14 18:47:27,297 INFO L273 TraceCheckUtils]: 80: Hoare triple {10471#(<= main_~i~0 37)} assume true; {10471#(<= main_~i~0 37)} is VALID [2018-11-14 18:47:27,298 INFO L273 TraceCheckUtils]: 81: Hoare triple {10471#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10472#(<= main_~i~0 38)} is VALID [2018-11-14 18:47:27,298 INFO L273 TraceCheckUtils]: 82: Hoare triple {10472#(<= main_~i~0 38)} assume true; {10472#(<= main_~i~0 38)} is VALID [2018-11-14 18:47:27,299 INFO L273 TraceCheckUtils]: 83: Hoare triple {10472#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10473#(<= main_~i~0 39)} is VALID [2018-11-14 18:47:27,300 INFO L273 TraceCheckUtils]: 84: Hoare triple {10473#(<= main_~i~0 39)} assume true; {10473#(<= main_~i~0 39)} is VALID [2018-11-14 18:47:27,301 INFO L273 TraceCheckUtils]: 85: Hoare triple {10473#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10474#(<= main_~i~0 40)} is VALID [2018-11-14 18:47:27,301 INFO L273 TraceCheckUtils]: 86: Hoare triple {10474#(<= main_~i~0 40)} assume true; {10474#(<= main_~i~0 40)} is VALID [2018-11-14 18:47:27,302 INFO L273 TraceCheckUtils]: 87: Hoare triple {10474#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10475#(<= main_~i~0 41)} is VALID [2018-11-14 18:47:27,303 INFO L273 TraceCheckUtils]: 88: Hoare triple {10475#(<= main_~i~0 41)} assume true; {10475#(<= main_~i~0 41)} is VALID [2018-11-14 18:47:27,304 INFO L273 TraceCheckUtils]: 89: Hoare triple {10475#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10476#(<= main_~i~0 42)} is VALID [2018-11-14 18:47:27,305 INFO L273 TraceCheckUtils]: 90: Hoare triple {10476#(<= main_~i~0 42)} assume true; {10476#(<= main_~i~0 42)} is VALID [2018-11-14 18:47:27,305 INFO L273 TraceCheckUtils]: 91: Hoare triple {10476#(<= main_~i~0 42)} assume !(~i~0 < 100000); {10433#false} is VALID [2018-11-14 18:47:27,306 INFO L273 TraceCheckUtils]: 92: Hoare triple {10433#false} ~i~0 := 1; {10433#false} is VALID [2018-11-14 18:47:27,306 INFO L273 TraceCheckUtils]: 93: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 18:47:27,306 INFO L273 TraceCheckUtils]: 94: Hoare triple {10433#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {10433#false} is VALID [2018-11-14 18:47:27,306 INFO L273 TraceCheckUtils]: 95: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 18:47:27,306 INFO L273 TraceCheckUtils]: 96: Hoare triple {10433#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {10433#false} is VALID [2018-11-14 18:47:27,307 INFO L273 TraceCheckUtils]: 97: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 18:47:27,307 INFO L273 TraceCheckUtils]: 98: Hoare triple {10433#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {10433#false} is VALID [2018-11-14 18:47:27,307 INFO L273 TraceCheckUtils]: 99: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 18:47:27,307 INFO L273 TraceCheckUtils]: 100: Hoare triple {10433#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {10433#false} is VALID [2018-11-14 18:47:27,307 INFO L273 TraceCheckUtils]: 101: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 18:47:27,308 INFO L273 TraceCheckUtils]: 102: Hoare triple {10433#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {10433#false} is VALID [2018-11-14 18:47:27,308 INFO L273 TraceCheckUtils]: 103: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 18:47:27,308 INFO L273 TraceCheckUtils]: 104: Hoare triple {10433#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {10433#false} is VALID [2018-11-14 18:47:27,308 INFO L273 TraceCheckUtils]: 105: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 18:47:27,308 INFO L273 TraceCheckUtils]: 106: Hoare triple {10433#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {10433#false} is VALID [2018-11-14 18:47:27,309 INFO L273 TraceCheckUtils]: 107: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 18:47:27,309 INFO L273 TraceCheckUtils]: 108: Hoare triple {10433#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {10433#false} is VALID [2018-11-14 18:47:27,309 INFO L273 TraceCheckUtils]: 109: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 18:47:27,309 INFO L273 TraceCheckUtils]: 110: Hoare triple {10433#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 9;~j~0 := ~j~0 + 1; {10433#false} is VALID [2018-11-14 18:47:27,309 INFO L273 TraceCheckUtils]: 111: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 18:47:27,309 INFO L273 TraceCheckUtils]: 112: Hoare triple {10433#false} assume !(~i~0 < 100000); {10433#false} is VALID [2018-11-14 18:47:27,310 INFO L273 TraceCheckUtils]: 113: Hoare triple {10433#false} ~i~0 := 1;~j~0 := 0; {10433#false} is VALID [2018-11-14 18:47:27,310 INFO L273 TraceCheckUtils]: 114: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 18:47:27,310 INFO L273 TraceCheckUtils]: 115: Hoare triple {10433#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (9 * ~j~0 + 1) * 4, 4); {10433#false} is VALID [2018-11-14 18:47:27,310 INFO L256 TraceCheckUtils]: 116: Hoare triple {10433#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10433#false} is VALID [2018-11-14 18:47:27,310 INFO L273 TraceCheckUtils]: 117: Hoare triple {10433#false} ~cond := #in~cond; {10433#false} is VALID [2018-11-14 18:47:27,310 INFO L273 TraceCheckUtils]: 118: Hoare triple {10433#false} assume ~cond == 0; {10433#false} is VALID [2018-11-14 18:47:27,310 INFO L273 TraceCheckUtils]: 119: Hoare triple {10433#false} assume !false; {10433#false} is VALID [2018-11-14 18:47:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1896 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-14 18:47:27,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:47:27,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:47:27,329 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1