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.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 16:58:57,802 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:58:57,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:58:57,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:58:57,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:58:57,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:58:57,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:58:57,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:58:57,825 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:58:57,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:58:57,827 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:58:57,827 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:58:57,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:58:57,829 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:58:57,830 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:58:57,832 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:58:57,833 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:58:57,834 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:58:57,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:58:57,842 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:58:57,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:58:57,846 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:58:57,853 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:58:57,853 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:58:57,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:58:57,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:58:57,857 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:58:57,861 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:58:57,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:58:57,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:58:57,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:58:57,867 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:58:57,867 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:58:57,867 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:58:57,868 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:58:57,870 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:58:57,871 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 16:58:57,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:58:57,895 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:58:57,896 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:58:57,896 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:58:57,897 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:58:57,897 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:58:57,898 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:58:57,898 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:58:57,898 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:58:57,898 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:58:57,899 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:58:57,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:58:57,899 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:58:57,899 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:58:57,899 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:58:57,901 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:58:57,901 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:58:57,901 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:58:57,901 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:58:57,902 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:58:57,902 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:58:57,902 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:58:57,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:58:57,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:58:57,903 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:58:57,903 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:58:57,903 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:58:57,903 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:58:57,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:58:57,904 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:58:57,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:58:57,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:58:57,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:58:57,993 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:58:57,993 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:58:57,994 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 16:58:58,050 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd03acd8d/a5934efc2935401f990bd15580ad7d5b/FLAG345f2e1ae [2018-11-14 16:58:58,475 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:58:58,476 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_09_true-unreach-call.i [2018-11-14 16:58:58,482 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd03acd8d/a5934efc2935401f990bd15580ad7d5b/FLAG345f2e1ae [2018-11-14 16:58:58,497 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd03acd8d/a5934efc2935401f990bd15580ad7d5b [2018-11-14 16:58:58,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:58:58,508 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:58:58,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:58:58,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:58:58,513 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:58:58,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:58:58" (1/1) ... [2018-11-14 16:58:58,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278364e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:58, skipping insertion in model container [2018-11-14 16:58:58,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:58:58" (1/1) ... [2018-11-14 16:58:58,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:58:58,561 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:58:58,826 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:58:58,832 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:58:58,859 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:58:58,882 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:58:58,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:58 WrapperNode [2018-11-14 16:58:58,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:58:58,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:58:58,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:58:58,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:58:58,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:58" (1/1) ... [2018-11-14 16:58:58,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:58" (1/1) ... [2018-11-14 16:58:58,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:58" (1/1) ... [2018-11-14 16:58:58,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:58" (1/1) ... [2018-11-14 16:58:58,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:58" (1/1) ... [2018-11-14 16:58:58,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:58" (1/1) ... [2018-11-14 16:58:58,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:58" (1/1) ... [2018-11-14 16:58:58,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:58:58,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:58:58,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:58:58,931 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:58:58,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:58" (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 16:58:59,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:58:59,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:58:59,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:58:59,054 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:58:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:58:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:58:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:58:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:58:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:58:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:58:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:58:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:58:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:58:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:58:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:58:59,598 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:58:59,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:58:59 BoogieIcfgContainer [2018-11-14 16:58:59,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:58:59,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:58:59,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:58:59,603 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:58:59,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:58:58" (1/3) ... [2018-11-14 16:58:59,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cf622c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:58:59, skipping insertion in model container [2018-11-14 16:58:59,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:58" (2/3) ... [2018-11-14 16:58:59,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cf622c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:58:59, skipping insertion in model container [2018-11-14 16:58:59,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:58:59" (3/3) ... [2018-11-14 16:58:59,607 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_09_true-unreach-call.i [2018-11-14 16:58:59,615 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:58:59,622 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:58:59,639 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:58:59,673 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:58:59,674 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:58:59,674 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:58:59,674 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:58:59,674 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:58:59,675 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:58:59,675 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:58:59,675 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:58:59,675 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:58:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-14 16:58:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:58:59,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:59,703 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:59,705 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:59,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1015131587, now seen corresponding path program 1 times [2018-11-14 16:58:59,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:59,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:59,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:59,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:59,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:59,856 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-14 16:58:59,860 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 16:58:59,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-14 16:58:59,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-14 16:58:59,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret4 := main(); {30#true} is VALID [2018-11-14 16:58:59,862 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 16:58:59,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-14 16:58:59,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~i~0 := 1; {31#false} is VALID [2018-11-14 16:58:59,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !true; {31#false} is VALID [2018-11-14 16:58:59,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 1;~j~0 := 0; {31#false} is VALID [2018-11-14 16:58:59,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume true; {31#false} is VALID [2018-11-14 16:58:59,865 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 16:58:59,866 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 16:58:59,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-14 16:58:59,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume ~cond == 0; {31#false} is VALID [2018-11-14 16:58:59,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-14 16:58:59,870 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 16:58:59,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:58:59,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:58:59,879 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 16:58:59,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:59,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:58:59,991 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 16:58:59,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:58:59,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:59:00,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:59:00,003 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-14 16:59:00,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:00,344 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-14 16:59:00,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:59:00,344 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 16:59:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:00,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:59:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 16:59:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:59:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 16:59:00,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-14 16:59:00,537 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 16:59:00,548 INFO L225 Difference]: With dead ends: 46 [2018-11-14 16:59:00,549 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 16:59:00,552 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 16:59:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 16:59:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 16:59:00,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:00,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 16:59:00,701 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:59:00,701 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:59:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:00,705 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 16:59:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 16:59:00,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:00,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:00,707 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:59:00,707 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:59:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:00,711 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 16:59:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 16:59:00,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:00,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:00,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:00,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 16:59:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-14 16:59:00,717 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2018-11-14 16:59:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:00,717 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-14 16:59:00,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:59:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 16:59:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:59:00,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:00,719 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 16:59:00,719 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:00,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:00,720 INFO L82 PathProgramCache]: Analyzing trace with hash -669754579, now seen corresponding path program 1 times [2018-11-14 16:59:00,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:00,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:00,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:00,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:00,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:00,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2018-11-14 16:59:00,887 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 16:59:00,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2018-11-14 16:59:00,888 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #63#return; {168#true} is VALID [2018-11-14 16:59:00,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret4 := main(); {168#true} is VALID [2018-11-14 16:59:00,893 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 16:59:00,895 INFO L273 TraceCheckUtils]: 6: Hoare triple {170#(= main_~i~0 0)} assume true; {170#(= main_~i~0 0)} is VALID [2018-11-14 16:59:00,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {170#(= main_~i~0 0)} assume !(~i~0 < 100000); {169#false} is VALID [2018-11-14 16:59:00,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {169#false} ~i~0 := 1; {169#false} is VALID [2018-11-14 16:59:00,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {169#false} assume true; {169#false} is VALID [2018-11-14 16:59:00,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {169#false} assume !(~i~0 < 100000); {169#false} is VALID [2018-11-14 16:59:00,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {169#false} ~i~0 := 1;~j~0 := 0; {169#false} is VALID [2018-11-14 16:59:00,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {169#false} assume true; {169#false} is VALID [2018-11-14 16:59:00,898 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 16:59:00,898 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 16:59:00,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2018-11-14 16:59:00,899 INFO L273 TraceCheckUtils]: 16: Hoare triple {169#false} assume ~cond == 0; {169#false} is VALID [2018-11-14 16:59:00,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {169#false} assume !false; {169#false} is VALID [2018-11-14 16:59:00,905 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 16:59:00,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:59:00,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:59:00,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 16:59:00,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:00,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:59:00,951 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 16:59:00,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:59:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:59:00,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:59:00,952 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-14 16:59:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:01,107 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 16:59:01,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:59:01,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 16:59:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:59:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 16:59:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:59:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 16:59:01,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-14 16:59:01,468 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 16:59:01,470 INFO L225 Difference]: With dead ends: 38 [2018-11-14 16:59:01,470 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 16:59:01,471 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 16:59:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 16:59:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 16:59:01,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:01,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 16:59:01,615 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:59:01,615 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:59:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:01,618 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 16:59:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 16:59:01,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:01,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:01,619 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:59:01,619 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:59:01,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:01,622 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 16:59:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 16:59:01,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:01,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:01,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:01,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:59:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-14 16:59:01,626 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2018-11-14 16:59:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:01,626 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-14 16:59:01,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:59:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 16:59:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:59:01,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:01,628 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 16:59:01,628 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:01,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:01,628 INFO L82 PathProgramCache]: Analyzing trace with hash 619123155, now seen corresponding path program 1 times [2018-11-14 16:59:01,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:01,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:01,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:01,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2018-11-14 16:59:01,731 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 16:59:01,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-14 16:59:01,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #63#return; {307#true} is VALID [2018-11-14 16:59:01,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret4 := main(); {307#true} is VALID [2018-11-14 16:59:01,733 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 16:59:01,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-14 16:59:01,733 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 16:59:01,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-14 16:59:01,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {307#true} assume !(~i~0 < 100000); {307#true} is VALID [2018-11-14 16:59:01,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {307#true} ~i~0 := 1; {309#(= main_~i~0 1)} is VALID [2018-11-14 16:59:01,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {309#(= main_~i~0 1)} assume true; {309#(= main_~i~0 1)} is VALID [2018-11-14 16:59:01,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {309#(= main_~i~0 1)} assume !(~i~0 < 100000); {308#false} is VALID [2018-11-14 16:59:01,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {308#false} ~i~0 := 1;~j~0 := 0; {308#false} is VALID [2018-11-14 16:59:01,742 INFO L273 TraceCheckUtils]: 14: Hoare triple {308#false} assume true; {308#false} is VALID [2018-11-14 16:59:01,742 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 16:59:01,743 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 16:59:01,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2018-11-14 16:59:01,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {308#false} assume ~cond == 0; {308#false} is VALID [2018-11-14 16:59:01,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {308#false} assume !false; {308#false} is VALID [2018-11-14 16:59:01,746 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 16:59:01,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:59:01,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:59:01,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 16:59:01,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:01,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:59:01,834 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 16:59:01,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:59:01,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:59:01,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:59:01,835 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 3 states. [2018-11-14 16:59:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:02,035 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-14 16:59:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:59:02,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 16:59:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:59:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 16:59:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:59:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 16:59:02,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-14 16:59:02,152 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 16:59:02,155 INFO L225 Difference]: With dead ends: 41 [2018-11-14 16:59:02,156 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 16:59:02,156 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 16:59:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 16:59:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-14 16:59:02,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:02,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 26 states. [2018-11-14 16:59:02,171 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 26 states. [2018-11-14 16:59:02,171 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 26 states. [2018-11-14 16:59:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:02,176 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 16:59:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 16:59:02,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:02,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:02,177 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 30 states. [2018-11-14 16:59:02,177 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 30 states. [2018-11-14 16:59:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:02,181 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 16:59:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 16:59:02,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:02,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:02,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:02,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:59:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-14 16:59:02,185 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2018-11-14 16:59:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:02,185 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-14 16:59:02,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:59:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-14 16:59:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:59:02,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:02,186 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 16:59:02,187 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:02,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1402898029, now seen corresponding path program 1 times [2018-11-14 16:59:02,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:02,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:02,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:02,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:02,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:02,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-14 16:59:02,297 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 16:59:02,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-14 16:59:02,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #63#return; {466#true} is VALID [2018-11-14 16:59:02,298 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret4 := main(); {466#true} is VALID [2018-11-14 16:59:02,299 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 16:59:02,299 INFO L273 TraceCheckUtils]: 6: Hoare triple {468#(= main_~i~0 0)} assume true; {468#(= main_~i~0 0)} is VALID [2018-11-14 16:59:02,300 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 16:59:02,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(<= main_~i~0 1)} assume true; {469#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:02,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {469#(<= main_~i~0 1)} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-14 16:59:02,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#false} ~i~0 := 1; {467#false} is VALID [2018-11-14 16:59:02,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 16:59:02,305 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 16:59:02,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 16:59:02,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {467#false} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-14 16:59:02,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {467#false} ~i~0 := 1;~j~0 := 0; {467#false} is VALID [2018-11-14 16:59:02,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 16:59:02,307 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 16:59:02,307 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 16:59:02,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2018-11-14 16:59:02,308 INFO L273 TraceCheckUtils]: 20: Hoare triple {467#false} assume ~cond == 0; {467#false} is VALID [2018-11-14 16:59:02,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-14 16:59:02,309 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 16:59:02,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:02,310 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 16:59:02,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:02,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:02,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-14 16:59:02,539 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 16:59:02,539 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-14 16:59:02,539 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #63#return; {466#true} is VALID [2018-11-14 16:59:02,540 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret4 := main(); {466#true} is VALID [2018-11-14 16:59:02,541 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 16:59:02,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {488#(<= main_~i~0 0)} assume true; {488#(<= main_~i~0 0)} is VALID [2018-11-14 16:59:02,542 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 16:59:02,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(<= main_~i~0 1)} assume true; {469#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:02,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {469#(<= main_~i~0 1)} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-14 16:59:02,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#false} ~i~0 := 1; {467#false} is VALID [2018-11-14 16:59:02,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 16:59:02,544 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 16:59:02,544 INFO L273 TraceCheckUtils]: 13: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 16:59:02,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {467#false} assume !(~i~0 < 100000); {467#false} is VALID [2018-11-14 16:59:02,545 INFO L273 TraceCheckUtils]: 15: Hoare triple {467#false} ~i~0 := 1;~j~0 := 0; {467#false} is VALID [2018-11-14 16:59:02,546 INFO L273 TraceCheckUtils]: 16: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 16:59:02,546 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 16:59:02,547 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 16:59:02,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2018-11-14 16:59:02,547 INFO L273 TraceCheckUtils]: 20: Hoare triple {467#false} assume ~cond == 0; {467#false} is VALID [2018-11-14 16:59:02,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-14 16:59:02,549 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 16:59:02,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:02,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:59:02,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 16:59:02,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:02,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:59:02,633 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 16:59:02,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:59:02,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:59:02,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:59:02,634 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-14 16:59:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:02,979 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 16:59:02,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:59:02,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 16:59:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:59:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-14 16:59:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:59:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-14 16:59:02,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-14 16:59:03,076 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 16:59:03,078 INFO L225 Difference]: With dead ends: 48 [2018-11-14 16:59:03,078 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 16:59:03,079 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 16:59:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 16:59:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-11-14 16:59:03,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:03,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2018-11-14 16:59:03,115 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2018-11-14 16:59:03,116 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2018-11-14 16:59:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:03,119 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 16:59:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 16:59:03,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:03,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:03,121 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2018-11-14 16:59:03,121 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2018-11-14 16:59:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:03,124 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 16:59:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 16:59:03,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:03,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:03,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:03,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:59:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-14 16:59:03,127 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2018-11-14 16:59:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:03,127 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-14 16:59:03,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:59:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 16:59:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:59:03,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:03,129 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 16:59:03,129 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:03,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:03,130 INFO L82 PathProgramCache]: Analyzing trace with hash -179733997, now seen corresponding path program 2 times [2018-11-14 16:59:03,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:03,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:03,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:03,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:03,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:03,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2018-11-14 16:59:03,267 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 16:59:03,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2018-11-14 16:59:03,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #63#return; {707#true} is VALID [2018-11-14 16:59:03,268 INFO L256 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret4 := main(); {707#true} is VALID [2018-11-14 16:59:03,268 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 16:59:03,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {709#(= main_~i~0 0)} assume true; {709#(= main_~i~0 0)} is VALID [2018-11-14 16:59:03,270 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 16:59:03,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#(<= main_~i~0 1)} assume true; {710#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:03,276 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 16:59:03,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#(<= main_~i~0 2)} assume true; {711#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:03,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#(<= main_~i~0 2)} assume !(~i~0 < 100000); {708#false} is VALID [2018-11-14 16:59:03,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {708#false} ~i~0 := 1; {708#false} is VALID [2018-11-14 16:59:03,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 16:59:03,279 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 16:59:03,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 16:59:03,280 INFO L273 TraceCheckUtils]: 16: Hoare triple {708#false} assume !(~i~0 < 100000); {708#false} is VALID [2018-11-14 16:59:03,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {708#false} ~i~0 := 1;~j~0 := 0; {708#false} is VALID [2018-11-14 16:59:03,281 INFO L273 TraceCheckUtils]: 18: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 16:59:03,281 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 16:59:03,281 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 16:59:03,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {708#false} ~cond := #in~cond; {708#false} is VALID [2018-11-14 16:59:03,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {708#false} assume ~cond == 0; {708#false} is VALID [2018-11-14 16:59:03,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {708#false} assume !false; {708#false} is VALID [2018-11-14 16:59:03,283 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 16:59:03,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:03,284 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 16:59:03,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:59:03,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:59:03,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:03,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:03,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2018-11-14 16:59:03,458 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 16:59:03,458 INFO L273 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2018-11-14 16:59:03,459 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #63#return; {707#true} is VALID [2018-11-14 16:59:03,459 INFO L256 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret4 := main(); {707#true} is VALID [2018-11-14 16:59:03,460 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 16:59:03,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {730#(<= main_~i~0 0)} assume true; {730#(<= main_~i~0 0)} is VALID [2018-11-14 16:59:03,464 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 16:59:03,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#(<= main_~i~0 1)} assume true; {710#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:03,466 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 16:59:03,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#(<= main_~i~0 2)} assume true; {711#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:03,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#(<= main_~i~0 2)} assume !(~i~0 < 100000); {708#false} is VALID [2018-11-14 16:59:03,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {708#false} ~i~0 := 1; {708#false} is VALID [2018-11-14 16:59:03,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 16:59:03,467 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 16:59:03,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 16:59:03,468 INFO L273 TraceCheckUtils]: 16: Hoare triple {708#false} assume !(~i~0 < 100000); {708#false} is VALID [2018-11-14 16:59:03,468 INFO L273 TraceCheckUtils]: 17: Hoare triple {708#false} ~i~0 := 1;~j~0 := 0; {708#false} is VALID [2018-11-14 16:59:03,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 16:59:03,469 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 16:59:03,469 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 16:59:03,470 INFO L273 TraceCheckUtils]: 21: Hoare triple {708#false} ~cond := #in~cond; {708#false} is VALID [2018-11-14 16:59:03,470 INFO L273 TraceCheckUtils]: 22: Hoare triple {708#false} assume ~cond == 0; {708#false} is VALID [2018-11-14 16:59:03,470 INFO L273 TraceCheckUtils]: 23: Hoare triple {708#false} assume !false; {708#false} is VALID [2018-11-14 16:59:03,471 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 16:59:03,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:03,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 16:59:03,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 16:59:03,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:03,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:59:03,569 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 16:59:03,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:59:03,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:59:03,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:59:03,570 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2018-11-14 16:59:03,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:03,815 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-14 16:59:03,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:59:03,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 16:59:03,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:59:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 16:59:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:59:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 16:59:03,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-14 16:59:03,901 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 16:59:03,904 INFO L225 Difference]: With dead ends: 50 [2018-11-14 16:59:03,904 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 16:59:03,905 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 16:59:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 16:59:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-11-14 16:59:03,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:03,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 30 states. [2018-11-14 16:59:03,922 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 30 states. [2018-11-14 16:59:03,923 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 30 states. [2018-11-14 16:59:03,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:03,925 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:59:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:59:03,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:03,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:03,926 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 34 states. [2018-11-14 16:59:03,927 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 34 states. [2018-11-14 16:59:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:03,929 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:59:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:59:03,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:03,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:03,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:03,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:59:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-14 16:59:03,932 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2018-11-14 16:59:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:03,933 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-14 16:59:03,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:59:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-14 16:59:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:59:03,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:03,934 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 16:59:03,934 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:03,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash -670688199, now seen corresponding path program 3 times [2018-11-14 16:59:03,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:03,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:03,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:04,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {965#true} call ULTIMATE.init(); {965#true} is VALID [2018-11-14 16:59:04,063 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 16:59:04,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 16:59:04,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {965#true} {965#true} #63#return; {965#true} is VALID [2018-11-14 16:59:04,064 INFO L256 TraceCheckUtils]: 4: Hoare triple {965#true} call #t~ret4 := main(); {965#true} is VALID [2018-11-14 16:59:04,064 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 16:59:04,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {967#(= main_~i~0 0)} assume true; {967#(= main_~i~0 0)} is VALID [2018-11-14 16:59:04,066 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 16:59:04,067 INFO L273 TraceCheckUtils]: 8: Hoare triple {968#(<= main_~i~0 1)} assume true; {968#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:04,068 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 16:59:04,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {969#(<= main_~i~0 2)} assume true; {969#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:04,069 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 16:59:04,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {970#(<= main_~i~0 3)} assume true; {970#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:04,071 INFO L273 TraceCheckUtils]: 13: Hoare triple {970#(<= main_~i~0 3)} assume !(~i~0 < 100000); {966#false} is VALID [2018-11-14 16:59:04,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {966#false} ~i~0 := 1; {966#false} is VALID [2018-11-14 16:59:04,071 INFO L273 TraceCheckUtils]: 15: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 16:59:04,072 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 16:59:04,072 INFO L273 TraceCheckUtils]: 17: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 16:59:04,072 INFO L273 TraceCheckUtils]: 18: Hoare triple {966#false} assume !(~i~0 < 100000); {966#false} is VALID [2018-11-14 16:59:04,073 INFO L273 TraceCheckUtils]: 19: Hoare triple {966#false} ~i~0 := 1;~j~0 := 0; {966#false} is VALID [2018-11-14 16:59:04,073 INFO L273 TraceCheckUtils]: 20: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 16:59:04,073 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 16:59:04,074 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 16:59:04,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {966#false} ~cond := #in~cond; {966#false} is VALID [2018-11-14 16:59:04,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {966#false} assume ~cond == 0; {966#false} is VALID [2018-11-14 16:59:04,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {966#false} assume !false; {966#false} is VALID [2018-11-14 16:59:04,076 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 16:59:04,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:04,076 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 16:59:04,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:59:04,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 16:59:04,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:04,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:04,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {965#true} call ULTIMATE.init(); {965#true} is VALID [2018-11-14 16:59:04,188 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 16:59:04,189 INFO L273 TraceCheckUtils]: 2: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 16:59:04,189 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {965#true} {965#true} #63#return; {965#true} is VALID [2018-11-14 16:59:04,189 INFO L256 TraceCheckUtils]: 4: Hoare triple {965#true} call #t~ret4 := main(); {965#true} is VALID [2018-11-14 16:59:04,190 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 16:59:04,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 16:59:04,190 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 16:59:04,190 INFO L273 TraceCheckUtils]: 8: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 16:59:04,190 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 16:59:04,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 16:59:04,191 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 16:59:04,191 INFO L273 TraceCheckUtils]: 12: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 16:59:04,191 INFO L273 TraceCheckUtils]: 13: Hoare triple {965#true} assume !(~i~0 < 100000); {965#true} is VALID [2018-11-14 16:59:04,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {965#true} ~i~0 := 1; {968#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:04,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {968#(<= main_~i~0 1)} assume true; {968#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:04,195 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 16:59:04,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {1022#(<= main_~i~0 10)} assume true; {1022#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:04,196 INFO L273 TraceCheckUtils]: 18: Hoare triple {1022#(<= main_~i~0 10)} assume !(~i~0 < 100000); {966#false} is VALID [2018-11-14 16:59:04,197 INFO L273 TraceCheckUtils]: 19: Hoare triple {966#false} ~i~0 := 1;~j~0 := 0; {966#false} is VALID [2018-11-14 16:59:04,197 INFO L273 TraceCheckUtils]: 20: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 16:59:04,197 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 16:59:04,198 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 16:59:04,198 INFO L273 TraceCheckUtils]: 23: Hoare triple {966#false} ~cond := #in~cond; {966#false} is VALID [2018-11-14 16:59:04,199 INFO L273 TraceCheckUtils]: 24: Hoare triple {966#false} assume ~cond == 0; {966#false} is VALID [2018-11-14 16:59:04,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {966#false} assume !false; {966#false} is VALID [2018-11-14 16:59:04,200 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 16:59:04,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:04,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-11-14 16:59:04,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-14 16:59:04,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:04,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:59:04,357 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 16:59:04,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:59:04,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:59:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:59:04,359 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 7 states. [2018-11-14 16:59:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:04,618 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-14 16:59:04,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:59:04,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-14 16:59:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:59:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-14 16:59:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:59:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-14 16:59:04,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2018-11-14 16:59:04,763 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 16:59:04,765 INFO L225 Difference]: With dead ends: 60 [2018-11-14 16:59:04,765 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 16:59:04,765 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 16:59:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 16:59:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-11-14 16:59:04,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:04,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 36 states. [2018-11-14 16:59:04,801 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 36 states. [2018-11-14 16:59:04,802 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 36 states. [2018-11-14 16:59:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:04,804 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 16:59:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 16:59:04,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:04,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:04,805 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 44 states. [2018-11-14 16:59:04,806 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 44 states. [2018-11-14 16:59:04,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:04,808 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 16:59:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 16:59:04,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:04,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:04,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:04,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:59:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-14 16:59:04,812 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2018-11-14 16:59:04,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:04,812 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-14 16:59:04,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:59:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 16:59:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 16:59:04,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:04,814 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 16:59:04,814 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:04,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:04,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1044356127, now seen corresponding path program 4 times [2018-11-14 16:59:04,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:04,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:04,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:04,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:04,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:05,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {1274#true} call ULTIMATE.init(); {1274#true} is VALID [2018-11-14 16:59:05,121 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 16:59:05,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:59:05,121 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1274#true} {1274#true} #63#return; {1274#true} is VALID [2018-11-14 16:59:05,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {1274#true} call #t~ret4 := main(); {1274#true} is VALID [2018-11-14 16:59:05,123 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 16:59:05,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {1276#(= main_~i~0 0)} assume true; {1276#(= main_~i~0 0)} is VALID [2018-11-14 16:59:05,125 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 16:59:05,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {1277#(<= main_~i~0 1)} assume true; {1277#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:05,126 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 16:59:05,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {1278#(<= main_~i~0 2)} assume true; {1278#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:05,128 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 16:59:05,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {1279#(<= main_~i~0 3)} assume true; {1279#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:05,130 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 16:59:05,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {1280#(<= main_~i~0 4)} assume true; {1280#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:05,132 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 16:59:05,132 INFO L273 TraceCheckUtils]: 16: Hoare triple {1281#(<= main_~i~0 5)} assume true; {1281#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:05,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {1281#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1275#false} is VALID [2018-11-14 16:59:05,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {1275#false} ~i~0 := 1; {1275#false} is VALID [2018-11-14 16:59:05,134 INFO L273 TraceCheckUtils]: 19: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 16:59:05,134 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 16:59:05,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 16:59:05,135 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 16:59:05,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 16:59:05,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {1275#false} assume !(~i~0 < 100000); {1275#false} is VALID [2018-11-14 16:59:05,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {1275#false} ~i~0 := 1;~j~0 := 0; {1275#false} is VALID [2018-11-14 16:59:05,136 INFO L273 TraceCheckUtils]: 26: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 16:59:05,137 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 16:59:05,137 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 16:59:05,137 INFO L273 TraceCheckUtils]: 29: Hoare triple {1275#false} ~cond := #in~cond; {1275#false} is VALID [2018-11-14 16:59:05,138 INFO L273 TraceCheckUtils]: 30: Hoare triple {1275#false} assume ~cond == 0; {1275#false} is VALID [2018-11-14 16:59:05,138 INFO L273 TraceCheckUtils]: 31: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2018-11-14 16:59:05,140 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 16:59:05,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:05,141 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 16:59:05,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:59:05,186 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:59:05,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:05,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:05,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {1274#true} call ULTIMATE.init(); {1274#true} is VALID [2018-11-14 16:59:05,385 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 16:59:05,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:59:05,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1274#true} {1274#true} #63#return; {1274#true} is VALID [2018-11-14 16:59:05,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {1274#true} call #t~ret4 := main(); {1274#true} is VALID [2018-11-14 16:59:05,387 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 16:59:05,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:59:05,387 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 16:59:05,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:59:05,388 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 16:59:05,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:59:05,388 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 16:59:05,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:59:05,389 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 16:59:05,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:59:05,389 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 16:59:05,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:59:05,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {1274#true} assume !(~i~0 < 100000); {1274#true} is VALID [2018-11-14 16:59:05,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {1274#true} ~i~0 := 1; {1277#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:05,391 INFO L273 TraceCheckUtils]: 19: Hoare triple {1277#(<= main_~i~0 1)} assume true; {1277#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:05,392 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 16:59:05,393 INFO L273 TraceCheckUtils]: 21: Hoare triple {1345#(<= main_~i~0 10)} assume true; {1345#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:05,395 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 16:59:05,397 INFO L273 TraceCheckUtils]: 23: Hoare triple {1352#(<= main_~i~0 19)} assume true; {1352#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:05,399 INFO L273 TraceCheckUtils]: 24: Hoare triple {1352#(<= main_~i~0 19)} assume !(~i~0 < 100000); {1275#false} is VALID [2018-11-14 16:59:05,400 INFO L273 TraceCheckUtils]: 25: Hoare triple {1275#false} ~i~0 := 1;~j~0 := 0; {1275#false} is VALID [2018-11-14 16:59:05,400 INFO L273 TraceCheckUtils]: 26: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 16:59:05,401 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 16:59:05,401 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 16:59:05,401 INFO L273 TraceCheckUtils]: 29: Hoare triple {1275#false} ~cond := #in~cond; {1275#false} is VALID [2018-11-14 16:59:05,402 INFO L273 TraceCheckUtils]: 30: Hoare triple {1275#false} assume ~cond == 0; {1275#false} is VALID [2018-11-14 16:59:05,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2018-11-14 16:59:05,403 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 16:59:05,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:05,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-11-14 16:59:05,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-14 16:59:05,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:05,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:59:05,495 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 16:59:05,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:59:05,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:59:05,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:59:05,496 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-11-14 16:59:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:05,828 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-14 16:59:05,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:59:05,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-14 16:59:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:59:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-14 16:59:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:59:05,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-14 16:59:05,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2018-11-14 16:59:06,039 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 16:59:06,040 INFO L225 Difference]: With dead ends: 74 [2018-11-14 16:59:06,040 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 16:59:06,041 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 16:59:06,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 16:59:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2018-11-14 16:59:06,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:06,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 44 states. [2018-11-14 16:59:06,112 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 44 states. [2018-11-14 16:59:06,112 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 44 states. [2018-11-14 16:59:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:06,115 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-14 16:59:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-14 16:59:06,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:06,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:06,116 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 56 states. [2018-11-14 16:59:06,116 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 56 states. [2018-11-14 16:59:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:06,119 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-14 16:59:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-14 16:59:06,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:06,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:06,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:06,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:59:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-14 16:59:06,122 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 32 [2018-11-14 16:59:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:06,123 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-14 16:59:06,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:59:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-14 16:59:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 16:59:06,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:06,124 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 16:59:06,124 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:06,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:06,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2019436245, now seen corresponding path program 5 times [2018-11-14 16:59:06,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:06,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:06,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:06,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:06,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:06,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1661#true} is VALID [2018-11-14 16:59:06,374 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 16:59:06,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {1661#true} assume true; {1661#true} is VALID [2018-11-14 16:59:06,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1661#true} {1661#true} #63#return; {1661#true} is VALID [2018-11-14 16:59:06,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {1661#true} call #t~ret4 := main(); {1661#true} is VALID [2018-11-14 16:59:06,376 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 16:59:06,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {1663#(= main_~i~0 0)} assume true; {1663#(= main_~i~0 0)} is VALID [2018-11-14 16:59:06,377 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 16:59:06,378 INFO L273 TraceCheckUtils]: 8: Hoare triple {1664#(<= main_~i~0 1)} assume true; {1664#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:06,378 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 16:59:06,379 INFO L273 TraceCheckUtils]: 10: Hoare triple {1665#(<= main_~i~0 2)} assume true; {1665#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:06,379 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 16:59:06,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {1666#(<= main_~i~0 3)} assume true; {1666#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:06,381 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 16:59:06,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {1667#(<= main_~i~0 4)} assume true; {1667#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:06,383 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 16:59:06,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {1668#(<= main_~i~0 5)} assume true; {1668#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:06,385 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 16:59:06,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {1669#(<= main_~i~0 6)} assume true; {1669#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:06,387 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 16:59:06,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {1670#(<= main_~i~0 7)} assume true; {1670#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:06,389 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 16:59:06,390 INFO L273 TraceCheckUtils]: 22: Hoare triple {1671#(<= main_~i~0 8)} assume true; {1671#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:06,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {1671#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1662#false} is VALID [2018-11-14 16:59:06,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {1662#false} ~i~0 := 1; {1662#false} is VALID [2018-11-14 16:59:06,391 INFO L273 TraceCheckUtils]: 25: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:59:06,392 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 16:59:06,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:59:06,392 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 16:59:06,392 INFO L273 TraceCheckUtils]: 29: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:59:06,393 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 16:59:06,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:59:06,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {1662#false} assume !(~i~0 < 100000); {1662#false} is VALID [2018-11-14 16:59:06,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {1662#false} ~i~0 := 1;~j~0 := 0; {1662#false} is VALID [2018-11-14 16:59:06,393 INFO L273 TraceCheckUtils]: 34: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:59:06,393 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 16:59:06,394 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 16:59:06,394 INFO L273 TraceCheckUtils]: 37: Hoare triple {1662#false} ~cond := #in~cond; {1662#false} is VALID [2018-11-14 16:59:06,394 INFO L273 TraceCheckUtils]: 38: Hoare triple {1662#false} assume ~cond == 0; {1662#false} is VALID [2018-11-14 16:59:06,394 INFO L273 TraceCheckUtils]: 39: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2018-11-14 16:59:06,397 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 16:59:06,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:06,397 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 16:59:06,409 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:59:06,518 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-14 16:59:06,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:06,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:06,658 INFO L256 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1661#true} is VALID [2018-11-14 16:59:06,659 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 16:59:06,659 INFO L273 TraceCheckUtils]: 2: Hoare triple {1661#true} assume true; {1661#true} is VALID [2018-11-14 16:59:06,659 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1661#true} {1661#true} #63#return; {1661#true} is VALID [2018-11-14 16:59:06,659 INFO L256 TraceCheckUtils]: 4: Hoare triple {1661#true} call #t~ret4 := main(); {1661#true} is VALID [2018-11-14 16:59:06,661 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 16:59:06,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {1690#(<= main_~i~0 0)} assume true; {1690#(<= main_~i~0 0)} is VALID [2018-11-14 16:59:06,665 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 16:59:06,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {1664#(<= main_~i~0 1)} assume true; {1664#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:06,666 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 16:59:06,666 INFO L273 TraceCheckUtils]: 10: Hoare triple {1665#(<= main_~i~0 2)} assume true; {1665#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:06,667 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 16:59:06,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {1666#(<= main_~i~0 3)} assume true; {1666#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:06,669 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 16:59:06,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {1667#(<= main_~i~0 4)} assume true; {1667#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:06,671 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 16:59:06,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {1668#(<= main_~i~0 5)} assume true; {1668#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:06,673 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 16:59:06,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {1669#(<= main_~i~0 6)} assume true; {1669#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:06,675 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 16:59:06,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {1670#(<= main_~i~0 7)} assume true; {1670#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:06,677 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 16:59:06,677 INFO L273 TraceCheckUtils]: 22: Hoare triple {1671#(<= main_~i~0 8)} assume true; {1671#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:06,678 INFO L273 TraceCheckUtils]: 23: Hoare triple {1671#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1662#false} is VALID [2018-11-14 16:59:06,679 INFO L273 TraceCheckUtils]: 24: Hoare triple {1662#false} ~i~0 := 1; {1662#false} is VALID [2018-11-14 16:59:06,679 INFO L273 TraceCheckUtils]: 25: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:59:06,679 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 16:59:06,680 INFO L273 TraceCheckUtils]: 27: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:59:06,680 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 16:59:06,680 INFO L273 TraceCheckUtils]: 29: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:59:06,681 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 16:59:06,681 INFO L273 TraceCheckUtils]: 31: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:59:06,681 INFO L273 TraceCheckUtils]: 32: Hoare triple {1662#false} assume !(~i~0 < 100000); {1662#false} is VALID [2018-11-14 16:59:06,682 INFO L273 TraceCheckUtils]: 33: Hoare triple {1662#false} ~i~0 := 1;~j~0 := 0; {1662#false} is VALID [2018-11-14 16:59:06,682 INFO L273 TraceCheckUtils]: 34: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:59:06,682 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 16:59:06,683 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 16:59:06,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {1662#false} ~cond := #in~cond; {1662#false} is VALID [2018-11-14 16:59:06,683 INFO L273 TraceCheckUtils]: 38: Hoare triple {1662#false} assume ~cond == 0; {1662#false} is VALID [2018-11-14 16:59:06,684 INFO L273 TraceCheckUtils]: 39: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2018-11-14 16:59:06,686 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 16:59:06,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:06,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:59:06,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-14 16:59:06,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:06,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:59:06,803 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 16:59:06,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:59:06,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:59:06,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:59:06,805 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2018-11-14 16:59:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:07,278 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-14 16:59:07,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:59:07,278 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-14 16:59:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:07,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:59:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2018-11-14 16:59:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:59:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2018-11-14 16:59:07,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 65 transitions. [2018-11-14 16:59:07,374 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 16:59:07,377 INFO L225 Difference]: With dead ends: 70 [2018-11-14 16:59:07,377 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 16:59:07,378 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:59:07,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 16:59:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-14 16:59:07,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:07,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 46 states. [2018-11-14 16:59:07,410 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 46 states. [2018-11-14 16:59:07,411 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 46 states. [2018-11-14 16:59:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:07,413 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-14 16:59:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 16:59:07,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:07,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:07,414 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 50 states. [2018-11-14 16:59:07,414 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 50 states. [2018-11-14 16:59:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:07,417 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-14 16:59:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 16:59:07,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:07,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:07,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:07,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 16:59:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-14 16:59:07,419 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 40 [2018-11-14 16:59:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:07,420 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-14 16:59:07,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:59:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 16:59:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 16:59:07,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:07,421 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 16:59:07,422 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:07,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash -367956143, now seen corresponding path program 6 times [2018-11-14 16:59:07,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:07,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:07,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:07,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {2059#true} call ULTIMATE.init(); {2059#true} is VALID [2018-11-14 16:59:07,708 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 16:59:07,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 16:59:07,708 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2059#true} {2059#true} #63#return; {2059#true} is VALID [2018-11-14 16:59:07,708 INFO L256 TraceCheckUtils]: 4: Hoare triple {2059#true} call #t~ret4 := main(); {2059#true} is VALID [2018-11-14 16:59:07,709 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 16:59:07,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {2061#(= main_~i~0 0)} assume true; {2061#(= main_~i~0 0)} is VALID [2018-11-14 16:59:07,716 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 16:59:07,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {2062#(<= main_~i~0 1)} assume true; {2062#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:07,719 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 16:59:07,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {2063#(<= main_~i~0 2)} assume true; {2063#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:07,735 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 16:59:07,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {2064#(<= main_~i~0 3)} assume true; {2064#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:07,736 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 16:59:07,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {2065#(<= main_~i~0 4)} assume true; {2065#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:07,738 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 16:59:07,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {2066#(<= main_~i~0 5)} assume true; {2066#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:07,739 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 16:59:07,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {2067#(<= main_~i~0 6)} assume true; {2067#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:07,741 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 16:59:07,742 INFO L273 TraceCheckUtils]: 20: Hoare triple {2068#(<= main_~i~0 7)} assume true; {2068#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:07,743 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 16:59:07,743 INFO L273 TraceCheckUtils]: 22: Hoare triple {2069#(<= main_~i~0 8)} assume true; {2069#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:07,744 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 16:59:07,745 INFO L273 TraceCheckUtils]: 24: Hoare triple {2070#(<= main_~i~0 9)} assume true; {2070#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:07,746 INFO L273 TraceCheckUtils]: 25: Hoare triple {2070#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2060#false} is VALID [2018-11-14 16:59:07,746 INFO L273 TraceCheckUtils]: 26: Hoare triple {2060#false} ~i~0 := 1; {2060#false} is VALID [2018-11-14 16:59:07,746 INFO L273 TraceCheckUtils]: 27: Hoare triple {2060#false} assume true; {2060#false} is VALID [2018-11-14 16:59:07,746 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 16:59:07,747 INFO L273 TraceCheckUtils]: 29: Hoare triple {2060#false} assume true; {2060#false} is VALID [2018-11-14 16:59:07,747 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 16:59:07,748 INFO L273 TraceCheckUtils]: 31: Hoare triple {2060#false} assume true; {2060#false} is VALID [2018-11-14 16:59:07,748 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 16:59:07,749 INFO L273 TraceCheckUtils]: 33: Hoare triple {2060#false} assume true; {2060#false} is VALID [2018-11-14 16:59:07,749 INFO L273 TraceCheckUtils]: 34: Hoare triple {2060#false} assume !(~i~0 < 100000); {2060#false} is VALID [2018-11-14 16:59:07,749 INFO L273 TraceCheckUtils]: 35: Hoare triple {2060#false} ~i~0 := 1;~j~0 := 0; {2060#false} is VALID [2018-11-14 16:59:07,749 INFO L273 TraceCheckUtils]: 36: Hoare triple {2060#false} assume true; {2060#false} is VALID [2018-11-14 16:59:07,749 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 16:59:07,749 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 16:59:07,750 INFO L273 TraceCheckUtils]: 39: Hoare triple {2060#false} ~cond := #in~cond; {2060#false} is VALID [2018-11-14 16:59:07,750 INFO L273 TraceCheckUtils]: 40: Hoare triple {2060#false} assume ~cond == 0; {2060#false} is VALID [2018-11-14 16:59:07,750 INFO L273 TraceCheckUtils]: 41: Hoare triple {2060#false} assume !false; {2060#false} is VALID [2018-11-14 16:59:07,751 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 16:59:07,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:07,752 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 16:59:07,764 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:59:07,805 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 16:59:07,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:07,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:08,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {2059#true} call ULTIMATE.init(); {2059#true} is VALID [2018-11-14 16:59:08,037 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 16:59:08,037 INFO L273 TraceCheckUtils]: 2: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 16:59:08,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2059#true} {2059#true} #63#return; {2059#true} is VALID [2018-11-14 16:59:08,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {2059#true} call #t~ret4 := main(); {2059#true} is VALID [2018-11-14 16:59:08,037 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 16:59:08,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 16:59:08,038 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 16:59:08,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 16:59:08,038 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 16:59:08,038 INFO L273 TraceCheckUtils]: 10: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 16:59:08,038 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 16:59:08,039 INFO L273 TraceCheckUtils]: 12: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 16:59:08,039 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 16:59:08,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 16:59:08,039 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 16:59:08,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 16:59:08,040 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 16:59:08,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 16:59:08,040 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 16:59:08,040 INFO L273 TraceCheckUtils]: 20: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 16:59:08,040 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 16:59:08,041 INFO L273 TraceCheckUtils]: 22: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 16:59:08,041 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 16:59:08,041 INFO L273 TraceCheckUtils]: 24: Hoare triple {2059#true} assume true; {2059#true} is VALID [2018-11-14 16:59:08,041 INFO L273 TraceCheckUtils]: 25: Hoare triple {2059#true} assume !(~i~0 < 100000); {2059#true} is VALID [2018-11-14 16:59:08,052 INFO L273 TraceCheckUtils]: 26: Hoare triple {2059#true} ~i~0 := 1; {2062#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:08,053 INFO L273 TraceCheckUtils]: 27: Hoare triple {2062#(<= main_~i~0 1)} assume true; {2062#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:08,054 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 16:59:08,054 INFO L273 TraceCheckUtils]: 29: Hoare triple {2158#(<= main_~i~0 10)} assume true; {2158#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:08,055 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 16:59:08,055 INFO L273 TraceCheckUtils]: 31: Hoare triple {2165#(<= main_~i~0 19)} assume true; {2165#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:08,056 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 16:59:08,056 INFO L273 TraceCheckUtils]: 33: Hoare triple {2172#(<= main_~i~0 28)} assume true; {2172#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:08,057 INFO L273 TraceCheckUtils]: 34: Hoare triple {2172#(<= main_~i~0 28)} assume !(~i~0 < 100000); {2060#false} is VALID [2018-11-14 16:59:08,057 INFO L273 TraceCheckUtils]: 35: Hoare triple {2060#false} ~i~0 := 1;~j~0 := 0; {2060#false} is VALID [2018-11-14 16:59:08,057 INFO L273 TraceCheckUtils]: 36: Hoare triple {2060#false} assume true; {2060#false} is VALID [2018-11-14 16:59:08,057 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 16:59:08,058 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 16:59:08,058 INFO L273 TraceCheckUtils]: 39: Hoare triple {2060#false} ~cond := #in~cond; {2060#false} is VALID [2018-11-14 16:59:08,058 INFO L273 TraceCheckUtils]: 40: Hoare triple {2060#false} assume ~cond == 0; {2060#false} is VALID [2018-11-14 16:59:08,058 INFO L273 TraceCheckUtils]: 41: Hoare triple {2060#false} assume !false; {2060#false} is VALID [2018-11-14 16:59:08,060 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 16:59:08,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:08,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 15 [2018-11-14 16:59:08,082 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-11-14 16:59:08,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:08,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:59:08,149 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 16:59:08,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:59:08,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:59:08,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:59:08,150 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 15 states. [2018-11-14 16:59:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:08,712 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-11-14 16:59:08,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 16:59:08,712 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-11-14 16:59:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:59:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 98 transitions. [2018-11-14 16:59:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:59:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 98 transitions. [2018-11-14 16:59:08,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 98 transitions. [2018-11-14 16:59:08,865 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 16:59:08,868 INFO L225 Difference]: With dead ends: 92 [2018-11-14 16:59:08,868 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 16:59:08,869 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 16:59:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 16:59:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2018-11-14 16:59:08,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:08,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 56 states. [2018-11-14 16:59:08,893 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 56 states. [2018-11-14 16:59:08,893 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 56 states. [2018-11-14 16:59:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:08,896 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-14 16:59:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-11-14 16:59:08,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:08,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:08,897 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 72 states. [2018-11-14 16:59:08,897 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 72 states. [2018-11-14 16:59:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:08,900 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-14 16:59:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-11-14 16:59:08,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:08,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:08,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:08,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 16:59:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-14 16:59:08,903 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 42 [2018-11-14 16:59:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:08,903 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-14 16:59:08,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:59:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-14 16:59:08,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 16:59:08,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:08,904 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 16:59:08,904 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:08,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:08,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1081597949, now seen corresponding path program 7 times [2018-11-14 16:59:08,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:08,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:08,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:08,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:08,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:09,315 INFO L256 TraceCheckUtils]: 0: Hoare triple {2558#true} call ULTIMATE.init(); {2558#true} is VALID [2018-11-14 16:59:09,315 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 16:59:09,316 INFO L273 TraceCheckUtils]: 2: Hoare triple {2558#true} assume true; {2558#true} is VALID [2018-11-14 16:59:09,316 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2558#true} {2558#true} #63#return; {2558#true} is VALID [2018-11-14 16:59:09,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {2558#true} call #t~ret4 := main(); {2558#true} is VALID [2018-11-14 16:59:09,317 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 16:59:09,317 INFO L273 TraceCheckUtils]: 6: Hoare triple {2560#(= main_~i~0 0)} assume true; {2560#(= main_~i~0 0)} is VALID [2018-11-14 16:59:09,318 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 16:59:09,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {2561#(<= main_~i~0 1)} assume true; {2561#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:09,319 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 16:59:09,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {2562#(<= main_~i~0 2)} assume true; {2562#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:09,320 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 16:59:09,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {2563#(<= main_~i~0 3)} assume true; {2563#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:09,322 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 16:59:09,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {2564#(<= main_~i~0 4)} assume true; {2564#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:09,323 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 16:59:09,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {2565#(<= main_~i~0 5)} assume true; {2565#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:09,325 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 16:59:09,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {2566#(<= main_~i~0 6)} assume true; {2566#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:09,327 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 16:59:09,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {2567#(<= main_~i~0 7)} assume true; {2567#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:09,328 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 16:59:09,329 INFO L273 TraceCheckUtils]: 22: Hoare triple {2568#(<= main_~i~0 8)} assume true; {2568#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:09,330 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 16:59:09,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {2569#(<= main_~i~0 9)} assume true; {2569#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:09,332 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 16:59:09,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {2570#(<= main_~i~0 10)} assume true; {2570#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:09,333 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 16:59:09,334 INFO L273 TraceCheckUtils]: 28: Hoare triple {2571#(<= main_~i~0 11)} assume true; {2571#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:09,335 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 16:59:09,336 INFO L273 TraceCheckUtils]: 30: Hoare triple {2572#(<= main_~i~0 12)} assume true; {2572#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:09,337 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 16:59:09,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {2573#(<= main_~i~0 13)} assume true; {2573#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:09,338 INFO L273 TraceCheckUtils]: 33: Hoare triple {2573#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2559#false} is VALID [2018-11-14 16:59:09,338 INFO L273 TraceCheckUtils]: 34: Hoare triple {2559#false} ~i~0 := 1; {2559#false} is VALID [2018-11-14 16:59:09,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 16:59:09,339 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 16:59:09,339 INFO L273 TraceCheckUtils]: 37: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 16:59:09,339 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 16:59:09,339 INFO L273 TraceCheckUtils]: 39: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 16:59:09,340 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 16:59:09,340 INFO L273 TraceCheckUtils]: 41: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 16:59:09,340 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 16:59:09,340 INFO L273 TraceCheckUtils]: 43: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 16:59:09,340 INFO L273 TraceCheckUtils]: 44: Hoare triple {2559#false} assume !(~i~0 < 100000); {2559#false} is VALID [2018-11-14 16:59:09,341 INFO L273 TraceCheckUtils]: 45: Hoare triple {2559#false} ~i~0 := 1;~j~0 := 0; {2559#false} is VALID [2018-11-14 16:59:09,341 INFO L273 TraceCheckUtils]: 46: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 16:59:09,341 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 16:59:09,341 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 16:59:09,341 INFO L273 TraceCheckUtils]: 49: Hoare triple {2559#false} ~cond := #in~cond; {2559#false} is VALID [2018-11-14 16:59:09,342 INFO L273 TraceCheckUtils]: 50: Hoare triple {2559#false} assume ~cond == 0; {2559#false} is VALID [2018-11-14 16:59:09,342 INFO L273 TraceCheckUtils]: 51: Hoare triple {2559#false} assume !false; {2559#false} is VALID [2018-11-14 16:59:09,344 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 16:59:09,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:09,345 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 16:59:09,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:09,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:09,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {2558#true} call ULTIMATE.init(); {2558#true} is VALID [2018-11-14 16:59:09,861 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 16:59:09,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {2558#true} assume true; {2558#true} is VALID [2018-11-14 16:59:09,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2558#true} {2558#true} #63#return; {2558#true} is VALID [2018-11-14 16:59:09,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {2558#true} call #t~ret4 := main(); {2558#true} is VALID [2018-11-14 16:59:09,863 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 16:59:09,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {2592#(<= main_~i~0 0)} assume true; {2592#(<= main_~i~0 0)} is VALID [2018-11-14 16:59:09,865 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 16:59:09,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {2561#(<= main_~i~0 1)} assume true; {2561#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:09,866 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 16:59:09,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {2562#(<= main_~i~0 2)} assume true; {2562#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:09,868 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 16:59:09,869 INFO L273 TraceCheckUtils]: 12: Hoare triple {2563#(<= main_~i~0 3)} assume true; {2563#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:09,870 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 16:59:09,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {2564#(<= main_~i~0 4)} assume true; {2564#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:09,872 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 16:59:09,872 INFO L273 TraceCheckUtils]: 16: Hoare triple {2565#(<= main_~i~0 5)} assume true; {2565#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:09,874 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 16:59:09,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {2566#(<= main_~i~0 6)} assume true; {2566#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:09,876 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 16:59:09,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {2567#(<= main_~i~0 7)} assume true; {2567#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:09,877 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 16:59:09,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {2568#(<= main_~i~0 8)} assume true; {2568#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:09,879 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 16:59:09,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {2569#(<= main_~i~0 9)} assume true; {2569#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:09,881 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 16:59:09,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {2570#(<= main_~i~0 10)} assume true; {2570#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:09,883 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 16:59:09,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {2571#(<= main_~i~0 11)} assume true; {2571#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:09,885 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 16:59:09,886 INFO L273 TraceCheckUtils]: 30: Hoare triple {2572#(<= main_~i~0 12)} assume true; {2572#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:09,887 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 16:59:09,887 INFO L273 TraceCheckUtils]: 32: Hoare triple {2573#(<= main_~i~0 13)} assume true; {2573#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:09,888 INFO L273 TraceCheckUtils]: 33: Hoare triple {2573#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2559#false} is VALID [2018-11-14 16:59:09,889 INFO L273 TraceCheckUtils]: 34: Hoare triple {2559#false} ~i~0 := 1; {2559#false} is VALID [2018-11-14 16:59:09,889 INFO L273 TraceCheckUtils]: 35: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 16:59:09,889 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 16:59:09,890 INFO L273 TraceCheckUtils]: 37: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 16:59:09,890 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 16:59:09,890 INFO L273 TraceCheckUtils]: 39: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 16:59:09,891 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 16:59:09,891 INFO L273 TraceCheckUtils]: 41: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 16:59:09,891 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 16:59:09,892 INFO L273 TraceCheckUtils]: 43: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 16:59:09,892 INFO L273 TraceCheckUtils]: 44: Hoare triple {2559#false} assume !(~i~0 < 100000); {2559#false} is VALID [2018-11-14 16:59:09,892 INFO L273 TraceCheckUtils]: 45: Hoare triple {2559#false} ~i~0 := 1;~j~0 := 0; {2559#false} is VALID [2018-11-14 16:59:09,892 INFO L273 TraceCheckUtils]: 46: Hoare triple {2559#false} assume true; {2559#false} is VALID [2018-11-14 16:59:09,892 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 16:59:09,893 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 16:59:09,893 INFO L273 TraceCheckUtils]: 49: Hoare triple {2559#false} ~cond := #in~cond; {2559#false} is VALID [2018-11-14 16:59:09,893 INFO L273 TraceCheckUtils]: 50: Hoare triple {2559#false} assume ~cond == 0; {2559#false} is VALID [2018-11-14 16:59:09,893 INFO L273 TraceCheckUtils]: 51: Hoare triple {2559#false} assume !false; {2559#false} is VALID [2018-11-14 16:59:09,895 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 16:59:09,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:09,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 16:59:09,920 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-14 16:59:09,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:09,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:59:10,027 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 16:59:10,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:59:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:59:10,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:59:10,028 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 17 states. [2018-11-14 16:59:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:10,593 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-14 16:59:10,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:59:10,593 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-14 16:59:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:59:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 82 transitions. [2018-11-14 16:59:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:59:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 82 transitions. [2018-11-14 16:59:10,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 82 transitions. [2018-11-14 16:59:10,702 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 16:59:10,704 INFO L225 Difference]: With dead ends: 88 [2018-11-14 16:59:10,704 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 16:59:10,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:59:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 16:59:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-11-14 16:59:10,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:10,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 58 states. [2018-11-14 16:59:10,733 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 58 states. [2018-11-14 16:59:10,733 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 58 states. [2018-11-14 16:59:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:10,736 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 16:59:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 16:59:10,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:10,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:10,737 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 66 states. [2018-11-14 16:59:10,737 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 66 states. [2018-11-14 16:59:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:10,739 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 16:59:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 16:59:10,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:10,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:10,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:10,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 16:59:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-14 16:59:10,742 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 52 [2018-11-14 16:59:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:10,742 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-14 16:59:10,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:59:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-14 16:59:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 16:59:10,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:10,743 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 16:59:10,743 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:10,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:10,744 INFO L82 PathProgramCache]: Analyzing trace with hash 549039401, now seen corresponding path program 8 times [2018-11-14 16:59:10,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:10,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:10,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:10,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:10,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:11,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {3074#true} call ULTIMATE.init(); {3074#true} is VALID [2018-11-14 16:59:11,000 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 16:59:11,001 INFO L273 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2018-11-14 16:59:11,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3074#true} #63#return; {3074#true} is VALID [2018-11-14 16:59:11,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {3074#true} call #t~ret4 := main(); {3074#true} is VALID [2018-11-14 16:59:11,002 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 16:59:11,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {3076#(= main_~i~0 0)} assume true; {3076#(= main_~i~0 0)} is VALID [2018-11-14 16:59:11,003 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 16:59:11,004 INFO L273 TraceCheckUtils]: 8: Hoare triple {3077#(<= main_~i~0 1)} assume true; {3077#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:11,004 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 16:59:11,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {3078#(<= main_~i~0 2)} assume true; {3078#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:11,005 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 16:59:11,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {3079#(<= main_~i~0 3)} assume true; {3079#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:11,007 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 16:59:11,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {3080#(<= main_~i~0 4)} assume true; {3080#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:11,008 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 16:59:11,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {3081#(<= main_~i~0 5)} assume true; {3081#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:11,010 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 16:59:11,010 INFO L273 TraceCheckUtils]: 18: Hoare triple {3082#(<= main_~i~0 6)} assume true; {3082#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:11,011 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 16:59:11,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {3083#(<= main_~i~0 7)} assume true; {3083#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:11,013 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 16:59:11,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {3084#(<= main_~i~0 8)} assume true; {3084#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:11,015 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 16:59:11,032 INFO L273 TraceCheckUtils]: 24: Hoare triple {3085#(<= main_~i~0 9)} assume true; {3085#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:11,034 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 16:59:11,035 INFO L273 TraceCheckUtils]: 26: Hoare triple {3086#(<= main_~i~0 10)} assume true; {3086#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:11,035 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 16:59:11,036 INFO L273 TraceCheckUtils]: 28: Hoare triple {3087#(<= main_~i~0 11)} assume true; {3087#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:11,036 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 16:59:11,037 INFO L273 TraceCheckUtils]: 30: Hoare triple {3088#(<= main_~i~0 12)} assume true; {3088#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:11,037 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 16:59:11,038 INFO L273 TraceCheckUtils]: 32: Hoare triple {3089#(<= main_~i~0 13)} assume true; {3089#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:11,039 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 16:59:11,039 INFO L273 TraceCheckUtils]: 34: Hoare triple {3090#(<= main_~i~0 14)} assume true; {3090#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:11,040 INFO L273 TraceCheckUtils]: 35: Hoare triple {3090#(<= main_~i~0 14)} assume !(~i~0 < 100000); {3075#false} is VALID [2018-11-14 16:59:11,040 INFO L273 TraceCheckUtils]: 36: Hoare triple {3075#false} ~i~0 := 1; {3075#false} is VALID [2018-11-14 16:59:11,040 INFO L273 TraceCheckUtils]: 37: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 16:59:11,041 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 16:59:11,041 INFO L273 TraceCheckUtils]: 39: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 16:59:11,041 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 16:59:11,041 INFO L273 TraceCheckUtils]: 41: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 16:59:11,042 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 16:59:11,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 16:59:11,042 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 16:59:11,042 INFO L273 TraceCheckUtils]: 45: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 16:59:11,042 INFO L273 TraceCheckUtils]: 46: Hoare triple {3075#false} assume !(~i~0 < 100000); {3075#false} is VALID [2018-11-14 16:59:11,042 INFO L273 TraceCheckUtils]: 47: Hoare triple {3075#false} ~i~0 := 1;~j~0 := 0; {3075#false} is VALID [2018-11-14 16:59:11,043 INFO L273 TraceCheckUtils]: 48: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 16:59:11,043 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 16:59:11,043 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 16:59:11,043 INFO L273 TraceCheckUtils]: 51: Hoare triple {3075#false} ~cond := #in~cond; {3075#false} is VALID [2018-11-14 16:59:11,043 INFO L273 TraceCheckUtils]: 52: Hoare triple {3075#false} assume ~cond == 0; {3075#false} is VALID [2018-11-14 16:59:11,043 INFO L273 TraceCheckUtils]: 53: Hoare triple {3075#false} assume !false; {3075#false} is VALID [2018-11-14 16:59:11,047 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 16:59:11,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:11,048 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 16:59:11,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:59:11,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:59:11,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:11,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:11,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {3074#true} call ULTIMATE.init(); {3074#true} is VALID [2018-11-14 16:59:11,311 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 16:59:11,311 INFO L273 TraceCheckUtils]: 2: Hoare triple {3074#true} assume true; {3074#true} is VALID [2018-11-14 16:59:11,311 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3074#true} {3074#true} #63#return; {3074#true} is VALID [2018-11-14 16:59:11,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {3074#true} call #t~ret4 := main(); {3074#true} is VALID [2018-11-14 16:59:11,312 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 16:59:11,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {3109#(<= main_~i~0 0)} assume true; {3109#(<= main_~i~0 0)} is VALID [2018-11-14 16:59:11,313 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 16:59:11,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {3077#(<= main_~i~0 1)} assume true; {3077#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:11,314 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 16:59:11,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {3078#(<= main_~i~0 2)} assume true; {3078#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:11,315 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 16:59:11,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {3079#(<= main_~i~0 3)} assume true; {3079#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:11,317 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 16:59:11,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {3080#(<= main_~i~0 4)} assume true; {3080#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:11,318 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 16:59:11,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {3081#(<= main_~i~0 5)} assume true; {3081#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:11,320 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 16:59:11,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {3082#(<= main_~i~0 6)} assume true; {3082#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:11,321 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 16:59:11,322 INFO L273 TraceCheckUtils]: 20: Hoare triple {3083#(<= main_~i~0 7)} assume true; {3083#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:11,323 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 16:59:11,323 INFO L273 TraceCheckUtils]: 22: Hoare triple {3084#(<= main_~i~0 8)} assume true; {3084#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:11,324 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 16:59:11,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {3085#(<= main_~i~0 9)} assume true; {3085#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:11,330 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 16:59:11,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {3086#(<= main_~i~0 10)} assume true; {3086#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:11,331 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 16:59:11,332 INFO L273 TraceCheckUtils]: 28: Hoare triple {3087#(<= main_~i~0 11)} assume true; {3087#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:11,332 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 16:59:11,333 INFO L273 TraceCheckUtils]: 30: Hoare triple {3088#(<= main_~i~0 12)} assume true; {3088#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:11,334 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 16:59:11,334 INFO L273 TraceCheckUtils]: 32: Hoare triple {3089#(<= main_~i~0 13)} assume true; {3089#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:11,335 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 16:59:11,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {3090#(<= main_~i~0 14)} assume true; {3090#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:11,336 INFO L273 TraceCheckUtils]: 35: Hoare triple {3090#(<= main_~i~0 14)} assume !(~i~0 < 100000); {3075#false} is VALID [2018-11-14 16:59:11,337 INFO L273 TraceCheckUtils]: 36: Hoare triple {3075#false} ~i~0 := 1; {3075#false} is VALID [2018-11-14 16:59:11,337 INFO L273 TraceCheckUtils]: 37: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 16:59:11,337 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 16:59:11,337 INFO L273 TraceCheckUtils]: 39: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 16:59:11,338 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 16:59:11,338 INFO L273 TraceCheckUtils]: 41: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 16:59:11,338 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 16:59:11,338 INFO L273 TraceCheckUtils]: 43: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 16:59:11,338 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 16:59:11,339 INFO L273 TraceCheckUtils]: 45: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 16:59:11,339 INFO L273 TraceCheckUtils]: 46: Hoare triple {3075#false} assume !(~i~0 < 100000); {3075#false} is VALID [2018-11-14 16:59:11,339 INFO L273 TraceCheckUtils]: 47: Hoare triple {3075#false} ~i~0 := 1;~j~0 := 0; {3075#false} is VALID [2018-11-14 16:59:11,339 INFO L273 TraceCheckUtils]: 48: Hoare triple {3075#false} assume true; {3075#false} is VALID [2018-11-14 16:59:11,340 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 16:59:11,340 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 16:59:11,340 INFO L273 TraceCheckUtils]: 51: Hoare triple {3075#false} ~cond := #in~cond; {3075#false} is VALID [2018-11-14 16:59:11,340 INFO L273 TraceCheckUtils]: 52: Hoare triple {3075#false} assume ~cond == 0; {3075#false} is VALID [2018-11-14 16:59:11,340 INFO L273 TraceCheckUtils]: 53: Hoare triple {3075#false} assume !false; {3075#false} is VALID [2018-11-14 16:59:11,343 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 16:59:11,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:11,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 16:59:11,364 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-11-14 16:59:11,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:11,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 16:59:11,432 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 16:59:11,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 16:59:11,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 16:59:11,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:59:11,432 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 18 states. [2018-11-14 16:59:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:11,938 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-11-14 16:59:11,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:59:11,938 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-11-14 16:59:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:59:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2018-11-14 16:59:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:59:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2018-11-14 16:59:11,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 84 transitions. [2018-11-14 16:59:12,059 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 16:59:12,061 INFO L225 Difference]: With dead ends: 90 [2018-11-14 16:59:12,061 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 16:59:12,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:59:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 16:59:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-11-14 16:59:12,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:12,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 60 states. [2018-11-14 16:59:12,098 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 60 states. [2018-11-14 16:59:12,098 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 60 states. [2018-11-14 16:59:12,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:12,099 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-14 16:59:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 16:59:12,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:12,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:12,100 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 68 states. [2018-11-14 16:59:12,100 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 68 states. [2018-11-14 16:59:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:12,102 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-14 16:59:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 16:59:12,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:12,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:12,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:12,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 16:59:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-14 16:59:12,105 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 54 [2018-11-14 16:59:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:12,105 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-14 16:59:12,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 16:59:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-14 16:59:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 16:59:12,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:12,106 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 16:59:12,107 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:12,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:12,107 INFO L82 PathProgramCache]: Analyzing trace with hash -71530289, now seen corresponding path program 9 times [2018-11-14 16:59:12,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:12,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:12,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:12,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:12,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:12,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {3607#true} call ULTIMATE.init(); {3607#true} is VALID [2018-11-14 16:59:12,461 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 16:59:12,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,461 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3607#true} {3607#true} #63#return; {3607#true} is VALID [2018-11-14 16:59:12,461 INFO L256 TraceCheckUtils]: 4: Hoare triple {3607#true} call #t~ret4 := main(); {3607#true} is VALID [2018-11-14 16:59:12,462 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 16:59:12,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {3609#(= main_~i~0 0)} assume true; {3609#(= main_~i~0 0)} is VALID [2018-11-14 16:59:12,463 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 16:59:12,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {3610#(<= main_~i~0 1)} assume true; {3610#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:12,464 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 16:59:12,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {3611#(<= main_~i~0 2)} assume true; {3611#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:12,465 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 16:59:12,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {3612#(<= main_~i~0 3)} assume true; {3612#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:12,467 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 16:59:12,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {3613#(<= main_~i~0 4)} assume true; {3613#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:12,469 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 16:59:12,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {3614#(<= main_~i~0 5)} assume true; {3614#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:12,470 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 16:59:12,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {3615#(<= main_~i~0 6)} assume true; {3615#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:12,472 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 16:59:12,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {3616#(<= main_~i~0 7)} assume true; {3616#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:12,473 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 16:59:12,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {3617#(<= main_~i~0 8)} assume true; {3617#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:12,475 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 16:59:12,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {3618#(<= main_~i~0 9)} assume true; {3618#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:12,477 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 16:59:12,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {3619#(<= main_~i~0 10)} assume true; {3619#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:12,478 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 16:59:12,479 INFO L273 TraceCheckUtils]: 28: Hoare triple {3620#(<= main_~i~0 11)} assume true; {3620#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:12,480 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 16:59:12,480 INFO L273 TraceCheckUtils]: 30: Hoare triple {3621#(<= main_~i~0 12)} assume true; {3621#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:12,481 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 16:59:12,482 INFO L273 TraceCheckUtils]: 32: Hoare triple {3622#(<= main_~i~0 13)} assume true; {3622#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:12,483 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 16:59:12,483 INFO L273 TraceCheckUtils]: 34: Hoare triple {3623#(<= main_~i~0 14)} assume true; {3623#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:12,484 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 16:59:12,485 INFO L273 TraceCheckUtils]: 36: Hoare triple {3624#(<= main_~i~0 15)} assume true; {3624#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:12,486 INFO L273 TraceCheckUtils]: 37: Hoare triple {3624#(<= main_~i~0 15)} assume !(~i~0 < 100000); {3608#false} is VALID [2018-11-14 16:59:12,486 INFO L273 TraceCheckUtils]: 38: Hoare triple {3608#false} ~i~0 := 1; {3608#false} is VALID [2018-11-14 16:59:12,486 INFO L273 TraceCheckUtils]: 39: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 16:59:12,486 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 16:59:12,487 INFO L273 TraceCheckUtils]: 41: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 16:59:12,487 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 16:59:12,487 INFO L273 TraceCheckUtils]: 43: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 16:59:12,487 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 16:59:12,487 INFO L273 TraceCheckUtils]: 45: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 16:59:12,488 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 16:59:12,488 INFO L273 TraceCheckUtils]: 47: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 16:59:12,488 INFO L273 TraceCheckUtils]: 48: Hoare triple {3608#false} assume !(~i~0 < 100000); {3608#false} is VALID [2018-11-14 16:59:12,488 INFO L273 TraceCheckUtils]: 49: Hoare triple {3608#false} ~i~0 := 1;~j~0 := 0; {3608#false} is VALID [2018-11-14 16:59:12,489 INFO L273 TraceCheckUtils]: 50: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 16:59:12,489 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 16:59:12,489 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 16:59:12,490 INFO L273 TraceCheckUtils]: 53: Hoare triple {3608#false} ~cond := #in~cond; {3608#false} is VALID [2018-11-14 16:59:12,490 INFO L273 TraceCheckUtils]: 54: Hoare triple {3608#false} assume ~cond == 0; {3608#false} is VALID [2018-11-14 16:59:12,490 INFO L273 TraceCheckUtils]: 55: Hoare triple {3608#false} assume !false; {3608#false} is VALID [2018-11-14 16:59:12,493 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 16:59:12,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:12,493 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 16:59:12,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:59:12,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 16:59:12,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:12,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:12,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {3607#true} call ULTIMATE.init(); {3607#true} is VALID [2018-11-14 16:59:12,700 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 16:59:12,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3607#true} {3607#true} #63#return; {3607#true} is VALID [2018-11-14 16:59:12,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {3607#true} call #t~ret4 := main(); {3607#true} is VALID [2018-11-14 16:59:12,701 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 16:59:12,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,702 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 16:59:12,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,702 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 16:59:12,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,703 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 16:59:12,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,703 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 16:59:12,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,703 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 16:59:12,703 INFO L273 TraceCheckUtils]: 16: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,704 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 16:59:12,704 INFO L273 TraceCheckUtils]: 18: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,704 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 16:59:12,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,704 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 16:59:12,704 INFO L273 TraceCheckUtils]: 22: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,704 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 16:59:12,705 INFO L273 TraceCheckUtils]: 24: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,705 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 16:59:12,705 INFO L273 TraceCheckUtils]: 26: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,705 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 16:59:12,705 INFO L273 TraceCheckUtils]: 28: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,705 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 16:59:12,706 INFO L273 TraceCheckUtils]: 30: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,706 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 16:59:12,706 INFO L273 TraceCheckUtils]: 32: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,706 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 16:59:12,707 INFO L273 TraceCheckUtils]: 34: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,707 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 16:59:12,707 INFO L273 TraceCheckUtils]: 36: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-14 16:59:12,707 INFO L273 TraceCheckUtils]: 37: Hoare triple {3607#true} assume !(~i~0 < 100000); {3607#true} is VALID [2018-11-14 16:59:12,722 INFO L273 TraceCheckUtils]: 38: Hoare triple {3607#true} ~i~0 := 1; {3610#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:12,723 INFO L273 TraceCheckUtils]: 39: Hoare triple {3610#(<= main_~i~0 1)} assume true; {3610#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:12,724 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 16:59:12,724 INFO L273 TraceCheckUtils]: 41: Hoare triple {3619#(<= main_~i~0 10)} assume true; {3619#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:12,725 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 16:59:12,735 INFO L273 TraceCheckUtils]: 43: Hoare triple {3754#(<= main_~i~0 19)} assume true; {3754#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:12,736 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 16:59:12,737 INFO L273 TraceCheckUtils]: 45: Hoare triple {3761#(<= main_~i~0 28)} assume true; {3761#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:12,737 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 16:59:12,739 INFO L273 TraceCheckUtils]: 47: Hoare triple {3768#(<= main_~i~0 37)} assume true; {3768#(<= main_~i~0 37)} is VALID [2018-11-14 16:59:12,739 INFO L273 TraceCheckUtils]: 48: Hoare triple {3768#(<= main_~i~0 37)} assume !(~i~0 < 100000); {3608#false} is VALID [2018-11-14 16:59:12,739 INFO L273 TraceCheckUtils]: 49: Hoare triple {3608#false} ~i~0 := 1;~j~0 := 0; {3608#false} is VALID [2018-11-14 16:59:12,740 INFO L273 TraceCheckUtils]: 50: Hoare triple {3608#false} assume true; {3608#false} is VALID [2018-11-14 16:59:12,740 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 16:59:12,740 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 16:59:12,740 INFO L273 TraceCheckUtils]: 53: Hoare triple {3608#false} ~cond := #in~cond; {3608#false} is VALID [2018-11-14 16:59:12,741 INFO L273 TraceCheckUtils]: 54: Hoare triple {3608#false} assume ~cond == 0; {3608#false} is VALID [2018-11-14 16:59:12,741 INFO L273 TraceCheckUtils]: 55: Hoare triple {3608#false} assume !false; {3608#false} is VALID [2018-11-14 16:59:12,745 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 16:59:12,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:12,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 21 [2018-11-14 16:59:12,766 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-11-14 16:59:12,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:12,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 16:59:12,834 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 16:59:12,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 16:59:12,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 16:59:12,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:59:12,836 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 21 states. [2018-11-14 16:59:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:13,801 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-11-14 16:59:13,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 16:59:13,801 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-11-14 16:59:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:59:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 117 transitions. [2018-11-14 16:59:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:59:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 117 transitions. [2018-11-14 16:59:13,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 117 transitions. [2018-11-14 16:59:13,973 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 16:59:13,976 INFO L225 Difference]: With dead ends: 112 [2018-11-14 16:59:13,976 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 16:59:13,977 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 16:59:13,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 16:59:14,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-11-14 16:59:14,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:14,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 70 states. [2018-11-14 16:59:14,016 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 70 states. [2018-11-14 16:59:14,016 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 70 states. [2018-11-14 16:59:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:14,019 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-11-14 16:59:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-11-14 16:59:14,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:14,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:14,020 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 90 states. [2018-11-14 16:59:14,020 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 90 states. [2018-11-14 16:59:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:14,023 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-11-14 16:59:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-11-14 16:59:14,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:14,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:14,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:14,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 16:59:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-11-14 16:59:14,025 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 56 [2018-11-14 16:59:14,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:14,026 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-14 16:59:14,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 16:59:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-14 16:59:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-14 16:59:14,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:14,027 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 16:59:14,027 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:14,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:14,027 INFO L82 PathProgramCache]: Analyzing trace with hash -641685503, now seen corresponding path program 10 times [2018-11-14 16:59:14,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:14,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:14,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:14,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:14,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:15,008 INFO L256 TraceCheckUtils]: 0: Hoare triple {4241#true} call ULTIMATE.init(); {4241#true} is VALID [2018-11-14 16:59:15,009 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 16:59:15,009 INFO L273 TraceCheckUtils]: 2: Hoare triple {4241#true} assume true; {4241#true} is VALID [2018-11-14 16:59:15,009 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4241#true} {4241#true} #63#return; {4241#true} is VALID [2018-11-14 16:59:15,009 INFO L256 TraceCheckUtils]: 4: Hoare triple {4241#true} call #t~ret4 := main(); {4241#true} is VALID [2018-11-14 16:59:15,010 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 16:59:15,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {4243#(= main_~i~0 0)} assume true; {4243#(= main_~i~0 0)} is VALID [2018-11-14 16:59:15,011 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 16:59:15,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {4244#(<= main_~i~0 1)} assume true; {4244#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:15,012 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 16:59:15,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {4245#(<= main_~i~0 2)} assume true; {4245#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:15,013 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 16:59:15,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {4246#(<= main_~i~0 3)} assume true; {4246#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:15,015 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 16:59:15,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {4247#(<= main_~i~0 4)} assume true; {4247#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:15,016 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 16:59:15,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {4248#(<= main_~i~0 5)} assume true; {4248#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:15,018 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 16:59:15,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {4249#(<= main_~i~0 6)} assume true; {4249#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:15,020 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 16:59:15,020 INFO L273 TraceCheckUtils]: 20: Hoare triple {4250#(<= main_~i~0 7)} assume true; {4250#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:15,021 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 16:59:15,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {4251#(<= main_~i~0 8)} assume true; {4251#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:15,023 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 16:59:15,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {4252#(<= main_~i~0 9)} assume true; {4252#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:15,024 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 16:59:15,025 INFO L273 TraceCheckUtils]: 26: Hoare triple {4253#(<= main_~i~0 10)} assume true; {4253#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:15,044 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 16:59:15,060 INFO L273 TraceCheckUtils]: 28: Hoare triple {4254#(<= main_~i~0 11)} assume true; {4254#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:15,076 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 16:59:15,085 INFO L273 TraceCheckUtils]: 30: Hoare triple {4255#(<= main_~i~0 12)} assume true; {4255#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:15,098 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 16:59:15,098 INFO L273 TraceCheckUtils]: 32: Hoare triple {4256#(<= main_~i~0 13)} assume true; {4256#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:15,099 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 16:59:15,099 INFO L273 TraceCheckUtils]: 34: Hoare triple {4257#(<= main_~i~0 14)} assume true; {4257#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:15,117 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 16:59:15,126 INFO L273 TraceCheckUtils]: 36: Hoare triple {4258#(<= main_~i~0 15)} assume true; {4258#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:15,134 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 16:59:15,135 INFO L273 TraceCheckUtils]: 38: Hoare triple {4259#(<= main_~i~0 16)} assume true; {4259#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:15,136 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 16:59:15,136 INFO L273 TraceCheckUtils]: 40: Hoare triple {4260#(<= main_~i~0 17)} assume true; {4260#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:15,139 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 16:59:15,139 INFO L273 TraceCheckUtils]: 42: Hoare triple {4261#(<= main_~i~0 18)} assume true; {4261#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:15,140 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 16:59:15,140 INFO L273 TraceCheckUtils]: 44: Hoare triple {4262#(<= main_~i~0 19)} assume true; {4262#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:15,140 INFO L273 TraceCheckUtils]: 45: Hoare triple {4262#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4242#false} is VALID [2018-11-14 16:59:15,140 INFO L273 TraceCheckUtils]: 46: Hoare triple {4242#false} ~i~0 := 1; {4242#false} is VALID [2018-11-14 16:59:15,141 INFO L273 TraceCheckUtils]: 47: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,141 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 16:59:15,141 INFO L273 TraceCheckUtils]: 49: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,141 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 16:59:15,141 INFO L273 TraceCheckUtils]: 51: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,141 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 16:59:15,141 INFO L273 TraceCheckUtils]: 53: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,141 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 16:59:15,142 INFO L273 TraceCheckUtils]: 55: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,142 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 16:59:15,142 INFO L273 TraceCheckUtils]: 57: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,142 INFO L273 TraceCheckUtils]: 58: Hoare triple {4242#false} assume !(~i~0 < 100000); {4242#false} is VALID [2018-11-14 16:59:15,142 INFO L273 TraceCheckUtils]: 59: Hoare triple {4242#false} ~i~0 := 1;~j~0 := 0; {4242#false} is VALID [2018-11-14 16:59:15,142 INFO L273 TraceCheckUtils]: 60: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,142 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 16:59:15,142 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 16:59:15,142 INFO L273 TraceCheckUtils]: 63: Hoare triple {4242#false} ~cond := #in~cond; {4242#false} is VALID [2018-11-14 16:59:15,143 INFO L273 TraceCheckUtils]: 64: Hoare triple {4242#false} assume ~cond == 0; {4242#false} is VALID [2018-11-14 16:59:15,143 INFO L273 TraceCheckUtils]: 65: Hoare triple {4242#false} assume !false; {4242#false} is VALID [2018-11-14 16:59:15,145 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 16:59:15,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:15,146 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 16:59:15,156 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:59:15,193 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:59:15,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:15,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:15,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {4241#true} call ULTIMATE.init(); {4241#true} is VALID [2018-11-14 16:59:15,384 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 16:59:15,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {4241#true} assume true; {4241#true} is VALID [2018-11-14 16:59:15,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4241#true} {4241#true} #63#return; {4241#true} is VALID [2018-11-14 16:59:15,385 INFO L256 TraceCheckUtils]: 4: Hoare triple {4241#true} call #t~ret4 := main(); {4241#true} is VALID [2018-11-14 16:59:15,385 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 16:59:15,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {4281#(<= main_~i~0 0)} assume true; {4281#(<= main_~i~0 0)} is VALID [2018-11-14 16:59:15,386 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 16:59:15,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {4244#(<= main_~i~0 1)} assume true; {4244#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:15,387 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 16:59:15,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {4245#(<= main_~i~0 2)} assume true; {4245#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:15,389 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 16:59:15,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {4246#(<= main_~i~0 3)} assume true; {4246#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:15,390 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 16:59:15,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {4247#(<= main_~i~0 4)} assume true; {4247#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:15,392 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 16:59:15,393 INFO L273 TraceCheckUtils]: 16: Hoare triple {4248#(<= main_~i~0 5)} assume true; {4248#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:15,394 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 16:59:15,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {4249#(<= main_~i~0 6)} assume true; {4249#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:15,395 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 16:59:15,396 INFO L273 TraceCheckUtils]: 20: Hoare triple {4250#(<= main_~i~0 7)} assume true; {4250#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:15,397 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 16:59:15,397 INFO L273 TraceCheckUtils]: 22: Hoare triple {4251#(<= main_~i~0 8)} assume true; {4251#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:15,398 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 16:59:15,399 INFO L273 TraceCheckUtils]: 24: Hoare triple {4252#(<= main_~i~0 9)} assume true; {4252#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:15,400 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 16:59:15,400 INFO L273 TraceCheckUtils]: 26: Hoare triple {4253#(<= main_~i~0 10)} assume true; {4253#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:15,401 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 16:59:15,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {4254#(<= main_~i~0 11)} assume true; {4254#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:15,403 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 16:59:15,403 INFO L273 TraceCheckUtils]: 30: Hoare triple {4255#(<= main_~i~0 12)} assume true; {4255#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:15,404 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 16:59:15,405 INFO L273 TraceCheckUtils]: 32: Hoare triple {4256#(<= main_~i~0 13)} assume true; {4256#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:15,406 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 16:59:15,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {4257#(<= main_~i~0 14)} assume true; {4257#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:15,407 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 16:59:15,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {4258#(<= main_~i~0 15)} assume true; {4258#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:15,409 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 16:59:15,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {4259#(<= main_~i~0 16)} assume true; {4259#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:15,411 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 16:59:15,411 INFO L273 TraceCheckUtils]: 40: Hoare triple {4260#(<= main_~i~0 17)} assume true; {4260#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:15,412 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 16:59:15,413 INFO L273 TraceCheckUtils]: 42: Hoare triple {4261#(<= main_~i~0 18)} assume true; {4261#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:15,414 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 16:59:15,414 INFO L273 TraceCheckUtils]: 44: Hoare triple {4262#(<= main_~i~0 19)} assume true; {4262#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:15,415 INFO L273 TraceCheckUtils]: 45: Hoare triple {4262#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4242#false} is VALID [2018-11-14 16:59:15,415 INFO L273 TraceCheckUtils]: 46: Hoare triple {4242#false} ~i~0 := 1; {4242#false} is VALID [2018-11-14 16:59:15,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,416 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 16:59:15,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,416 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 16:59:15,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,416 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 16:59:15,417 INFO L273 TraceCheckUtils]: 53: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,417 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 16:59:15,417 INFO L273 TraceCheckUtils]: 55: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,417 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 16:59:15,417 INFO L273 TraceCheckUtils]: 57: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,418 INFO L273 TraceCheckUtils]: 58: Hoare triple {4242#false} assume !(~i~0 < 100000); {4242#false} is VALID [2018-11-14 16:59:15,418 INFO L273 TraceCheckUtils]: 59: Hoare triple {4242#false} ~i~0 := 1;~j~0 := 0; {4242#false} is VALID [2018-11-14 16:59:15,418 INFO L273 TraceCheckUtils]: 60: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 16:59:15,418 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 16:59:15,418 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 16:59:15,418 INFO L273 TraceCheckUtils]: 63: Hoare triple {4242#false} ~cond := #in~cond; {4242#false} is VALID [2018-11-14 16:59:15,418 INFO L273 TraceCheckUtils]: 64: Hoare triple {4242#false} assume ~cond == 0; {4242#false} is VALID [2018-11-14 16:59:15,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {4242#false} assume !false; {4242#false} is VALID [2018-11-14 16:59:15,422 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 16:59:15,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:15,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 16:59:15,444 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-11-14 16:59:15,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:15,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 16:59:15,497 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 16:59:15,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 16:59:15,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 16:59:15,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:59:15,499 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 23 states. [2018-11-14 16:59:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:16,110 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2018-11-14 16:59:16,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 16:59:16,110 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-11-14 16:59:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:59:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 101 transitions. [2018-11-14 16:59:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:59:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 101 transitions. [2018-11-14 16:59:16,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 101 transitions. [2018-11-14 16:59:16,652 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 16:59:16,654 INFO L225 Difference]: With dead ends: 108 [2018-11-14 16:59:16,655 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 16:59:16,656 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:59:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 16:59:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2018-11-14 16:59:17,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:17,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 72 states. [2018-11-14 16:59:17,247 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 72 states. [2018-11-14 16:59:17,247 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 72 states. [2018-11-14 16:59:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:17,249 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-14 16:59:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-14 16:59:17,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:17,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:17,250 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 84 states. [2018-11-14 16:59:17,250 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 84 states. [2018-11-14 16:59:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:17,253 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-14 16:59:17,253 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-14 16:59:17,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:17,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:17,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:17,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 16:59:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-11-14 16:59:17,255 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 66 [2018-11-14 16:59:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:17,256 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-11-14 16:59:17,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 16:59:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-14 16:59:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-14 16:59:17,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:17,257 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 16:59:17,257 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:17,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash 21576359, now seen corresponding path program 11 times [2018-11-14 16:59:17,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:17,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:17,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:17,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:18,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {4892#true} call ULTIMATE.init(); {4892#true} is VALID [2018-11-14 16:59:18,820 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 16:59:18,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:18,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4892#true} {4892#true} #63#return; {4892#true} is VALID [2018-11-14 16:59:18,821 INFO L256 TraceCheckUtils]: 4: Hoare triple {4892#true} call #t~ret4 := main(); {4892#true} is VALID [2018-11-14 16:59:18,821 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 16:59:18,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {4894#(= main_~i~0 0)} assume true; {4894#(= main_~i~0 0)} is VALID [2018-11-14 16:59:18,822 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 16:59:18,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {4895#(<= main_~i~0 1)} assume true; {4895#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:18,823 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 16:59:18,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {4896#(<= main_~i~0 2)} assume true; {4896#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:18,824 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 16:59:18,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {4897#(<= main_~i~0 3)} assume true; {4897#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:18,826 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 16:59:18,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {4898#(<= main_~i~0 4)} assume true; {4898#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:18,827 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 16:59:18,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {4899#(<= main_~i~0 5)} assume true; {4899#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:18,829 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 16:59:18,829 INFO L273 TraceCheckUtils]: 18: Hoare triple {4900#(<= main_~i~0 6)} assume true; {4900#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:18,830 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 16:59:18,831 INFO L273 TraceCheckUtils]: 20: Hoare triple {4901#(<= main_~i~0 7)} assume true; {4901#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:18,832 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 16:59:18,832 INFO L273 TraceCheckUtils]: 22: Hoare triple {4902#(<= main_~i~0 8)} assume true; {4902#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:18,833 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 16:59:18,833 INFO L273 TraceCheckUtils]: 24: Hoare triple {4903#(<= main_~i~0 9)} assume true; {4903#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:18,834 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 16:59:18,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {4904#(<= main_~i~0 10)} assume true; {4904#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:18,836 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 16:59:18,836 INFO L273 TraceCheckUtils]: 28: Hoare triple {4905#(<= main_~i~0 11)} assume true; {4905#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:18,837 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 16:59:18,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {4906#(<= main_~i~0 12)} assume true; {4906#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:18,839 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 16:59:18,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {4907#(<= main_~i~0 13)} assume true; {4907#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:18,840 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 16:59:18,841 INFO L273 TraceCheckUtils]: 34: Hoare triple {4908#(<= main_~i~0 14)} assume true; {4908#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:18,842 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 16:59:18,842 INFO L273 TraceCheckUtils]: 36: Hoare triple {4909#(<= main_~i~0 15)} assume true; {4909#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:18,843 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 16:59:18,844 INFO L273 TraceCheckUtils]: 38: Hoare triple {4910#(<= main_~i~0 16)} assume true; {4910#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:18,845 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 16:59:18,846 INFO L273 TraceCheckUtils]: 40: Hoare triple {4911#(<= main_~i~0 17)} assume true; {4911#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:18,847 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 16:59:18,847 INFO L273 TraceCheckUtils]: 42: Hoare triple {4912#(<= main_~i~0 18)} assume true; {4912#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:18,848 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 16:59:18,849 INFO L273 TraceCheckUtils]: 44: Hoare triple {4913#(<= main_~i~0 19)} assume true; {4913#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:18,850 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 16:59:18,850 INFO L273 TraceCheckUtils]: 46: Hoare triple {4914#(<= main_~i~0 20)} assume true; {4914#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:18,851 INFO L273 TraceCheckUtils]: 47: Hoare triple {4914#(<= main_~i~0 20)} assume !(~i~0 < 100000); {4893#false} is VALID [2018-11-14 16:59:18,851 INFO L273 TraceCheckUtils]: 48: Hoare triple {4893#false} ~i~0 := 1; {4893#false} is VALID [2018-11-14 16:59:18,851 INFO L273 TraceCheckUtils]: 49: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 16:59:18,852 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 16:59:18,852 INFO L273 TraceCheckUtils]: 51: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 16:59:18,852 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 16:59:18,852 INFO L273 TraceCheckUtils]: 53: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 16:59:18,852 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 16:59:18,853 INFO L273 TraceCheckUtils]: 55: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 16:59:18,853 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 16:59:18,853 INFO L273 TraceCheckUtils]: 57: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 16:59:18,853 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 16:59:18,853 INFO L273 TraceCheckUtils]: 59: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 16:59:18,854 INFO L273 TraceCheckUtils]: 60: Hoare triple {4893#false} assume !(~i~0 < 100000); {4893#false} is VALID [2018-11-14 16:59:18,854 INFO L273 TraceCheckUtils]: 61: Hoare triple {4893#false} ~i~0 := 1;~j~0 := 0; {4893#false} is VALID [2018-11-14 16:59:18,854 INFO L273 TraceCheckUtils]: 62: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 16:59:18,854 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 16:59:18,854 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 16:59:18,855 INFO L273 TraceCheckUtils]: 65: Hoare triple {4893#false} ~cond := #in~cond; {4893#false} is VALID [2018-11-14 16:59:18,855 INFO L273 TraceCheckUtils]: 66: Hoare triple {4893#false} assume ~cond == 0; {4893#false} is VALID [2018-11-14 16:59:18,855 INFO L273 TraceCheckUtils]: 67: Hoare triple {4893#false} assume !false; {4893#false} is VALID [2018-11-14 16:59:18,858 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 16:59:18,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:18,858 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 16:59:18,868 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:59:19,763 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-11-14 16:59:19,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:19,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:19,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {4892#true} call ULTIMATE.init(); {4892#true} is VALID [2018-11-14 16:59:19,914 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 16:59:19,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4892#true} {4892#true} #63#return; {4892#true} is VALID [2018-11-14 16:59:19,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {4892#true} call #t~ret4 := main(); {4892#true} is VALID [2018-11-14 16:59:19,915 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 16:59:19,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,915 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 16:59:19,916 INFO L273 TraceCheckUtils]: 8: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,916 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 16:59:19,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,916 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 16:59:19,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,916 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 16:59:19,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,916 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 16:59:19,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,917 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 16:59:19,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,917 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 16:59:19,917 INFO L273 TraceCheckUtils]: 20: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,917 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 16:59:19,917 INFO L273 TraceCheckUtils]: 22: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,917 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 16:59:19,918 INFO L273 TraceCheckUtils]: 24: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,918 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 16:59:19,918 INFO L273 TraceCheckUtils]: 26: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,918 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 16:59:19,918 INFO L273 TraceCheckUtils]: 28: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,918 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 16:59:19,918 INFO L273 TraceCheckUtils]: 30: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,918 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 16:59:19,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,919 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 16:59:19,919 INFO L273 TraceCheckUtils]: 34: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,919 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 16:59:19,919 INFO L273 TraceCheckUtils]: 36: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,919 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 16:59:19,919 INFO L273 TraceCheckUtils]: 38: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,919 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 16:59:19,919 INFO L273 TraceCheckUtils]: 40: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,920 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 16:59:19,920 INFO L273 TraceCheckUtils]: 42: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,920 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 16:59:19,920 INFO L273 TraceCheckUtils]: 44: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,920 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 16:59:19,920 INFO L273 TraceCheckUtils]: 46: Hoare triple {4892#true} assume true; {4892#true} is VALID [2018-11-14 16:59:19,920 INFO L273 TraceCheckUtils]: 47: Hoare triple {4892#true} assume !(~i~0 < 100000); {4892#true} is VALID [2018-11-14 16:59:19,921 INFO L273 TraceCheckUtils]: 48: Hoare triple {4892#true} ~i~0 := 1; {4895#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:19,921 INFO L273 TraceCheckUtils]: 49: Hoare triple {4895#(<= main_~i~0 1)} assume true; {4895#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:19,922 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 16:59:19,922 INFO L273 TraceCheckUtils]: 51: Hoare triple {4904#(<= main_~i~0 10)} assume true; {4904#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:19,923 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 16:59:19,923 INFO L273 TraceCheckUtils]: 53: Hoare triple {4913#(<= main_~i~0 19)} assume true; {4913#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:19,924 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 16:59:19,924 INFO L273 TraceCheckUtils]: 55: Hoare triple {5080#(<= main_~i~0 28)} assume true; {5080#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:19,925 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 16:59:19,926 INFO L273 TraceCheckUtils]: 57: Hoare triple {5087#(<= main_~i~0 37)} assume true; {5087#(<= main_~i~0 37)} is VALID [2018-11-14 16:59:19,927 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 16:59:19,927 INFO L273 TraceCheckUtils]: 59: Hoare triple {5094#(<= main_~i~0 46)} assume true; {5094#(<= main_~i~0 46)} is VALID [2018-11-14 16:59:19,928 INFO L273 TraceCheckUtils]: 60: Hoare triple {5094#(<= main_~i~0 46)} assume !(~i~0 < 100000); {4893#false} is VALID [2018-11-14 16:59:19,928 INFO L273 TraceCheckUtils]: 61: Hoare triple {4893#false} ~i~0 := 1;~j~0 := 0; {4893#false} is VALID [2018-11-14 16:59:19,928 INFO L273 TraceCheckUtils]: 62: Hoare triple {4893#false} assume true; {4893#false} is VALID [2018-11-14 16:59:19,928 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 16:59:19,929 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 16:59:19,929 INFO L273 TraceCheckUtils]: 65: Hoare triple {4893#false} ~cond := #in~cond; {4893#false} is VALID [2018-11-14 16:59:19,929 INFO L273 TraceCheckUtils]: 66: Hoare triple {4893#false} assume ~cond == 0; {4893#false} is VALID [2018-11-14 16:59:19,929 INFO L273 TraceCheckUtils]: 67: Hoare triple {4893#false} assume !false; {4893#false} is VALID [2018-11-14 16:59:19,934 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 16:59:19,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:19,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8] total 26 [2018-11-14 16:59:19,955 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 68 [2018-11-14 16:59:19,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:19,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 16:59:20,028 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 16:59:20,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 16:59:20,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 16:59:20,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:59:20,030 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 26 states. [2018-11-14 16:59:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:20,931 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-11-14 16:59:20,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 16:59:20,932 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 68 [2018-11-14 16:59:20,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:59:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 134 transitions. [2018-11-14 16:59:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:59:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 134 transitions. [2018-11-14 16:59:20,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 134 transitions. [2018-11-14 16:59:21,516 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 16:59:21,519 INFO L225 Difference]: With dead ends: 130 [2018-11-14 16:59:21,519 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 16:59:21,520 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:59:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 16:59:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2018-11-14 16:59:21,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:21,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 82 states. [2018-11-14 16:59:21,559 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 82 states. [2018-11-14 16:59:21,559 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 82 states. [2018-11-14 16:59:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:21,563 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-14 16:59:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-11-14 16:59:21,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:21,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:21,564 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 106 states. [2018-11-14 16:59:21,564 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 106 states. [2018-11-14 16:59:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:21,567 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-14 16:59:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-11-14 16:59:21,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:21,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:21,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:21,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 16:59:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-14 16:59:21,570 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 68 [2018-11-14 16:59:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:21,571 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-14 16:59:21,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 16:59:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-14 16:59:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-14 16:59:21,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:21,572 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 16:59:21,572 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:21,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:21,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1975951321, now seen corresponding path program 12 times [2018-11-14 16:59:21,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:21,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:21,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:21,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:23,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {5644#true} call ULTIMATE.init(); {5644#true} is VALID [2018-11-14 16:59:23,026 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 16:59:23,026 INFO L273 TraceCheckUtils]: 2: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5644#true} {5644#true} #63#return; {5644#true} is VALID [2018-11-14 16:59:23,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {5644#true} call #t~ret4 := main(); {5644#true} is VALID [2018-11-14 16:59:23,027 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 16:59:23,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {5646#(= main_~i~0 0)} assume true; {5646#(= main_~i~0 0)} is VALID [2018-11-14 16:59:23,028 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 16:59:23,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {5647#(<= main_~i~0 1)} assume true; {5647#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:23,029 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 16:59:23,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {5648#(<= main_~i~0 2)} assume true; {5648#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:23,030 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 16:59:23,031 INFO L273 TraceCheckUtils]: 12: Hoare triple {5649#(<= main_~i~0 3)} assume true; {5649#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:23,032 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 16:59:23,032 INFO L273 TraceCheckUtils]: 14: Hoare triple {5650#(<= main_~i~0 4)} assume true; {5650#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:23,033 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 16:59:23,034 INFO L273 TraceCheckUtils]: 16: Hoare triple {5651#(<= main_~i~0 5)} assume true; {5651#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:23,035 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 16:59:23,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {5652#(<= main_~i~0 6)} assume true; {5652#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:23,036 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 16:59:23,037 INFO L273 TraceCheckUtils]: 20: Hoare triple {5653#(<= main_~i~0 7)} assume true; {5653#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:23,038 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 16:59:23,038 INFO L273 TraceCheckUtils]: 22: Hoare triple {5654#(<= main_~i~0 8)} assume true; {5654#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:23,039 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 16:59:23,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {5655#(<= main_~i~0 9)} assume true; {5655#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:23,041 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 16:59:23,041 INFO L273 TraceCheckUtils]: 26: Hoare triple {5656#(<= main_~i~0 10)} assume true; {5656#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:23,042 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 16:59:23,043 INFO L273 TraceCheckUtils]: 28: Hoare triple {5657#(<= main_~i~0 11)} assume true; {5657#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:23,044 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 16:59:23,045 INFO L273 TraceCheckUtils]: 30: Hoare triple {5658#(<= main_~i~0 12)} assume true; {5658#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:23,046 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 16:59:23,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {5659#(<= main_~i~0 13)} assume true; {5659#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:23,047 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 16:59:23,048 INFO L273 TraceCheckUtils]: 34: Hoare triple {5660#(<= main_~i~0 14)} assume true; {5660#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:23,049 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 16:59:23,049 INFO L273 TraceCheckUtils]: 36: Hoare triple {5661#(<= main_~i~0 15)} assume true; {5661#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:23,050 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 16:59:23,051 INFO L273 TraceCheckUtils]: 38: Hoare triple {5662#(<= main_~i~0 16)} assume true; {5662#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:23,052 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 16:59:23,052 INFO L273 TraceCheckUtils]: 40: Hoare triple {5663#(<= main_~i~0 17)} assume true; {5663#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:23,053 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 16:59:23,054 INFO L273 TraceCheckUtils]: 42: Hoare triple {5664#(<= main_~i~0 18)} assume true; {5664#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:23,055 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 16:59:23,055 INFO L273 TraceCheckUtils]: 44: Hoare triple {5665#(<= main_~i~0 19)} assume true; {5665#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:23,056 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 16:59:23,057 INFO L273 TraceCheckUtils]: 46: Hoare triple {5666#(<= main_~i~0 20)} assume true; {5666#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:23,058 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 16:59:23,058 INFO L273 TraceCheckUtils]: 48: Hoare triple {5667#(<= main_~i~0 21)} assume true; {5667#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:23,059 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 16:59:23,060 INFO L273 TraceCheckUtils]: 50: Hoare triple {5668#(<= main_~i~0 22)} assume true; {5668#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:23,061 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 16:59:23,062 INFO L273 TraceCheckUtils]: 52: Hoare triple {5669#(<= main_~i~0 23)} assume true; {5669#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:23,063 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 16:59:23,063 INFO L273 TraceCheckUtils]: 54: Hoare triple {5670#(<= main_~i~0 24)} assume true; {5670#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:23,064 INFO L273 TraceCheckUtils]: 55: Hoare triple {5670#(<= main_~i~0 24)} assume !(~i~0 < 100000); {5645#false} is VALID [2018-11-14 16:59:23,064 INFO L273 TraceCheckUtils]: 56: Hoare triple {5645#false} ~i~0 := 1; {5645#false} is VALID [2018-11-14 16:59:23,064 INFO L273 TraceCheckUtils]: 57: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 16:59:23,064 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 16:59:23,065 INFO L273 TraceCheckUtils]: 59: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 16:59:23,065 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 16:59:23,065 INFO L273 TraceCheckUtils]: 61: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 16:59:23,065 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 16:59:23,066 INFO L273 TraceCheckUtils]: 63: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 16:59:23,066 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 16:59:23,066 INFO L273 TraceCheckUtils]: 65: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 16:59:23,066 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 16:59:23,066 INFO L273 TraceCheckUtils]: 67: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 16:59:23,067 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 16:59:23,067 INFO L273 TraceCheckUtils]: 69: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 16:59:23,067 INFO L273 TraceCheckUtils]: 70: Hoare triple {5645#false} assume !(~i~0 < 100000); {5645#false} is VALID [2018-11-14 16:59:23,067 INFO L273 TraceCheckUtils]: 71: Hoare triple {5645#false} ~i~0 := 1;~j~0 := 0; {5645#false} is VALID [2018-11-14 16:59:23,067 INFO L273 TraceCheckUtils]: 72: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 16:59:23,068 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 16:59:23,068 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 16:59:23,068 INFO L273 TraceCheckUtils]: 75: Hoare triple {5645#false} ~cond := #in~cond; {5645#false} is VALID [2018-11-14 16:59:23,068 INFO L273 TraceCheckUtils]: 76: Hoare triple {5645#false} assume ~cond == 0; {5645#false} is VALID [2018-11-14 16:59:23,068 INFO L273 TraceCheckUtils]: 77: Hoare triple {5645#false} assume !false; {5645#false} is VALID [2018-11-14 16:59:23,072 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 16:59:23,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:23,072 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 16:59:23,081 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:59:23,645 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 16:59:23,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:23,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:23,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {5644#true} call ULTIMATE.init(); {5644#true} is VALID [2018-11-14 16:59:23,869 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 16:59:23,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5644#true} {5644#true} #63#return; {5644#true} is VALID [2018-11-14 16:59:23,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {5644#true} call #t~ret4 := main(); {5644#true} is VALID [2018-11-14 16:59:23,870 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 16:59:23,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,870 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 16:59:23,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,871 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 16:59:23,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,871 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 16:59:23,871 INFO L273 TraceCheckUtils]: 12: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,872 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 16:59:23,872 INFO L273 TraceCheckUtils]: 14: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,872 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 16:59:23,872 INFO L273 TraceCheckUtils]: 16: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,872 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 16:59:23,872 INFO L273 TraceCheckUtils]: 18: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,872 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 16:59:23,873 INFO L273 TraceCheckUtils]: 20: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,873 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 16:59:23,873 INFO L273 TraceCheckUtils]: 22: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,873 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 16:59:23,873 INFO L273 TraceCheckUtils]: 24: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,873 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 16:59:23,874 INFO L273 TraceCheckUtils]: 26: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,874 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 16:59:23,874 INFO L273 TraceCheckUtils]: 28: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,874 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 16:59:23,874 INFO L273 TraceCheckUtils]: 30: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,874 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 16:59:23,874 INFO L273 TraceCheckUtils]: 32: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,875 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 16:59:23,875 INFO L273 TraceCheckUtils]: 34: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,875 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 16:59:23,875 INFO L273 TraceCheckUtils]: 36: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,875 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 16:59:23,875 INFO L273 TraceCheckUtils]: 38: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,875 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 16:59:23,876 INFO L273 TraceCheckUtils]: 40: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,876 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 16:59:23,876 INFO L273 TraceCheckUtils]: 42: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,876 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 16:59:23,876 INFO L273 TraceCheckUtils]: 44: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,876 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 16:59:23,877 INFO L273 TraceCheckUtils]: 46: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,877 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 16:59:23,877 INFO L273 TraceCheckUtils]: 48: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,877 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 16:59:23,877 INFO L273 TraceCheckUtils]: 50: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,877 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 16:59:23,877 INFO L273 TraceCheckUtils]: 52: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,878 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 16:59:23,878 INFO L273 TraceCheckUtils]: 54: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-14 16:59:23,878 INFO L273 TraceCheckUtils]: 55: Hoare triple {5644#true} assume !(~i~0 < 100000); {5644#true} is VALID [2018-11-14 16:59:23,878 INFO L273 TraceCheckUtils]: 56: Hoare triple {5644#true} ~i~0 := 1; {5647#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:23,879 INFO L273 TraceCheckUtils]: 57: Hoare triple {5647#(<= main_~i~0 1)} assume true; {5647#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:23,880 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 16:59:23,880 INFO L273 TraceCheckUtils]: 59: Hoare triple {5656#(<= main_~i~0 10)} assume true; {5656#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:23,881 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 16:59:23,882 INFO L273 TraceCheckUtils]: 61: Hoare triple {5665#(<= main_~i~0 19)} assume true; {5665#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:23,883 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 16:59:23,883 INFO L273 TraceCheckUtils]: 63: Hoare triple {5860#(<= main_~i~0 28)} assume true; {5860#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:23,885 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 16:59:23,885 INFO L273 TraceCheckUtils]: 65: Hoare triple {5867#(<= main_~i~0 37)} assume true; {5867#(<= main_~i~0 37)} is VALID [2018-11-14 16:59:23,886 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 16:59:23,887 INFO L273 TraceCheckUtils]: 67: Hoare triple {5874#(<= main_~i~0 46)} assume true; {5874#(<= main_~i~0 46)} is VALID [2018-11-14 16:59:23,888 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 16:59:23,889 INFO L273 TraceCheckUtils]: 69: Hoare triple {5881#(<= main_~i~0 55)} assume true; {5881#(<= main_~i~0 55)} is VALID [2018-11-14 16:59:23,890 INFO L273 TraceCheckUtils]: 70: Hoare triple {5881#(<= main_~i~0 55)} assume !(~i~0 < 100000); {5645#false} is VALID [2018-11-14 16:59:23,890 INFO L273 TraceCheckUtils]: 71: Hoare triple {5645#false} ~i~0 := 1;~j~0 := 0; {5645#false} is VALID [2018-11-14 16:59:23,890 INFO L273 TraceCheckUtils]: 72: Hoare triple {5645#false} assume true; {5645#false} is VALID [2018-11-14 16:59:23,891 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 16:59:23,891 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 16:59:23,891 INFO L273 TraceCheckUtils]: 75: Hoare triple {5645#false} ~cond := #in~cond; {5645#false} is VALID [2018-11-14 16:59:23,891 INFO L273 TraceCheckUtils]: 76: Hoare triple {5645#false} assume ~cond == 0; {5645#false} is VALID [2018-11-14 16:59:23,892 INFO L273 TraceCheckUtils]: 77: Hoare triple {5645#false} assume !false; {5645#false} is VALID [2018-11-14 16:59:23,897 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 16:59:23,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:23,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 31 [2018-11-14 16:59:23,919 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2018-11-14 16:59:23,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:23,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 16:59:24,013 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 16:59:24,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 16:59:24,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 16:59:24,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 16:59:24,015 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 31 states. [2018-11-14 16:59:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:25,832 INFO L93 Difference]: Finished difference Result 148 states and 164 transitions. [2018-11-14 16:59:25,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 16:59:25,832 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2018-11-14 16:59:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:59:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 152 transitions. [2018-11-14 16:59:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:59:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 152 transitions. [2018-11-14 16:59:25,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 152 transitions. [2018-11-14 16:59:26,403 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 16:59:26,409 INFO L225 Difference]: With dead ends: 148 [2018-11-14 16:59:26,409 INFO L226 Difference]: Without dead ends: 122 [2018-11-14 16:59:26,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 16:59:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-14 16:59:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2018-11-14 16:59:26,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:26,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 94 states. [2018-11-14 16:59:26,455 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 94 states. [2018-11-14 16:59:26,455 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 94 states. [2018-11-14 16:59:26,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:26,459 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2018-11-14 16:59:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-11-14 16:59:26,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:26,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:26,460 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 122 states. [2018-11-14 16:59:26,460 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 122 states. [2018-11-14 16:59:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:26,464 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2018-11-14 16:59:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-11-14 16:59:26,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:26,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:26,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:26,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 16:59:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-11-14 16:59:26,467 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 78 [2018-11-14 16:59:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:26,467 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-11-14 16:59:26,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 16:59:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-11-14 16:59:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-14 16:59:26,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:26,468 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 16:59:26,469 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:26,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:26,469 INFO L82 PathProgramCache]: Analyzing trace with hash 18601137, now seen corresponding path program 13 times [2018-11-14 16:59:26,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:26,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:26,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:26,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:26,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:27,221 INFO L256 TraceCheckUtils]: 0: Hoare triple {6508#true} call ULTIMATE.init(); {6508#true} is VALID [2018-11-14 16:59:27,221 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 16:59:27,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {6508#true} assume true; {6508#true} is VALID [2018-11-14 16:59:27,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6508#true} {6508#true} #63#return; {6508#true} is VALID [2018-11-14 16:59:27,222 INFO L256 TraceCheckUtils]: 4: Hoare triple {6508#true} call #t~ret4 := main(); {6508#true} is VALID [2018-11-14 16:59:27,235 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 16:59:27,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {6510#(= main_~i~0 0)} assume true; {6510#(= main_~i~0 0)} is VALID [2018-11-14 16:59:27,253 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 16:59:27,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {6511#(<= main_~i~0 1)} assume true; {6511#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:27,254 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 16:59:27,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {6512#(<= main_~i~0 2)} assume true; {6512#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:27,255 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 16:59:27,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {6513#(<= main_~i~0 3)} assume true; {6513#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:27,256 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 16:59:27,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {6514#(<= main_~i~0 4)} assume true; {6514#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:27,257 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 16:59:27,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {6515#(<= main_~i~0 5)} assume true; {6515#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:27,258 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 16:59:27,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {6516#(<= main_~i~0 6)} assume true; {6516#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:27,259 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 16:59:27,260 INFO L273 TraceCheckUtils]: 20: Hoare triple {6517#(<= main_~i~0 7)} assume true; {6517#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:27,261 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 16:59:27,261 INFO L273 TraceCheckUtils]: 22: Hoare triple {6518#(<= main_~i~0 8)} assume true; {6518#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:27,262 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 16:59:27,263 INFO L273 TraceCheckUtils]: 24: Hoare triple {6519#(<= main_~i~0 9)} assume true; {6519#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:27,264 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 16:59:27,264 INFO L273 TraceCheckUtils]: 26: Hoare triple {6520#(<= main_~i~0 10)} assume true; {6520#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:27,265 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 16:59:27,266 INFO L273 TraceCheckUtils]: 28: Hoare triple {6521#(<= main_~i~0 11)} assume true; {6521#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:27,267 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 16:59:27,267 INFO L273 TraceCheckUtils]: 30: Hoare triple {6522#(<= main_~i~0 12)} assume true; {6522#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:27,268 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 16:59:27,269 INFO L273 TraceCheckUtils]: 32: Hoare triple {6523#(<= main_~i~0 13)} assume true; {6523#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:27,270 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 16:59:27,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {6524#(<= main_~i~0 14)} assume true; {6524#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:27,271 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 16:59:27,272 INFO L273 TraceCheckUtils]: 36: Hoare triple {6525#(<= main_~i~0 15)} assume true; {6525#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:27,273 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 16:59:27,274 INFO L273 TraceCheckUtils]: 38: Hoare triple {6526#(<= main_~i~0 16)} assume true; {6526#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:27,275 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 16:59:27,275 INFO L273 TraceCheckUtils]: 40: Hoare triple {6527#(<= main_~i~0 17)} assume true; {6527#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:27,276 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 16:59:27,277 INFO L273 TraceCheckUtils]: 42: Hoare triple {6528#(<= main_~i~0 18)} assume true; {6528#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:27,278 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 16:59:27,278 INFO L273 TraceCheckUtils]: 44: Hoare triple {6529#(<= main_~i~0 19)} assume true; {6529#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:27,279 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 16:59:27,280 INFO L273 TraceCheckUtils]: 46: Hoare triple {6530#(<= main_~i~0 20)} assume true; {6530#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:27,281 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 16:59:27,281 INFO L273 TraceCheckUtils]: 48: Hoare triple {6531#(<= main_~i~0 21)} assume true; {6531#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:27,282 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 16:59:27,283 INFO L273 TraceCheckUtils]: 50: Hoare triple {6532#(<= main_~i~0 22)} assume true; {6532#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:27,284 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 16:59:27,284 INFO L273 TraceCheckUtils]: 52: Hoare triple {6533#(<= main_~i~0 23)} assume true; {6533#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:27,285 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 16:59:27,286 INFO L273 TraceCheckUtils]: 54: Hoare triple {6534#(<= main_~i~0 24)} assume true; {6534#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:27,287 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 16:59:27,288 INFO L273 TraceCheckUtils]: 56: Hoare triple {6535#(<= main_~i~0 25)} assume true; {6535#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:27,289 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 16:59:27,291 INFO L273 TraceCheckUtils]: 58: Hoare triple {6536#(<= main_~i~0 26)} assume true; {6536#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:27,292 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 16:59:27,293 INFO L273 TraceCheckUtils]: 60: Hoare triple {6537#(<= main_~i~0 27)} assume true; {6537#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:27,293 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 16:59:27,294 INFO L273 TraceCheckUtils]: 62: Hoare triple {6538#(<= main_~i~0 28)} assume true; {6538#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:27,294 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 16:59:27,295 INFO L273 TraceCheckUtils]: 64: Hoare triple {6539#(<= main_~i~0 29)} assume true; {6539#(<= main_~i~0 29)} is VALID [2018-11-14 16:59:27,296 INFO L273 TraceCheckUtils]: 65: Hoare triple {6539#(<= main_~i~0 29)} assume !(~i~0 < 100000); {6509#false} is VALID [2018-11-14 16:59:27,296 INFO L273 TraceCheckUtils]: 66: Hoare triple {6509#false} ~i~0 := 1; {6509#false} is VALID [2018-11-14 16:59:27,296 INFO L273 TraceCheckUtils]: 67: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,296 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 16:59:27,297 INFO L273 TraceCheckUtils]: 69: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,297 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 16:59:27,297 INFO L273 TraceCheckUtils]: 71: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,297 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 16:59:27,297 INFO L273 TraceCheckUtils]: 73: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,298 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 16:59:27,298 INFO L273 TraceCheckUtils]: 75: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,298 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 16:59:27,298 INFO L273 TraceCheckUtils]: 77: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,298 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 16:59:27,299 INFO L273 TraceCheckUtils]: 79: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,299 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 16:59:27,299 INFO L273 TraceCheckUtils]: 81: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,299 INFO L273 TraceCheckUtils]: 82: Hoare triple {6509#false} assume !(~i~0 < 100000); {6509#false} is VALID [2018-11-14 16:59:27,299 INFO L273 TraceCheckUtils]: 83: Hoare triple {6509#false} ~i~0 := 1;~j~0 := 0; {6509#false} is VALID [2018-11-14 16:59:27,299 INFO L273 TraceCheckUtils]: 84: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,299 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 16:59:27,300 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 16:59:27,300 INFO L273 TraceCheckUtils]: 87: Hoare triple {6509#false} ~cond := #in~cond; {6509#false} is VALID [2018-11-14 16:59:27,300 INFO L273 TraceCheckUtils]: 88: Hoare triple {6509#false} assume ~cond == 0; {6509#false} is VALID [2018-11-14 16:59:27,300 INFO L273 TraceCheckUtils]: 89: Hoare triple {6509#false} assume !false; {6509#false} is VALID [2018-11-14 16:59:27,305 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 16:59:27,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:27,305 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 16:59:27,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:27,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:27,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {6508#true} call ULTIMATE.init(); {6508#true} is VALID [2018-11-14 16:59:27,600 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 16:59:27,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {6508#true} assume true; {6508#true} is VALID [2018-11-14 16:59:27,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6508#true} {6508#true} #63#return; {6508#true} is VALID [2018-11-14 16:59:27,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {6508#true} call #t~ret4 := main(); {6508#true} is VALID [2018-11-14 16:59:27,601 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 16:59:27,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {6558#(<= main_~i~0 0)} assume true; {6558#(<= main_~i~0 0)} is VALID [2018-11-14 16:59:27,602 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 16:59:27,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {6511#(<= main_~i~0 1)} assume true; {6511#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:27,603 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 16:59:27,604 INFO L273 TraceCheckUtils]: 10: Hoare triple {6512#(<= main_~i~0 2)} assume true; {6512#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:27,605 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 16:59:27,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {6513#(<= main_~i~0 3)} assume true; {6513#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:27,606 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 16:59:27,607 INFO L273 TraceCheckUtils]: 14: Hoare triple {6514#(<= main_~i~0 4)} assume true; {6514#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:27,608 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 16:59:27,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {6515#(<= main_~i~0 5)} assume true; {6515#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:27,610 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 16:59:27,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {6516#(<= main_~i~0 6)} assume true; {6516#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:27,611 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 16:59:27,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {6517#(<= main_~i~0 7)} assume true; {6517#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:27,613 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 16:59:27,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {6518#(<= main_~i~0 8)} assume true; {6518#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:27,614 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 16:59:27,615 INFO L273 TraceCheckUtils]: 24: Hoare triple {6519#(<= main_~i~0 9)} assume true; {6519#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:27,616 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 16:59:27,616 INFO L273 TraceCheckUtils]: 26: Hoare triple {6520#(<= main_~i~0 10)} assume true; {6520#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:27,617 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 16:59:27,618 INFO L273 TraceCheckUtils]: 28: Hoare triple {6521#(<= main_~i~0 11)} assume true; {6521#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:27,619 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 16:59:27,619 INFO L273 TraceCheckUtils]: 30: Hoare triple {6522#(<= main_~i~0 12)} assume true; {6522#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:27,620 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 16:59:27,621 INFO L273 TraceCheckUtils]: 32: Hoare triple {6523#(<= main_~i~0 13)} assume true; {6523#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:27,622 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 16:59:27,622 INFO L273 TraceCheckUtils]: 34: Hoare triple {6524#(<= main_~i~0 14)} assume true; {6524#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:27,623 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 16:59:27,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {6525#(<= main_~i~0 15)} assume true; {6525#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:27,625 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 16:59:27,626 INFO L273 TraceCheckUtils]: 38: Hoare triple {6526#(<= main_~i~0 16)} assume true; {6526#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:27,627 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 16:59:27,627 INFO L273 TraceCheckUtils]: 40: Hoare triple {6527#(<= main_~i~0 17)} assume true; {6527#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:27,628 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 16:59:27,629 INFO L273 TraceCheckUtils]: 42: Hoare triple {6528#(<= main_~i~0 18)} assume true; {6528#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:27,630 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 16:59:27,630 INFO L273 TraceCheckUtils]: 44: Hoare triple {6529#(<= main_~i~0 19)} assume true; {6529#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:27,631 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 16:59:27,632 INFO L273 TraceCheckUtils]: 46: Hoare triple {6530#(<= main_~i~0 20)} assume true; {6530#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:27,633 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 16:59:27,633 INFO L273 TraceCheckUtils]: 48: Hoare triple {6531#(<= main_~i~0 21)} assume true; {6531#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:27,634 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 16:59:27,635 INFO L273 TraceCheckUtils]: 50: Hoare triple {6532#(<= main_~i~0 22)} assume true; {6532#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:27,636 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 16:59:27,636 INFO L273 TraceCheckUtils]: 52: Hoare triple {6533#(<= main_~i~0 23)} assume true; {6533#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:27,637 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 16:59:27,638 INFO L273 TraceCheckUtils]: 54: Hoare triple {6534#(<= main_~i~0 24)} assume true; {6534#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:27,639 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 16:59:27,639 INFO L273 TraceCheckUtils]: 56: Hoare triple {6535#(<= main_~i~0 25)} assume true; {6535#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:27,640 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 16:59:27,641 INFO L273 TraceCheckUtils]: 58: Hoare triple {6536#(<= main_~i~0 26)} assume true; {6536#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:27,642 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 16:59:27,642 INFO L273 TraceCheckUtils]: 60: Hoare triple {6537#(<= main_~i~0 27)} assume true; {6537#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:27,643 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 16:59:27,644 INFO L273 TraceCheckUtils]: 62: Hoare triple {6538#(<= main_~i~0 28)} assume true; {6538#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:27,645 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 16:59:27,645 INFO L273 TraceCheckUtils]: 64: Hoare triple {6539#(<= main_~i~0 29)} assume true; {6539#(<= main_~i~0 29)} is VALID [2018-11-14 16:59:27,646 INFO L273 TraceCheckUtils]: 65: Hoare triple {6539#(<= main_~i~0 29)} assume !(~i~0 < 100000); {6509#false} is VALID [2018-11-14 16:59:27,646 INFO L273 TraceCheckUtils]: 66: Hoare triple {6509#false} ~i~0 := 1; {6509#false} is VALID [2018-11-14 16:59:27,647 INFO L273 TraceCheckUtils]: 67: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,647 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 16:59:27,647 INFO L273 TraceCheckUtils]: 69: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,647 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 16:59:27,648 INFO L273 TraceCheckUtils]: 71: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,648 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 16:59:27,648 INFO L273 TraceCheckUtils]: 73: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,649 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 16:59:27,649 INFO L273 TraceCheckUtils]: 75: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,649 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 16:59:27,649 INFO L273 TraceCheckUtils]: 77: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,650 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 16:59:27,650 INFO L273 TraceCheckUtils]: 79: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,650 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 16:59:27,651 INFO L273 TraceCheckUtils]: 81: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,651 INFO L273 TraceCheckUtils]: 82: Hoare triple {6509#false} assume !(~i~0 < 100000); {6509#false} is VALID [2018-11-14 16:59:27,651 INFO L273 TraceCheckUtils]: 83: Hoare triple {6509#false} ~i~0 := 1;~j~0 := 0; {6509#false} is VALID [2018-11-14 16:59:27,652 INFO L273 TraceCheckUtils]: 84: Hoare triple {6509#false} assume true; {6509#false} is VALID [2018-11-14 16:59:27,652 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 16:59:27,652 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 16:59:27,652 INFO L273 TraceCheckUtils]: 87: Hoare triple {6509#false} ~cond := #in~cond; {6509#false} is VALID [2018-11-14 16:59:27,652 INFO L273 TraceCheckUtils]: 88: Hoare triple {6509#false} assume ~cond == 0; {6509#false} is VALID [2018-11-14 16:59:27,652 INFO L273 TraceCheckUtils]: 89: Hoare triple {6509#false} assume !false; {6509#false} is VALID [2018-11-14 16:59:27,659 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 16:59:27,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:27,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-14 16:59:27,690 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 90 [2018-11-14 16:59:27,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:27,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 16:59:27,774 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 16:59:27,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 16:59:27,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 16:59:27,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 16:59:27,776 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 33 states. [2018-11-14 16:59:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:28,573 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-14 16:59:28,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 16:59:28,573 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 90 [2018-11-14 16:59:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 16:59:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 128 transitions. [2018-11-14 16:59:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 16:59:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 128 transitions. [2018-11-14 16:59:28,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 128 transitions. [2018-11-14 16:59:28,723 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 16:59:28,725 INFO L225 Difference]: With dead ends: 140 [2018-11-14 16:59:28,725 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 16:59:28,726 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 16:59:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 16:59:28,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-11-14 16:59:28,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:28,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 96 states. [2018-11-14 16:59:28,774 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 96 states. [2018-11-14 16:59:28,774 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 96 states. [2018-11-14 16:59:28,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:28,777 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-11-14 16:59:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-14 16:59:28,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:28,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:28,778 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 112 states. [2018-11-14 16:59:28,778 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 112 states. [2018-11-14 16:59:28,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:28,781 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-11-14 16:59:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-14 16:59:28,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:28,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:28,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:28,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-14 16:59:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-11-14 16:59:28,784 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 90 [2018-11-14 16:59:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:28,784 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-11-14 16:59:28,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 16:59:28,784 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-11-14 16:59:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-14 16:59:28,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:28,785 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 16:59:28,786 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:28,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:28,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1407210839, now seen corresponding path program 14 times [2018-11-14 16:59:28,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:28,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:28,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:28,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:28,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:30,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {7381#true} call ULTIMATE.init(); {7381#true} is VALID [2018-11-14 16:59:30,282 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 16:59:30,282 INFO L273 TraceCheckUtils]: 2: Hoare triple {7381#true} assume true; {7381#true} is VALID [2018-11-14 16:59:30,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7381#true} {7381#true} #63#return; {7381#true} is VALID [2018-11-14 16:59:30,282 INFO L256 TraceCheckUtils]: 4: Hoare triple {7381#true} call #t~ret4 := main(); {7381#true} is VALID [2018-11-14 16:59:30,283 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 16:59:30,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {7383#(= main_~i~0 0)} assume true; {7383#(= main_~i~0 0)} is VALID [2018-11-14 16:59:30,284 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 16:59:30,285 INFO L273 TraceCheckUtils]: 8: Hoare triple {7384#(<= main_~i~0 1)} assume true; {7384#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:30,286 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 16:59:30,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {7385#(<= main_~i~0 2)} assume true; {7385#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:30,287 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 16:59:30,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {7386#(<= main_~i~0 3)} assume true; {7386#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:30,289 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 16:59:30,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {7387#(<= main_~i~0 4)} assume true; {7387#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:30,290 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 16:59:30,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {7388#(<= main_~i~0 5)} assume true; {7388#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:30,292 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 16:59:30,292 INFO L273 TraceCheckUtils]: 18: Hoare triple {7389#(<= main_~i~0 6)} assume true; {7389#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:30,293 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 16:59:30,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {7390#(<= main_~i~0 7)} assume true; {7390#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:30,295 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 16:59:30,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {7391#(<= main_~i~0 8)} assume true; {7391#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:30,296 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 16:59:30,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {7392#(<= main_~i~0 9)} assume true; {7392#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:30,298 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 16:59:30,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {7393#(<= main_~i~0 10)} assume true; {7393#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:30,299 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 16:59:30,317 INFO L273 TraceCheckUtils]: 28: Hoare triple {7394#(<= main_~i~0 11)} assume true; {7394#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:30,332 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 16:59:30,341 INFO L273 TraceCheckUtils]: 30: Hoare triple {7395#(<= main_~i~0 12)} assume true; {7395#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:30,355 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 16:59:30,355 INFO L273 TraceCheckUtils]: 32: Hoare triple {7396#(<= main_~i~0 13)} assume true; {7396#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:30,356 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 16:59:30,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {7397#(<= main_~i~0 14)} assume true; {7397#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:30,357 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 16:59:30,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {7398#(<= main_~i~0 15)} assume true; {7398#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:30,358 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 16:59:30,358 INFO L273 TraceCheckUtils]: 38: Hoare triple {7399#(<= main_~i~0 16)} assume true; {7399#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:30,359 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 16:59:30,359 INFO L273 TraceCheckUtils]: 40: Hoare triple {7400#(<= main_~i~0 17)} assume true; {7400#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:30,360 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 16:59:30,361 INFO L273 TraceCheckUtils]: 42: Hoare triple {7401#(<= main_~i~0 18)} assume true; {7401#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:30,362 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 16:59:30,363 INFO L273 TraceCheckUtils]: 44: Hoare triple {7402#(<= main_~i~0 19)} assume true; {7402#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:30,364 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 16:59:30,364 INFO L273 TraceCheckUtils]: 46: Hoare triple {7403#(<= main_~i~0 20)} assume true; {7403#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:30,365 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 16:59:30,366 INFO L273 TraceCheckUtils]: 48: Hoare triple {7404#(<= main_~i~0 21)} assume true; {7404#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:30,367 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 16:59:30,367 INFO L273 TraceCheckUtils]: 50: Hoare triple {7405#(<= main_~i~0 22)} assume true; {7405#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:30,368 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 16:59:30,369 INFO L273 TraceCheckUtils]: 52: Hoare triple {7406#(<= main_~i~0 23)} assume true; {7406#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:30,370 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 16:59:30,371 INFO L273 TraceCheckUtils]: 54: Hoare triple {7407#(<= main_~i~0 24)} assume true; {7407#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:30,372 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 16:59:30,372 INFO L273 TraceCheckUtils]: 56: Hoare triple {7408#(<= main_~i~0 25)} assume true; {7408#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:30,373 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 16:59:30,374 INFO L273 TraceCheckUtils]: 58: Hoare triple {7409#(<= main_~i~0 26)} assume true; {7409#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:30,375 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 16:59:30,375 INFO L273 TraceCheckUtils]: 60: Hoare triple {7410#(<= main_~i~0 27)} assume true; {7410#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:30,376 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 16:59:30,377 INFO L273 TraceCheckUtils]: 62: Hoare triple {7411#(<= main_~i~0 28)} assume true; {7411#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:30,378 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 16:59:30,378 INFO L273 TraceCheckUtils]: 64: Hoare triple {7412#(<= main_~i~0 29)} assume true; {7412#(<= main_~i~0 29)} is VALID [2018-11-14 16:59:30,379 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 16:59:30,380 INFO L273 TraceCheckUtils]: 66: Hoare triple {7413#(<= main_~i~0 30)} assume true; {7413#(<= main_~i~0 30)} is VALID [2018-11-14 16:59:30,380 INFO L273 TraceCheckUtils]: 67: Hoare triple {7413#(<= main_~i~0 30)} assume !(~i~0 < 100000); {7382#false} is VALID [2018-11-14 16:59:30,381 INFO L273 TraceCheckUtils]: 68: Hoare triple {7382#false} ~i~0 := 1; {7382#false} is VALID [2018-11-14 16:59:30,381 INFO L273 TraceCheckUtils]: 69: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:30,381 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 16:59:30,381 INFO L273 TraceCheckUtils]: 71: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:30,381 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 16:59:30,382 INFO L273 TraceCheckUtils]: 73: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:30,382 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 16:59:30,382 INFO L273 TraceCheckUtils]: 75: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:30,382 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 16:59:30,382 INFO L273 TraceCheckUtils]: 77: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:30,383 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 16:59:30,383 INFO L273 TraceCheckUtils]: 79: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:30,383 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 16:59:30,383 INFO L273 TraceCheckUtils]: 81: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:30,383 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 16:59:30,383 INFO L273 TraceCheckUtils]: 83: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:30,383 INFO L273 TraceCheckUtils]: 84: Hoare triple {7382#false} assume !(~i~0 < 100000); {7382#false} is VALID [2018-11-14 16:59:30,383 INFO L273 TraceCheckUtils]: 85: Hoare triple {7382#false} ~i~0 := 1;~j~0 := 0; {7382#false} is VALID [2018-11-14 16:59:30,384 INFO L273 TraceCheckUtils]: 86: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:30,384 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 16:59:30,384 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 16:59:30,384 INFO L273 TraceCheckUtils]: 89: Hoare triple {7382#false} ~cond := #in~cond; {7382#false} is VALID [2018-11-14 16:59:30,384 INFO L273 TraceCheckUtils]: 90: Hoare triple {7382#false} assume ~cond == 0; {7382#false} is VALID [2018-11-14 16:59:30,384 INFO L273 TraceCheckUtils]: 91: Hoare triple {7382#false} assume !false; {7382#false} is VALID [2018-11-14 16:59:30,389 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 16:59:30,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:30,390 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 16:59:30,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:59:30,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:59:30,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:30,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:31,035 INFO L256 TraceCheckUtils]: 0: Hoare triple {7381#true} call ULTIMATE.init(); {7381#true} is VALID [2018-11-14 16:59:31,035 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 16:59:31,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {7381#true} assume true; {7381#true} is VALID [2018-11-14 16:59:31,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7381#true} {7381#true} #63#return; {7381#true} is VALID [2018-11-14 16:59:31,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {7381#true} call #t~ret4 := main(); {7381#true} is VALID [2018-11-14 16:59:31,036 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 16:59:31,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {7432#(<= main_~i~0 0)} assume true; {7432#(<= main_~i~0 0)} is VALID [2018-11-14 16:59:31,037 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 16:59:31,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {7384#(<= main_~i~0 1)} assume true; {7384#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:31,039 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 16:59:31,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {7385#(<= main_~i~0 2)} assume true; {7385#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:31,040 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 16:59:31,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {7386#(<= main_~i~0 3)} assume true; {7386#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:31,042 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 16:59:31,043 INFO L273 TraceCheckUtils]: 14: Hoare triple {7387#(<= main_~i~0 4)} assume true; {7387#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:31,044 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 16:59:31,044 INFO L273 TraceCheckUtils]: 16: Hoare triple {7388#(<= main_~i~0 5)} assume true; {7388#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:31,045 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 16:59:31,046 INFO L273 TraceCheckUtils]: 18: Hoare triple {7389#(<= main_~i~0 6)} assume true; {7389#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:31,047 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 16:59:31,047 INFO L273 TraceCheckUtils]: 20: Hoare triple {7390#(<= main_~i~0 7)} assume true; {7390#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:31,048 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 16:59:31,049 INFO L273 TraceCheckUtils]: 22: Hoare triple {7391#(<= main_~i~0 8)} assume true; {7391#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:31,050 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 16:59:31,050 INFO L273 TraceCheckUtils]: 24: Hoare triple {7392#(<= main_~i~0 9)} assume true; {7392#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:31,051 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 16:59:31,052 INFO L273 TraceCheckUtils]: 26: Hoare triple {7393#(<= main_~i~0 10)} assume true; {7393#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:31,053 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 16:59:31,053 INFO L273 TraceCheckUtils]: 28: Hoare triple {7394#(<= main_~i~0 11)} assume true; {7394#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:31,054 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 16:59:31,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {7395#(<= main_~i~0 12)} assume true; {7395#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:31,056 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 16:59:31,056 INFO L273 TraceCheckUtils]: 32: Hoare triple {7396#(<= main_~i~0 13)} assume true; {7396#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:31,057 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 16:59:31,058 INFO L273 TraceCheckUtils]: 34: Hoare triple {7397#(<= main_~i~0 14)} assume true; {7397#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:31,059 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 16:59:31,059 INFO L273 TraceCheckUtils]: 36: Hoare triple {7398#(<= main_~i~0 15)} assume true; {7398#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:31,060 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 16:59:31,061 INFO L273 TraceCheckUtils]: 38: Hoare triple {7399#(<= main_~i~0 16)} assume true; {7399#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:31,062 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 16:59:31,062 INFO L273 TraceCheckUtils]: 40: Hoare triple {7400#(<= main_~i~0 17)} assume true; {7400#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:31,063 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 16:59:31,064 INFO L273 TraceCheckUtils]: 42: Hoare triple {7401#(<= main_~i~0 18)} assume true; {7401#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:31,065 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 16:59:31,065 INFO L273 TraceCheckUtils]: 44: Hoare triple {7402#(<= main_~i~0 19)} assume true; {7402#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:31,066 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 16:59:31,067 INFO L273 TraceCheckUtils]: 46: Hoare triple {7403#(<= main_~i~0 20)} assume true; {7403#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:31,068 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 16:59:31,068 INFO L273 TraceCheckUtils]: 48: Hoare triple {7404#(<= main_~i~0 21)} assume true; {7404#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:31,069 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 16:59:31,070 INFO L273 TraceCheckUtils]: 50: Hoare triple {7405#(<= main_~i~0 22)} assume true; {7405#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:31,071 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 16:59:31,071 INFO L273 TraceCheckUtils]: 52: Hoare triple {7406#(<= main_~i~0 23)} assume true; {7406#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:31,072 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 16:59:31,073 INFO L273 TraceCheckUtils]: 54: Hoare triple {7407#(<= main_~i~0 24)} assume true; {7407#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:31,074 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 16:59:31,074 INFO L273 TraceCheckUtils]: 56: Hoare triple {7408#(<= main_~i~0 25)} assume true; {7408#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:31,075 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 16:59:31,076 INFO L273 TraceCheckUtils]: 58: Hoare triple {7409#(<= main_~i~0 26)} assume true; {7409#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:31,077 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 16:59:31,078 INFO L273 TraceCheckUtils]: 60: Hoare triple {7410#(<= main_~i~0 27)} assume true; {7410#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:31,079 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 16:59:31,079 INFO L273 TraceCheckUtils]: 62: Hoare triple {7411#(<= main_~i~0 28)} assume true; {7411#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:31,080 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 16:59:31,081 INFO L273 TraceCheckUtils]: 64: Hoare triple {7412#(<= main_~i~0 29)} assume true; {7412#(<= main_~i~0 29)} is VALID [2018-11-14 16:59:31,082 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 16:59:31,082 INFO L273 TraceCheckUtils]: 66: Hoare triple {7413#(<= main_~i~0 30)} assume true; {7413#(<= main_~i~0 30)} is VALID [2018-11-14 16:59:31,083 INFO L273 TraceCheckUtils]: 67: Hoare triple {7413#(<= main_~i~0 30)} assume !(~i~0 < 100000); {7382#false} is VALID [2018-11-14 16:59:31,083 INFO L273 TraceCheckUtils]: 68: Hoare triple {7382#false} ~i~0 := 1; {7382#false} is VALID [2018-11-14 16:59:31,083 INFO L273 TraceCheckUtils]: 69: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:31,083 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 16:59:31,084 INFO L273 TraceCheckUtils]: 71: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:31,084 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 16:59:31,084 INFO L273 TraceCheckUtils]: 73: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:31,084 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 16:59:31,084 INFO L273 TraceCheckUtils]: 75: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:31,085 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 16:59:31,085 INFO L273 TraceCheckUtils]: 77: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:31,085 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 16:59:31,085 INFO L273 TraceCheckUtils]: 79: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:31,085 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 16:59:31,086 INFO L273 TraceCheckUtils]: 81: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:31,086 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 16:59:31,086 INFO L273 TraceCheckUtils]: 83: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:31,086 INFO L273 TraceCheckUtils]: 84: Hoare triple {7382#false} assume !(~i~0 < 100000); {7382#false} is VALID [2018-11-14 16:59:31,086 INFO L273 TraceCheckUtils]: 85: Hoare triple {7382#false} ~i~0 := 1;~j~0 := 0; {7382#false} is VALID [2018-11-14 16:59:31,086 INFO L273 TraceCheckUtils]: 86: Hoare triple {7382#false} assume true; {7382#false} is VALID [2018-11-14 16:59:31,086 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 16:59:31,087 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 16:59:31,087 INFO L273 TraceCheckUtils]: 89: Hoare triple {7382#false} ~cond := #in~cond; {7382#false} is VALID [2018-11-14 16:59:31,087 INFO L273 TraceCheckUtils]: 90: Hoare triple {7382#false} assume ~cond == 0; {7382#false} is VALID [2018-11-14 16:59:31,087 INFO L273 TraceCheckUtils]: 91: Hoare triple {7382#false} assume !false; {7382#false} is VALID [2018-11-14 16:59:31,092 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 16:59:31,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:31,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-14 16:59:31,113 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 92 [2018-11-14 16:59:31,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:31,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 16:59:31,195 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 16:59:31,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 16:59:31,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 16:59:31,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 16:59:31,196 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 34 states. [2018-11-14 16:59:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:32,152 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2018-11-14 16:59:32,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 16:59:32,152 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 92 [2018-11-14 16:59:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:59:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 130 transitions. [2018-11-14 16:59:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:59:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 130 transitions. [2018-11-14 16:59:32,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 130 transitions. [2018-11-14 16:59:32,411 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 16:59:32,414 INFO L225 Difference]: With dead ends: 142 [2018-11-14 16:59:32,414 INFO L226 Difference]: Without dead ends: 114 [2018-11-14 16:59:32,415 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 16:59:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-14 16:59:32,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2018-11-14 16:59:32,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:32,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 98 states. [2018-11-14 16:59:32,469 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 98 states. [2018-11-14 16:59:32,469 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 98 states. [2018-11-14 16:59:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:32,471 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-11-14 16:59:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-11-14 16:59:32,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:32,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:32,472 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 114 states. [2018-11-14 16:59:32,472 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 114 states. [2018-11-14 16:59:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:32,475 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-11-14 16:59:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-11-14 16:59:32,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:32,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:32,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:32,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 16:59:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-11-14 16:59:32,478 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 92 [2018-11-14 16:59:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:32,478 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-11-14 16:59:32,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 16:59:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-11-14 16:59:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 16:59:32,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:32,479 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 16:59:32,480 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:32,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:32,480 INFO L82 PathProgramCache]: Analyzing trace with hash 126305405, now seen corresponding path program 15 times [2018-11-14 16:59:32,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:32,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:32,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:32,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:32,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:34,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {8271#true} call ULTIMATE.init(); {8271#true} is VALID [2018-11-14 16:59:34,468 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 16:59:34,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:34,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8271#true} {8271#true} #63#return; {8271#true} is VALID [2018-11-14 16:59:34,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {8271#true} call #t~ret4 := main(); {8271#true} is VALID [2018-11-14 16:59:34,470 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 16:59:34,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {8273#(= main_~i~0 0)} assume true; {8273#(= main_~i~0 0)} is VALID [2018-11-14 16:59:34,471 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 16:59:34,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {8274#(<= main_~i~0 1)} assume true; {8274#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:34,472 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 16:59:34,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {8275#(<= main_~i~0 2)} assume true; {8275#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:34,474 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 16:59:34,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {8276#(<= main_~i~0 3)} assume true; {8276#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:34,475 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 16:59:34,476 INFO L273 TraceCheckUtils]: 14: Hoare triple {8277#(<= main_~i~0 4)} assume true; {8277#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:34,477 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 16:59:34,477 INFO L273 TraceCheckUtils]: 16: Hoare triple {8278#(<= main_~i~0 5)} assume true; {8278#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:34,478 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 16:59:34,479 INFO L273 TraceCheckUtils]: 18: Hoare triple {8279#(<= main_~i~0 6)} assume true; {8279#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:34,480 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 16:59:34,480 INFO L273 TraceCheckUtils]: 20: Hoare triple {8280#(<= main_~i~0 7)} assume true; {8280#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:34,481 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 16:59:34,482 INFO L273 TraceCheckUtils]: 22: Hoare triple {8281#(<= main_~i~0 8)} assume true; {8281#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:34,483 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 16:59:34,483 INFO L273 TraceCheckUtils]: 24: Hoare triple {8282#(<= main_~i~0 9)} assume true; {8282#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:34,484 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 16:59:34,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {8283#(<= main_~i~0 10)} assume true; {8283#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:34,486 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 16:59:34,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {8284#(<= main_~i~0 11)} assume true; {8284#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:34,487 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 16:59:34,488 INFO L273 TraceCheckUtils]: 30: Hoare triple {8285#(<= main_~i~0 12)} assume true; {8285#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:34,489 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 16:59:34,489 INFO L273 TraceCheckUtils]: 32: Hoare triple {8286#(<= main_~i~0 13)} assume true; {8286#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:34,490 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 16:59:34,491 INFO L273 TraceCheckUtils]: 34: Hoare triple {8287#(<= main_~i~0 14)} assume true; {8287#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:34,492 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 16:59:34,492 INFO L273 TraceCheckUtils]: 36: Hoare triple {8288#(<= main_~i~0 15)} assume true; {8288#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:34,493 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 16:59:34,494 INFO L273 TraceCheckUtils]: 38: Hoare triple {8289#(<= main_~i~0 16)} assume true; {8289#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:34,495 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 16:59:34,495 INFO L273 TraceCheckUtils]: 40: Hoare triple {8290#(<= main_~i~0 17)} assume true; {8290#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:34,496 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 16:59:34,497 INFO L273 TraceCheckUtils]: 42: Hoare triple {8291#(<= main_~i~0 18)} assume true; {8291#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:34,498 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 16:59:34,499 INFO L273 TraceCheckUtils]: 44: Hoare triple {8292#(<= main_~i~0 19)} assume true; {8292#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:34,500 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 16:59:34,500 INFO L273 TraceCheckUtils]: 46: Hoare triple {8293#(<= main_~i~0 20)} assume true; {8293#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:34,501 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 16:59:34,502 INFO L273 TraceCheckUtils]: 48: Hoare triple {8294#(<= main_~i~0 21)} assume true; {8294#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:34,503 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 16:59:34,503 INFO L273 TraceCheckUtils]: 50: Hoare triple {8295#(<= main_~i~0 22)} assume true; {8295#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:34,504 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 16:59:34,505 INFO L273 TraceCheckUtils]: 52: Hoare triple {8296#(<= main_~i~0 23)} assume true; {8296#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:34,506 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 16:59:34,506 INFO L273 TraceCheckUtils]: 54: Hoare triple {8297#(<= main_~i~0 24)} assume true; {8297#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:34,507 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 16:59:34,508 INFO L273 TraceCheckUtils]: 56: Hoare triple {8298#(<= main_~i~0 25)} assume true; {8298#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:34,509 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 16:59:34,509 INFO L273 TraceCheckUtils]: 58: Hoare triple {8299#(<= main_~i~0 26)} assume true; {8299#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:34,510 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 16:59:34,511 INFO L273 TraceCheckUtils]: 60: Hoare triple {8300#(<= main_~i~0 27)} assume true; {8300#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:34,512 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 16:59:34,512 INFO L273 TraceCheckUtils]: 62: Hoare triple {8301#(<= main_~i~0 28)} assume true; {8301#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:34,513 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 16:59:34,514 INFO L273 TraceCheckUtils]: 64: Hoare triple {8302#(<= main_~i~0 29)} assume true; {8302#(<= main_~i~0 29)} is VALID [2018-11-14 16:59:34,515 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 16:59:34,515 INFO L273 TraceCheckUtils]: 66: Hoare triple {8303#(<= main_~i~0 30)} assume true; {8303#(<= main_~i~0 30)} is VALID [2018-11-14 16:59:34,516 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 16:59:34,517 INFO L273 TraceCheckUtils]: 68: Hoare triple {8304#(<= main_~i~0 31)} assume true; {8304#(<= main_~i~0 31)} is VALID [2018-11-14 16:59:34,518 INFO L273 TraceCheckUtils]: 69: Hoare triple {8304#(<= main_~i~0 31)} assume !(~i~0 < 100000); {8272#false} is VALID [2018-11-14 16:59:34,518 INFO L273 TraceCheckUtils]: 70: Hoare triple {8272#false} ~i~0 := 1; {8272#false} is VALID [2018-11-14 16:59:34,518 INFO L273 TraceCheckUtils]: 71: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 16:59:34,518 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 16:59:34,518 INFO L273 TraceCheckUtils]: 73: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 16:59:34,519 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 16:59:34,519 INFO L273 TraceCheckUtils]: 75: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 16:59:34,519 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 16:59:34,519 INFO L273 TraceCheckUtils]: 77: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 16:59:34,520 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 16:59:34,520 INFO L273 TraceCheckUtils]: 79: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 16:59:34,520 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 16:59:34,520 INFO L273 TraceCheckUtils]: 81: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 16:59:34,520 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 16:59:34,521 INFO L273 TraceCheckUtils]: 83: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 16:59:34,521 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 16:59:34,521 INFO L273 TraceCheckUtils]: 85: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 16:59:34,521 INFO L273 TraceCheckUtils]: 86: Hoare triple {8272#false} assume !(~i~0 < 100000); {8272#false} is VALID [2018-11-14 16:59:34,521 INFO L273 TraceCheckUtils]: 87: Hoare triple {8272#false} ~i~0 := 1;~j~0 := 0; {8272#false} is VALID [2018-11-14 16:59:34,522 INFO L273 TraceCheckUtils]: 88: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 16:59:34,522 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 16:59:34,522 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 16:59:34,522 INFO L273 TraceCheckUtils]: 91: Hoare triple {8272#false} ~cond := #in~cond; {8272#false} is VALID [2018-11-14 16:59:34,522 INFO L273 TraceCheckUtils]: 92: Hoare triple {8272#false} assume ~cond == 0; {8272#false} is VALID [2018-11-14 16:59:34,523 INFO L273 TraceCheckUtils]: 93: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2018-11-14 16:59:34,528 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 16:59:34,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:34,528 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 16:59:34,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:59:34,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-14 16:59:34,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:34,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:35,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {8271#true} call ULTIMATE.init(); {8271#true} is VALID [2018-11-14 16:59:35,019 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 16:59:35,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,019 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8271#true} {8271#true} #63#return; {8271#true} is VALID [2018-11-14 16:59:35,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {8271#true} call #t~ret4 := main(); {8271#true} is VALID [2018-11-14 16:59:35,020 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 16:59:35,020 INFO L273 TraceCheckUtils]: 6: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,020 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 16:59:35,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,021 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 16:59:35,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,021 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 16:59:35,021 INFO L273 TraceCheckUtils]: 12: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,021 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 16:59:35,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,022 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 16:59:35,022 INFO L273 TraceCheckUtils]: 16: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,022 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 16:59:35,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,022 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 16:59:35,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,022 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 16:59:35,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,023 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 16:59:35,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,023 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 16:59:35,023 INFO L273 TraceCheckUtils]: 26: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,023 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 16:59:35,023 INFO L273 TraceCheckUtils]: 28: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,023 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 16:59:35,023 INFO L273 TraceCheckUtils]: 30: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,023 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 16:59:35,024 INFO L273 TraceCheckUtils]: 32: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,024 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 16:59:35,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,024 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 16:59:35,024 INFO L273 TraceCheckUtils]: 36: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,024 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 16:59:35,024 INFO L273 TraceCheckUtils]: 38: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,024 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 16:59:35,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,025 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 16:59:35,025 INFO L273 TraceCheckUtils]: 42: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,025 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 16:59:35,025 INFO L273 TraceCheckUtils]: 44: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,025 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 16:59:35,025 INFO L273 TraceCheckUtils]: 46: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,025 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 16:59:35,025 INFO L273 TraceCheckUtils]: 48: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,025 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 16:59:35,026 INFO L273 TraceCheckUtils]: 50: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,026 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 16:59:35,026 INFO L273 TraceCheckUtils]: 52: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,026 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 16:59:35,026 INFO L273 TraceCheckUtils]: 54: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,026 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 16:59:35,026 INFO L273 TraceCheckUtils]: 56: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,027 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 16:59:35,027 INFO L273 TraceCheckUtils]: 58: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,027 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 16:59:35,027 INFO L273 TraceCheckUtils]: 60: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,027 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 16:59:35,027 INFO L273 TraceCheckUtils]: 62: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,028 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 16:59:35,028 INFO L273 TraceCheckUtils]: 64: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,028 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 16:59:35,028 INFO L273 TraceCheckUtils]: 66: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,028 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 16:59:35,028 INFO L273 TraceCheckUtils]: 68: Hoare triple {8271#true} assume true; {8271#true} is VALID [2018-11-14 16:59:35,029 INFO L273 TraceCheckUtils]: 69: Hoare triple {8271#true} assume !(~i~0 < 100000); {8271#true} is VALID [2018-11-14 16:59:35,037 INFO L273 TraceCheckUtils]: 70: Hoare triple {8271#true} ~i~0 := 1; {8274#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:35,038 INFO L273 TraceCheckUtils]: 71: Hoare triple {8274#(<= main_~i~0 1)} assume true; {8274#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:35,039 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 16:59:35,039 INFO L273 TraceCheckUtils]: 73: Hoare triple {8283#(<= main_~i~0 10)} assume true; {8283#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:35,039 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 16:59:35,040 INFO L273 TraceCheckUtils]: 75: Hoare triple {8292#(<= main_~i~0 19)} assume true; {8292#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:35,040 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 16:59:35,041 INFO L273 TraceCheckUtils]: 77: Hoare triple {8301#(<= main_~i~0 28)} assume true; {8301#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:35,041 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 16:59:35,042 INFO L273 TraceCheckUtils]: 79: Hoare triple {8542#(<= main_~i~0 37)} assume true; {8542#(<= main_~i~0 37)} is VALID [2018-11-14 16:59:35,042 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 16:59:35,043 INFO L273 TraceCheckUtils]: 81: Hoare triple {8549#(<= main_~i~0 46)} assume true; {8549#(<= main_~i~0 46)} is VALID [2018-11-14 16:59:35,044 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 16:59:35,044 INFO L273 TraceCheckUtils]: 83: Hoare triple {8556#(<= main_~i~0 55)} assume true; {8556#(<= main_~i~0 55)} is VALID [2018-11-14 16:59:35,045 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 16:59:35,046 INFO L273 TraceCheckUtils]: 85: Hoare triple {8563#(<= main_~i~0 64)} assume true; {8563#(<= main_~i~0 64)} is VALID [2018-11-14 16:59:35,046 INFO L273 TraceCheckUtils]: 86: Hoare triple {8563#(<= main_~i~0 64)} assume !(~i~0 < 100000); {8272#false} is VALID [2018-11-14 16:59:35,047 INFO L273 TraceCheckUtils]: 87: Hoare triple {8272#false} ~i~0 := 1;~j~0 := 0; {8272#false} is VALID [2018-11-14 16:59:35,047 INFO L273 TraceCheckUtils]: 88: Hoare triple {8272#false} assume true; {8272#false} is VALID [2018-11-14 16:59:35,047 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 16:59:35,047 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 16:59:35,047 INFO L273 TraceCheckUtils]: 91: Hoare triple {8272#false} ~cond := #in~cond; {8272#false} is VALID [2018-11-14 16:59:35,048 INFO L273 TraceCheckUtils]: 92: Hoare triple {8272#false} assume ~cond == 0; {8272#false} is VALID [2018-11-14 16:59:35,048 INFO L273 TraceCheckUtils]: 93: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2018-11-14 16:59:35,052 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 16:59:35,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:35,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 10] total 38 [2018-11-14 16:59:35,073 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-11-14 16:59:35,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:35,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 16:59:35,172 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 16:59:35,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 16:59:35,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 16:59:35,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 16:59:35,174 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 38 states. [2018-11-14 16:59:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:36,460 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2018-11-14 16:59:36,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-14 16:59:36,461 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-11-14 16:59:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:59:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 173 transitions. [2018-11-14 16:59:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:59:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 173 transitions. [2018-11-14 16:59:36,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 173 transitions. [2018-11-14 16:59:36,740 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 16:59:36,743 INFO L225 Difference]: With dead ends: 170 [2018-11-14 16:59:36,743 INFO L226 Difference]: Without dead ends: 142 [2018-11-14 16:59:36,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 16:59:36,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-14 16:59:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 110. [2018-11-14 16:59:36,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:36,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 110 states. [2018-11-14 16:59:36,825 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 110 states. [2018-11-14 16:59:36,825 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 110 states. [2018-11-14 16:59:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:36,828 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-11-14 16:59:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-11-14 16:59:36,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:36,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:36,829 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 142 states. [2018-11-14 16:59:36,829 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 142 states. [2018-11-14 16:59:36,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:36,832 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-11-14 16:59:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-11-14 16:59:36,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:36,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:36,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:36,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-14 16:59:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-11-14 16:59:36,835 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 94 [2018-11-14 16:59:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:36,836 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-11-14 16:59:36,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-14 16:59:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-11-14 16:59:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-14 16:59:36,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:36,837 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 16:59:36,837 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:36,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:36,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2048482219, now seen corresponding path program 16 times [2018-11-14 16:59:36,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:36,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:36,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:36,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:37,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {9287#true} call ULTIMATE.init(); {9287#true} is VALID [2018-11-14 16:59:37,696 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 16:59:37,696 INFO L273 TraceCheckUtils]: 2: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:37,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9287#true} {9287#true} #63#return; {9287#true} is VALID [2018-11-14 16:59:37,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {9287#true} call #t~ret4 := main(); {9287#true} is VALID [2018-11-14 16:59:37,697 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 16:59:37,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {9289#(= main_~i~0 0)} assume true; {9289#(= main_~i~0 0)} is VALID [2018-11-14 16:59:37,698 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 16:59:37,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {9290#(<= main_~i~0 1)} assume true; {9290#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:37,700 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 16:59:37,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {9291#(<= main_~i~0 2)} assume true; {9291#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:37,701 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 16:59:37,702 INFO L273 TraceCheckUtils]: 12: Hoare triple {9292#(<= main_~i~0 3)} assume true; {9292#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:37,703 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 16:59:37,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {9293#(<= main_~i~0 4)} assume true; {9293#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:37,704 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 16:59:37,705 INFO L273 TraceCheckUtils]: 16: Hoare triple {9294#(<= main_~i~0 5)} assume true; {9294#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:37,706 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 16:59:37,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {9295#(<= main_~i~0 6)} assume true; {9295#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:37,708 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 16:59:37,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {9296#(<= main_~i~0 7)} assume true; {9296#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:37,709 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 16:59:37,710 INFO L273 TraceCheckUtils]: 22: Hoare triple {9297#(<= main_~i~0 8)} assume true; {9297#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:37,711 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 16:59:37,711 INFO L273 TraceCheckUtils]: 24: Hoare triple {9298#(<= main_~i~0 9)} assume true; {9298#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:37,712 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 16:59:37,713 INFO L273 TraceCheckUtils]: 26: Hoare triple {9299#(<= main_~i~0 10)} assume true; {9299#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:37,714 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 16:59:37,714 INFO L273 TraceCheckUtils]: 28: Hoare triple {9300#(<= main_~i~0 11)} assume true; {9300#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:37,715 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 16:59:37,716 INFO L273 TraceCheckUtils]: 30: Hoare triple {9301#(<= main_~i~0 12)} assume true; {9301#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:37,717 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 16:59:37,717 INFO L273 TraceCheckUtils]: 32: Hoare triple {9302#(<= main_~i~0 13)} assume true; {9302#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:37,718 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 16:59:37,719 INFO L273 TraceCheckUtils]: 34: Hoare triple {9303#(<= main_~i~0 14)} assume true; {9303#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:37,720 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 16:59:37,720 INFO L273 TraceCheckUtils]: 36: Hoare triple {9304#(<= main_~i~0 15)} assume true; {9304#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:37,721 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 16:59:37,722 INFO L273 TraceCheckUtils]: 38: Hoare triple {9305#(<= main_~i~0 16)} assume true; {9305#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:37,723 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 16:59:37,723 INFO L273 TraceCheckUtils]: 40: Hoare triple {9306#(<= main_~i~0 17)} assume true; {9306#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:37,724 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 16:59:37,725 INFO L273 TraceCheckUtils]: 42: Hoare triple {9307#(<= main_~i~0 18)} assume true; {9307#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:37,726 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 16:59:37,726 INFO L273 TraceCheckUtils]: 44: Hoare triple {9308#(<= main_~i~0 19)} assume true; {9308#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:37,727 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 16:59:37,728 INFO L273 TraceCheckUtils]: 46: Hoare triple {9309#(<= main_~i~0 20)} assume true; {9309#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:37,729 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 16:59:37,729 INFO L273 TraceCheckUtils]: 48: Hoare triple {9310#(<= main_~i~0 21)} assume true; {9310#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:37,730 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 16:59:37,731 INFO L273 TraceCheckUtils]: 50: Hoare triple {9311#(<= main_~i~0 22)} assume true; {9311#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:37,732 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 16:59:37,732 INFO L273 TraceCheckUtils]: 52: Hoare triple {9312#(<= main_~i~0 23)} assume true; {9312#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:37,733 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 16:59:37,734 INFO L273 TraceCheckUtils]: 54: Hoare triple {9313#(<= main_~i~0 24)} assume true; {9313#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:37,735 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 16:59:37,736 INFO L273 TraceCheckUtils]: 56: Hoare triple {9314#(<= main_~i~0 25)} assume true; {9314#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:37,736 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 16:59:37,737 INFO L273 TraceCheckUtils]: 58: Hoare triple {9315#(<= main_~i~0 26)} assume true; {9315#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:37,738 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 16:59:37,739 INFO L273 TraceCheckUtils]: 60: Hoare triple {9316#(<= main_~i~0 27)} assume true; {9316#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:37,740 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 16:59:37,740 INFO L273 TraceCheckUtils]: 62: Hoare triple {9317#(<= main_~i~0 28)} assume true; {9317#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:37,741 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 16:59:37,742 INFO L273 TraceCheckUtils]: 64: Hoare triple {9318#(<= main_~i~0 29)} assume true; {9318#(<= main_~i~0 29)} is VALID [2018-11-14 16:59:37,743 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 16:59:37,743 INFO L273 TraceCheckUtils]: 66: Hoare triple {9319#(<= main_~i~0 30)} assume true; {9319#(<= main_~i~0 30)} is VALID [2018-11-14 16:59:37,744 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 16:59:37,745 INFO L273 TraceCheckUtils]: 68: Hoare triple {9320#(<= main_~i~0 31)} assume true; {9320#(<= main_~i~0 31)} is VALID [2018-11-14 16:59:37,746 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 16:59:37,746 INFO L273 TraceCheckUtils]: 70: Hoare triple {9321#(<= main_~i~0 32)} assume true; {9321#(<= main_~i~0 32)} is VALID [2018-11-14 16:59:37,747 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 16:59:37,748 INFO L273 TraceCheckUtils]: 72: Hoare triple {9322#(<= main_~i~0 33)} assume true; {9322#(<= main_~i~0 33)} is VALID [2018-11-14 16:59:37,749 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 16:59:37,749 INFO L273 TraceCheckUtils]: 74: Hoare triple {9323#(<= main_~i~0 34)} assume true; {9323#(<= main_~i~0 34)} is VALID [2018-11-14 16:59:37,750 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 16:59:37,751 INFO L273 TraceCheckUtils]: 76: Hoare triple {9324#(<= main_~i~0 35)} assume true; {9324#(<= main_~i~0 35)} is VALID [2018-11-14 16:59:37,752 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 16:59:37,752 INFO L273 TraceCheckUtils]: 78: Hoare triple {9325#(<= main_~i~0 36)} assume true; {9325#(<= main_~i~0 36)} is VALID [2018-11-14 16:59:37,753 INFO L273 TraceCheckUtils]: 79: Hoare triple {9325#(<= main_~i~0 36)} assume !(~i~0 < 100000); {9288#false} is VALID [2018-11-14 16:59:37,753 INFO L273 TraceCheckUtils]: 80: Hoare triple {9288#false} ~i~0 := 1; {9288#false} is VALID [2018-11-14 16:59:37,753 INFO L273 TraceCheckUtils]: 81: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 16:59:37,754 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 16:59:37,754 INFO L273 TraceCheckUtils]: 83: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 16:59:37,754 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 16:59:37,754 INFO L273 TraceCheckUtils]: 85: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 16:59:37,754 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 16:59:37,755 INFO L273 TraceCheckUtils]: 87: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 16:59:37,755 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 16:59:37,755 INFO L273 TraceCheckUtils]: 89: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 16:59:37,755 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 16:59:37,755 INFO L273 TraceCheckUtils]: 91: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 16:59:37,756 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 16:59:37,756 INFO L273 TraceCheckUtils]: 93: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 16:59:37,756 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 16:59:37,756 INFO L273 TraceCheckUtils]: 95: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 16:59:37,756 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 16:59:37,756 INFO L273 TraceCheckUtils]: 97: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 16:59:37,756 INFO L273 TraceCheckUtils]: 98: Hoare triple {9288#false} assume !(~i~0 < 100000); {9288#false} is VALID [2018-11-14 16:59:37,756 INFO L273 TraceCheckUtils]: 99: Hoare triple {9288#false} ~i~0 := 1;~j~0 := 0; {9288#false} is VALID [2018-11-14 16:59:37,757 INFO L273 TraceCheckUtils]: 100: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 16:59:37,757 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 16:59:37,757 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 16:59:37,757 INFO L273 TraceCheckUtils]: 103: Hoare triple {9288#false} ~cond := #in~cond; {9288#false} is VALID [2018-11-14 16:59:37,757 INFO L273 TraceCheckUtils]: 104: Hoare triple {9288#false} assume ~cond == 0; {9288#false} is VALID [2018-11-14 16:59:37,757 INFO L273 TraceCheckUtils]: 105: Hoare triple {9288#false} assume !false; {9288#false} is VALID [2018-11-14 16:59:37,764 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 16:59:37,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:37,764 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 16:59:37,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:59:37,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:59:37,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:37,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:38,137 INFO L256 TraceCheckUtils]: 0: Hoare triple {9287#true} call ULTIMATE.init(); {9287#true} is VALID [2018-11-14 16:59:38,137 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 16:59:38,138 INFO L273 TraceCheckUtils]: 2: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,138 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9287#true} {9287#true} #63#return; {9287#true} is VALID [2018-11-14 16:59:38,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {9287#true} call #t~ret4 := main(); {9287#true} is VALID [2018-11-14 16:59:38,138 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 16:59:38,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,139 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 16:59:38,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,139 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 16:59:38,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,140 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 16:59:38,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,140 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 16:59:38,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,140 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 16:59:38,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,141 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 16:59:38,141 INFO L273 TraceCheckUtils]: 18: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,141 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 16:59:38,141 INFO L273 TraceCheckUtils]: 20: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,141 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 16:59:38,141 INFO L273 TraceCheckUtils]: 22: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,141 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 16:59:38,142 INFO L273 TraceCheckUtils]: 24: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,142 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 16:59:38,142 INFO L273 TraceCheckUtils]: 26: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,142 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 16:59:38,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,142 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 16:59:38,142 INFO L273 TraceCheckUtils]: 30: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,143 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 16:59:38,143 INFO L273 TraceCheckUtils]: 32: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,143 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 16:59:38,143 INFO L273 TraceCheckUtils]: 34: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,143 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 16:59:38,143 INFO L273 TraceCheckUtils]: 36: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,143 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 16:59:38,144 INFO L273 TraceCheckUtils]: 38: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,144 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 16:59:38,144 INFO L273 TraceCheckUtils]: 40: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,144 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 16:59:38,144 INFO L273 TraceCheckUtils]: 42: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,144 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 16:59:38,144 INFO L273 TraceCheckUtils]: 44: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,145 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 16:59:38,145 INFO L273 TraceCheckUtils]: 46: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,145 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 16:59:38,145 INFO L273 TraceCheckUtils]: 48: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,145 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 16:59:38,145 INFO L273 TraceCheckUtils]: 50: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,145 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 16:59:38,146 INFO L273 TraceCheckUtils]: 52: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,146 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 16:59:38,146 INFO L273 TraceCheckUtils]: 54: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,146 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 16:59:38,146 INFO L273 TraceCheckUtils]: 56: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,146 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 16:59:38,146 INFO L273 TraceCheckUtils]: 58: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,147 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 16:59:38,147 INFO L273 TraceCheckUtils]: 60: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,147 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 16:59:38,147 INFO L273 TraceCheckUtils]: 62: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,147 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 16:59:38,147 INFO L273 TraceCheckUtils]: 64: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,148 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 16:59:38,148 INFO L273 TraceCheckUtils]: 66: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,148 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 16:59:38,148 INFO L273 TraceCheckUtils]: 68: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,148 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 16:59:38,148 INFO L273 TraceCheckUtils]: 70: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,148 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 16:59:38,149 INFO L273 TraceCheckUtils]: 72: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,149 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 16:59:38,149 INFO L273 TraceCheckUtils]: 74: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,149 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 16:59:38,149 INFO L273 TraceCheckUtils]: 76: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,149 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 16:59:38,149 INFO L273 TraceCheckUtils]: 78: Hoare triple {9287#true} assume true; {9287#true} is VALID [2018-11-14 16:59:38,150 INFO L273 TraceCheckUtils]: 79: Hoare triple {9287#true} assume !(~i~0 < 100000); {9287#true} is VALID [2018-11-14 16:59:38,150 INFO L273 TraceCheckUtils]: 80: Hoare triple {9287#true} ~i~0 := 1; {9290#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:38,151 INFO L273 TraceCheckUtils]: 81: Hoare triple {9290#(<= main_~i~0 1)} assume true; {9290#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:38,151 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 16:59:38,152 INFO L273 TraceCheckUtils]: 83: Hoare triple {9299#(<= main_~i~0 10)} assume true; {9299#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:38,152 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 16:59:38,153 INFO L273 TraceCheckUtils]: 85: Hoare triple {9308#(<= main_~i~0 19)} assume true; {9308#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:38,154 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 16:59:38,155 INFO L273 TraceCheckUtils]: 87: Hoare triple {9317#(<= main_~i~0 28)} assume true; {9317#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:38,156 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 16:59:38,157 INFO L273 TraceCheckUtils]: 89: Hoare triple {9593#(<= main_~i~0 37)} assume true; {9593#(<= main_~i~0 37)} is VALID [2018-11-14 16:59:38,158 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 16:59:38,158 INFO L273 TraceCheckUtils]: 91: Hoare triple {9600#(<= main_~i~0 46)} assume true; {9600#(<= main_~i~0 46)} is VALID [2018-11-14 16:59:38,160 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 16:59:38,160 INFO L273 TraceCheckUtils]: 93: Hoare triple {9607#(<= main_~i~0 55)} assume true; {9607#(<= main_~i~0 55)} is VALID [2018-11-14 16:59:38,161 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 16:59:38,162 INFO L273 TraceCheckUtils]: 95: Hoare triple {9614#(<= main_~i~0 64)} assume true; {9614#(<= main_~i~0 64)} is VALID [2018-11-14 16:59:38,163 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 16:59:38,164 INFO L273 TraceCheckUtils]: 97: Hoare triple {9621#(<= main_~i~0 73)} assume true; {9621#(<= main_~i~0 73)} is VALID [2018-11-14 16:59:38,165 INFO L273 TraceCheckUtils]: 98: Hoare triple {9621#(<= main_~i~0 73)} assume !(~i~0 < 100000); {9288#false} is VALID [2018-11-14 16:59:38,165 INFO L273 TraceCheckUtils]: 99: Hoare triple {9288#false} ~i~0 := 1;~j~0 := 0; {9288#false} is VALID [2018-11-14 16:59:38,165 INFO L273 TraceCheckUtils]: 100: Hoare triple {9288#false} assume true; {9288#false} is VALID [2018-11-14 16:59:38,165 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 16:59:38,166 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 16:59:38,166 INFO L273 TraceCheckUtils]: 103: Hoare triple {9288#false} ~cond := #in~cond; {9288#false} is VALID [2018-11-14 16:59:38,166 INFO L273 TraceCheckUtils]: 104: Hoare triple {9288#false} assume ~cond == 0; {9288#false} is VALID [2018-11-14 16:59:38,166 INFO L273 TraceCheckUtils]: 105: Hoare triple {9288#false} assume !false; {9288#false} is VALID [2018-11-14 16:59:38,176 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 16:59:38,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:38,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 11] total 44 [2018-11-14 16:59:38,198 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 106 [2018-11-14 16:59:38,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:38,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-14 16:59:38,348 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 16:59:38,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-14 16:59:38,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-14 16:59:38,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-14 16:59:38,351 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 44 states. [2018-11-14 16:59:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:40,043 INFO L93 Difference]: Finished difference Result 190 states and 209 transitions. [2018-11-14 16:59:40,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-14 16:59:40,043 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 106 [2018-11-14 16:59:40,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:59:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 193 transitions. [2018-11-14 16:59:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:59:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 193 transitions. [2018-11-14 16:59:40,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 193 transitions. [2018-11-14 16:59:42,196 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 16:59:42,200 INFO L225 Difference]: With dead ends: 190 [2018-11-14 16:59:42,200 INFO L226 Difference]: Without dead ends: 160 [2018-11-14 16:59:42,201 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-14 16:59:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-14 16:59:42,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 124. [2018-11-14 16:59:42,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:42,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 124 states. [2018-11-14 16:59:42,269 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 124 states. [2018-11-14 16:59:42,269 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 124 states. [2018-11-14 16:59:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:42,273 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2018-11-14 16:59:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2018-11-14 16:59:42,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:42,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:42,274 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 160 states. [2018-11-14 16:59:42,274 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 160 states. [2018-11-14 16:59:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:42,278 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2018-11-14 16:59:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2018-11-14 16:59:42,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:42,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:42,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:42,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-14 16:59:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-11-14 16:59:42,281 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 106 [2018-11-14 16:59:42,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:42,282 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-11-14 16:59:42,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-14 16:59:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-11-14 16:59:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-14 16:59:42,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:42,283 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 16:59:42,284 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:42,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash 662924499, now seen corresponding path program 17 times [2018-11-14 16:59:42,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:42,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:42,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:42,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:42,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:43,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {10432#true} call ULTIMATE.init(); {10432#true} is VALID [2018-11-14 16:59:43,816 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 16:59:43,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {10432#true} assume true; {10432#true} is VALID [2018-11-14 16:59:43,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10432#true} {10432#true} #63#return; {10432#true} is VALID [2018-11-14 16:59:43,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {10432#true} call #t~ret4 := main(); {10432#true} is VALID [2018-11-14 16:59:43,817 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 16:59:43,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {10434#(= main_~i~0 0)} assume true; {10434#(= main_~i~0 0)} is VALID [2018-11-14 16:59:43,819 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 16:59:43,820 INFO L273 TraceCheckUtils]: 8: Hoare triple {10435#(<= main_~i~0 1)} assume true; {10435#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:43,821 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 16:59:43,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {10436#(<= main_~i~0 2)} assume true; {10436#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:43,822 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 16:59:43,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {10437#(<= main_~i~0 3)} assume true; {10437#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:43,824 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 16:59:43,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {10438#(<= main_~i~0 4)} assume true; {10438#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:43,825 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 16:59:43,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {10439#(<= main_~i~0 5)} assume true; {10439#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:43,827 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 16:59:43,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {10440#(<= main_~i~0 6)} assume true; {10440#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:43,828 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 16:59:43,829 INFO L273 TraceCheckUtils]: 20: Hoare triple {10441#(<= main_~i~0 7)} assume true; {10441#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:43,830 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 16:59:43,830 INFO L273 TraceCheckUtils]: 22: Hoare triple {10442#(<= main_~i~0 8)} assume true; {10442#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:43,831 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 16:59:43,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {10443#(<= main_~i~0 9)} assume true; {10443#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:43,833 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 16:59:43,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {10444#(<= main_~i~0 10)} assume true; {10444#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:43,834 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 16:59:43,835 INFO L273 TraceCheckUtils]: 28: Hoare triple {10445#(<= main_~i~0 11)} assume true; {10445#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:43,836 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 16:59:43,837 INFO L273 TraceCheckUtils]: 30: Hoare triple {10446#(<= main_~i~0 12)} assume true; {10446#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:43,838 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 16:59:43,838 INFO L273 TraceCheckUtils]: 32: Hoare triple {10447#(<= main_~i~0 13)} assume true; {10447#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:43,839 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 16:59:43,840 INFO L273 TraceCheckUtils]: 34: Hoare triple {10448#(<= main_~i~0 14)} assume true; {10448#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:43,841 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 16:59:43,841 INFO L273 TraceCheckUtils]: 36: Hoare triple {10449#(<= main_~i~0 15)} assume true; {10449#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:43,842 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 16:59:43,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {10450#(<= main_~i~0 16)} assume true; {10450#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:43,844 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 16:59:43,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {10451#(<= main_~i~0 17)} assume true; {10451#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:43,845 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 16:59:43,846 INFO L273 TraceCheckUtils]: 42: Hoare triple {10452#(<= main_~i~0 18)} assume true; {10452#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:43,847 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 16:59:43,847 INFO L273 TraceCheckUtils]: 44: Hoare triple {10453#(<= main_~i~0 19)} assume true; {10453#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:43,848 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 16:59:43,849 INFO L273 TraceCheckUtils]: 46: Hoare triple {10454#(<= main_~i~0 20)} assume true; {10454#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:43,850 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 16:59:43,850 INFO L273 TraceCheckUtils]: 48: Hoare triple {10455#(<= main_~i~0 21)} assume true; {10455#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:43,851 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 16:59:43,852 INFO L273 TraceCheckUtils]: 50: Hoare triple {10456#(<= main_~i~0 22)} assume true; {10456#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:43,853 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 16:59:43,853 INFO L273 TraceCheckUtils]: 52: Hoare triple {10457#(<= main_~i~0 23)} assume true; {10457#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:43,854 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 16:59:43,855 INFO L273 TraceCheckUtils]: 54: Hoare triple {10458#(<= main_~i~0 24)} assume true; {10458#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:43,856 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 16:59:43,856 INFO L273 TraceCheckUtils]: 56: Hoare triple {10459#(<= main_~i~0 25)} assume true; {10459#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:43,857 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 16:59:43,858 INFO L273 TraceCheckUtils]: 58: Hoare triple {10460#(<= main_~i~0 26)} assume true; {10460#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:43,859 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 16:59:43,859 INFO L273 TraceCheckUtils]: 60: Hoare triple {10461#(<= main_~i~0 27)} assume true; {10461#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:43,860 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 16:59:43,861 INFO L273 TraceCheckUtils]: 62: Hoare triple {10462#(<= main_~i~0 28)} assume true; {10462#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:43,862 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 16:59:43,862 INFO L273 TraceCheckUtils]: 64: Hoare triple {10463#(<= main_~i~0 29)} assume true; {10463#(<= main_~i~0 29)} is VALID [2018-11-14 16:59:43,863 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 16:59:43,864 INFO L273 TraceCheckUtils]: 66: Hoare triple {10464#(<= main_~i~0 30)} assume true; {10464#(<= main_~i~0 30)} is VALID [2018-11-14 16:59:43,865 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 16:59:43,866 INFO L273 TraceCheckUtils]: 68: Hoare triple {10465#(<= main_~i~0 31)} assume true; {10465#(<= main_~i~0 31)} is VALID [2018-11-14 16:59:43,867 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 16:59:43,867 INFO L273 TraceCheckUtils]: 70: Hoare triple {10466#(<= main_~i~0 32)} assume true; {10466#(<= main_~i~0 32)} is VALID [2018-11-14 16:59:43,868 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 16:59:43,869 INFO L273 TraceCheckUtils]: 72: Hoare triple {10467#(<= main_~i~0 33)} assume true; {10467#(<= main_~i~0 33)} is VALID [2018-11-14 16:59:43,870 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 16:59:43,870 INFO L273 TraceCheckUtils]: 74: Hoare triple {10468#(<= main_~i~0 34)} assume true; {10468#(<= main_~i~0 34)} is VALID [2018-11-14 16:59:43,871 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 16:59:43,872 INFO L273 TraceCheckUtils]: 76: Hoare triple {10469#(<= main_~i~0 35)} assume true; {10469#(<= main_~i~0 35)} is VALID [2018-11-14 16:59:43,873 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 16:59:43,874 INFO L273 TraceCheckUtils]: 78: Hoare triple {10470#(<= main_~i~0 36)} assume true; {10470#(<= main_~i~0 36)} is VALID [2018-11-14 16:59:43,875 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 16:59:43,875 INFO L273 TraceCheckUtils]: 80: Hoare triple {10471#(<= main_~i~0 37)} assume true; {10471#(<= main_~i~0 37)} is VALID [2018-11-14 16:59:43,876 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 16:59:43,877 INFO L273 TraceCheckUtils]: 82: Hoare triple {10472#(<= main_~i~0 38)} assume true; {10472#(<= main_~i~0 38)} is VALID [2018-11-14 16:59:43,878 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 16:59:43,878 INFO L273 TraceCheckUtils]: 84: Hoare triple {10473#(<= main_~i~0 39)} assume true; {10473#(<= main_~i~0 39)} is VALID [2018-11-14 16:59:43,879 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 16:59:43,880 INFO L273 TraceCheckUtils]: 86: Hoare triple {10474#(<= main_~i~0 40)} assume true; {10474#(<= main_~i~0 40)} is VALID [2018-11-14 16:59:43,881 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 16:59:43,881 INFO L273 TraceCheckUtils]: 88: Hoare triple {10475#(<= main_~i~0 41)} assume true; {10475#(<= main_~i~0 41)} is VALID [2018-11-14 16:59:43,882 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 16:59:43,883 INFO L273 TraceCheckUtils]: 90: Hoare triple {10476#(<= main_~i~0 42)} assume true; {10476#(<= main_~i~0 42)} is VALID [2018-11-14 16:59:43,884 INFO L273 TraceCheckUtils]: 91: Hoare triple {10476#(<= main_~i~0 42)} assume !(~i~0 < 100000); {10433#false} is VALID [2018-11-14 16:59:43,884 INFO L273 TraceCheckUtils]: 92: Hoare triple {10433#false} ~i~0 := 1; {10433#false} is VALID [2018-11-14 16:59:43,884 INFO L273 TraceCheckUtils]: 93: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:59:43,884 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 16:59:43,884 INFO L273 TraceCheckUtils]: 95: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:59:43,885 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 16:59:43,885 INFO L273 TraceCheckUtils]: 97: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:59:43,885 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 16:59:43,885 INFO L273 TraceCheckUtils]: 99: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:59:43,885 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 16:59:43,886 INFO L273 TraceCheckUtils]: 101: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:59:43,886 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 16:59:43,886 INFO L273 TraceCheckUtils]: 103: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:59:43,886 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 16:59:43,886 INFO L273 TraceCheckUtils]: 105: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:59:43,886 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 16:59:43,887 INFO L273 TraceCheckUtils]: 107: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:59:43,887 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 16:59:43,887 INFO L273 TraceCheckUtils]: 109: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:59:43,887 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 16:59:43,887 INFO L273 TraceCheckUtils]: 111: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:59:43,887 INFO L273 TraceCheckUtils]: 112: Hoare triple {10433#false} assume !(~i~0 < 100000); {10433#false} is VALID [2018-11-14 16:59:43,887 INFO L273 TraceCheckUtils]: 113: Hoare triple {10433#false} ~i~0 := 1;~j~0 := 0; {10433#false} is VALID [2018-11-14 16:59:43,887 INFO L273 TraceCheckUtils]: 114: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:59:43,887 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 16:59:43,888 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 16:59:43,888 INFO L273 TraceCheckUtils]: 117: Hoare triple {10433#false} ~cond := #in~cond; {10433#false} is VALID [2018-11-14 16:59:43,888 INFO L273 TraceCheckUtils]: 118: Hoare triple {10433#false} assume ~cond == 0; {10433#false} is VALID [2018-11-14 16:59:43,888 INFO L273 TraceCheckUtils]: 119: Hoare triple {10433#false} assume !false; {10433#false} is VALID [2018-11-14 16:59:43,897 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 16:59:43,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:43,897 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 16:59:43,907 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1