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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_04_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:07:58,965 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:07:58,967 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:07:58,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:07:58,985 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:07:58,987 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:07:58,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:07:58,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:07:58,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:07:58,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:07:58,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:07:58,996 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:07:58,998 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:07:59,000 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:07:59,001 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:07:59,004 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:07:59,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:07:59,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:07:59,014 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:07:59,015 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:07:59,016 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:07:59,018 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:07:59,023 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:07:59,023 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:07:59,023 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:07:59,024 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:07:59,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:07:59,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:07:59,029 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:07:59,032 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:07:59,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:07:59,033 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:07:59,034 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:07:59,035 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:07:59,037 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:07:59,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:07:59,038 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-23 12:07:59,070 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:07:59,070 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:07:59,072 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:07:59,072 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:07:59,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:07:59,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:07:59,077 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:07:59,077 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:07:59,077 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:07:59,077 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:07:59,078 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:07:59,078 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:07:59,078 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:07:59,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:07:59,078 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:07:59,079 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:07:59,079 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:07:59,079 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:07:59,079 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:07:59,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:07:59,080 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:07:59,080 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:07:59,080 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:07:59,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:07:59,080 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:07:59,081 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:07:59,081 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:07:59,081 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:07:59,081 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:07:59,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:07:59,082 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:07:59,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:07:59,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:07:59,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:07:59,149 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:07:59,150 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:07:59,150 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_04_true-unreach-call.i [2018-11-23 12:07:59,223 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b15be7e61/dfeb9a19a220481da15826a0653dd57d/FLAG4d3a84e33 [2018-11-23 12:07:59,657 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:07:59,658 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_04_true-unreach-call.i [2018-11-23 12:07:59,665 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b15be7e61/dfeb9a19a220481da15826a0653dd57d/FLAG4d3a84e33 [2018-11-23 12:08:00,030 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b15be7e61/dfeb9a19a220481da15826a0653dd57d [2018-11-23 12:08:00,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:08:00,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:08:00,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:08:00,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:08:00,047 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:08:00,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:08:00" (1/1) ... [2018-11-23 12:08:00,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7374229f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00, skipping insertion in model container [2018-11-23 12:08:00,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:08:00" (1/1) ... [2018-11-23 12:08:00,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:08:00,087 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:08:00,333 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:08:00,338 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:08:00,374 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:08:00,398 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:08:00,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00 WrapperNode [2018-11-23 12:08:00,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:08:00,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:08:00,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:08:00,400 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:08:00,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00" (1/1) ... [2018-11-23 12:08:00,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00" (1/1) ... [2018-11-23 12:08:00,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:08:00,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:08:00,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:08:00,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:08:00,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00" (1/1) ... [2018-11-23 12:08:00,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00" (1/1) ... [2018-11-23 12:08:00,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00" (1/1) ... [2018-11-23 12:08:00,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00" (1/1) ... [2018-11-23 12:08:00,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00" (1/1) ... [2018-11-23 12:08:00,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00" (1/1) ... [2018-11-23 12:08:00,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00" (1/1) ... [2018-11-23 12:08:00,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:08:00,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:08:00,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:08:00,462 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:08:00,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00" (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-23 12:08:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:08:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:08:00,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:08:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:08:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:08:00,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:08:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:08:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:08:00,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:08:00,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:08:00,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:08:00,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:08:01,129 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:08:01,130 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:08:01,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:08:01 BoogieIcfgContainer [2018-11-23 12:08:01,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:08:01,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:08:01,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:08:01,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:08:01,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:08:00" (1/3) ... [2018-11-23 12:08:01,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217d3605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:08:01, skipping insertion in model container [2018-11-23 12:08:01,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:00" (2/3) ... [2018-11-23 12:08:01,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217d3605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:08:01, skipping insertion in model container [2018-11-23 12:08:01,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:08:01" (3/3) ... [2018-11-23 12:08:01,140 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_04_true-unreach-call.i [2018-11-23 12:08:01,151 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:08:01,159 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:08:01,178 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:08:01,212 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:08:01,213 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:08:01,214 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:08:01,214 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:08:01,215 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:08:01,215 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:08:01,215 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:08:01,216 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:08:01,216 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:08:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 12:08:01,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:08:01,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:01,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:01,245 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:01,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:01,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2018-11-23 12:08:01,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:01,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:01,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:01,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:01,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:01,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 12:08:01,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-23 12:08:01,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 12:08:01,406 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2018-11-23 12:08:01,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2018-11-23 12:08:01,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#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; {27#true} is VALID [2018-11-23 12:08:01,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 12:08:01,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 1; {28#false} is VALID [2018-11-23 12:08:01,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !(~i~0 < 100000); {28#false} is VALID [2018-11-23 12:08:01,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} ~i~0 := 1;~j~0 := 0; {28#false} is VALID [2018-11-23 12:08:01,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {28#false} is VALID [2018-11-23 12:08:01,409 INFO L256 TraceCheckUtils]: 11: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {28#false} is VALID [2018-11-23 12:08:01,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 12:08:01,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-23 12:08:01,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 12:08:01,414 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-23 12:08:01,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:08:01,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:08:01,422 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:08:01,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:01,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:08:01,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:01,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:08:01,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:08:01,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:08:01,533 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 12:08:01,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:01,980 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-11-23 12:08:01,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:08:01,980 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:08:01,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:08:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:08:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:08:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:08:01,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 12:08:02,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:02,330 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:08:02,330 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 12:08:02,334 INFO L631 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-23 12:08:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 12:08:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 12:08:02,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:02,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 12:08:02,414 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:08:02,414 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:08:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:02,418 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 12:08:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:08:02,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:02,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:02,420 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:08:02,420 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:08:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:02,424 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 12:08:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:08:02,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:02,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:02,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:02,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:08:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 12:08:02,428 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-23 12:08:02,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:02,429 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 12:08:02,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:08:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:08:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:08:02,430 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:02,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:02,430 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:02,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:02,431 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2018-11-23 12:08:02,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:02,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:02,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:02,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:02,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:02,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2018-11-23 12:08:02,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {151#true} is VALID [2018-11-23 12:08:02,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {151#true} assume true; {151#true} is VALID [2018-11-23 12:08:02,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {151#true} {151#true} #60#return; {151#true} is VALID [2018-11-23 12:08:02,514 INFO L256 TraceCheckUtils]: 4: Hoare triple {151#true} call #t~ret4 := main(); {151#true} is VALID [2018-11-23 12:08:02,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {151#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; {153#(= main_~i~0 0)} is VALID [2018-11-23 12:08:02,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {153#(= main_~i~0 0)} assume !(~i~0 < 100000); {152#false} is VALID [2018-11-23 12:08:02,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {152#false} ~i~0 := 1; {152#false} is VALID [2018-11-23 12:08:02,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {152#false} assume !(~i~0 < 100000); {152#false} is VALID [2018-11-23 12:08:02,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {152#false} ~i~0 := 1;~j~0 := 0; {152#false} is VALID [2018-11-23 12:08:02,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {152#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {152#false} is VALID [2018-11-23 12:08:02,525 INFO L256 TraceCheckUtils]: 11: Hoare triple {152#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {152#false} is VALID [2018-11-23 12:08:02,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {152#false} ~cond := #in~cond; {152#false} is VALID [2018-11-23 12:08:02,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {152#false} assume 0 == ~cond; {152#false} is VALID [2018-11-23 12:08:02,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {152#false} assume !false; {152#false} is VALID [2018-11-23 12:08:02,527 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-23 12:08:02,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:08:02,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:08:02,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:08:02,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:02,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:08:02,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:02,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:08:02,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:08:02,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:08:02,663 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-23 12:08:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:02,796 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:08:02,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:08:02,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:08:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:08:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:08:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:08:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:08:02,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 12:08:02,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:02,871 INFO L225 Difference]: With dead ends: 32 [2018-11-23 12:08:02,871 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:08:02,872 INFO L631 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-23 12:08:02,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:08:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:08:02,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:02,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:08:02,898 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:08:02,899 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:08:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:02,901 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:08:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:08:02,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:02,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:02,902 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:08:02,902 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:08:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:02,904 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:08:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:08:02,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:02,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:02,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:02,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:08:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 12:08:02,907 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2018-11-23 12:08:02,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:02,908 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 12:08:02,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:08:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:08:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:08:02,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:02,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:02,909 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:02,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:02,910 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2018-11-23 12:08:02,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:02,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:02,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:02,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:02,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:03,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {272#true} call ULTIMATE.init(); {272#true} is VALID [2018-11-23 12:08:03,037 INFO L273 TraceCheckUtils]: 1: Hoare triple {272#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {272#true} is VALID [2018-11-23 12:08:03,037 INFO L273 TraceCheckUtils]: 2: Hoare triple {272#true} assume true; {272#true} is VALID [2018-11-23 12:08:03,038 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {272#true} {272#true} #60#return; {272#true} is VALID [2018-11-23 12:08:03,038 INFO L256 TraceCheckUtils]: 4: Hoare triple {272#true} call #t~ret4 := main(); {272#true} is VALID [2018-11-23 12:08:03,038 INFO L273 TraceCheckUtils]: 5: Hoare triple {272#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; {272#true} is VALID [2018-11-23 12:08:03,039 INFO L273 TraceCheckUtils]: 6: Hoare triple {272#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {272#true} is VALID [2018-11-23 12:08:03,039 INFO L273 TraceCheckUtils]: 7: Hoare triple {272#true} assume !(~i~0 < 100000); {272#true} is VALID [2018-11-23 12:08:03,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {272#true} ~i~0 := 1; {274#(= main_~i~0 1)} is VALID [2018-11-23 12:08:03,067 INFO L273 TraceCheckUtils]: 9: Hoare triple {274#(= main_~i~0 1)} assume !(~i~0 < 100000); {273#false} is VALID [2018-11-23 12:08:03,067 INFO L273 TraceCheckUtils]: 10: Hoare triple {273#false} ~i~0 := 1;~j~0 := 0; {273#false} is VALID [2018-11-23 12:08:03,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {273#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {273#false} is VALID [2018-11-23 12:08:03,068 INFO L256 TraceCheckUtils]: 12: Hoare triple {273#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {273#false} is VALID [2018-11-23 12:08:03,069 INFO L273 TraceCheckUtils]: 13: Hoare triple {273#false} ~cond := #in~cond; {273#false} is VALID [2018-11-23 12:08:03,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {273#false} assume 0 == ~cond; {273#false} is VALID [2018-11-23 12:08:03,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {273#false} assume !false; {273#false} is VALID [2018-11-23 12:08:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:08:03,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:08:03,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:08:03,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:08:03,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:03,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:08:03,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:03,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:08:03,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:08:03,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:08:03,285 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 12:08:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:03,446 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:08:03,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:08:03,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:08:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:08:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2018-11-23 12:08:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:08:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2018-11-23 12:08:03,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2018-11-23 12:08:03,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:03,677 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:08:03,677 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:08:03,678 INFO L631 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-23 12:08:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:08:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-23 12:08:03,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:03,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 21 states. [2018-11-23 12:08:03,736 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 21 states. [2018-11-23 12:08:03,736 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 21 states. [2018-11-23 12:08:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:03,740 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:08:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:08:03,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:03,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:03,741 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 24 states. [2018-11-23 12:08:03,741 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 24 states. [2018-11-23 12:08:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:03,744 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:08:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:08:03,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:03,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:03,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:03,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:08:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 12:08:03,747 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2018-11-23 12:08:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:03,748 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 12:08:03,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:08:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:08:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:08:03,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:03,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:03,753 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:03,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:03,754 INFO L82 PathProgramCache]: Analyzing trace with hash -59429947, now seen corresponding path program 1 times [2018-11-23 12:08:03,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:03,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:03,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:03,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:03,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:03,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2018-11-23 12:08:03,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {407#true} is VALID [2018-11-23 12:08:03,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-23 12:08:03,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #60#return; {407#true} is VALID [2018-11-23 12:08:03,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret4 := main(); {407#true} is VALID [2018-11-23 12:08:03,853 INFO L273 TraceCheckUtils]: 5: Hoare triple {407#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; {409#(= main_~i~0 0)} is VALID [2018-11-23 12:08:03,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {409#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {410#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:03,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {410#(<= main_~i~0 1)} assume !(~i~0 < 100000); {408#false} is VALID [2018-11-23 12:08:03,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {408#false} ~i~0 := 1; {408#false} is VALID [2018-11-23 12:08:03,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {408#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {408#false} is VALID [2018-11-23 12:08:03,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {408#false} assume !(~i~0 < 100000); {408#false} is VALID [2018-11-23 12:08:03,859 INFO L273 TraceCheckUtils]: 11: Hoare triple {408#false} ~i~0 := 1;~j~0 := 0; {408#false} is VALID [2018-11-23 12:08:03,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {408#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {408#false} is VALID [2018-11-23 12:08:03,859 INFO L256 TraceCheckUtils]: 13: Hoare triple {408#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {408#false} is VALID [2018-11-23 12:08:03,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {408#false} ~cond := #in~cond; {408#false} is VALID [2018-11-23 12:08:03,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#false} assume 0 == ~cond; {408#false} is VALID [2018-11-23 12:08:03,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {408#false} assume !false; {408#false} is VALID [2018-11-23 12:08:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:08:03,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:03,862 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-23 12:08:03,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:03,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:04,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2018-11-23 12:08:04,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {407#true} is VALID [2018-11-23 12:08:04,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-23 12:08:04,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #60#return; {407#true} is VALID [2018-11-23 12:08:04,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret4 := main(); {407#true} is VALID [2018-11-23 12:08:04,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {407#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; {429#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:04,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {429#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {410#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:04,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {410#(<= main_~i~0 1)} assume !(~i~0 < 100000); {408#false} is VALID [2018-11-23 12:08:04,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {408#false} ~i~0 := 1; {408#false} is VALID [2018-11-23 12:08:04,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {408#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {408#false} is VALID [2018-11-23 12:08:04,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {408#false} assume !(~i~0 < 100000); {408#false} is VALID [2018-11-23 12:08:04,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {408#false} ~i~0 := 1;~j~0 := 0; {408#false} is VALID [2018-11-23 12:08:04,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {408#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {408#false} is VALID [2018-11-23 12:08:04,165 INFO L256 TraceCheckUtils]: 13: Hoare triple {408#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {408#false} is VALID [2018-11-23 12:08:04,166 INFO L273 TraceCheckUtils]: 14: Hoare triple {408#false} ~cond := #in~cond; {408#false} is VALID [2018-11-23 12:08:04,166 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#false} assume 0 == ~cond; {408#false} is VALID [2018-11-23 12:08:04,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {408#false} assume !false; {408#false} is VALID [2018-11-23 12:08:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:08:04,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:04,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:08:04,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:08:04,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:04,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:08:04,255 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-23 12:08:04,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:08:04,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:08:04,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:08:04,256 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-23 12:08:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:04,531 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 12:08:04,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:08:04,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:08:04,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:08:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 12:08:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:08:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 12:08:04,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2018-11-23 12:08:04,664 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-23 12:08:04,666 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:08:04,666 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:08:04,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-23 12:08:04,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:08:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-11-23 12:08:04,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:04,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 22 states. [2018-11-23 12:08:04,696 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 22 states. [2018-11-23 12:08:04,696 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 22 states. [2018-11-23 12:08:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:04,699 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:08:04,699 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:08:04,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:04,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:04,700 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 25 states. [2018-11-23 12:08:04,700 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 25 states. [2018-11-23 12:08:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:04,703 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:08:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:08:04,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:04,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:04,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:04,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:08:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 12:08:04,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2018-11-23 12:08:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:04,707 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 12:08:04,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:08:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 12:08:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:08:04,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:04,708 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:04,708 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:04,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:04,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1302144745, now seen corresponding path program 2 times [2018-11-23 12:08:04,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:04,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:04,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:04,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:04,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:04,827 INFO L256 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2018-11-23 12:08:04,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {603#true} is VALID [2018-11-23 12:08:04,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 12:08:04,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #60#return; {603#true} is VALID [2018-11-23 12:08:04,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret4 := main(); {603#true} is VALID [2018-11-23 12:08:04,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {603#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; {605#(= main_~i~0 0)} is VALID [2018-11-23 12:08:04,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {605#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {606#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:04,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {606#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {607#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:04,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {607#(<= main_~i~0 2)} assume !(~i~0 < 100000); {604#false} is VALID [2018-11-23 12:08:04,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {604#false} ~i~0 := 1; {604#false} is VALID [2018-11-23 12:08:04,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {604#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {604#false} is VALID [2018-11-23 12:08:04,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {604#false} assume !(~i~0 < 100000); {604#false} is VALID [2018-11-23 12:08:04,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {604#false} ~i~0 := 1;~j~0 := 0; {604#false} is VALID [2018-11-23 12:08:04,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {604#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {604#false} is VALID [2018-11-23 12:08:04,843 INFO L256 TraceCheckUtils]: 14: Hoare triple {604#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {604#false} is VALID [2018-11-23 12:08:04,843 INFO L273 TraceCheckUtils]: 15: Hoare triple {604#false} ~cond := #in~cond; {604#false} is VALID [2018-11-23 12:08:04,843 INFO L273 TraceCheckUtils]: 16: Hoare triple {604#false} assume 0 == ~cond; {604#false} is VALID [2018-11-23 12:08:04,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {604#false} assume !false; {604#false} is VALID [2018-11-23 12:08:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:08:04,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:04,845 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-23 12:08:04,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:08:04,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:08:04,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:04,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:04,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2018-11-23 12:08:04,985 INFO L273 TraceCheckUtils]: 1: Hoare triple {603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {603#true} is VALID [2018-11-23 12:08:04,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 12:08:04,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #60#return; {603#true} is VALID [2018-11-23 12:08:04,986 INFO L256 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret4 := main(); {603#true} is VALID [2018-11-23 12:08:04,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {603#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; {626#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:04,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {626#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {606#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:04,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {606#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {607#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:04,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {607#(<= main_~i~0 2)} assume !(~i~0 < 100000); {604#false} is VALID [2018-11-23 12:08:04,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {604#false} ~i~0 := 1; {604#false} is VALID [2018-11-23 12:08:04,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {604#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {604#false} is VALID [2018-11-23 12:08:04,996 INFO L273 TraceCheckUtils]: 11: Hoare triple {604#false} assume !(~i~0 < 100000); {604#false} is VALID [2018-11-23 12:08:04,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {604#false} ~i~0 := 1;~j~0 := 0; {604#false} is VALID [2018-11-23 12:08:04,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {604#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {604#false} is VALID [2018-11-23 12:08:04,996 INFO L256 TraceCheckUtils]: 14: Hoare triple {604#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {604#false} is VALID [2018-11-23 12:08:04,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {604#false} ~cond := #in~cond; {604#false} is VALID [2018-11-23 12:08:04,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {604#false} assume 0 == ~cond; {604#false} is VALID [2018-11-23 12:08:04,997 INFO L273 TraceCheckUtils]: 17: Hoare triple {604#false} assume !false; {604#false} is VALID [2018-11-23 12:08:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:08:05,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:05,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:08:05,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 12:08:05,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:05,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:08:05,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:05,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:08:05,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:08:05,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:08:05,044 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2018-11-23 12:08:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:05,302 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 12:08:05,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:08:05,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 12:08:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:08:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-23 12:08:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:08:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-23 12:08:05,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2018-11-23 12:08:05,384 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-23 12:08:05,387 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:08:05,387 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:08:05,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-23 12:08:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:08:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-11-23 12:08:05,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:05,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 23 states. [2018-11-23 12:08:05,409 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 23 states. [2018-11-23 12:08:05,409 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 23 states. [2018-11-23 12:08:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:05,411 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 12:08:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:08:05,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:05,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:05,413 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 26 states. [2018-11-23 12:08:05,413 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 26 states. [2018-11-23 12:08:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:05,415 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 12:08:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:08:05,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:05,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:05,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:05,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:08:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 12:08:05,418 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2018-11-23 12:08:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:05,419 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 12:08:05,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:08:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 12:08:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:08:05,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:05,420 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:05,420 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:05,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:05,421 INFO L82 PathProgramCache]: Analyzing trace with hash 561287237, now seen corresponding path program 3 times [2018-11-23 12:08:05,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:05,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:05,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:05,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:05,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:05,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {809#true} is VALID [2018-11-23 12:08:05,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {809#true} is VALID [2018-11-23 12:08:05,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {809#true} assume true; {809#true} is VALID [2018-11-23 12:08:05,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} #60#return; {809#true} is VALID [2018-11-23 12:08:05,598 INFO L256 TraceCheckUtils]: 4: Hoare triple {809#true} call #t~ret4 := main(); {809#true} is VALID [2018-11-23 12:08:05,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {809#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; {811#(= main_~i~0 0)} is VALID [2018-11-23 12:08:05,613 INFO L273 TraceCheckUtils]: 6: Hoare triple {811#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {812#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:05,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {812#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {813#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:05,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {813#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {814#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:05,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {814#(<= main_~i~0 3)} assume !(~i~0 < 100000); {810#false} is VALID [2018-11-23 12:08:05,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {810#false} ~i~0 := 1; {810#false} is VALID [2018-11-23 12:08:05,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {810#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {810#false} is VALID [2018-11-23 12:08:05,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {810#false} assume !(~i~0 < 100000); {810#false} is VALID [2018-11-23 12:08:05,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {810#false} ~i~0 := 1;~j~0 := 0; {810#false} is VALID [2018-11-23 12:08:05,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {810#false} is VALID [2018-11-23 12:08:05,619 INFO L256 TraceCheckUtils]: 15: Hoare triple {810#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {810#false} is VALID [2018-11-23 12:08:05,620 INFO L273 TraceCheckUtils]: 16: Hoare triple {810#false} ~cond := #in~cond; {810#false} is VALID [2018-11-23 12:08:05,620 INFO L273 TraceCheckUtils]: 17: Hoare triple {810#false} assume 0 == ~cond; {810#false} is VALID [2018-11-23 12:08:05,621 INFO L273 TraceCheckUtils]: 18: Hoare triple {810#false} assume !false; {810#false} is VALID [2018-11-23 12:08:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:08:05,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:05,622 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-23 12:08:05,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:08:05,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:08:05,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:05,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:05,760 INFO L256 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {809#true} is VALID [2018-11-23 12:08:05,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {809#true} is VALID [2018-11-23 12:08:05,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {809#true} assume true; {809#true} is VALID [2018-11-23 12:08:05,761 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} #60#return; {809#true} is VALID [2018-11-23 12:08:05,761 INFO L256 TraceCheckUtils]: 4: Hoare triple {809#true} call #t~ret4 := main(); {809#true} is VALID [2018-11-23 12:08:05,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {809#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; {809#true} is VALID [2018-11-23 12:08:05,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {809#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {809#true} is VALID [2018-11-23 12:08:05,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {809#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {809#true} is VALID [2018-11-23 12:08:05,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {809#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {809#true} is VALID [2018-11-23 12:08:05,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {809#true} assume !(~i~0 < 100000); {809#true} is VALID [2018-11-23 12:08:05,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {809#true} ~i~0 := 1; {812#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:05,767 INFO L273 TraceCheckUtils]: 11: Hoare triple {812#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {851#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:05,770 INFO L273 TraceCheckUtils]: 12: Hoare triple {851#(<= main_~i~0 5)} assume !(~i~0 < 100000); {810#false} is VALID [2018-11-23 12:08:05,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {810#false} ~i~0 := 1;~j~0 := 0; {810#false} is VALID [2018-11-23 12:08:05,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {810#false} is VALID [2018-11-23 12:08:05,770 INFO L256 TraceCheckUtils]: 15: Hoare triple {810#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {810#false} is VALID [2018-11-23 12:08:05,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {810#false} ~cond := #in~cond; {810#false} is VALID [2018-11-23 12:08:05,771 INFO L273 TraceCheckUtils]: 17: Hoare triple {810#false} assume 0 == ~cond; {810#false} is VALID [2018-11-23 12:08:05,771 INFO L273 TraceCheckUtils]: 18: Hoare triple {810#false} assume !false; {810#false} is VALID [2018-11-23 12:08:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:08:05,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:05,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-11-23 12:08:05,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:08:05,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:05,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:08:05,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:05,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:08:05,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:08:05,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:08:05,837 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 7 states. [2018-11-23 12:08:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:06,026 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 12:08:06,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:08:06,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:08:06,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:08:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-23 12:08:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:08:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-23 12:08:06,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2018-11-23 12:08:06,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:06,162 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:08:06,162 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:08:06,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:08:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:08:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-11-23 12:08:06,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:06,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 26 states. [2018-11-23 12:08:06,190 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 26 states. [2018-11-23 12:08:06,190 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 26 states. [2018-11-23 12:08:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:06,193 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:08:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:08:06,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:06,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:06,194 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 32 states. [2018-11-23 12:08:06,194 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 32 states. [2018-11-23 12:08:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:06,197 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:08:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:08:06,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:06,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:06,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:06,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:08:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 12:08:06,200 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2018-11-23 12:08:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:06,200 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 12:08:06,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:08:06,200 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 12:08:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:08:06,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:06,201 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:06,202 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:06,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:06,202 INFO L82 PathProgramCache]: Analyzing trace with hash 53593642, now seen corresponding path program 4 times [2018-11-23 12:08:06,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:06,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:06,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:06,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:06,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:06,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 12:08:06,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1048#true} is VALID [2018-11-23 12:08:06,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 12:08:06,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #60#return; {1048#true} is VALID [2018-11-23 12:08:06,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret4 := main(); {1048#true} is VALID [2018-11-23 12:08:06,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#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; {1050#(= main_~i~0 0)} is VALID [2018-11-23 12:08:06,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {1050#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1051#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:06,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {1051#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1052#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:06,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {1052#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1053#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:06,376 INFO L273 TraceCheckUtils]: 9: Hoare triple {1053#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1054#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:06,377 INFO L273 TraceCheckUtils]: 10: Hoare triple {1054#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1055#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:06,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {1055#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1049#false} is VALID [2018-11-23 12:08:06,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {1049#false} ~i~0 := 1; {1049#false} is VALID [2018-11-23 12:08:06,378 INFO L273 TraceCheckUtils]: 13: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1049#false} is VALID [2018-11-23 12:08:06,378 INFO L273 TraceCheckUtils]: 14: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1049#false} is VALID [2018-11-23 12:08:06,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {1049#false} assume !(~i~0 < 100000); {1049#false} is VALID [2018-11-23 12:08:06,379 INFO L273 TraceCheckUtils]: 16: Hoare triple {1049#false} ~i~0 := 1;~j~0 := 0; {1049#false} is VALID [2018-11-23 12:08:06,379 INFO L273 TraceCheckUtils]: 17: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {1049#false} is VALID [2018-11-23 12:08:06,379 INFO L256 TraceCheckUtils]: 18: Hoare triple {1049#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1049#false} is VALID [2018-11-23 12:08:06,379 INFO L273 TraceCheckUtils]: 19: Hoare triple {1049#false} ~cond := #in~cond; {1049#false} is VALID [2018-11-23 12:08:06,380 INFO L273 TraceCheckUtils]: 20: Hoare triple {1049#false} assume 0 == ~cond; {1049#false} is VALID [2018-11-23 12:08:06,380 INFO L273 TraceCheckUtils]: 21: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 12:08:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:08:06,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:06,381 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-23 12:08:06,390 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:08:06,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:08:06,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:06,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:06,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 12:08:06,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1048#true} is VALID [2018-11-23 12:08:06,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 12:08:06,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #60#return; {1048#true} is VALID [2018-11-23 12:08:06,629 INFO L256 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret4 := main(); {1048#true} is VALID [2018-11-23 12:08:06,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#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; {1074#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:06,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {1074#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1051#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:06,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {1051#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1052#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:06,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {1052#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1053#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:06,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {1053#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1054#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:06,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {1054#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1055#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:06,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {1055#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1049#false} is VALID [2018-11-23 12:08:06,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {1049#false} ~i~0 := 1; {1049#false} is VALID [2018-11-23 12:08:06,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1049#false} is VALID [2018-11-23 12:08:06,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1049#false} is VALID [2018-11-23 12:08:06,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {1049#false} assume !(~i~0 < 100000); {1049#false} is VALID [2018-11-23 12:08:06,637 INFO L273 TraceCheckUtils]: 16: Hoare triple {1049#false} ~i~0 := 1;~j~0 := 0; {1049#false} is VALID [2018-11-23 12:08:06,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {1049#false} is VALID [2018-11-23 12:08:06,638 INFO L256 TraceCheckUtils]: 18: Hoare triple {1049#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1049#false} is VALID [2018-11-23 12:08:06,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {1049#false} ~cond := #in~cond; {1049#false} is VALID [2018-11-23 12:08:06,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {1049#false} assume 0 == ~cond; {1049#false} is VALID [2018-11-23 12:08:06,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 12:08:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:08:06,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:06,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:08:06,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 12:08:06,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:06,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:08:06,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:06,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:08:06,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:08:06,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:08:06,725 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 9 states. [2018-11-23 12:08:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:07,131 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-23 12:08:07,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:08:07,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 12:08:07,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:08:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-23 12:08:07,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:08:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-23 12:08:07,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2018-11-23 12:08:07,231 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-23 12:08:07,233 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:08:07,233 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:08:07,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:08:07,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:08:07,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-23 12:08:07,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:07,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 27 states. [2018-11-23 12:08:07,266 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 27 states. [2018-11-23 12:08:07,266 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 27 states. [2018-11-23 12:08:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:07,269 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 12:08:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:08:07,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:07,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:07,270 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 33 states. [2018-11-23 12:08:07,271 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 33 states. [2018-11-23 12:08:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:07,273 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 12:08:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:08:07,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:07,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:07,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:07,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:08:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 12:08:07,276 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 22 [2018-11-23 12:08:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:07,276 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 12:08:07,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:08:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:08:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:08:07,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:07,278 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:07,278 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:07,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:07,278 INFO L82 PathProgramCache]: Analyzing trace with hash -532864634, now seen corresponding path program 5 times [2018-11-23 12:08:07,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:07,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:07,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:07,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:07,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:07,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2018-11-23 12:08:07,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {1306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1306#true} is VALID [2018-11-23 12:08:07,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2018-11-23 12:08:07,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #60#return; {1306#true} is VALID [2018-11-23 12:08:07,484 INFO L256 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret4 := main(); {1306#true} is VALID [2018-11-23 12:08:07,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {1306#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; {1308#(= main_~i~0 0)} is VALID [2018-11-23 12:08:07,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {1308#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1309#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:07,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {1309#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1310#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:07,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {1310#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1311#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:07,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {1311#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1312#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:07,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {1312#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1313#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:07,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {1313#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1314#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:07,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1307#false} is VALID [2018-11-23 12:08:07,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {1307#false} ~i~0 := 1; {1307#false} is VALID [2018-11-23 12:08:07,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {1307#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1307#false} is VALID [2018-11-23 12:08:07,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {1307#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1307#false} is VALID [2018-11-23 12:08:07,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {1307#false} assume !(~i~0 < 100000); {1307#false} is VALID [2018-11-23 12:08:07,502 INFO L273 TraceCheckUtils]: 17: Hoare triple {1307#false} ~i~0 := 1;~j~0 := 0; {1307#false} is VALID [2018-11-23 12:08:07,502 INFO L273 TraceCheckUtils]: 18: Hoare triple {1307#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {1307#false} is VALID [2018-11-23 12:08:07,503 INFO L256 TraceCheckUtils]: 19: Hoare triple {1307#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1307#false} is VALID [2018-11-23 12:08:07,503 INFO L273 TraceCheckUtils]: 20: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2018-11-23 12:08:07,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2018-11-23 12:08:07,504 INFO L273 TraceCheckUtils]: 22: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2018-11-23 12:08:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:08:07,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:07,505 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-23 12:08:07,515 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:08:07,581 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:08:07,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:07,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:07,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2018-11-23 12:08:07,687 INFO L273 TraceCheckUtils]: 1: Hoare triple {1306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1306#true} is VALID [2018-11-23 12:08:07,687 INFO L273 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2018-11-23 12:08:07,687 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #60#return; {1306#true} is VALID [2018-11-23 12:08:07,688 INFO L256 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret4 := main(); {1306#true} is VALID [2018-11-23 12:08:07,689 INFO L273 TraceCheckUtils]: 5: Hoare triple {1306#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; {1333#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:07,690 INFO L273 TraceCheckUtils]: 6: Hoare triple {1333#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1309#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:07,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {1309#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1310#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:07,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {1310#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1311#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:07,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {1311#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1312#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:07,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {1312#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1313#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:07,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {1313#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1314#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:07,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1307#false} is VALID [2018-11-23 12:08:07,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {1307#false} ~i~0 := 1; {1307#false} is VALID [2018-11-23 12:08:07,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {1307#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1307#false} is VALID [2018-11-23 12:08:07,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {1307#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1307#false} is VALID [2018-11-23 12:08:07,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {1307#false} assume !(~i~0 < 100000); {1307#false} is VALID [2018-11-23 12:08:07,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {1307#false} ~i~0 := 1;~j~0 := 0; {1307#false} is VALID [2018-11-23 12:08:07,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {1307#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {1307#false} is VALID [2018-11-23 12:08:07,756 INFO L256 TraceCheckUtils]: 19: Hoare triple {1307#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1307#false} is VALID [2018-11-23 12:08:07,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2018-11-23 12:08:07,757 INFO L273 TraceCheckUtils]: 21: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2018-11-23 12:08:07,757 INFO L273 TraceCheckUtils]: 22: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2018-11-23 12:08:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:08:07,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:07,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:08:07,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 12:08:07,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:07,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:08:07,845 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-23 12:08:07,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:08:07,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:08:07,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:08:07,846 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 10 states. [2018-11-23 12:08:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:08,076 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:08:08,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:08:08,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 12:08:08,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:08:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-11-23 12:08:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:08:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-11-23 12:08:08,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 52 transitions. [2018-11-23 12:08:08,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:08,138 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:08:08,138 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:08:08,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:08:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:08:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-23 12:08:08,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:08,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 28 states. [2018-11-23 12:08:08,163 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 28 states. [2018-11-23 12:08:08,163 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 28 states. [2018-11-23 12:08:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:08,167 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:08:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:08:08,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:08,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:08,168 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 34 states. [2018-11-23 12:08:08,168 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 34 states. [2018-11-23 12:08:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:08,170 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:08:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:08:08,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:08,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:08,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:08,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:08:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 12:08:08,173 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2018-11-23 12:08:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:08,173 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 12:08:08,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:08:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 12:08:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:08:08,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:08,174 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:08,175 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:08,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:08,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1533202006, now seen corresponding path program 6 times [2018-11-23 12:08:08,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:08,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:08,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:08,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:08,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:08,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2018-11-23 12:08:08,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {1574#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1574#true} is VALID [2018-11-23 12:08:08,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2018-11-23 12:08:08,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #60#return; {1574#true} is VALID [2018-11-23 12:08:08,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret4 := main(); {1574#true} is VALID [2018-11-23 12:08:08,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {1574#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; {1576#(= main_~i~0 0)} is VALID [2018-11-23 12:08:08,375 INFO L273 TraceCheckUtils]: 6: Hoare triple {1576#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1577#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:08,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {1577#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1578#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:08,376 INFO L273 TraceCheckUtils]: 8: Hoare triple {1578#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1579#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:08,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {1579#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1580#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:08,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {1580#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1581#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:08,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {1581#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1582#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:08,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {1582#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1583#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:08,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {1583#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1575#false} is VALID [2018-11-23 12:08:08,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {1575#false} ~i~0 := 1; {1575#false} is VALID [2018-11-23 12:08:08,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {1575#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1575#false} is VALID [2018-11-23 12:08:08,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {1575#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1575#false} is VALID [2018-11-23 12:08:08,388 INFO L273 TraceCheckUtils]: 17: Hoare triple {1575#false} assume !(~i~0 < 100000); {1575#false} is VALID [2018-11-23 12:08:08,388 INFO L273 TraceCheckUtils]: 18: Hoare triple {1575#false} ~i~0 := 1;~j~0 := 0; {1575#false} is VALID [2018-11-23 12:08:08,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {1575#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {1575#false} is VALID [2018-11-23 12:08:08,389 INFO L256 TraceCheckUtils]: 20: Hoare triple {1575#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1575#false} is VALID [2018-11-23 12:08:08,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {1575#false} ~cond := #in~cond; {1575#false} is VALID [2018-11-23 12:08:08,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {1575#false} assume 0 == ~cond; {1575#false} is VALID [2018-11-23 12:08:08,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2018-11-23 12:08:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:08:08,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:08,391 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-23 12:08:08,402 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:08:08,429 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-11-23 12:08:08,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:08,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:08,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2018-11-23 12:08:08,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {1574#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1574#true} is VALID [2018-11-23 12:08:08,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2018-11-23 12:08:08,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #60#return; {1574#true} is VALID [2018-11-23 12:08:08,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret4 := main(); {1574#true} is VALID [2018-11-23 12:08:08,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {1574#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; {1574#true} is VALID [2018-11-23 12:08:08,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {1574#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1574#true} is VALID [2018-11-23 12:08:08,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {1574#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1574#true} is VALID [2018-11-23 12:08:08,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {1574#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1574#true} is VALID [2018-11-23 12:08:08,534 INFO L273 TraceCheckUtils]: 9: Hoare triple {1574#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1574#true} is VALID [2018-11-23 12:08:08,535 INFO L273 TraceCheckUtils]: 10: Hoare triple {1574#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1574#true} is VALID [2018-11-23 12:08:08,535 INFO L273 TraceCheckUtils]: 11: Hoare triple {1574#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1574#true} is VALID [2018-11-23 12:08:08,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {1574#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1574#true} is VALID [2018-11-23 12:08:08,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {1574#true} assume !(~i~0 < 100000); {1574#true} is VALID [2018-11-23 12:08:08,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {1574#true} ~i~0 := 1; {1577#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:08,539 INFO L273 TraceCheckUtils]: 15: Hoare triple {1577#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1581#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:08,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {1581#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1635#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:08,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {1635#(<= main_~i~0 9)} assume !(~i~0 < 100000); {1575#false} is VALID [2018-11-23 12:08:08,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {1575#false} ~i~0 := 1;~j~0 := 0; {1575#false} is VALID [2018-11-23 12:08:08,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {1575#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {1575#false} is VALID [2018-11-23 12:08:08,541 INFO L256 TraceCheckUtils]: 20: Hoare triple {1575#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1575#false} is VALID [2018-11-23 12:08:08,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {1575#false} ~cond := #in~cond; {1575#false} is VALID [2018-11-23 12:08:08,541 INFO L273 TraceCheckUtils]: 22: Hoare triple {1575#false} assume 0 == ~cond; {1575#false} is VALID [2018-11-23 12:08:08,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2018-11-23 12:08:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:08:08,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:08,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2018-11-23 12:08:08,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 12:08:08,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:08,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:08:08,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:08,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:08:08,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:08:08,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:08:08,595 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 11 states. [2018-11-23 12:08:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:09,134 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 12:08:09,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:08:09,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 12:08:09,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:08:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2018-11-23 12:08:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:08:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2018-11-23 12:08:09,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 61 transitions. [2018-11-23 12:08:09,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:09,223 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:08:09,223 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:08:09,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:08:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:08:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-11-23 12:08:09,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:09,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 31 states. [2018-11-23 12:08:09,256 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 31 states. [2018-11-23 12:08:09,257 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 31 states. [2018-11-23 12:08:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:09,260 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 12:08:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 12:08:09,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:09,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:09,260 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 40 states. [2018-11-23 12:08:09,261 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 40 states. [2018-11-23 12:08:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:09,262 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 12:08:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 12:08:09,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:09,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:09,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:09,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:08:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-23 12:08:09,265 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2018-11-23 12:08:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:09,265 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 12:08:09,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:08:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 12:08:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:08:09,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:09,266 INFO L402 BasicCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:09,266 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:09,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:09,267 INFO L82 PathProgramCache]: Analyzing trace with hash 73394789, now seen corresponding path program 7 times [2018-11-23 12:08:09,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:09,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:09,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:09,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:09,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:09,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {1875#true} call ULTIMATE.init(); {1875#true} is VALID [2018-11-23 12:08:09,548 INFO L273 TraceCheckUtils]: 1: Hoare triple {1875#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1875#true} is VALID [2018-11-23 12:08:09,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {1875#true} assume true; {1875#true} is VALID [2018-11-23 12:08:09,548 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1875#true} {1875#true} #60#return; {1875#true} is VALID [2018-11-23 12:08:09,549 INFO L256 TraceCheckUtils]: 4: Hoare triple {1875#true} call #t~ret4 := main(); {1875#true} is VALID [2018-11-23 12:08:09,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {1875#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; {1877#(= main_~i~0 0)} is VALID [2018-11-23 12:08:09,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {1877#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1878#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:09,551 INFO L273 TraceCheckUtils]: 7: Hoare triple {1878#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1879#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:09,554 INFO L273 TraceCheckUtils]: 8: Hoare triple {1879#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1880#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:09,555 INFO L273 TraceCheckUtils]: 9: Hoare triple {1880#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1881#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:09,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {1881#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1882#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:09,556 INFO L273 TraceCheckUtils]: 11: Hoare triple {1882#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1883#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:09,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {1883#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1884#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:09,557 INFO L273 TraceCheckUtils]: 13: Hoare triple {1884#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1885#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:09,558 INFO L273 TraceCheckUtils]: 14: Hoare triple {1885#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1886#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:09,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {1886#(<= main_~i~0 9)} assume !(~i~0 < 100000); {1876#false} is VALID [2018-11-23 12:08:09,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {1876#false} ~i~0 := 1; {1876#false} is VALID [2018-11-23 12:08:09,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {1876#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1876#false} is VALID [2018-11-23 12:08:09,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {1876#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1876#false} is VALID [2018-11-23 12:08:09,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {1876#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1876#false} is VALID [2018-11-23 12:08:09,561 INFO L273 TraceCheckUtils]: 20: Hoare triple {1876#false} assume !(~i~0 < 100000); {1876#false} is VALID [2018-11-23 12:08:09,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {1876#false} ~i~0 := 1;~j~0 := 0; {1876#false} is VALID [2018-11-23 12:08:09,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {1876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {1876#false} is VALID [2018-11-23 12:08:09,562 INFO L256 TraceCheckUtils]: 23: Hoare triple {1876#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1876#false} is VALID [2018-11-23 12:08:09,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {1876#false} ~cond := #in~cond; {1876#false} is VALID [2018-11-23 12:08:09,563 INFO L273 TraceCheckUtils]: 25: Hoare triple {1876#false} assume 0 == ~cond; {1876#false} is VALID [2018-11-23 12:08:09,564 INFO L273 TraceCheckUtils]: 26: Hoare triple {1876#false} assume !false; {1876#false} is VALID [2018-11-23 12:08:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:08:09,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:09,565 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-23 12:08:09,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:09,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:10,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {1875#true} call ULTIMATE.init(); {1875#true} is VALID [2018-11-23 12:08:10,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {1875#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1875#true} is VALID [2018-11-23 12:08:10,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {1875#true} assume true; {1875#true} is VALID [2018-11-23 12:08:10,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1875#true} {1875#true} #60#return; {1875#true} is VALID [2018-11-23 12:08:10,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {1875#true} call #t~ret4 := main(); {1875#true} is VALID [2018-11-23 12:08:10,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {1875#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; {1905#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:10,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {1905#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1878#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:10,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {1878#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1879#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:10,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {1879#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1880#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:10,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {1880#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1881#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:10,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {1881#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1882#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:10,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {1882#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1883#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:10,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {1883#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1884#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:10,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {1884#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1885#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:10,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {1885#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1886#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:10,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {1886#(<= main_~i~0 9)} assume !(~i~0 < 100000); {1876#false} is VALID [2018-11-23 12:08:10,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {1876#false} ~i~0 := 1; {1876#false} is VALID [2018-11-23 12:08:10,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {1876#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1876#false} is VALID [2018-11-23 12:08:10,625 INFO L273 TraceCheckUtils]: 18: Hoare triple {1876#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1876#false} is VALID [2018-11-23 12:08:10,625 INFO L273 TraceCheckUtils]: 19: Hoare triple {1876#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {1876#false} is VALID [2018-11-23 12:08:10,626 INFO L273 TraceCheckUtils]: 20: Hoare triple {1876#false} assume !(~i~0 < 100000); {1876#false} is VALID [2018-11-23 12:08:10,626 INFO L273 TraceCheckUtils]: 21: Hoare triple {1876#false} ~i~0 := 1;~j~0 := 0; {1876#false} is VALID [2018-11-23 12:08:10,626 INFO L273 TraceCheckUtils]: 22: Hoare triple {1876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {1876#false} is VALID [2018-11-23 12:08:10,626 INFO L256 TraceCheckUtils]: 23: Hoare triple {1876#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1876#false} is VALID [2018-11-23 12:08:10,626 INFO L273 TraceCheckUtils]: 24: Hoare triple {1876#false} ~cond := #in~cond; {1876#false} is VALID [2018-11-23 12:08:10,627 INFO L273 TraceCheckUtils]: 25: Hoare triple {1876#false} assume 0 == ~cond; {1876#false} is VALID [2018-11-23 12:08:10,627 INFO L273 TraceCheckUtils]: 26: Hoare triple {1876#false} assume !false; {1876#false} is VALID [2018-11-23 12:08:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:08:10,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:10,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:08:10,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-23 12:08:10,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:10,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:08:10,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:10,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:08:10,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:08:10,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:08:10,698 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 13 states. [2018-11-23 12:08:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:11,297 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-23 12:08:11,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:08:11,297 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-23 12:08:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:08:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-23 12:08:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:08:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-23 12:08:11,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2018-11-23 12:08:11,366 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-23 12:08:11,367 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:08:11,368 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:08:11,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:08:11,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:08:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-11-23 12:08:11,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:11,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 32 states. [2018-11-23 12:08:11,393 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 32 states. [2018-11-23 12:08:11,394 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 32 states. [2018-11-23 12:08:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:11,398 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 12:08:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:08:11,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:11,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:11,399 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 41 states. [2018-11-23 12:08:11,399 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 41 states. [2018-11-23 12:08:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:11,400 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 12:08:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:08:11,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:11,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:11,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:11,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:08:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 12:08:11,402 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 27 [2018-11-23 12:08:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:11,403 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 12:08:11,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:08:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 12:08:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:08:11,403 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:11,403 INFO L402 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:11,404 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:11,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:11,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2083735689, now seen corresponding path program 8 times [2018-11-23 12:08:11,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:11,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:11,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:11,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:11,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:11,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {2195#true} call ULTIMATE.init(); {2195#true} is VALID [2018-11-23 12:08:11,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {2195#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2195#true} is VALID [2018-11-23 12:08:11,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {2195#true} assume true; {2195#true} is VALID [2018-11-23 12:08:11,604 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2195#true} {2195#true} #60#return; {2195#true} is VALID [2018-11-23 12:08:11,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {2195#true} call #t~ret4 := main(); {2195#true} is VALID [2018-11-23 12:08:11,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {2195#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; {2197#(= main_~i~0 0)} is VALID [2018-11-23 12:08:11,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {2197#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2198#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:11,607 INFO L273 TraceCheckUtils]: 7: Hoare triple {2198#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2199#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:11,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {2199#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2200#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:11,608 INFO L273 TraceCheckUtils]: 9: Hoare triple {2200#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2201#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:11,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {2201#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2202#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:11,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {2202#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2203#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:11,612 INFO L273 TraceCheckUtils]: 12: Hoare triple {2203#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2204#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:11,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {2204#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2205#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:11,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {2205#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2206#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:11,615 INFO L273 TraceCheckUtils]: 15: Hoare triple {2206#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2207#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:11,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {2207#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 12:08:11,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {2196#false} ~i~0 := 1; {2196#false} is VALID [2018-11-23 12:08:11,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {2196#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2196#false} is VALID [2018-11-23 12:08:11,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {2196#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2196#false} is VALID [2018-11-23 12:08:11,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {2196#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2196#false} is VALID [2018-11-23 12:08:11,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {2196#false} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 12:08:11,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {2196#false} ~i~0 := 1;~j~0 := 0; {2196#false} is VALID [2018-11-23 12:08:11,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {2196#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {2196#false} is VALID [2018-11-23 12:08:11,618 INFO L256 TraceCheckUtils]: 24: Hoare triple {2196#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2196#false} is VALID [2018-11-23 12:08:11,618 INFO L273 TraceCheckUtils]: 25: Hoare triple {2196#false} ~cond := #in~cond; {2196#false} is VALID [2018-11-23 12:08:11,618 INFO L273 TraceCheckUtils]: 26: Hoare triple {2196#false} assume 0 == ~cond; {2196#false} is VALID [2018-11-23 12:08:11,618 INFO L273 TraceCheckUtils]: 27: Hoare triple {2196#false} assume !false; {2196#false} is VALID [2018-11-23 12:08:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:08:11,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:11,620 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-23 12:08:11,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:08:11,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:08:11,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:11,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:11,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {2195#true} call ULTIMATE.init(); {2195#true} is VALID [2018-11-23 12:08:11,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {2195#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2195#true} is VALID [2018-11-23 12:08:11,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {2195#true} assume true; {2195#true} is VALID [2018-11-23 12:08:11,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2195#true} {2195#true} #60#return; {2195#true} is VALID [2018-11-23 12:08:11,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {2195#true} call #t~ret4 := main(); {2195#true} is VALID [2018-11-23 12:08:11,834 INFO L273 TraceCheckUtils]: 5: Hoare triple {2195#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; {2226#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:11,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {2226#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2198#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:11,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {2198#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2199#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:11,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {2199#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2200#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:11,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {2200#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2201#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:11,843 INFO L273 TraceCheckUtils]: 10: Hoare triple {2201#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2202#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:11,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {2202#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2203#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:11,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {2203#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2204#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:11,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {2204#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2205#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:11,850 INFO L273 TraceCheckUtils]: 14: Hoare triple {2205#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2206#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:11,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {2206#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2207#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:11,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {2207#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 12:08:11,851 INFO L273 TraceCheckUtils]: 17: Hoare triple {2196#false} ~i~0 := 1; {2196#false} is VALID [2018-11-23 12:08:11,851 INFO L273 TraceCheckUtils]: 18: Hoare triple {2196#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2196#false} is VALID [2018-11-23 12:08:11,851 INFO L273 TraceCheckUtils]: 19: Hoare triple {2196#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2196#false} is VALID [2018-11-23 12:08:11,851 INFO L273 TraceCheckUtils]: 20: Hoare triple {2196#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2196#false} is VALID [2018-11-23 12:08:11,852 INFO L273 TraceCheckUtils]: 21: Hoare triple {2196#false} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 12:08:11,852 INFO L273 TraceCheckUtils]: 22: Hoare triple {2196#false} ~i~0 := 1;~j~0 := 0; {2196#false} is VALID [2018-11-23 12:08:11,852 INFO L273 TraceCheckUtils]: 23: Hoare triple {2196#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {2196#false} is VALID [2018-11-23 12:08:11,852 INFO L256 TraceCheckUtils]: 24: Hoare triple {2196#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2196#false} is VALID [2018-11-23 12:08:11,852 INFO L273 TraceCheckUtils]: 25: Hoare triple {2196#false} ~cond := #in~cond; {2196#false} is VALID [2018-11-23 12:08:11,852 INFO L273 TraceCheckUtils]: 26: Hoare triple {2196#false} assume 0 == ~cond; {2196#false} is VALID [2018-11-23 12:08:11,853 INFO L273 TraceCheckUtils]: 27: Hoare triple {2196#false} assume !false; {2196#false} is VALID [2018-11-23 12:08:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:08:11,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:11,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:08:11,873 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 12:08:11,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:11,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:08:11,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:11,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:08:11,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:08:11,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:08:11,899 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 14 states. [2018-11-23 12:08:12,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:12,369 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 12:08:12,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:08:12,369 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 12:08:12,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:08:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2018-11-23 12:08:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:08:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2018-11-23 12:08:12,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 61 transitions. [2018-11-23 12:08:12,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:12,479 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:08:12,479 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:08:12,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:08:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:08:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-11-23 12:08:12,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:12,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 33 states. [2018-11-23 12:08:12,507 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 33 states. [2018-11-23 12:08:12,507 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 33 states. [2018-11-23 12:08:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:12,509 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 12:08:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 12:08:12,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:12,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:12,510 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 42 states. [2018-11-23 12:08:12,510 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 42 states. [2018-11-23 12:08:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:12,511 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 12:08:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 12:08:12,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:12,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:12,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:12,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:08:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 12:08:12,513 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2018-11-23 12:08:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:12,513 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 12:08:12,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:08:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 12:08:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:08:12,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:12,514 INFO L402 BasicCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:12,514 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:12,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:12,514 INFO L82 PathProgramCache]: Analyzing trace with hash -20205851, now seen corresponding path program 9 times [2018-11-23 12:08:12,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:12,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:12,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:12,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:12,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:12,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2525#true} is VALID [2018-11-23 12:08:12,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {2525#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2525#true} is VALID [2018-11-23 12:08:12,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2018-11-23 12:08:12,744 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #60#return; {2525#true} is VALID [2018-11-23 12:08:12,744 INFO L256 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret4 := main(); {2525#true} is VALID [2018-11-23 12:08:12,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {2525#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; {2527#(= main_~i~0 0)} is VALID [2018-11-23 12:08:12,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {2527#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2528#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:12,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {2528#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2529#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:12,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {2529#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2530#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:12,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {2530#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2531#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:12,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {2531#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2532#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:12,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {2532#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2533#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:12,752 INFO L273 TraceCheckUtils]: 12: Hoare triple {2533#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2534#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:12,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {2534#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2535#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:12,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {2535#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2536#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:12,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {2536#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2537#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:12,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {2537#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2538#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:12,757 INFO L273 TraceCheckUtils]: 17: Hoare triple {2538#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2526#false} is VALID [2018-11-23 12:08:12,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {2526#false} ~i~0 := 1; {2526#false} is VALID [2018-11-23 12:08:12,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {2526#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2526#false} is VALID [2018-11-23 12:08:12,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {2526#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2526#false} is VALID [2018-11-23 12:08:12,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {2526#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2526#false} is VALID [2018-11-23 12:08:12,758 INFO L273 TraceCheckUtils]: 22: Hoare triple {2526#false} assume !(~i~0 < 100000); {2526#false} is VALID [2018-11-23 12:08:12,758 INFO L273 TraceCheckUtils]: 23: Hoare triple {2526#false} ~i~0 := 1;~j~0 := 0; {2526#false} is VALID [2018-11-23 12:08:12,758 INFO L273 TraceCheckUtils]: 24: Hoare triple {2526#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {2526#false} is VALID [2018-11-23 12:08:12,758 INFO L256 TraceCheckUtils]: 25: Hoare triple {2526#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2526#false} is VALID [2018-11-23 12:08:12,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {2526#false} ~cond := #in~cond; {2526#false} is VALID [2018-11-23 12:08:12,759 INFO L273 TraceCheckUtils]: 27: Hoare triple {2526#false} assume 0 == ~cond; {2526#false} is VALID [2018-11-23 12:08:12,759 INFO L273 TraceCheckUtils]: 28: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2018-11-23 12:08:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:08:12,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:12,760 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-23 12:08:12,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:08:12,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:08:12,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:12,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:12,880 INFO L256 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2525#true} is VALID [2018-11-23 12:08:12,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {2525#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2525#true} is VALID [2018-11-23 12:08:12,881 INFO L273 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2018-11-23 12:08:12,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #60#return; {2525#true} is VALID [2018-11-23 12:08:12,881 INFO L256 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret4 := main(); {2525#true} is VALID [2018-11-23 12:08:12,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {2525#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; {2525#true} is VALID [2018-11-23 12:08:12,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {2525#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2525#true} is VALID [2018-11-23 12:08:12,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {2525#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2525#true} is VALID [2018-11-23 12:08:12,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {2525#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2525#true} is VALID [2018-11-23 12:08:12,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {2525#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2525#true} is VALID [2018-11-23 12:08:12,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {2525#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2525#true} is VALID [2018-11-23 12:08:12,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {2525#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2525#true} is VALID [2018-11-23 12:08:12,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {2525#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2525#true} is VALID [2018-11-23 12:08:12,883 INFO L273 TraceCheckUtils]: 13: Hoare triple {2525#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2525#true} is VALID [2018-11-23 12:08:12,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {2525#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2525#true} is VALID [2018-11-23 12:08:12,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {2525#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2525#true} is VALID [2018-11-23 12:08:12,884 INFO L273 TraceCheckUtils]: 16: Hoare triple {2525#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2525#true} is VALID [2018-11-23 12:08:12,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {2525#true} assume !(~i~0 < 100000); {2525#true} is VALID [2018-11-23 12:08:12,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {2525#true} ~i~0 := 1; {2528#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:12,885 INFO L273 TraceCheckUtils]: 19: Hoare triple {2528#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2532#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:12,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {2532#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2536#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:12,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {2536#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2605#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:12,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {2605#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2526#false} is VALID [2018-11-23 12:08:12,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {2526#false} ~i~0 := 1;~j~0 := 0; {2526#false} is VALID [2018-11-23 12:08:12,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {2526#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {2526#false} is VALID [2018-11-23 12:08:12,887 INFO L256 TraceCheckUtils]: 25: Hoare triple {2526#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2526#false} is VALID [2018-11-23 12:08:12,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {2526#false} ~cond := #in~cond; {2526#false} is VALID [2018-11-23 12:08:12,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {2526#false} assume 0 == ~cond; {2526#false} is VALID [2018-11-23 12:08:12,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2018-11-23 12:08:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:08:12,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:12,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 15 [2018-11-23 12:08:12,908 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-23 12:08:12,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:12,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:08:12,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:12,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:08:12,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:08:12,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:08:12,964 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 15 states. [2018-11-23 12:08:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:13,422 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-23 12:08:13,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:08:13,422 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-23 12:08:13,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:08:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 70 transitions. [2018-11-23 12:08:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:08:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 70 transitions. [2018-11-23 12:08:13,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 70 transitions. [2018-11-23 12:08:13,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:13,497 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:08:13,497 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:08:13,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:08:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:08:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2018-11-23 12:08:13,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:13,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 36 states. [2018-11-23 12:08:13,699 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 36 states. [2018-11-23 12:08:13,699 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 36 states. [2018-11-23 12:08:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:13,701 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:08:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:08:13,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:13,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:13,702 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 48 states. [2018-11-23 12:08:13,702 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 48 states. [2018-11-23 12:08:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:13,704 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:08:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:08:13,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:13,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:13,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:13,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:08:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 12:08:13,706 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2018-11-23 12:08:13,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:13,706 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 12:08:13,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:08:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 12:08:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:08:13,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:13,707 INFO L402 BasicCegarLoop]: trace histogram [13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:13,707 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:13,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:13,707 INFO L82 PathProgramCache]: Analyzing trace with hash 527833994, now seen corresponding path program 10 times [2018-11-23 12:08:13,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:13,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:13,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:13,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:13,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:14,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {2888#true} call ULTIMATE.init(); {2888#true} is VALID [2018-11-23 12:08:14,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {2888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2888#true} is VALID [2018-11-23 12:08:14,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {2888#true} assume true; {2888#true} is VALID [2018-11-23 12:08:14,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2888#true} {2888#true} #60#return; {2888#true} is VALID [2018-11-23 12:08:14,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {2888#true} call #t~ret4 := main(); {2888#true} is VALID [2018-11-23 12:08:14,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {2888#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; {2890#(= main_~i~0 0)} is VALID [2018-11-23 12:08:14,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {2890#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2891#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:14,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {2891#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2892#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:14,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {2892#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2893#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:14,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {2893#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2894#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:14,067 INFO L273 TraceCheckUtils]: 10: Hoare triple {2894#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2895#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:14,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {2895#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2896#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:14,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {2896#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2897#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:14,070 INFO L273 TraceCheckUtils]: 13: Hoare triple {2897#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2898#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:14,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {2898#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2899#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:14,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {2899#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2900#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:14,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {2900#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2901#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:14,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {2901#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2902#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:14,093 INFO L273 TraceCheckUtils]: 18: Hoare triple {2902#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2903#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:14,093 INFO L273 TraceCheckUtils]: 19: Hoare triple {2903#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2889#false} is VALID [2018-11-23 12:08:14,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {2889#false} ~i~0 := 1; {2889#false} is VALID [2018-11-23 12:08:14,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:08:14,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:08:14,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:08:14,094 INFO L273 TraceCheckUtils]: 24: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:08:14,094 INFO L273 TraceCheckUtils]: 25: Hoare triple {2889#false} assume !(~i~0 < 100000); {2889#false} is VALID [2018-11-23 12:08:14,094 INFO L273 TraceCheckUtils]: 26: Hoare triple {2889#false} ~i~0 := 1;~j~0 := 0; {2889#false} is VALID [2018-11-23 12:08:14,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {2889#false} is VALID [2018-11-23 12:08:14,095 INFO L256 TraceCheckUtils]: 28: Hoare triple {2889#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2889#false} is VALID [2018-11-23 12:08:14,095 INFO L273 TraceCheckUtils]: 29: Hoare triple {2889#false} ~cond := #in~cond; {2889#false} is VALID [2018-11-23 12:08:14,095 INFO L273 TraceCheckUtils]: 30: Hoare triple {2889#false} assume 0 == ~cond; {2889#false} is VALID [2018-11-23 12:08:14,096 INFO L273 TraceCheckUtils]: 31: Hoare triple {2889#false} assume !false; {2889#false} is VALID [2018-11-23 12:08:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:08:14,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:14,097 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-23 12:08:14,105 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:08:14,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:08:14,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:14,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:14,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {2888#true} call ULTIMATE.init(); {2888#true} is VALID [2018-11-23 12:08:14,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {2888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2888#true} is VALID [2018-11-23 12:08:14,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {2888#true} assume true; {2888#true} is VALID [2018-11-23 12:08:14,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2888#true} {2888#true} #60#return; {2888#true} is VALID [2018-11-23 12:08:14,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {2888#true} call #t~ret4 := main(); {2888#true} is VALID [2018-11-23 12:08:14,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {2888#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; {2922#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:14,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {2922#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2891#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:14,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {2891#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2892#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:14,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {2892#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2893#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:14,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {2893#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2894#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:14,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {2894#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2895#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:14,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {2895#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2896#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:14,253 INFO L273 TraceCheckUtils]: 12: Hoare triple {2896#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2897#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:14,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {2897#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2898#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:14,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {2898#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2899#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:14,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {2899#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2900#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:14,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {2900#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2901#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:14,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {2901#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2902#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:14,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {2902#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2903#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:14,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {2903#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2889#false} is VALID [2018-11-23 12:08:14,260 INFO L273 TraceCheckUtils]: 20: Hoare triple {2889#false} ~i~0 := 1; {2889#false} is VALID [2018-11-23 12:08:14,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:08:14,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:08:14,261 INFO L273 TraceCheckUtils]: 23: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:08:14,261 INFO L273 TraceCheckUtils]: 24: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {2889#false} is VALID [2018-11-23 12:08:14,261 INFO L273 TraceCheckUtils]: 25: Hoare triple {2889#false} assume !(~i~0 < 100000); {2889#false} is VALID [2018-11-23 12:08:14,262 INFO L273 TraceCheckUtils]: 26: Hoare triple {2889#false} ~i~0 := 1;~j~0 := 0; {2889#false} is VALID [2018-11-23 12:08:14,262 INFO L273 TraceCheckUtils]: 27: Hoare triple {2889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {2889#false} is VALID [2018-11-23 12:08:14,262 INFO L256 TraceCheckUtils]: 28: Hoare triple {2889#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2889#false} is VALID [2018-11-23 12:08:14,262 INFO L273 TraceCheckUtils]: 29: Hoare triple {2889#false} ~cond := #in~cond; {2889#false} is VALID [2018-11-23 12:08:14,262 INFO L273 TraceCheckUtils]: 30: Hoare triple {2889#false} assume 0 == ~cond; {2889#false} is VALID [2018-11-23 12:08:14,263 INFO L273 TraceCheckUtils]: 31: Hoare triple {2889#false} assume !false; {2889#false} is VALID [2018-11-23 12:08:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:08:14,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:14,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:08:14,287 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-11-23 12:08:14,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:14,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:08:14,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:14,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:08:14,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:08:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:08:14,312 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 17 states. [2018-11-23 12:08:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:14,886 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 12:08:14,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:08:14,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-11-23 12:08:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:14,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:08:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 69 transitions. [2018-11-23 12:08:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:08:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 69 transitions. [2018-11-23 12:08:14,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 69 transitions. [2018-11-23 12:08:14,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:14,960 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:08:14,960 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:08:14,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 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-23 12:08:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:08:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2018-11-23 12:08:14,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:14,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 37 states. [2018-11-23 12:08:14,998 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 37 states. [2018-11-23 12:08:14,998 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 37 states. [2018-11-23 12:08:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:15,000 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 12:08:15,000 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 12:08:15,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:15,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:15,001 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 49 states. [2018-11-23 12:08:15,001 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 49 states. [2018-11-23 12:08:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:15,003 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 12:08:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 12:08:15,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:15,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:15,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:15,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:08:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-23 12:08:15,005 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2018-11-23 12:08:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:15,005 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-23 12:08:15,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:08:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-23 12:08:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:08:15,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:15,006 INFO L402 BasicCegarLoop]: trace histogram [14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:15,006 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:15,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:15,006 INFO L82 PathProgramCache]: Analyzing trace with hash 947647462, now seen corresponding path program 11 times [2018-11-23 12:08:15,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:15,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:15,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:15,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {3270#true} call ULTIMATE.init(); {3270#true} is VALID [2018-11-23 12:08:15,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {3270#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3270#true} is VALID [2018-11-23 12:08:15,926 INFO L273 TraceCheckUtils]: 2: Hoare triple {3270#true} assume true; {3270#true} is VALID [2018-11-23 12:08:15,926 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3270#true} {3270#true} #60#return; {3270#true} is VALID [2018-11-23 12:08:15,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {3270#true} call #t~ret4 := main(); {3270#true} is VALID [2018-11-23 12:08:15,926 INFO L273 TraceCheckUtils]: 5: Hoare triple {3270#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; {3272#(= main_~i~0 0)} is VALID [2018-11-23 12:08:15,927 INFO L273 TraceCheckUtils]: 6: Hoare triple {3272#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3273#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:15,928 INFO L273 TraceCheckUtils]: 7: Hoare triple {3273#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3274#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:15,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {3274#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3275#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:15,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {3275#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3276#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:15,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {3276#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3277#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:15,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {3277#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3278#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:15,934 INFO L273 TraceCheckUtils]: 12: Hoare triple {3278#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3279#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:15,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {3279#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3280#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:15,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {3280#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3281#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:15,937 INFO L273 TraceCheckUtils]: 15: Hoare triple {3281#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3282#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:15,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {3282#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3283#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:15,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {3283#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3284#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:15,941 INFO L273 TraceCheckUtils]: 18: Hoare triple {3284#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3285#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:15,942 INFO L273 TraceCheckUtils]: 19: Hoare triple {3285#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3286#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:15,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {3286#(<= main_~i~0 14)} assume !(~i~0 < 100000); {3271#false} is VALID [2018-11-23 12:08:15,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {3271#false} ~i~0 := 1; {3271#false} is VALID [2018-11-23 12:08:15,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {3271#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3271#false} is VALID [2018-11-23 12:08:15,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {3271#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3271#false} is VALID [2018-11-23 12:08:15,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {3271#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3271#false} is VALID [2018-11-23 12:08:15,943 INFO L273 TraceCheckUtils]: 25: Hoare triple {3271#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3271#false} is VALID [2018-11-23 12:08:15,943 INFO L273 TraceCheckUtils]: 26: Hoare triple {3271#false} assume !(~i~0 < 100000); {3271#false} is VALID [2018-11-23 12:08:15,943 INFO L273 TraceCheckUtils]: 27: Hoare triple {3271#false} ~i~0 := 1;~j~0 := 0; {3271#false} is VALID [2018-11-23 12:08:15,944 INFO L273 TraceCheckUtils]: 28: Hoare triple {3271#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {3271#false} is VALID [2018-11-23 12:08:15,944 INFO L256 TraceCheckUtils]: 29: Hoare triple {3271#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3271#false} is VALID [2018-11-23 12:08:15,944 INFO L273 TraceCheckUtils]: 30: Hoare triple {3271#false} ~cond := #in~cond; {3271#false} is VALID [2018-11-23 12:08:15,944 INFO L273 TraceCheckUtils]: 31: Hoare triple {3271#false} assume 0 == ~cond; {3271#false} is VALID [2018-11-23 12:08:15,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {3271#false} assume !false; {3271#false} is VALID [2018-11-23 12:08:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:08:15,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:15,947 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-23 12:08:15,955 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:08:16,373 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-23 12:08:16,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:16,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:16,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {3270#true} call ULTIMATE.init(); {3270#true} is VALID [2018-11-23 12:08:16,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {3270#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3270#true} is VALID [2018-11-23 12:08:16,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {3270#true} assume true; {3270#true} is VALID [2018-11-23 12:08:16,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3270#true} {3270#true} #60#return; {3270#true} is VALID [2018-11-23 12:08:16,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {3270#true} call #t~ret4 := main(); {3270#true} is VALID [2018-11-23 12:08:16,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {3270#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; {3305#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:16,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {3305#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3273#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:16,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {3273#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3274#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:16,536 INFO L273 TraceCheckUtils]: 8: Hoare triple {3274#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3275#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:16,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {3275#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3276#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:16,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {3276#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3277#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:16,539 INFO L273 TraceCheckUtils]: 11: Hoare triple {3277#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3278#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:16,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {3278#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3279#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:16,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {3279#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3280#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:16,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {3280#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3281#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:16,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {3281#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3282#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:16,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {3282#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3283#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:16,546 INFO L273 TraceCheckUtils]: 17: Hoare triple {3283#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3284#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:16,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {3284#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3285#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:16,549 INFO L273 TraceCheckUtils]: 19: Hoare triple {3285#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3286#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:16,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {3286#(<= main_~i~0 14)} assume !(~i~0 < 100000); {3271#false} is VALID [2018-11-23 12:08:16,550 INFO L273 TraceCheckUtils]: 21: Hoare triple {3271#false} ~i~0 := 1; {3271#false} is VALID [2018-11-23 12:08:16,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {3271#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3271#false} is VALID [2018-11-23 12:08:16,550 INFO L273 TraceCheckUtils]: 23: Hoare triple {3271#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3271#false} is VALID [2018-11-23 12:08:16,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {3271#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3271#false} is VALID [2018-11-23 12:08:16,551 INFO L273 TraceCheckUtils]: 25: Hoare triple {3271#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3271#false} is VALID [2018-11-23 12:08:16,551 INFO L273 TraceCheckUtils]: 26: Hoare triple {3271#false} assume !(~i~0 < 100000); {3271#false} is VALID [2018-11-23 12:08:16,551 INFO L273 TraceCheckUtils]: 27: Hoare triple {3271#false} ~i~0 := 1;~j~0 := 0; {3271#false} is VALID [2018-11-23 12:08:16,552 INFO L273 TraceCheckUtils]: 28: Hoare triple {3271#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {3271#false} is VALID [2018-11-23 12:08:16,552 INFO L256 TraceCheckUtils]: 29: Hoare triple {3271#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3271#false} is VALID [2018-11-23 12:08:16,552 INFO L273 TraceCheckUtils]: 30: Hoare triple {3271#false} ~cond := #in~cond; {3271#false} is VALID [2018-11-23 12:08:16,553 INFO L273 TraceCheckUtils]: 31: Hoare triple {3271#false} assume 0 == ~cond; {3271#false} is VALID [2018-11-23 12:08:16,553 INFO L273 TraceCheckUtils]: 32: Hoare triple {3271#false} assume !false; {3271#false} is VALID [2018-11-23 12:08:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:08:16,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:16,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:08:16,578 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-11-23 12:08:16,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:16,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:08:16,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:16,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:08:16,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:08:16,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:08:16,608 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 18 states. [2018-11-23 12:08:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:17,181 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-23 12:08:17,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:08:17,182 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-11-23 12:08:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:08:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2018-11-23 12:08:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:08:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2018-11-23 12:08:17,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 70 transitions. [2018-11-23 12:08:17,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:17,271 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:08:17,271 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:08:17,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:08:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:08:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2018-11-23 12:08:17,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:17,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 38 states. [2018-11-23 12:08:17,297 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 38 states. [2018-11-23 12:08:17,297 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 38 states. [2018-11-23 12:08:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:17,299 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 12:08:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-23 12:08:17,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:17,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:17,300 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 50 states. [2018-11-23 12:08:17,300 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 50 states. [2018-11-23 12:08:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:17,301 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 12:08:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-23 12:08:17,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:17,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:17,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:17,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:08:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 12:08:17,304 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2018-11-23 12:08:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:17,304 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 12:08:17,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:08:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 12:08:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:08:17,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:17,305 INFO L402 BasicCegarLoop]: trace histogram [15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:17,305 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:17,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1076963082, now seen corresponding path program 12 times [2018-11-23 12:08:17,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:17,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:17,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:17,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {3662#true} call ULTIMATE.init(); {3662#true} is VALID [2018-11-23 12:08:17,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {3662#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3662#true} is VALID [2018-11-23 12:08:17,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {3662#true} assume true; {3662#true} is VALID [2018-11-23 12:08:17,567 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3662#true} {3662#true} #60#return; {3662#true} is VALID [2018-11-23 12:08:17,567 INFO L256 TraceCheckUtils]: 4: Hoare triple {3662#true} call #t~ret4 := main(); {3662#true} is VALID [2018-11-23 12:08:17,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {3662#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; {3664#(= main_~i~0 0)} is VALID [2018-11-23 12:08:17,569 INFO L273 TraceCheckUtils]: 6: Hoare triple {3664#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3665#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:17,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {3665#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3666#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:17,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {3666#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3667#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:17,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {3667#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3668#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:17,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {3668#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3669#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:17,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {3669#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3670#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:17,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {3670#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3671#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:17,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {3671#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3672#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:17,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {3672#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3673#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:17,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {3673#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3674#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:17,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {3674#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3675#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:17,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {3675#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3676#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:17,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {3676#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3677#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:17,583 INFO L273 TraceCheckUtils]: 19: Hoare triple {3677#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3678#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:17,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {3678#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3679#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:17,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {3679#(<= main_~i~0 15)} assume !(~i~0 < 100000); {3663#false} is VALID [2018-11-23 12:08:17,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {3663#false} ~i~0 := 1; {3663#false} is VALID [2018-11-23 12:08:17,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {3663#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3663#false} is VALID [2018-11-23 12:08:17,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {3663#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3663#false} is VALID [2018-11-23 12:08:17,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {3663#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3663#false} is VALID [2018-11-23 12:08:17,585 INFO L273 TraceCheckUtils]: 26: Hoare triple {3663#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3663#false} is VALID [2018-11-23 12:08:17,586 INFO L273 TraceCheckUtils]: 27: Hoare triple {3663#false} assume !(~i~0 < 100000); {3663#false} is VALID [2018-11-23 12:08:17,586 INFO L273 TraceCheckUtils]: 28: Hoare triple {3663#false} ~i~0 := 1;~j~0 := 0; {3663#false} is VALID [2018-11-23 12:08:17,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {3663#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {3663#false} is VALID [2018-11-23 12:08:17,586 INFO L256 TraceCheckUtils]: 30: Hoare triple {3663#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3663#false} is VALID [2018-11-23 12:08:17,587 INFO L273 TraceCheckUtils]: 31: Hoare triple {3663#false} ~cond := #in~cond; {3663#false} is VALID [2018-11-23 12:08:17,587 INFO L273 TraceCheckUtils]: 32: Hoare triple {3663#false} assume 0 == ~cond; {3663#false} is VALID [2018-11-23 12:08:17,587 INFO L273 TraceCheckUtils]: 33: Hoare triple {3663#false} assume !false; {3663#false} is VALID [2018-11-23 12:08:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:08:17,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:17,588 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-23 12:08:17,599 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:08:17,631 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:08:17,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:17,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:17,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {3662#true} call ULTIMATE.init(); {3662#true} is VALID [2018-11-23 12:08:17,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {3662#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3662#true} is VALID [2018-11-23 12:08:17,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {3662#true} assume true; {3662#true} is VALID [2018-11-23 12:08:17,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3662#true} {3662#true} #60#return; {3662#true} is VALID [2018-11-23 12:08:17,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {3662#true} call #t~ret4 := main(); {3662#true} is VALID [2018-11-23 12:08:17,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {3662#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; {3662#true} is VALID [2018-11-23 12:08:17,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,734 INFO L273 TraceCheckUtils]: 13: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,735 INFO L273 TraceCheckUtils]: 16: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,735 INFO L273 TraceCheckUtils]: 17: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,735 INFO L273 TraceCheckUtils]: 19: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,736 INFO L273 TraceCheckUtils]: 20: Hoare triple {3662#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3662#true} is VALID [2018-11-23 12:08:17,736 INFO L273 TraceCheckUtils]: 21: Hoare triple {3662#true} assume !(~i~0 < 100000); {3662#true} is VALID [2018-11-23 12:08:17,736 INFO L273 TraceCheckUtils]: 22: Hoare triple {3662#true} ~i~0 := 1; {3665#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:17,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {3665#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3669#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:17,738 INFO L273 TraceCheckUtils]: 24: Hoare triple {3669#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3673#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:17,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {3673#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3677#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:17,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {3677#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {3761#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:17,739 INFO L273 TraceCheckUtils]: 27: Hoare triple {3761#(<= main_~i~0 17)} assume !(~i~0 < 100000); {3663#false} is VALID [2018-11-23 12:08:17,739 INFO L273 TraceCheckUtils]: 28: Hoare triple {3663#false} ~i~0 := 1;~j~0 := 0; {3663#false} is VALID [2018-11-23 12:08:17,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {3663#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {3663#false} is VALID [2018-11-23 12:08:17,740 INFO L256 TraceCheckUtils]: 30: Hoare triple {3663#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3663#false} is VALID [2018-11-23 12:08:17,740 INFO L273 TraceCheckUtils]: 31: Hoare triple {3663#false} ~cond := #in~cond; {3663#false} is VALID [2018-11-23 12:08:17,740 INFO L273 TraceCheckUtils]: 32: Hoare triple {3663#false} assume 0 == ~cond; {3663#false} is VALID [2018-11-23 12:08:17,741 INFO L273 TraceCheckUtils]: 33: Hoare triple {3663#false} assume !false; {3663#false} is VALID [2018-11-23 12:08:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-23 12:08:17,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:17,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 19 [2018-11-23 12:08:17,763 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-11-23 12:08:17,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:17,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:08:17,797 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-23 12:08:17,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:08:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:08:17,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:08:17,798 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 19 states. [2018-11-23 12:08:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:18,329 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-23 12:08:18,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:08:18,330 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-11-23 12:08:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:08:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2018-11-23 12:08:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:08:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2018-11-23 12:08:18,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 79 transitions. [2018-11-23 12:08:18,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:18,691 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:08:18,691 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:08:18,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:08:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:08:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2018-11-23 12:08:18,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:18,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 41 states. [2018-11-23 12:08:18,720 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 41 states. [2018-11-23 12:08:18,721 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 41 states. [2018-11-23 12:08:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:18,723 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-23 12:08:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-23 12:08:18,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:18,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:18,723 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 56 states. [2018-11-23 12:08:18,723 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 56 states. [2018-11-23 12:08:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:18,725 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-23 12:08:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-23 12:08:18,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:18,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:18,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:18,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:08:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-23 12:08:18,726 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2018-11-23 12:08:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:18,727 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-23 12:08:18,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:08:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-23 12:08:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:08:18,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:18,728 INFO L402 BasicCegarLoop]: trace histogram [17, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:18,728 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:18,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:18,728 INFO L82 PathProgramCache]: Analyzing trace with hash 777453829, now seen corresponding path program 13 times [2018-11-23 12:08:18,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:18,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:18,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:18,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:18,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:19,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {4087#true} call ULTIMATE.init(); {4087#true} is VALID [2018-11-23 12:08:19,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {4087#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4087#true} is VALID [2018-11-23 12:08:19,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {4087#true} assume true; {4087#true} is VALID [2018-11-23 12:08:19,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4087#true} {4087#true} #60#return; {4087#true} is VALID [2018-11-23 12:08:19,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {4087#true} call #t~ret4 := main(); {4087#true} is VALID [2018-11-23 12:08:19,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {4087#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; {4089#(= main_~i~0 0)} is VALID [2018-11-23 12:08:19,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {4089#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4090#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:19,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {4090#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4091#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:19,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {4091#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4092#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:19,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {4092#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4093#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:19,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {4093#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4094#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:19,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {4094#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4095#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:19,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {4095#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4096#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:19,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {4096#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4097#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:19,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {4097#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4098#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:19,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {4098#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4099#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:19,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {4099#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4100#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:19,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {4100#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4101#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:19,115 INFO L273 TraceCheckUtils]: 18: Hoare triple {4101#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4102#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:19,116 INFO L273 TraceCheckUtils]: 19: Hoare triple {4102#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4103#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:19,117 INFO L273 TraceCheckUtils]: 20: Hoare triple {4103#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4104#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:19,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {4104#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4105#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:19,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {4105#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4106#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:19,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {4106#(<= main_~i~0 17)} assume !(~i~0 < 100000); {4088#false} is VALID [2018-11-23 12:08:19,120 INFO L273 TraceCheckUtils]: 24: Hoare triple {4088#false} ~i~0 := 1; {4088#false} is VALID [2018-11-23 12:08:19,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {4088#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4088#false} is VALID [2018-11-23 12:08:19,121 INFO L273 TraceCheckUtils]: 26: Hoare triple {4088#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4088#false} is VALID [2018-11-23 12:08:19,121 INFO L273 TraceCheckUtils]: 27: Hoare triple {4088#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4088#false} is VALID [2018-11-23 12:08:19,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {4088#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4088#false} is VALID [2018-11-23 12:08:19,121 INFO L273 TraceCheckUtils]: 29: Hoare triple {4088#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4088#false} is VALID [2018-11-23 12:08:19,122 INFO L273 TraceCheckUtils]: 30: Hoare triple {4088#false} assume !(~i~0 < 100000); {4088#false} is VALID [2018-11-23 12:08:19,122 INFO L273 TraceCheckUtils]: 31: Hoare triple {4088#false} ~i~0 := 1;~j~0 := 0; {4088#false} is VALID [2018-11-23 12:08:19,122 INFO L273 TraceCheckUtils]: 32: Hoare triple {4088#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {4088#false} is VALID [2018-11-23 12:08:19,122 INFO L256 TraceCheckUtils]: 33: Hoare triple {4088#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4088#false} is VALID [2018-11-23 12:08:19,122 INFO L273 TraceCheckUtils]: 34: Hoare triple {4088#false} ~cond := #in~cond; {4088#false} is VALID [2018-11-23 12:08:19,123 INFO L273 TraceCheckUtils]: 35: Hoare triple {4088#false} assume 0 == ~cond; {4088#false} is VALID [2018-11-23 12:08:19,123 INFO L273 TraceCheckUtils]: 36: Hoare triple {4088#false} assume !false; {4088#false} is VALID [2018-11-23 12:08:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:08:19,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:19,124 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-23 12:08:19,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:19,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:19,358 INFO L256 TraceCheckUtils]: 0: Hoare triple {4087#true} call ULTIMATE.init(); {4087#true} is VALID [2018-11-23 12:08:19,359 INFO L273 TraceCheckUtils]: 1: Hoare triple {4087#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4087#true} is VALID [2018-11-23 12:08:19,359 INFO L273 TraceCheckUtils]: 2: Hoare triple {4087#true} assume true; {4087#true} is VALID [2018-11-23 12:08:19,359 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4087#true} {4087#true} #60#return; {4087#true} is VALID [2018-11-23 12:08:19,359 INFO L256 TraceCheckUtils]: 4: Hoare triple {4087#true} call #t~ret4 := main(); {4087#true} is VALID [2018-11-23 12:08:19,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {4087#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; {4125#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:19,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {4125#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4090#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:19,362 INFO L273 TraceCheckUtils]: 7: Hoare triple {4090#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4091#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:19,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {4091#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4092#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:19,363 INFO L273 TraceCheckUtils]: 9: Hoare triple {4092#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4093#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:19,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {4093#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4094#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:19,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {4094#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4095#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:19,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {4095#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4096#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:19,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {4096#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4097#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:19,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {4097#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4098#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:19,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {4098#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4099#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:19,370 INFO L273 TraceCheckUtils]: 16: Hoare triple {4099#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4100#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:19,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {4100#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4101#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:19,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {4101#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4102#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:19,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {4102#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4103#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:19,374 INFO L273 TraceCheckUtils]: 20: Hoare triple {4103#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4104#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:19,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {4104#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4105#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:19,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {4105#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4106#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:19,376 INFO L273 TraceCheckUtils]: 23: Hoare triple {4106#(<= main_~i~0 17)} assume !(~i~0 < 100000); {4088#false} is VALID [2018-11-23 12:08:19,377 INFO L273 TraceCheckUtils]: 24: Hoare triple {4088#false} ~i~0 := 1; {4088#false} is VALID [2018-11-23 12:08:19,377 INFO L273 TraceCheckUtils]: 25: Hoare triple {4088#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4088#false} is VALID [2018-11-23 12:08:19,377 INFO L273 TraceCheckUtils]: 26: Hoare triple {4088#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4088#false} is VALID [2018-11-23 12:08:19,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {4088#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4088#false} is VALID [2018-11-23 12:08:19,378 INFO L273 TraceCheckUtils]: 28: Hoare triple {4088#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4088#false} is VALID [2018-11-23 12:08:19,378 INFO L273 TraceCheckUtils]: 29: Hoare triple {4088#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4088#false} is VALID [2018-11-23 12:08:19,378 INFO L273 TraceCheckUtils]: 30: Hoare triple {4088#false} assume !(~i~0 < 100000); {4088#false} is VALID [2018-11-23 12:08:19,378 INFO L273 TraceCheckUtils]: 31: Hoare triple {4088#false} ~i~0 := 1;~j~0 := 0; {4088#false} is VALID [2018-11-23 12:08:19,378 INFO L273 TraceCheckUtils]: 32: Hoare triple {4088#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {4088#false} is VALID [2018-11-23 12:08:19,379 INFO L256 TraceCheckUtils]: 33: Hoare triple {4088#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4088#false} is VALID [2018-11-23 12:08:19,379 INFO L273 TraceCheckUtils]: 34: Hoare triple {4088#false} ~cond := #in~cond; {4088#false} is VALID [2018-11-23 12:08:19,379 INFO L273 TraceCheckUtils]: 35: Hoare triple {4088#false} assume 0 == ~cond; {4088#false} is VALID [2018-11-23 12:08:19,379 INFO L273 TraceCheckUtils]: 36: Hoare triple {4088#false} assume !false; {4088#false} is VALID [2018-11-23 12:08:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:08:19,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:19,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:08:19,401 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2018-11-23 12:08:19,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:19,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:08:19,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:19,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:08:19,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:08:19,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:08:19,427 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 21 states. [2018-11-23 12:08:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:19,898 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-23 12:08:19,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:08:19,899 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2018-11-23 12:08:19,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:08:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 78 transitions. [2018-11-23 12:08:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:08:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 78 transitions. [2018-11-23 12:08:19,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 78 transitions. [2018-11-23 12:08:19,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:19,997 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:08:19,997 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:08:19,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:08:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:08:20,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-11-23 12:08:20,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:20,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 42 states. [2018-11-23 12:08:20,107 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 42 states. [2018-11-23 12:08:20,107 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 42 states. [2018-11-23 12:08:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:20,109 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 12:08:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 12:08:20,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:20,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:20,110 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 57 states. [2018-11-23 12:08:20,110 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 57 states. [2018-11-23 12:08:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:20,111 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 12:08:20,111 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 12:08:20,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:20,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:20,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:20,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:08:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 12:08:20,113 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 37 [2018-11-23 12:08:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:20,114 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 12:08:20,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:08:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 12:08:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:08:20,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:20,115 INFO L402 BasicCegarLoop]: trace histogram [18, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:20,115 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:20,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash 607519273, now seen corresponding path program 14 times [2018-11-23 12:08:20,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:20,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:20,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:20,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:20,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:21,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {4531#true} call ULTIMATE.init(); {4531#true} is VALID [2018-11-23 12:08:21,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {4531#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4531#true} is VALID [2018-11-23 12:08:21,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {4531#true} assume true; {4531#true} is VALID [2018-11-23 12:08:21,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4531#true} {4531#true} #60#return; {4531#true} is VALID [2018-11-23 12:08:21,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {4531#true} call #t~ret4 := main(); {4531#true} is VALID [2018-11-23 12:08:21,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {4531#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; {4533#(= main_~i~0 0)} is VALID [2018-11-23 12:08:21,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {4533#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4534#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:21,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {4534#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4535#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:21,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {4535#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4536#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:21,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {4536#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4537#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:21,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {4537#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4538#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:21,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {4538#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4539#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:21,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {4539#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4540#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:21,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {4540#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4541#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:21,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {4541#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4542#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:21,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {4542#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4543#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:21,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {4543#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4544#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:21,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {4544#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4545#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:21,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {4545#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4546#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:21,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {4546#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4547#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:21,306 INFO L273 TraceCheckUtils]: 20: Hoare triple {4547#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4548#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:21,307 INFO L273 TraceCheckUtils]: 21: Hoare triple {4548#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4549#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:21,308 INFO L273 TraceCheckUtils]: 22: Hoare triple {4549#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4550#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:21,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {4550#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4551#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:21,310 INFO L273 TraceCheckUtils]: 24: Hoare triple {4551#(<= main_~i~0 18)} assume !(~i~0 < 100000); {4532#false} is VALID [2018-11-23 12:08:21,310 INFO L273 TraceCheckUtils]: 25: Hoare triple {4532#false} ~i~0 := 1; {4532#false} is VALID [2018-11-23 12:08:21,310 INFO L273 TraceCheckUtils]: 26: Hoare triple {4532#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4532#false} is VALID [2018-11-23 12:08:21,310 INFO L273 TraceCheckUtils]: 27: Hoare triple {4532#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4532#false} is VALID [2018-11-23 12:08:21,311 INFO L273 TraceCheckUtils]: 28: Hoare triple {4532#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4532#false} is VALID [2018-11-23 12:08:21,311 INFO L273 TraceCheckUtils]: 29: Hoare triple {4532#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4532#false} is VALID [2018-11-23 12:08:21,311 INFO L273 TraceCheckUtils]: 30: Hoare triple {4532#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4532#false} is VALID [2018-11-23 12:08:21,311 INFO L273 TraceCheckUtils]: 31: Hoare triple {4532#false} assume !(~i~0 < 100000); {4532#false} is VALID [2018-11-23 12:08:21,311 INFO L273 TraceCheckUtils]: 32: Hoare triple {4532#false} ~i~0 := 1;~j~0 := 0; {4532#false} is VALID [2018-11-23 12:08:21,312 INFO L273 TraceCheckUtils]: 33: Hoare triple {4532#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {4532#false} is VALID [2018-11-23 12:08:21,312 INFO L256 TraceCheckUtils]: 34: Hoare triple {4532#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4532#false} is VALID [2018-11-23 12:08:21,312 INFO L273 TraceCheckUtils]: 35: Hoare triple {4532#false} ~cond := #in~cond; {4532#false} is VALID [2018-11-23 12:08:21,312 INFO L273 TraceCheckUtils]: 36: Hoare triple {4532#false} assume 0 == ~cond; {4532#false} is VALID [2018-11-23 12:08:21,313 INFO L273 TraceCheckUtils]: 37: Hoare triple {4532#false} assume !false; {4532#false} is VALID [2018-11-23 12:08:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:08:21,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:21,315 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-23 12:08:21,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:08:21,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:08:21,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:21,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:21,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {4531#true} call ULTIMATE.init(); {4531#true} is VALID [2018-11-23 12:08:21,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {4531#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4531#true} is VALID [2018-11-23 12:08:21,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {4531#true} assume true; {4531#true} is VALID [2018-11-23 12:08:21,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4531#true} {4531#true} #60#return; {4531#true} is VALID [2018-11-23 12:08:21,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {4531#true} call #t~ret4 := main(); {4531#true} is VALID [2018-11-23 12:08:21,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {4531#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; {4570#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:21,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {4570#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4534#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:21,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {4534#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4535#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:21,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {4535#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4536#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:21,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {4536#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4537#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:21,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {4537#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4538#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:21,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {4538#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4539#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:21,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {4539#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4540#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:21,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {4540#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4541#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:21,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {4541#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4542#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:21,619 INFO L273 TraceCheckUtils]: 15: Hoare triple {4542#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4543#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:21,620 INFO L273 TraceCheckUtils]: 16: Hoare triple {4543#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4544#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:21,620 INFO L273 TraceCheckUtils]: 17: Hoare triple {4544#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4545#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:21,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {4545#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4546#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:21,622 INFO L273 TraceCheckUtils]: 19: Hoare triple {4546#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4547#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:21,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {4547#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4548#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:21,625 INFO L273 TraceCheckUtils]: 21: Hoare triple {4548#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4549#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:21,626 INFO L273 TraceCheckUtils]: 22: Hoare triple {4549#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4550#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:21,627 INFO L273 TraceCheckUtils]: 23: Hoare triple {4550#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4551#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:21,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {4551#(<= main_~i~0 18)} assume !(~i~0 < 100000); {4532#false} is VALID [2018-11-23 12:08:21,628 INFO L273 TraceCheckUtils]: 25: Hoare triple {4532#false} ~i~0 := 1; {4532#false} is VALID [2018-11-23 12:08:21,628 INFO L273 TraceCheckUtils]: 26: Hoare triple {4532#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4532#false} is VALID [2018-11-23 12:08:21,628 INFO L273 TraceCheckUtils]: 27: Hoare triple {4532#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4532#false} is VALID [2018-11-23 12:08:21,628 INFO L273 TraceCheckUtils]: 28: Hoare triple {4532#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4532#false} is VALID [2018-11-23 12:08:21,629 INFO L273 TraceCheckUtils]: 29: Hoare triple {4532#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4532#false} is VALID [2018-11-23 12:08:21,629 INFO L273 TraceCheckUtils]: 30: Hoare triple {4532#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4532#false} is VALID [2018-11-23 12:08:21,629 INFO L273 TraceCheckUtils]: 31: Hoare triple {4532#false} assume !(~i~0 < 100000); {4532#false} is VALID [2018-11-23 12:08:21,629 INFO L273 TraceCheckUtils]: 32: Hoare triple {4532#false} ~i~0 := 1;~j~0 := 0; {4532#false} is VALID [2018-11-23 12:08:21,629 INFO L273 TraceCheckUtils]: 33: Hoare triple {4532#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {4532#false} is VALID [2018-11-23 12:08:21,630 INFO L256 TraceCheckUtils]: 34: Hoare triple {4532#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4532#false} is VALID [2018-11-23 12:08:21,630 INFO L273 TraceCheckUtils]: 35: Hoare triple {4532#false} ~cond := #in~cond; {4532#false} is VALID [2018-11-23 12:08:21,630 INFO L273 TraceCheckUtils]: 36: Hoare triple {4532#false} assume 0 == ~cond; {4532#false} is VALID [2018-11-23 12:08:21,630 INFO L273 TraceCheckUtils]: 37: Hoare triple {4532#false} assume !false; {4532#false} is VALID [2018-11-23 12:08:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:08:21,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:21,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:08:21,652 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-11-23 12:08:21,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:21,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:08:21,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:21,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:08:21,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:08:21,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:08:21,684 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 22 states. [2018-11-23 12:08:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:22,345 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-23 12:08:22,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:08:22,346 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-11-23 12:08:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:08:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 79 transitions. [2018-11-23 12:08:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:08:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 79 transitions. [2018-11-23 12:08:22,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 79 transitions. [2018-11-23 12:08:22,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:22,885 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:08:22,885 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:08:22,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:08:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:08:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2018-11-23 12:08:22,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:22,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 43 states. [2018-11-23 12:08:22,919 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 43 states. [2018-11-23 12:08:22,919 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 43 states. [2018-11-23 12:08:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:22,921 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 12:08:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 12:08:22,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:22,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:22,921 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 58 states. [2018-11-23 12:08:22,922 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 58 states. [2018-11-23 12:08:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:22,924 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 12:08:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 12:08:22,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:22,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:22,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:22,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:08:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-23 12:08:22,926 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 38 [2018-11-23 12:08:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:22,926 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 12:08:22,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:08:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 12:08:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:08:22,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:22,927 INFO L402 BasicCegarLoop]: trace histogram [19, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:22,927 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:22,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:22,928 INFO L82 PathProgramCache]: Analyzing trace with hash -365484667, now seen corresponding path program 15 times [2018-11-23 12:08:22,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:22,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:22,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:22,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:22,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:23,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {4985#true} call ULTIMATE.init(); {4985#true} is VALID [2018-11-23 12:08:23,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {4985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4985#true} is VALID [2018-11-23 12:08:23,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {4985#true} assume true; {4985#true} is VALID [2018-11-23 12:08:23,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4985#true} {4985#true} #60#return; {4985#true} is VALID [2018-11-23 12:08:23,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {4985#true} call #t~ret4 := main(); {4985#true} is VALID [2018-11-23 12:08:23,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {4985#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; {4987#(= main_~i~0 0)} is VALID [2018-11-23 12:08:23,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {4987#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4988#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:23,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {4988#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4989#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:23,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {4989#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4990#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:23,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {4990#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4991#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:23,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {4991#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4992#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:23,671 INFO L273 TraceCheckUtils]: 11: Hoare triple {4992#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4993#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:23,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {4993#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4994#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:23,672 INFO L273 TraceCheckUtils]: 13: Hoare triple {4994#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4995#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:23,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {4995#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4996#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:23,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {4996#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4997#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:23,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {4997#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4998#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:23,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {4998#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4999#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:23,677 INFO L273 TraceCheckUtils]: 18: Hoare triple {4999#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5000#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:23,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {5000#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5001#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:23,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {5001#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5002#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:23,680 INFO L273 TraceCheckUtils]: 21: Hoare triple {5002#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5003#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:23,681 INFO L273 TraceCheckUtils]: 22: Hoare triple {5003#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5004#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:23,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {5004#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5005#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:23,683 INFO L273 TraceCheckUtils]: 24: Hoare triple {5005#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5006#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:23,684 INFO L273 TraceCheckUtils]: 25: Hoare triple {5006#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4986#false} is VALID [2018-11-23 12:08:23,684 INFO L273 TraceCheckUtils]: 26: Hoare triple {4986#false} ~i~0 := 1; {4986#false} is VALID [2018-11-23 12:08:23,684 INFO L273 TraceCheckUtils]: 27: Hoare triple {4986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4986#false} is VALID [2018-11-23 12:08:23,684 INFO L273 TraceCheckUtils]: 28: Hoare triple {4986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4986#false} is VALID [2018-11-23 12:08:23,685 INFO L273 TraceCheckUtils]: 29: Hoare triple {4986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4986#false} is VALID [2018-11-23 12:08:23,685 INFO L273 TraceCheckUtils]: 30: Hoare triple {4986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4986#false} is VALID [2018-11-23 12:08:23,685 INFO L273 TraceCheckUtils]: 31: Hoare triple {4986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4986#false} is VALID [2018-11-23 12:08:23,685 INFO L273 TraceCheckUtils]: 32: Hoare triple {4986#false} assume !(~i~0 < 100000); {4986#false} is VALID [2018-11-23 12:08:23,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {4986#false} ~i~0 := 1;~j~0 := 0; {4986#false} is VALID [2018-11-23 12:08:23,686 INFO L273 TraceCheckUtils]: 34: Hoare triple {4986#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {4986#false} is VALID [2018-11-23 12:08:23,686 INFO L256 TraceCheckUtils]: 35: Hoare triple {4986#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4986#false} is VALID [2018-11-23 12:08:23,686 INFO L273 TraceCheckUtils]: 36: Hoare triple {4986#false} ~cond := #in~cond; {4986#false} is VALID [2018-11-23 12:08:23,686 INFO L273 TraceCheckUtils]: 37: Hoare triple {4986#false} assume 0 == ~cond; {4986#false} is VALID [2018-11-23 12:08:23,686 INFO L273 TraceCheckUtils]: 38: Hoare triple {4986#false} assume !false; {4986#false} is VALID [2018-11-23 12:08:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:08:23,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:23,689 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-23 12:08:23,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:08:23,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:08:23,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:23,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:23,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {4985#true} call ULTIMATE.init(); {4985#true} is VALID [2018-11-23 12:08:23,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {4985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4985#true} is VALID [2018-11-23 12:08:23,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {4985#true} assume true; {4985#true} is VALID [2018-11-23 12:08:23,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4985#true} {4985#true} #60#return; {4985#true} is VALID [2018-11-23 12:08:23,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {4985#true} call #t~ret4 := main(); {4985#true} is VALID [2018-11-23 12:08:23,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {4985#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; {4985#true} is VALID [2018-11-23 12:08:23,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,872 INFO L273 TraceCheckUtils]: 8: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,873 INFO L273 TraceCheckUtils]: 14: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,873 INFO L273 TraceCheckUtils]: 15: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,873 INFO L273 TraceCheckUtils]: 17: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,874 INFO L273 TraceCheckUtils]: 24: Hoare triple {4985#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4985#true} is VALID [2018-11-23 12:08:23,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {4985#true} assume !(~i~0 < 100000); {4985#true} is VALID [2018-11-23 12:08:23,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {4985#true} ~i~0 := 1; {4988#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:23,876 INFO L273 TraceCheckUtils]: 27: Hoare triple {4988#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4992#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:23,877 INFO L273 TraceCheckUtils]: 28: Hoare triple {4992#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {4996#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:23,877 INFO L273 TraceCheckUtils]: 29: Hoare triple {4996#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5000#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:23,878 INFO L273 TraceCheckUtils]: 30: Hoare triple {5000#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5004#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:23,879 INFO L273 TraceCheckUtils]: 31: Hoare triple {5004#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5103#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:23,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {5103#(<= main_~i~0 21)} assume !(~i~0 < 100000); {4986#false} is VALID [2018-11-23 12:08:23,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {4986#false} ~i~0 := 1;~j~0 := 0; {4986#false} is VALID [2018-11-23 12:08:23,880 INFO L273 TraceCheckUtils]: 34: Hoare triple {4986#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {4986#false} is VALID [2018-11-23 12:08:23,880 INFO L256 TraceCheckUtils]: 35: Hoare triple {4986#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4986#false} is VALID [2018-11-23 12:08:23,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {4986#false} ~cond := #in~cond; {4986#false} is VALID [2018-11-23 12:08:23,881 INFO L273 TraceCheckUtils]: 37: Hoare triple {4986#false} assume 0 == ~cond; {4986#false} is VALID [2018-11-23 12:08:23,881 INFO L273 TraceCheckUtils]: 38: Hoare triple {4986#false} assume !false; {4986#false} is VALID [2018-11-23 12:08:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-23 12:08:23,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:23,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8] total 23 [2018-11-23 12:08:23,903 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-11-23 12:08:23,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:23,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:08:23,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:23,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:08:23,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:08:23,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:08:23,953 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 23 states. [2018-11-23 12:08:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:24,692 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-11-23 12:08:24,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:08:24,692 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-11-23 12:08:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:08:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 88 transitions. [2018-11-23 12:08:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:08:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 88 transitions. [2018-11-23 12:08:24,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 88 transitions. [2018-11-23 12:08:25,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:25,294 INFO L225 Difference]: With dead ends: 81 [2018-11-23 12:08:25,295 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:08:25,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:08:25,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:08:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2018-11-23 12:08:25,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:25,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 46 states. [2018-11-23 12:08:25,324 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 46 states. [2018-11-23 12:08:25,325 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 46 states. [2018-11-23 12:08:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:25,328 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-23 12:08:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-23 12:08:25,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:25,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:25,328 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 64 states. [2018-11-23 12:08:25,328 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 64 states. [2018-11-23 12:08:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:25,331 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-23 12:08:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-23 12:08:25,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:25,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:25,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:25,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:08:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-23 12:08:25,333 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2018-11-23 12:08:25,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:25,334 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-23 12:08:25,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:08:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 12:08:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:08:25,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:25,334 INFO L402 BasicCegarLoop]: trace histogram [21, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:25,335 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:25,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:25,335 INFO L82 PathProgramCache]: Analyzing trace with hash 657004778, now seen corresponding path program 16 times [2018-11-23 12:08:25,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:25,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:25,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:25,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:25,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:26,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {5472#true} call ULTIMATE.init(); {5472#true} is VALID [2018-11-23 12:08:26,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {5472#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5472#true} is VALID [2018-11-23 12:08:26,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {5472#true} assume true; {5472#true} is VALID [2018-11-23 12:08:26,492 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5472#true} {5472#true} #60#return; {5472#true} is VALID [2018-11-23 12:08:26,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {5472#true} call #t~ret4 := main(); {5472#true} is VALID [2018-11-23 12:08:26,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {5472#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; {5474#(= main_~i~0 0)} is VALID [2018-11-23 12:08:26,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {5474#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5475#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:26,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {5475#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5476#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:26,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {5476#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5477#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:26,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {5477#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5478#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:26,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {5478#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5479#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:26,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {5479#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5480#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:26,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {5480#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5481#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:26,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {5481#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5482#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:26,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {5482#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5483#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:26,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {5483#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5484#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:26,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {5484#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5485#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:26,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {5485#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5486#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:26,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {5486#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5487#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:26,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {5487#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5488#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:26,508 INFO L273 TraceCheckUtils]: 20: Hoare triple {5488#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5489#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:26,509 INFO L273 TraceCheckUtils]: 21: Hoare triple {5489#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5490#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:26,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {5490#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5491#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:26,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {5491#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5492#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:26,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {5492#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5493#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:26,513 INFO L273 TraceCheckUtils]: 25: Hoare triple {5493#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5494#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:26,514 INFO L273 TraceCheckUtils]: 26: Hoare triple {5494#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5495#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:26,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {5495#(<= main_~i~0 21)} assume !(~i~0 < 100000); {5473#false} is VALID [2018-11-23 12:08:26,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {5473#false} ~i~0 := 1; {5473#false} is VALID [2018-11-23 12:08:26,515 INFO L273 TraceCheckUtils]: 29: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5473#false} is VALID [2018-11-23 12:08:26,516 INFO L273 TraceCheckUtils]: 30: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5473#false} is VALID [2018-11-23 12:08:26,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5473#false} is VALID [2018-11-23 12:08:26,516 INFO L273 TraceCheckUtils]: 32: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5473#false} is VALID [2018-11-23 12:08:26,516 INFO L273 TraceCheckUtils]: 33: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5473#false} is VALID [2018-11-23 12:08:26,516 INFO L273 TraceCheckUtils]: 34: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5473#false} is VALID [2018-11-23 12:08:26,517 INFO L273 TraceCheckUtils]: 35: Hoare triple {5473#false} assume !(~i~0 < 100000); {5473#false} is VALID [2018-11-23 12:08:26,517 INFO L273 TraceCheckUtils]: 36: Hoare triple {5473#false} ~i~0 := 1;~j~0 := 0; {5473#false} is VALID [2018-11-23 12:08:26,517 INFO L273 TraceCheckUtils]: 37: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {5473#false} is VALID [2018-11-23 12:08:26,517 INFO L256 TraceCheckUtils]: 38: Hoare triple {5473#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5473#false} is VALID [2018-11-23 12:08:26,517 INFO L273 TraceCheckUtils]: 39: Hoare triple {5473#false} ~cond := #in~cond; {5473#false} is VALID [2018-11-23 12:08:26,518 INFO L273 TraceCheckUtils]: 40: Hoare triple {5473#false} assume 0 == ~cond; {5473#false} is VALID [2018-11-23 12:08:26,518 INFO L273 TraceCheckUtils]: 41: Hoare triple {5473#false} assume !false; {5473#false} is VALID [2018-11-23 12:08:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:08:26,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:26,519 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-23 12:08:26,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:08:26,589 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:08:26,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:26,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:26,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {5472#true} call ULTIMATE.init(); {5472#true} is VALID [2018-11-23 12:08:26,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {5472#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5472#true} is VALID [2018-11-23 12:08:26,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {5472#true} assume true; {5472#true} is VALID [2018-11-23 12:08:26,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5472#true} {5472#true} #60#return; {5472#true} is VALID [2018-11-23 12:08:26,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {5472#true} call #t~ret4 := main(); {5472#true} is VALID [2018-11-23 12:08:26,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {5472#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; {5514#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:26,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {5514#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5475#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:26,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {5475#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5476#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:26,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {5476#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5477#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:26,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {5477#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5478#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:26,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {5478#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5479#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:26,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {5479#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5480#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:26,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {5480#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5481#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:26,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {5481#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5482#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:26,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {5482#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5483#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:26,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {5483#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5484#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:26,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {5484#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5485#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:26,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {5485#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5486#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:26,849 INFO L273 TraceCheckUtils]: 18: Hoare triple {5486#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5487#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:26,850 INFO L273 TraceCheckUtils]: 19: Hoare triple {5487#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5488#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:26,851 INFO L273 TraceCheckUtils]: 20: Hoare triple {5488#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5489#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:26,852 INFO L273 TraceCheckUtils]: 21: Hoare triple {5489#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5490#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:26,853 INFO L273 TraceCheckUtils]: 22: Hoare triple {5490#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5491#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:26,854 INFO L273 TraceCheckUtils]: 23: Hoare triple {5491#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5492#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:26,855 INFO L273 TraceCheckUtils]: 24: Hoare triple {5492#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5493#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:26,856 INFO L273 TraceCheckUtils]: 25: Hoare triple {5493#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5494#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:26,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {5494#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5495#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:26,858 INFO L273 TraceCheckUtils]: 27: Hoare triple {5495#(<= main_~i~0 21)} assume !(~i~0 < 100000); {5473#false} is VALID [2018-11-23 12:08:26,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {5473#false} ~i~0 := 1; {5473#false} is VALID [2018-11-23 12:08:26,858 INFO L273 TraceCheckUtils]: 29: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5473#false} is VALID [2018-11-23 12:08:26,859 INFO L273 TraceCheckUtils]: 30: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5473#false} is VALID [2018-11-23 12:08:26,859 INFO L273 TraceCheckUtils]: 31: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5473#false} is VALID [2018-11-23 12:08:26,859 INFO L273 TraceCheckUtils]: 32: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5473#false} is VALID [2018-11-23 12:08:26,859 INFO L273 TraceCheckUtils]: 33: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5473#false} is VALID [2018-11-23 12:08:26,859 INFO L273 TraceCheckUtils]: 34: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5473#false} is VALID [2018-11-23 12:08:26,860 INFO L273 TraceCheckUtils]: 35: Hoare triple {5473#false} assume !(~i~0 < 100000); {5473#false} is VALID [2018-11-23 12:08:26,860 INFO L273 TraceCheckUtils]: 36: Hoare triple {5473#false} ~i~0 := 1;~j~0 := 0; {5473#false} is VALID [2018-11-23 12:08:26,860 INFO L273 TraceCheckUtils]: 37: Hoare triple {5473#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {5473#false} is VALID [2018-11-23 12:08:26,860 INFO L256 TraceCheckUtils]: 38: Hoare triple {5473#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5473#false} is VALID [2018-11-23 12:08:26,860 INFO L273 TraceCheckUtils]: 39: Hoare triple {5473#false} ~cond := #in~cond; {5473#false} is VALID [2018-11-23 12:08:26,861 INFO L273 TraceCheckUtils]: 40: Hoare triple {5473#false} assume 0 == ~cond; {5473#false} is VALID [2018-11-23 12:08:26,861 INFO L273 TraceCheckUtils]: 41: Hoare triple {5473#false} assume !false; {5473#false} is VALID [2018-11-23 12:08:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:08:26,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:26,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:08:26,885 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2018-11-23 12:08:26,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:26,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:08:26,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:26,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:08:26,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:08:26,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:08:26,916 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 25 states. [2018-11-23 12:08:27,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:27,662 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-11-23 12:08:27,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:08:27,663 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2018-11-23 12:08:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:08:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 87 transitions. [2018-11-23 12:08:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:08:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 87 transitions. [2018-11-23 12:08:27,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 87 transitions. [2018-11-23 12:08:28,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:28,095 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:08:28,095 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:08:28,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:08:28,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:08:28,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2018-11-23 12:08:28,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:28,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 47 states. [2018-11-23 12:08:28,129 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 47 states. [2018-11-23 12:08:28,129 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 47 states. [2018-11-23 12:08:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:28,133 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 12:08:28,133 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-23 12:08:28,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:28,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:28,134 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 65 states. [2018-11-23 12:08:28,134 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 65 states. [2018-11-23 12:08:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:28,136 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 12:08:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-23 12:08:28,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:28,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:28,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:28,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:08:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-23 12:08:28,138 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2018-11-23 12:08:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:28,138 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-23 12:08:28,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:08:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 12:08:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:08:28,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:28,139 INFO L402 BasicCegarLoop]: trace histogram [22, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:28,139 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:28,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:28,140 INFO L82 PathProgramCache]: Analyzing trace with hash -151966138, now seen corresponding path program 17 times [2018-11-23 12:08:28,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:28,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:28,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:28,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:28,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:28,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {5978#true} call ULTIMATE.init(); {5978#true} is VALID [2018-11-23 12:08:28,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {5978#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5978#true} is VALID [2018-11-23 12:08:28,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {5978#true} assume true; {5978#true} is VALID [2018-11-23 12:08:28,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5978#true} {5978#true} #60#return; {5978#true} is VALID [2018-11-23 12:08:28,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {5978#true} call #t~ret4 := main(); {5978#true} is VALID [2018-11-23 12:08:28,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {5978#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; {5980#(= main_~i~0 0)} is VALID [2018-11-23 12:08:28,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {5980#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5981#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:28,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {5981#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5982#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:28,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {5982#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5983#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:28,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {5983#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5984#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:28,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {5984#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5985#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:28,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {5985#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5986#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:28,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {5986#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5987#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:28,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {5987#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5988#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:28,554 INFO L273 TraceCheckUtils]: 14: Hoare triple {5988#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5989#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:28,555 INFO L273 TraceCheckUtils]: 15: Hoare triple {5989#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5990#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:28,556 INFO L273 TraceCheckUtils]: 16: Hoare triple {5990#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5991#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:28,557 INFO L273 TraceCheckUtils]: 17: Hoare triple {5991#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5992#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:28,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {5992#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5993#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:28,559 INFO L273 TraceCheckUtils]: 19: Hoare triple {5993#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5994#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:28,560 INFO L273 TraceCheckUtils]: 20: Hoare triple {5994#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5995#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:28,561 INFO L273 TraceCheckUtils]: 21: Hoare triple {5995#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5996#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:28,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {5996#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5997#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:28,563 INFO L273 TraceCheckUtils]: 23: Hoare triple {5997#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5998#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:28,564 INFO L273 TraceCheckUtils]: 24: Hoare triple {5998#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5999#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:28,565 INFO L273 TraceCheckUtils]: 25: Hoare triple {5999#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6000#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:28,566 INFO L273 TraceCheckUtils]: 26: Hoare triple {6000#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6001#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:28,567 INFO L273 TraceCheckUtils]: 27: Hoare triple {6001#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6002#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:28,568 INFO L273 TraceCheckUtils]: 28: Hoare triple {6002#(<= main_~i~0 22)} assume !(~i~0 < 100000); {5979#false} is VALID [2018-11-23 12:08:28,568 INFO L273 TraceCheckUtils]: 29: Hoare triple {5979#false} ~i~0 := 1; {5979#false} is VALID [2018-11-23 12:08:28,568 INFO L273 TraceCheckUtils]: 30: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5979#false} is VALID [2018-11-23 12:08:28,569 INFO L273 TraceCheckUtils]: 31: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5979#false} is VALID [2018-11-23 12:08:28,569 INFO L273 TraceCheckUtils]: 32: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5979#false} is VALID [2018-11-23 12:08:28,569 INFO L273 TraceCheckUtils]: 33: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5979#false} is VALID [2018-11-23 12:08:28,569 INFO L273 TraceCheckUtils]: 34: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5979#false} is VALID [2018-11-23 12:08:28,569 INFO L273 TraceCheckUtils]: 35: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5979#false} is VALID [2018-11-23 12:08:28,570 INFO L273 TraceCheckUtils]: 36: Hoare triple {5979#false} assume !(~i~0 < 100000); {5979#false} is VALID [2018-11-23 12:08:28,570 INFO L273 TraceCheckUtils]: 37: Hoare triple {5979#false} ~i~0 := 1;~j~0 := 0; {5979#false} is VALID [2018-11-23 12:08:28,570 INFO L273 TraceCheckUtils]: 38: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {5979#false} is VALID [2018-11-23 12:08:28,570 INFO L256 TraceCheckUtils]: 39: Hoare triple {5979#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5979#false} is VALID [2018-11-23 12:08:28,571 INFO L273 TraceCheckUtils]: 40: Hoare triple {5979#false} ~cond := #in~cond; {5979#false} is VALID [2018-11-23 12:08:28,571 INFO L273 TraceCheckUtils]: 41: Hoare triple {5979#false} assume 0 == ~cond; {5979#false} is VALID [2018-11-23 12:08:28,571 INFO L273 TraceCheckUtils]: 42: Hoare triple {5979#false} assume !false; {5979#false} is VALID [2018-11-23 12:08:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:08:28,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:28,572 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-23 12:08:28,581 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:08:31,371 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:08:31,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:31,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:31,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {5978#true} call ULTIMATE.init(); {5978#true} is VALID [2018-11-23 12:08:31,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {5978#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5978#true} is VALID [2018-11-23 12:08:31,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {5978#true} assume true; {5978#true} is VALID [2018-11-23 12:08:31,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5978#true} {5978#true} #60#return; {5978#true} is VALID [2018-11-23 12:08:31,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {5978#true} call #t~ret4 := main(); {5978#true} is VALID [2018-11-23 12:08:31,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {5978#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; {6021#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:31,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {6021#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5981#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:31,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {5981#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5982#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:31,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {5982#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5983#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:31,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {5983#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5984#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:31,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {5984#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5985#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:31,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {5985#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5986#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:31,673 INFO L273 TraceCheckUtils]: 12: Hoare triple {5986#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5987#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:31,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {5987#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5988#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:31,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {5988#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5989#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:31,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {5989#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5990#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:31,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {5990#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5991#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:31,678 INFO L273 TraceCheckUtils]: 17: Hoare triple {5991#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5992#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:31,679 INFO L273 TraceCheckUtils]: 18: Hoare triple {5992#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5993#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:31,680 INFO L273 TraceCheckUtils]: 19: Hoare triple {5993#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5994#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:31,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {5994#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5995#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:31,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {5995#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5996#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:31,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {5996#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5997#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:31,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {5997#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5998#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:31,685 INFO L273 TraceCheckUtils]: 24: Hoare triple {5998#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5999#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:31,686 INFO L273 TraceCheckUtils]: 25: Hoare triple {5999#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6000#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:31,687 INFO L273 TraceCheckUtils]: 26: Hoare triple {6000#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6001#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:31,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {6001#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6002#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:31,689 INFO L273 TraceCheckUtils]: 28: Hoare triple {6002#(<= main_~i~0 22)} assume !(~i~0 < 100000); {5979#false} is VALID [2018-11-23 12:08:31,689 INFO L273 TraceCheckUtils]: 29: Hoare triple {5979#false} ~i~0 := 1; {5979#false} is VALID [2018-11-23 12:08:31,689 INFO L273 TraceCheckUtils]: 30: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5979#false} is VALID [2018-11-23 12:08:31,690 INFO L273 TraceCheckUtils]: 31: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5979#false} is VALID [2018-11-23 12:08:31,690 INFO L273 TraceCheckUtils]: 32: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5979#false} is VALID [2018-11-23 12:08:31,690 INFO L273 TraceCheckUtils]: 33: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5979#false} is VALID [2018-11-23 12:08:31,690 INFO L273 TraceCheckUtils]: 34: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5979#false} is VALID [2018-11-23 12:08:31,690 INFO L273 TraceCheckUtils]: 35: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {5979#false} is VALID [2018-11-23 12:08:31,691 INFO L273 TraceCheckUtils]: 36: Hoare triple {5979#false} assume !(~i~0 < 100000); {5979#false} is VALID [2018-11-23 12:08:31,691 INFO L273 TraceCheckUtils]: 37: Hoare triple {5979#false} ~i~0 := 1;~j~0 := 0; {5979#false} is VALID [2018-11-23 12:08:31,691 INFO L273 TraceCheckUtils]: 38: Hoare triple {5979#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {5979#false} is VALID [2018-11-23 12:08:31,691 INFO L256 TraceCheckUtils]: 39: Hoare triple {5979#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5979#false} is VALID [2018-11-23 12:08:31,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {5979#false} ~cond := #in~cond; {5979#false} is VALID [2018-11-23 12:08:31,692 INFO L273 TraceCheckUtils]: 41: Hoare triple {5979#false} assume 0 == ~cond; {5979#false} is VALID [2018-11-23 12:08:31,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {5979#false} assume !false; {5979#false} is VALID [2018-11-23 12:08:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:08:31,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:31,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:08:31,715 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2018-11-23 12:08:31,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:31,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:08:31,748 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-23 12:08:31,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:08:31,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:08:31,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:08:31,750 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 26 states. [2018-11-23 12:08:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:32,418 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-11-23 12:08:32,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:08:32,418 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2018-11-23 12:08:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:08:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 88 transitions. [2018-11-23 12:08:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:08:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 88 transitions. [2018-11-23 12:08:32,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 88 transitions. [2018-11-23 12:08:32,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:32,897 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:08:32,897 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:08:32,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:08:32,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:08:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2018-11-23 12:08:32,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:32,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 48 states. [2018-11-23 12:08:32,956 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 48 states. [2018-11-23 12:08:32,956 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 48 states. [2018-11-23 12:08:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:32,958 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-23 12:08:32,958 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 12:08:32,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:32,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:32,958 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 66 states. [2018-11-23 12:08:32,958 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 66 states. [2018-11-23 12:08:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:32,960 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-23 12:08:32,960 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 12:08:32,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:32,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:32,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:32,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:08:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-23 12:08:32,962 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 43 [2018-11-23 12:08:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:32,962 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-23 12:08:32,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:08:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-23 12:08:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:08:32,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:32,963 INFO L402 BasicCegarLoop]: trace histogram [23, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:32,963 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:32,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:32,964 INFO L82 PathProgramCache]: Analyzing trace with hash 539739242, now seen corresponding path program 18 times [2018-11-23 12:08:32,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:32,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:32,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:32,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:32,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:33,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {6494#true} call ULTIMATE.init(); {6494#true} is VALID [2018-11-23 12:08:33,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {6494#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6494#true} is VALID [2018-11-23 12:08:33,685 INFO L273 TraceCheckUtils]: 2: Hoare triple {6494#true} assume true; {6494#true} is VALID [2018-11-23 12:08:33,686 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6494#true} {6494#true} #60#return; {6494#true} is VALID [2018-11-23 12:08:33,686 INFO L256 TraceCheckUtils]: 4: Hoare triple {6494#true} call #t~ret4 := main(); {6494#true} is VALID [2018-11-23 12:08:33,710 INFO L273 TraceCheckUtils]: 5: Hoare triple {6494#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; {6496#(= main_~i~0 0)} is VALID [2018-11-23 12:08:33,716 INFO L273 TraceCheckUtils]: 6: Hoare triple {6496#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6497#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:33,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {6497#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6498#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:33,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {6498#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6499#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:33,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {6499#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6500#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:33,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {6500#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6501#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:33,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {6501#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6502#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:33,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {6502#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6503#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:33,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {6503#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6504#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:33,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {6504#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6505#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:33,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {6505#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6506#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:33,724 INFO L273 TraceCheckUtils]: 16: Hoare triple {6506#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6507#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:33,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {6507#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6508#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:33,726 INFO L273 TraceCheckUtils]: 18: Hoare triple {6508#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6509#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:33,727 INFO L273 TraceCheckUtils]: 19: Hoare triple {6509#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6510#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:33,728 INFO L273 TraceCheckUtils]: 20: Hoare triple {6510#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6511#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:33,729 INFO L273 TraceCheckUtils]: 21: Hoare triple {6511#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6512#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:33,730 INFO L273 TraceCheckUtils]: 22: Hoare triple {6512#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6513#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:33,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {6513#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6514#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:33,732 INFO L273 TraceCheckUtils]: 24: Hoare triple {6514#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6515#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:33,733 INFO L273 TraceCheckUtils]: 25: Hoare triple {6515#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6516#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:33,734 INFO L273 TraceCheckUtils]: 26: Hoare triple {6516#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6517#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:33,735 INFO L273 TraceCheckUtils]: 27: Hoare triple {6517#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6518#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:33,736 INFO L273 TraceCheckUtils]: 28: Hoare triple {6518#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6519#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:33,737 INFO L273 TraceCheckUtils]: 29: Hoare triple {6519#(<= main_~i~0 23)} assume !(~i~0 < 100000); {6495#false} is VALID [2018-11-23 12:08:33,737 INFO L273 TraceCheckUtils]: 30: Hoare triple {6495#false} ~i~0 := 1; {6495#false} is VALID [2018-11-23 12:08:33,737 INFO L273 TraceCheckUtils]: 31: Hoare triple {6495#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {6495#false} is VALID [2018-11-23 12:08:33,737 INFO L273 TraceCheckUtils]: 32: Hoare triple {6495#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {6495#false} is VALID [2018-11-23 12:08:33,737 INFO L273 TraceCheckUtils]: 33: Hoare triple {6495#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {6495#false} is VALID [2018-11-23 12:08:33,738 INFO L273 TraceCheckUtils]: 34: Hoare triple {6495#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {6495#false} is VALID [2018-11-23 12:08:33,738 INFO L273 TraceCheckUtils]: 35: Hoare triple {6495#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {6495#false} is VALID [2018-11-23 12:08:33,738 INFO L273 TraceCheckUtils]: 36: Hoare triple {6495#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {6495#false} is VALID [2018-11-23 12:08:33,738 INFO L273 TraceCheckUtils]: 37: Hoare triple {6495#false} assume !(~i~0 < 100000); {6495#false} is VALID [2018-11-23 12:08:33,739 INFO L273 TraceCheckUtils]: 38: Hoare triple {6495#false} ~i~0 := 1;~j~0 := 0; {6495#false} is VALID [2018-11-23 12:08:33,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {6495#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {6495#false} is VALID [2018-11-23 12:08:33,739 INFO L256 TraceCheckUtils]: 40: Hoare triple {6495#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6495#false} is VALID [2018-11-23 12:08:33,739 INFO L273 TraceCheckUtils]: 41: Hoare triple {6495#false} ~cond := #in~cond; {6495#false} is VALID [2018-11-23 12:08:33,739 INFO L273 TraceCheckUtils]: 42: Hoare triple {6495#false} assume 0 == ~cond; {6495#false} is VALID [2018-11-23 12:08:33,740 INFO L273 TraceCheckUtils]: 43: Hoare triple {6495#false} assume !false; {6495#false} is VALID [2018-11-23 12:08:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:08:33,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:33,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:33,751 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:08:34,001 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:08:34,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:34,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:34,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {6494#true} call ULTIMATE.init(); {6494#true} is VALID [2018-11-23 12:08:34,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {6494#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6494#true} is VALID [2018-11-23 12:08:34,123 INFO L273 TraceCheckUtils]: 2: Hoare triple {6494#true} assume true; {6494#true} is VALID [2018-11-23 12:08:34,123 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6494#true} {6494#true} #60#return; {6494#true} is VALID [2018-11-23 12:08:34,123 INFO L256 TraceCheckUtils]: 4: Hoare triple {6494#true} call #t~ret4 := main(); {6494#true} is VALID [2018-11-23 12:08:34,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {6494#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; {6494#true} is VALID [2018-11-23 12:08:34,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,125 INFO L273 TraceCheckUtils]: 11: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,125 INFO L273 TraceCheckUtils]: 12: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,125 INFO L273 TraceCheckUtils]: 13: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,125 INFO L273 TraceCheckUtils]: 14: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,125 INFO L273 TraceCheckUtils]: 15: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,126 INFO L273 TraceCheckUtils]: 18: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,126 INFO L273 TraceCheckUtils]: 19: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,126 INFO L273 TraceCheckUtils]: 20: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,126 INFO L273 TraceCheckUtils]: 21: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,126 INFO L273 TraceCheckUtils]: 22: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,126 INFO L273 TraceCheckUtils]: 23: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,126 INFO L273 TraceCheckUtils]: 24: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,127 INFO L273 TraceCheckUtils]: 25: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,127 INFO L273 TraceCheckUtils]: 26: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,127 INFO L273 TraceCheckUtils]: 27: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,127 INFO L273 TraceCheckUtils]: 28: Hoare triple {6494#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6494#true} is VALID [2018-11-23 12:08:34,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {6494#true} assume !(~i~0 < 100000); {6494#true} is VALID [2018-11-23 12:08:34,128 INFO L273 TraceCheckUtils]: 30: Hoare triple {6494#true} ~i~0 := 1; {6497#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:34,128 INFO L273 TraceCheckUtils]: 31: Hoare triple {6497#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {6501#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:34,129 INFO L273 TraceCheckUtils]: 32: Hoare triple {6501#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {6505#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:34,130 INFO L273 TraceCheckUtils]: 33: Hoare triple {6505#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {6509#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:34,130 INFO L273 TraceCheckUtils]: 34: Hoare triple {6509#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {6513#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:34,131 INFO L273 TraceCheckUtils]: 35: Hoare triple {6513#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {6517#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:34,132 INFO L273 TraceCheckUtils]: 36: Hoare triple {6517#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {6631#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:34,151 INFO L273 TraceCheckUtils]: 37: Hoare triple {6631#(<= main_~i~0 25)} assume !(~i~0 < 100000); {6495#false} is VALID [2018-11-23 12:08:34,151 INFO L273 TraceCheckUtils]: 38: Hoare triple {6495#false} ~i~0 := 1;~j~0 := 0; {6495#false} is VALID [2018-11-23 12:08:34,151 INFO L273 TraceCheckUtils]: 39: Hoare triple {6495#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {6495#false} is VALID [2018-11-23 12:08:34,151 INFO L256 TraceCheckUtils]: 40: Hoare triple {6495#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6495#false} is VALID [2018-11-23 12:08:34,152 INFO L273 TraceCheckUtils]: 41: Hoare triple {6495#false} ~cond := #in~cond; {6495#false} is VALID [2018-11-23 12:08:34,152 INFO L273 TraceCheckUtils]: 42: Hoare triple {6495#false} assume 0 == ~cond; {6495#false} is VALID [2018-11-23 12:08:34,152 INFO L273 TraceCheckUtils]: 43: Hoare triple {6495#false} assume !false; {6495#false} is VALID [2018-11-23 12:08:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-23 12:08:34,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:34,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 9] total 27 [2018-11-23 12:08:34,181 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2018-11-23 12:08:34,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:34,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:08:34,241 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-23 12:08:34,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:08:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:08:34,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:08:34,243 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 27 states. [2018-11-23 12:08:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:35,142 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-11-23 12:08:35,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:08:35,143 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2018-11-23 12:08:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:08:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 97 transitions. [2018-11-23 12:08:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:08:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 97 transitions. [2018-11-23 12:08:35,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 97 transitions. [2018-11-23 12:08:35,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:35,271 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:08:35,271 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:08:35,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:08:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:08:35,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2018-11-23 12:08:35,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:35,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 51 states. [2018-11-23 12:08:35,311 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 51 states. [2018-11-23 12:08:35,311 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 51 states. [2018-11-23 12:08:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:35,313 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-23 12:08:35,313 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-23 12:08:35,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:35,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:35,314 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 72 states. [2018-11-23 12:08:35,314 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 72 states. [2018-11-23 12:08:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:35,316 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-23 12:08:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-23 12:08:35,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:35,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:35,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:35,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:08:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-23 12:08:35,318 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 44 [2018-11-23 12:08:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:35,319 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-23 12:08:35,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:08:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-23 12:08:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:08:35,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:35,320 INFO L402 BasicCegarLoop]: trace histogram [25, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:35,320 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:35,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:35,320 INFO L82 PathProgramCache]: Analyzing trace with hash 79982501, now seen corresponding path program 19 times [2018-11-23 12:08:35,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:35,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:35,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:35,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:35,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:35,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {7043#true} call ULTIMATE.init(); {7043#true} is VALID [2018-11-23 12:08:35,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {7043#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7043#true} is VALID [2018-11-23 12:08:35,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {7043#true} assume true; {7043#true} is VALID [2018-11-23 12:08:35,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7043#true} {7043#true} #60#return; {7043#true} is VALID [2018-11-23 12:08:35,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {7043#true} call #t~ret4 := main(); {7043#true} is VALID [2018-11-23 12:08:35,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {7043#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; {7045#(= main_~i~0 0)} is VALID [2018-11-23 12:08:35,920 INFO L273 TraceCheckUtils]: 6: Hoare triple {7045#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7046#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:35,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {7046#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7047#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:35,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {7047#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7048#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:35,922 INFO L273 TraceCheckUtils]: 9: Hoare triple {7048#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7049#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:35,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {7049#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7050#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:35,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {7050#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7051#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:35,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {7051#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7052#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:35,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {7052#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7053#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:35,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {7053#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7054#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:35,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {7054#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7055#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:35,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {7055#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7056#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:35,929 INFO L273 TraceCheckUtils]: 17: Hoare triple {7056#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7057#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:35,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {7057#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7058#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:35,931 INFO L273 TraceCheckUtils]: 19: Hoare triple {7058#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7059#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:35,932 INFO L273 TraceCheckUtils]: 20: Hoare triple {7059#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7060#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:35,933 INFO L273 TraceCheckUtils]: 21: Hoare triple {7060#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7061#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:35,934 INFO L273 TraceCheckUtils]: 22: Hoare triple {7061#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7062#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:35,935 INFO L273 TraceCheckUtils]: 23: Hoare triple {7062#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7063#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:35,936 INFO L273 TraceCheckUtils]: 24: Hoare triple {7063#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7064#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:35,937 INFO L273 TraceCheckUtils]: 25: Hoare triple {7064#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7065#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:35,939 INFO L273 TraceCheckUtils]: 26: Hoare triple {7065#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7066#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:35,940 INFO L273 TraceCheckUtils]: 27: Hoare triple {7066#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7067#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:35,941 INFO L273 TraceCheckUtils]: 28: Hoare triple {7067#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7068#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:35,942 INFO L273 TraceCheckUtils]: 29: Hoare triple {7068#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7069#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:35,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {7069#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7070#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:35,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {7070#(<= main_~i~0 25)} assume !(~i~0 < 100000); {7044#false} is VALID [2018-11-23 12:08:35,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {7044#false} ~i~0 := 1; {7044#false} is VALID [2018-11-23 12:08:35,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:35,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:35,944 INFO L273 TraceCheckUtils]: 35: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:35,944 INFO L273 TraceCheckUtils]: 36: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:35,945 INFO L273 TraceCheckUtils]: 37: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:35,945 INFO L273 TraceCheckUtils]: 38: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:35,945 INFO L273 TraceCheckUtils]: 39: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:35,945 INFO L273 TraceCheckUtils]: 40: Hoare triple {7044#false} assume !(~i~0 < 100000); {7044#false} is VALID [2018-11-23 12:08:35,945 INFO L273 TraceCheckUtils]: 41: Hoare triple {7044#false} ~i~0 := 1;~j~0 := 0; {7044#false} is VALID [2018-11-23 12:08:35,946 INFO L273 TraceCheckUtils]: 42: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {7044#false} is VALID [2018-11-23 12:08:35,946 INFO L256 TraceCheckUtils]: 43: Hoare triple {7044#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7044#false} is VALID [2018-11-23 12:08:35,946 INFO L273 TraceCheckUtils]: 44: Hoare triple {7044#false} ~cond := #in~cond; {7044#false} is VALID [2018-11-23 12:08:35,946 INFO L273 TraceCheckUtils]: 45: Hoare triple {7044#false} assume 0 == ~cond; {7044#false} is VALID [2018-11-23 12:08:35,946 INFO L273 TraceCheckUtils]: 46: Hoare triple {7044#false} assume !false; {7044#false} is VALID [2018-11-23 12:08:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:08:35,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:35,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:35,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:36,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:36,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {7043#true} call ULTIMATE.init(); {7043#true} is VALID [2018-11-23 12:08:36,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {7043#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7043#true} is VALID [2018-11-23 12:08:36,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {7043#true} assume true; {7043#true} is VALID [2018-11-23 12:08:36,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7043#true} {7043#true} #60#return; {7043#true} is VALID [2018-11-23 12:08:36,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {7043#true} call #t~ret4 := main(); {7043#true} is VALID [2018-11-23 12:08:36,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {7043#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; {7089#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:36,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {7089#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7046#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:36,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {7046#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7047#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:36,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {7047#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7048#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:36,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {7048#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7049#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:36,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {7049#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7050#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:36,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {7050#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7051#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:36,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {7051#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7052#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:36,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {7052#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7053#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:36,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {7053#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7054#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:36,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {7054#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7055#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:36,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {7055#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7056#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:36,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {7056#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7057#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:36,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {7057#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7058#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:36,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {7058#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7059#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:36,363 INFO L273 TraceCheckUtils]: 20: Hoare triple {7059#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7060#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:36,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {7060#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7061#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:36,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {7061#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7062#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:36,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {7062#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7063#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:36,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {7063#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7064#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:36,368 INFO L273 TraceCheckUtils]: 25: Hoare triple {7064#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7065#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:36,369 INFO L273 TraceCheckUtils]: 26: Hoare triple {7065#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7066#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:36,370 INFO L273 TraceCheckUtils]: 27: Hoare triple {7066#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7067#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:36,371 INFO L273 TraceCheckUtils]: 28: Hoare triple {7067#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7068#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:36,373 INFO L273 TraceCheckUtils]: 29: Hoare triple {7068#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7069#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:36,376 INFO L273 TraceCheckUtils]: 30: Hoare triple {7069#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7070#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:36,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {7070#(<= main_~i~0 25)} assume !(~i~0 < 100000); {7044#false} is VALID [2018-11-23 12:08:36,377 INFO L273 TraceCheckUtils]: 32: Hoare triple {7044#false} ~i~0 := 1; {7044#false} is VALID [2018-11-23 12:08:36,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:36,377 INFO L273 TraceCheckUtils]: 34: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:36,377 INFO L273 TraceCheckUtils]: 35: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:36,377 INFO L273 TraceCheckUtils]: 36: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:36,377 INFO L273 TraceCheckUtils]: 37: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:36,377 INFO L273 TraceCheckUtils]: 38: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:36,378 INFO L273 TraceCheckUtils]: 39: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7044#false} is VALID [2018-11-23 12:08:36,378 INFO L273 TraceCheckUtils]: 40: Hoare triple {7044#false} assume !(~i~0 < 100000); {7044#false} is VALID [2018-11-23 12:08:36,378 INFO L273 TraceCheckUtils]: 41: Hoare triple {7044#false} ~i~0 := 1;~j~0 := 0; {7044#false} is VALID [2018-11-23 12:08:36,378 INFO L273 TraceCheckUtils]: 42: Hoare triple {7044#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {7044#false} is VALID [2018-11-23 12:08:36,378 INFO L256 TraceCheckUtils]: 43: Hoare triple {7044#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7044#false} is VALID [2018-11-23 12:08:36,378 INFO L273 TraceCheckUtils]: 44: Hoare triple {7044#false} ~cond := #in~cond; {7044#false} is VALID [2018-11-23 12:08:36,378 INFO L273 TraceCheckUtils]: 45: Hoare triple {7044#false} assume 0 == ~cond; {7044#false} is VALID [2018-11-23 12:08:36,378 INFO L273 TraceCheckUtils]: 46: Hoare triple {7044#false} assume !false; {7044#false} is VALID [2018-11-23 12:08:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:08:36,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:36,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:08:36,399 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 47 [2018-11-23 12:08:36,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:36,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:08:36,465 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-23 12:08:36,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:08:36,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:08:36,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:08:36,467 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 29 states. [2018-11-23 12:08:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:37,459 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-11-23 12:08:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:08:37,460 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 47 [2018-11-23 12:08:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:08:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 96 transitions. [2018-11-23 12:08:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:08:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 96 transitions. [2018-11-23 12:08:37,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 96 transitions. [2018-11-23 12:08:37,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:37,588 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:08:37,588 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 12:08:37,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:08:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 12:08:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 52. [2018-11-23 12:08:37,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:37,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 52 states. [2018-11-23 12:08:37,621 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 52 states. [2018-11-23 12:08:37,621 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 52 states. [2018-11-23 12:08:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:37,623 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:08:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-23 12:08:37,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:37,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:37,624 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 73 states. [2018-11-23 12:08:37,624 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 73 states. [2018-11-23 12:08:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:37,626 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:08:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-23 12:08:37,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:37,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:37,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:37,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:08:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-11-23 12:08:37,628 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2018-11-23 12:08:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:37,629 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-23 12:08:37,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:08:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 12:08:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:08:37,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:37,630 INFO L402 BasicCegarLoop]: trace histogram [26, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:37,630 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:37,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:37,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1153389513, now seen corresponding path program 20 times [2018-11-23 12:08:37,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:37,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:37,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:37,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:37,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:38,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {7611#true} call ULTIMATE.init(); {7611#true} is VALID [2018-11-23 12:08:38,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {7611#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7611#true} is VALID [2018-11-23 12:08:38,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {7611#true} assume true; {7611#true} is VALID [2018-11-23 12:08:38,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7611#true} {7611#true} #60#return; {7611#true} is VALID [2018-11-23 12:08:38,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {7611#true} call #t~ret4 := main(); {7611#true} is VALID [2018-11-23 12:08:38,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {7611#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; {7613#(= main_~i~0 0)} is VALID [2018-11-23 12:08:38,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {7613#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7614#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:38,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {7614#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7615#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:38,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {7615#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7616#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:38,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {7616#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7617#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:38,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {7617#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7618#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:38,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {7618#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7619#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:38,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {7619#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7620#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:38,439 INFO L273 TraceCheckUtils]: 13: Hoare triple {7620#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7621#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:38,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {7621#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7622#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:38,441 INFO L273 TraceCheckUtils]: 15: Hoare triple {7622#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7623#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:38,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {7623#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7624#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:38,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {7624#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7625#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:38,444 INFO L273 TraceCheckUtils]: 18: Hoare triple {7625#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7626#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:38,445 INFO L273 TraceCheckUtils]: 19: Hoare triple {7626#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7627#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:38,446 INFO L273 TraceCheckUtils]: 20: Hoare triple {7627#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7628#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:38,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {7628#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7629#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:38,448 INFO L273 TraceCheckUtils]: 22: Hoare triple {7629#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7630#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:38,449 INFO L273 TraceCheckUtils]: 23: Hoare triple {7630#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7631#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:38,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {7631#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7632#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:38,451 INFO L273 TraceCheckUtils]: 25: Hoare triple {7632#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7633#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:38,451 INFO L273 TraceCheckUtils]: 26: Hoare triple {7633#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7634#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:38,452 INFO L273 TraceCheckUtils]: 27: Hoare triple {7634#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7635#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:38,453 INFO L273 TraceCheckUtils]: 28: Hoare triple {7635#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7636#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:38,454 INFO L273 TraceCheckUtils]: 29: Hoare triple {7636#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7637#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:38,455 INFO L273 TraceCheckUtils]: 30: Hoare triple {7637#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7638#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:38,456 INFO L273 TraceCheckUtils]: 31: Hoare triple {7638#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7639#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:38,457 INFO L273 TraceCheckUtils]: 32: Hoare triple {7639#(<= main_~i~0 26)} assume !(~i~0 < 100000); {7612#false} is VALID [2018-11-23 12:08:38,457 INFO L273 TraceCheckUtils]: 33: Hoare triple {7612#false} ~i~0 := 1; {7612#false} is VALID [2018-11-23 12:08:38,457 INFO L273 TraceCheckUtils]: 34: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,457 INFO L273 TraceCheckUtils]: 35: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,458 INFO L273 TraceCheckUtils]: 36: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,458 INFO L273 TraceCheckUtils]: 37: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,458 INFO L273 TraceCheckUtils]: 38: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,459 INFO L273 TraceCheckUtils]: 40: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,459 INFO L273 TraceCheckUtils]: 41: Hoare triple {7612#false} assume !(~i~0 < 100000); {7612#false} is VALID [2018-11-23 12:08:38,459 INFO L273 TraceCheckUtils]: 42: Hoare triple {7612#false} ~i~0 := 1;~j~0 := 0; {7612#false} is VALID [2018-11-23 12:08:38,459 INFO L273 TraceCheckUtils]: 43: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {7612#false} is VALID [2018-11-23 12:08:38,459 INFO L256 TraceCheckUtils]: 44: Hoare triple {7612#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7612#false} is VALID [2018-11-23 12:08:38,460 INFO L273 TraceCheckUtils]: 45: Hoare triple {7612#false} ~cond := #in~cond; {7612#false} is VALID [2018-11-23 12:08:38,460 INFO L273 TraceCheckUtils]: 46: Hoare triple {7612#false} assume 0 == ~cond; {7612#false} is VALID [2018-11-23 12:08:38,460 INFO L273 TraceCheckUtils]: 47: Hoare triple {7612#false} assume !false; {7612#false} is VALID [2018-11-23 12:08:38,462 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:08:38,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:38,462 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:38,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:08:38,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:08:38,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:38,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:38,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {7611#true} call ULTIMATE.init(); {7611#true} is VALID [2018-11-23 12:08:38,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {7611#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7611#true} is VALID [2018-11-23 12:08:38,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {7611#true} assume true; {7611#true} is VALID [2018-11-23 12:08:38,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7611#true} {7611#true} #60#return; {7611#true} is VALID [2018-11-23 12:08:38,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {7611#true} call #t~ret4 := main(); {7611#true} is VALID [2018-11-23 12:08:38,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {7611#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; {7658#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:38,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {7658#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7614#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:38,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {7614#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7615#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:38,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {7615#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7616#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:38,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {7616#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7617#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:38,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {7617#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7618#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:38,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {7618#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7619#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:38,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {7619#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7620#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:38,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {7620#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7621#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:38,685 INFO L273 TraceCheckUtils]: 14: Hoare triple {7621#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7622#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:38,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {7622#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7623#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:38,687 INFO L273 TraceCheckUtils]: 16: Hoare triple {7623#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7624#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:38,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {7624#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7625#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:38,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {7625#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7626#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:38,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {7626#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7627#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:38,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {7627#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7628#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:38,692 INFO L273 TraceCheckUtils]: 21: Hoare triple {7628#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7629#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:38,692 INFO L273 TraceCheckUtils]: 22: Hoare triple {7629#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7630#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:38,693 INFO L273 TraceCheckUtils]: 23: Hoare triple {7630#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7631#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:38,694 INFO L273 TraceCheckUtils]: 24: Hoare triple {7631#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7632#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:38,695 INFO L273 TraceCheckUtils]: 25: Hoare triple {7632#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7633#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:38,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {7633#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7634#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:38,697 INFO L273 TraceCheckUtils]: 27: Hoare triple {7634#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7635#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:38,698 INFO L273 TraceCheckUtils]: 28: Hoare triple {7635#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7636#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:38,699 INFO L273 TraceCheckUtils]: 29: Hoare triple {7636#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7637#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:38,700 INFO L273 TraceCheckUtils]: 30: Hoare triple {7637#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7638#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:38,701 INFO L273 TraceCheckUtils]: 31: Hoare triple {7638#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7639#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:38,701 INFO L273 TraceCheckUtils]: 32: Hoare triple {7639#(<= main_~i~0 26)} assume !(~i~0 < 100000); {7612#false} is VALID [2018-11-23 12:08:38,702 INFO L273 TraceCheckUtils]: 33: Hoare triple {7612#false} ~i~0 := 1; {7612#false} is VALID [2018-11-23 12:08:38,702 INFO L273 TraceCheckUtils]: 34: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,702 INFO L273 TraceCheckUtils]: 35: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,702 INFO L273 TraceCheckUtils]: 36: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,702 INFO L273 TraceCheckUtils]: 37: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,703 INFO L273 TraceCheckUtils]: 38: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,703 INFO L273 TraceCheckUtils]: 39: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,703 INFO L273 TraceCheckUtils]: 40: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {7612#false} is VALID [2018-11-23 12:08:38,703 INFO L273 TraceCheckUtils]: 41: Hoare triple {7612#false} assume !(~i~0 < 100000); {7612#false} is VALID [2018-11-23 12:08:38,703 INFO L273 TraceCheckUtils]: 42: Hoare triple {7612#false} ~i~0 := 1;~j~0 := 0; {7612#false} is VALID [2018-11-23 12:08:38,704 INFO L273 TraceCheckUtils]: 43: Hoare triple {7612#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {7612#false} is VALID [2018-11-23 12:08:38,704 INFO L256 TraceCheckUtils]: 44: Hoare triple {7612#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7612#false} is VALID [2018-11-23 12:08:38,704 INFO L273 TraceCheckUtils]: 45: Hoare triple {7612#false} ~cond := #in~cond; {7612#false} is VALID [2018-11-23 12:08:38,704 INFO L273 TraceCheckUtils]: 46: Hoare triple {7612#false} assume 0 == ~cond; {7612#false} is VALID [2018-11-23 12:08:38,704 INFO L273 TraceCheckUtils]: 47: Hoare triple {7612#false} assume !false; {7612#false} is VALID [2018-11-23 12:08:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:08:38,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:38,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:08:38,726 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-11-23 12:08:38,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:38,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:08:38,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:38,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:08:38,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:08:38,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:08:38,760 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 30 states. [2018-11-23 12:08:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:40,059 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-11-23 12:08:40,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:08:40,059 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-11-23 12:08:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:08:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 97 transitions. [2018-11-23 12:08:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:08:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 97 transitions. [2018-11-23 12:08:40,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 97 transitions. [2018-11-23 12:08:40,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:40,154 INFO L225 Difference]: With dead ends: 93 [2018-11-23 12:08:40,154 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:08:40,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:08:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:08:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 53. [2018-11-23 12:08:40,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:40,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 53 states. [2018-11-23 12:08:40,197 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 53 states. [2018-11-23 12:08:40,197 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 53 states. [2018-11-23 12:08:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:40,199 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-23 12:08:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-23 12:08:40,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:40,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:40,199 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 74 states. [2018-11-23 12:08:40,199 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 74 states. [2018-11-23 12:08:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:40,201 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-23 12:08:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-23 12:08:40,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:40,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:40,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:40,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:08:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-11-23 12:08:40,203 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 48 [2018-11-23 12:08:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:40,203 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-23 12:08:40,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:08:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-23 12:08:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:08:40,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:40,204 INFO L402 BasicCegarLoop]: trace histogram [27, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:40,204 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:40,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:40,204 INFO L82 PathProgramCache]: Analyzing trace with hash 69268517, now seen corresponding path program 21 times [2018-11-23 12:08:40,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:40,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:40,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:40,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:40,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:40,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {8189#true} call ULTIMATE.init(); {8189#true} is VALID [2018-11-23 12:08:40,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {8189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8189#true} is VALID [2018-11-23 12:08:40,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {8189#true} assume true; {8189#true} is VALID [2018-11-23 12:08:40,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8189#true} {8189#true} #60#return; {8189#true} is VALID [2018-11-23 12:08:40,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {8189#true} call #t~ret4 := main(); {8189#true} is VALID [2018-11-23 12:08:40,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {8189#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; {8191#(= main_~i~0 0)} is VALID [2018-11-23 12:08:40,920 INFO L273 TraceCheckUtils]: 6: Hoare triple {8191#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8192#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:40,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {8192#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8193#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:40,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {8193#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8194#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:40,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {8194#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8195#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:40,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {8195#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8196#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:40,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {8196#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8197#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:40,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {8197#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8198#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:40,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {8198#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8199#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:40,945 INFO L273 TraceCheckUtils]: 14: Hoare triple {8199#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8200#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:40,946 INFO L273 TraceCheckUtils]: 15: Hoare triple {8200#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8201#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:40,947 INFO L273 TraceCheckUtils]: 16: Hoare triple {8201#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8202#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:40,948 INFO L273 TraceCheckUtils]: 17: Hoare triple {8202#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8203#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:40,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {8203#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8204#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:40,950 INFO L273 TraceCheckUtils]: 19: Hoare triple {8204#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8205#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:40,951 INFO L273 TraceCheckUtils]: 20: Hoare triple {8205#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8206#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:40,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {8206#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8207#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:40,953 INFO L273 TraceCheckUtils]: 22: Hoare triple {8207#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8208#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:40,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {8208#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8209#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:40,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {8209#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8210#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:40,956 INFO L273 TraceCheckUtils]: 25: Hoare triple {8210#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8211#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:40,957 INFO L273 TraceCheckUtils]: 26: Hoare triple {8211#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8212#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:40,958 INFO L273 TraceCheckUtils]: 27: Hoare triple {8212#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8213#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:40,959 INFO L273 TraceCheckUtils]: 28: Hoare triple {8213#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8214#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:40,960 INFO L273 TraceCheckUtils]: 29: Hoare triple {8214#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8215#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:40,961 INFO L273 TraceCheckUtils]: 30: Hoare triple {8215#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8216#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:40,962 INFO L273 TraceCheckUtils]: 31: Hoare triple {8216#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8217#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:40,963 INFO L273 TraceCheckUtils]: 32: Hoare triple {8217#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8218#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:40,964 INFO L273 TraceCheckUtils]: 33: Hoare triple {8218#(<= main_~i~0 27)} assume !(~i~0 < 100000); {8190#false} is VALID [2018-11-23 12:08:40,964 INFO L273 TraceCheckUtils]: 34: Hoare triple {8190#false} ~i~0 := 1; {8190#false} is VALID [2018-11-23 12:08:40,964 INFO L273 TraceCheckUtils]: 35: Hoare triple {8190#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8190#false} is VALID [2018-11-23 12:08:40,964 INFO L273 TraceCheckUtils]: 36: Hoare triple {8190#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8190#false} is VALID [2018-11-23 12:08:40,965 INFO L273 TraceCheckUtils]: 37: Hoare triple {8190#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8190#false} is VALID [2018-11-23 12:08:40,965 INFO L273 TraceCheckUtils]: 38: Hoare triple {8190#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8190#false} is VALID [2018-11-23 12:08:40,965 INFO L273 TraceCheckUtils]: 39: Hoare triple {8190#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8190#false} is VALID [2018-11-23 12:08:40,965 INFO L273 TraceCheckUtils]: 40: Hoare triple {8190#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8190#false} is VALID [2018-11-23 12:08:40,965 INFO L273 TraceCheckUtils]: 41: Hoare triple {8190#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8190#false} is VALID [2018-11-23 12:08:40,966 INFO L273 TraceCheckUtils]: 42: Hoare triple {8190#false} assume !(~i~0 < 100000); {8190#false} is VALID [2018-11-23 12:08:40,966 INFO L273 TraceCheckUtils]: 43: Hoare triple {8190#false} ~i~0 := 1;~j~0 := 0; {8190#false} is VALID [2018-11-23 12:08:40,966 INFO L273 TraceCheckUtils]: 44: Hoare triple {8190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {8190#false} is VALID [2018-11-23 12:08:40,966 INFO L256 TraceCheckUtils]: 45: Hoare triple {8190#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8190#false} is VALID [2018-11-23 12:08:40,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {8190#false} ~cond := #in~cond; {8190#false} is VALID [2018-11-23 12:08:40,967 INFO L273 TraceCheckUtils]: 47: Hoare triple {8190#false} assume 0 == ~cond; {8190#false} is VALID [2018-11-23 12:08:40,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {8190#false} assume !false; {8190#false} is VALID [2018-11-23 12:08:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:08:40,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:40,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:40,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:08:41,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 12:08:41,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:41,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:41,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {8189#true} call ULTIMATE.init(); {8189#true} is VALID [2018-11-23 12:08:41,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {8189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8189#true} is VALID [2018-11-23 12:08:41,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {8189#true} assume true; {8189#true} is VALID [2018-11-23 12:08:41,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8189#true} {8189#true} #60#return; {8189#true} is VALID [2018-11-23 12:08:41,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {8189#true} call #t~ret4 := main(); {8189#true} is VALID [2018-11-23 12:08:41,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {8189#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; {8189#true} is VALID [2018-11-23 12:08:41,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,228 INFO L273 TraceCheckUtils]: 14: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,231 INFO L273 TraceCheckUtils]: 29: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,231 INFO L273 TraceCheckUtils]: 30: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,231 INFO L273 TraceCheckUtils]: 31: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,231 INFO L273 TraceCheckUtils]: 32: Hoare triple {8189#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8189#true} is VALID [2018-11-23 12:08:41,231 INFO L273 TraceCheckUtils]: 33: Hoare triple {8189#true} assume !(~i~0 < 100000); {8189#true} is VALID [2018-11-23 12:08:41,232 INFO L273 TraceCheckUtils]: 34: Hoare triple {8189#true} ~i~0 := 1; {8192#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:41,234 INFO L273 TraceCheckUtils]: 35: Hoare triple {8192#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8196#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:41,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {8196#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8200#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:41,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {8200#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8204#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:41,236 INFO L273 TraceCheckUtils]: 38: Hoare triple {8204#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8208#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:41,237 INFO L273 TraceCheckUtils]: 39: Hoare triple {8208#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8212#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:41,238 INFO L273 TraceCheckUtils]: 40: Hoare triple {8212#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8216#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:41,239 INFO L273 TraceCheckUtils]: 41: Hoare triple {8216#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8345#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:41,240 INFO L273 TraceCheckUtils]: 42: Hoare triple {8345#(<= main_~i~0 29)} assume !(~i~0 < 100000); {8190#false} is VALID [2018-11-23 12:08:41,241 INFO L273 TraceCheckUtils]: 43: Hoare triple {8190#false} ~i~0 := 1;~j~0 := 0; {8190#false} is VALID [2018-11-23 12:08:41,241 INFO L273 TraceCheckUtils]: 44: Hoare triple {8190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {8190#false} is VALID [2018-11-23 12:08:41,241 INFO L256 TraceCheckUtils]: 45: Hoare triple {8190#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8190#false} is VALID [2018-11-23 12:08:41,241 INFO L273 TraceCheckUtils]: 46: Hoare triple {8190#false} ~cond := #in~cond; {8190#false} is VALID [2018-11-23 12:08:41,242 INFO L273 TraceCheckUtils]: 47: Hoare triple {8190#false} assume 0 == ~cond; {8190#false} is VALID [2018-11-23 12:08:41,242 INFO L273 TraceCheckUtils]: 48: Hoare triple {8190#false} assume !false; {8190#false} is VALID [2018-11-23 12:08:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-23 12:08:41,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:41,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 31 [2018-11-23 12:08:41,264 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2018-11-23 12:08:41,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:41,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:08:41,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:41,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:08:41,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:08:41,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:08:41,338 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 31 states. [2018-11-23 12:08:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:42,628 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-11-23 12:08:42,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:08:42,629 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2018-11-23 12:08:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:08:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 106 transitions. [2018-11-23 12:08:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:08:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 106 transitions. [2018-11-23 12:08:42,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 106 transitions. [2018-11-23 12:08:42,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:42,955 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:08:42,955 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 12:08:42,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:08:42,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 12:08:42,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2018-11-23 12:08:42,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:42,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 56 states. [2018-11-23 12:08:42,993 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 56 states. [2018-11-23 12:08:42,993 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 56 states. [2018-11-23 12:08:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:42,995 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-11-23 12:08:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-23 12:08:42,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:42,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:42,996 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 80 states. [2018-11-23 12:08:42,997 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 80 states. [2018-11-23 12:08:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:42,998 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-11-23 12:08:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-23 12:08:42,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:42,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:42,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:43,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:08:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-23 12:08:43,001 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 49 [2018-11-23 12:08:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:43,001 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-23 12:08:43,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:08:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 12:08:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:08:43,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:43,002 INFO L402 BasicCegarLoop]: trace histogram [29, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:43,002 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:43,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:43,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1323254198, now seen corresponding path program 22 times [2018-11-23 12:08:43,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:43,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:43,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:43,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:43,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:43,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {8800#true} call ULTIMATE.init(); {8800#true} is VALID [2018-11-23 12:08:43,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {8800#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8800#true} is VALID [2018-11-23 12:08:43,835 INFO L273 TraceCheckUtils]: 2: Hoare triple {8800#true} assume true; {8800#true} is VALID [2018-11-23 12:08:43,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8800#true} {8800#true} #60#return; {8800#true} is VALID [2018-11-23 12:08:43,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {8800#true} call #t~ret4 := main(); {8800#true} is VALID [2018-11-23 12:08:43,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {8800#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; {8802#(= main_~i~0 0)} is VALID [2018-11-23 12:08:43,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {8802#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8803#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:43,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {8803#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8804#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:43,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {8804#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8805#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:43,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {8805#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8806#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:43,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {8806#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8807#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:43,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {8807#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8808#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:43,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {8808#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8809#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:43,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {8809#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8810#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:43,844 INFO L273 TraceCheckUtils]: 14: Hoare triple {8810#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8811#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:43,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {8811#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8812#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:43,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {8812#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8813#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:43,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {8813#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8814#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:43,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {8814#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8815#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:43,849 INFO L273 TraceCheckUtils]: 19: Hoare triple {8815#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8816#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:43,850 INFO L273 TraceCheckUtils]: 20: Hoare triple {8816#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8817#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:43,851 INFO L273 TraceCheckUtils]: 21: Hoare triple {8817#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8818#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:43,852 INFO L273 TraceCheckUtils]: 22: Hoare triple {8818#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8819#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:43,853 INFO L273 TraceCheckUtils]: 23: Hoare triple {8819#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8820#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:43,854 INFO L273 TraceCheckUtils]: 24: Hoare triple {8820#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8821#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:43,855 INFO L273 TraceCheckUtils]: 25: Hoare triple {8821#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8822#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:43,856 INFO L273 TraceCheckUtils]: 26: Hoare triple {8822#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8823#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:43,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {8823#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8824#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:43,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {8824#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8825#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:43,859 INFO L273 TraceCheckUtils]: 29: Hoare triple {8825#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8826#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:43,860 INFO L273 TraceCheckUtils]: 30: Hoare triple {8826#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8827#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:43,861 INFO L273 TraceCheckUtils]: 31: Hoare triple {8827#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8828#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:43,862 INFO L273 TraceCheckUtils]: 32: Hoare triple {8828#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8829#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:43,863 INFO L273 TraceCheckUtils]: 33: Hoare triple {8829#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8830#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:43,864 INFO L273 TraceCheckUtils]: 34: Hoare triple {8830#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8831#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:43,865 INFO L273 TraceCheckUtils]: 35: Hoare triple {8831#(<= main_~i~0 29)} assume !(~i~0 < 100000); {8801#false} is VALID [2018-11-23 12:08:43,865 INFO L273 TraceCheckUtils]: 36: Hoare triple {8801#false} ~i~0 := 1; {8801#false} is VALID [2018-11-23 12:08:43,865 INFO L273 TraceCheckUtils]: 37: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:43,865 INFO L273 TraceCheckUtils]: 38: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:43,866 INFO L273 TraceCheckUtils]: 39: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:43,866 INFO L273 TraceCheckUtils]: 40: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:43,866 INFO L273 TraceCheckUtils]: 41: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:43,866 INFO L273 TraceCheckUtils]: 42: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:43,866 INFO L273 TraceCheckUtils]: 43: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:43,867 INFO L273 TraceCheckUtils]: 44: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:43,867 INFO L273 TraceCheckUtils]: 45: Hoare triple {8801#false} assume !(~i~0 < 100000); {8801#false} is VALID [2018-11-23 12:08:43,867 INFO L273 TraceCheckUtils]: 46: Hoare triple {8801#false} ~i~0 := 1;~j~0 := 0; {8801#false} is VALID [2018-11-23 12:08:43,867 INFO L273 TraceCheckUtils]: 47: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {8801#false} is VALID [2018-11-23 12:08:43,867 INFO L256 TraceCheckUtils]: 48: Hoare triple {8801#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8801#false} is VALID [2018-11-23 12:08:43,868 INFO L273 TraceCheckUtils]: 49: Hoare triple {8801#false} ~cond := #in~cond; {8801#false} is VALID [2018-11-23 12:08:43,868 INFO L273 TraceCheckUtils]: 50: Hoare triple {8801#false} assume 0 == ~cond; {8801#false} is VALID [2018-11-23 12:08:43,868 INFO L273 TraceCheckUtils]: 51: Hoare triple {8801#false} assume !false; {8801#false} is VALID [2018-11-23 12:08:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:08:43,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:43,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:43,879 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:08:43,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:08:43,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:43,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:44,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {8800#true} call ULTIMATE.init(); {8800#true} is VALID [2018-11-23 12:08:44,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {8800#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8800#true} is VALID [2018-11-23 12:08:44,176 INFO L273 TraceCheckUtils]: 2: Hoare triple {8800#true} assume true; {8800#true} is VALID [2018-11-23 12:08:44,176 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8800#true} {8800#true} #60#return; {8800#true} is VALID [2018-11-23 12:08:44,176 INFO L256 TraceCheckUtils]: 4: Hoare triple {8800#true} call #t~ret4 := main(); {8800#true} is VALID [2018-11-23 12:08:44,177 INFO L273 TraceCheckUtils]: 5: Hoare triple {8800#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; {8850#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:44,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {8850#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8803#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:44,179 INFO L273 TraceCheckUtils]: 7: Hoare triple {8803#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8804#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:44,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {8804#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8805#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:44,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {8805#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8806#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:44,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {8806#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8807#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:44,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {8807#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8808#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:44,183 INFO L273 TraceCheckUtils]: 12: Hoare triple {8808#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8809#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:44,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {8809#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8810#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:44,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {8810#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8811#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:44,186 INFO L273 TraceCheckUtils]: 15: Hoare triple {8811#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8812#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:44,187 INFO L273 TraceCheckUtils]: 16: Hoare triple {8812#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8813#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:44,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {8813#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8814#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:44,189 INFO L273 TraceCheckUtils]: 18: Hoare triple {8814#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8815#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:44,190 INFO L273 TraceCheckUtils]: 19: Hoare triple {8815#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8816#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:44,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {8816#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8817#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:44,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {8817#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8818#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:44,193 INFO L273 TraceCheckUtils]: 22: Hoare triple {8818#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8819#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:44,194 INFO L273 TraceCheckUtils]: 23: Hoare triple {8819#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8820#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:44,195 INFO L273 TraceCheckUtils]: 24: Hoare triple {8820#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8821#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:44,196 INFO L273 TraceCheckUtils]: 25: Hoare triple {8821#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8822#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:44,197 INFO L273 TraceCheckUtils]: 26: Hoare triple {8822#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8823#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:44,198 INFO L273 TraceCheckUtils]: 27: Hoare triple {8823#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8824#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:44,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {8824#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8825#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:44,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {8825#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8826#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:44,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {8826#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8827#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:44,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {8827#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8828#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:44,203 INFO L273 TraceCheckUtils]: 32: Hoare triple {8828#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8829#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:44,204 INFO L273 TraceCheckUtils]: 33: Hoare triple {8829#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8830#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:44,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {8830#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8831#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:44,205 INFO L273 TraceCheckUtils]: 35: Hoare triple {8831#(<= main_~i~0 29)} assume !(~i~0 < 100000); {8801#false} is VALID [2018-11-23 12:08:44,205 INFO L273 TraceCheckUtils]: 36: Hoare triple {8801#false} ~i~0 := 1; {8801#false} is VALID [2018-11-23 12:08:44,206 INFO L273 TraceCheckUtils]: 37: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:44,206 INFO L273 TraceCheckUtils]: 38: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:44,206 INFO L273 TraceCheckUtils]: 39: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:44,206 INFO L273 TraceCheckUtils]: 40: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:44,206 INFO L273 TraceCheckUtils]: 41: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:44,207 INFO L273 TraceCheckUtils]: 42: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:44,207 INFO L273 TraceCheckUtils]: 43: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:44,207 INFO L273 TraceCheckUtils]: 44: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {8801#false} is VALID [2018-11-23 12:08:44,207 INFO L273 TraceCheckUtils]: 45: Hoare triple {8801#false} assume !(~i~0 < 100000); {8801#false} is VALID [2018-11-23 12:08:44,207 INFO L273 TraceCheckUtils]: 46: Hoare triple {8801#false} ~i~0 := 1;~j~0 := 0; {8801#false} is VALID [2018-11-23 12:08:44,208 INFO L273 TraceCheckUtils]: 47: Hoare triple {8801#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {8801#false} is VALID [2018-11-23 12:08:44,208 INFO L256 TraceCheckUtils]: 48: Hoare triple {8801#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8801#false} is VALID [2018-11-23 12:08:44,208 INFO L273 TraceCheckUtils]: 49: Hoare triple {8801#false} ~cond := #in~cond; {8801#false} is VALID [2018-11-23 12:08:44,208 INFO L273 TraceCheckUtils]: 50: Hoare triple {8801#false} assume 0 == ~cond; {8801#false} is VALID [2018-11-23 12:08:44,208 INFO L273 TraceCheckUtils]: 51: Hoare triple {8801#false} assume !false; {8801#false} is VALID [2018-11-23 12:08:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:08:44,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:44,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 12:08:44,229 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 52 [2018-11-23 12:08:44,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:44,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:08:44,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:44,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:08:44,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:08:44,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:08:44,266 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 33 states. [2018-11-23 12:08:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:45,624 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2018-11-23 12:08:45,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:08:45,624 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 52 [2018-11-23 12:08:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:08:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2018-11-23 12:08:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:08:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2018-11-23 12:08:45,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 105 transitions. [2018-11-23 12:08:46,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:46,547 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:08:46,547 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:08:46,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:08:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:08:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2018-11-23 12:08:47,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:47,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 57 states. [2018-11-23 12:08:47,649 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 57 states. [2018-11-23 12:08:47,649 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 57 states. [2018-11-23 12:08:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:47,652 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-23 12:08:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-11-23 12:08:47,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:47,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:47,653 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 81 states. [2018-11-23 12:08:47,653 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 81 states. [2018-11-23 12:08:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:47,655 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-23 12:08:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-11-23 12:08:47,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:47,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:47,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:47,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:08:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-23 12:08:47,657 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 52 [2018-11-23 12:08:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:47,657 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-23 12:08:47,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:08:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-23 12:08:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:08:47,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:47,658 INFO L402 BasicCegarLoop]: trace histogram [30, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:47,658 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:47,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:47,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1413295962, now seen corresponding path program 23 times [2018-11-23 12:08:47,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:47,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:47,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:47,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:47,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:49,315 INFO L256 TraceCheckUtils]: 0: Hoare triple {9430#true} call ULTIMATE.init(); {9430#true} is VALID [2018-11-23 12:08:49,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {9430#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9430#true} is VALID [2018-11-23 12:08:49,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {9430#true} assume true; {9430#true} is VALID [2018-11-23 12:08:49,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9430#true} {9430#true} #60#return; {9430#true} is VALID [2018-11-23 12:08:49,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {9430#true} call #t~ret4 := main(); {9430#true} is VALID [2018-11-23 12:08:49,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {9430#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; {9432#(= main_~i~0 0)} is VALID [2018-11-23 12:08:49,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {9432#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9433#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:49,317 INFO L273 TraceCheckUtils]: 7: Hoare triple {9433#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9434#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:49,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {9434#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9435#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:49,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {9435#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9436#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:49,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {9436#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9437#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:49,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {9437#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9438#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:49,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {9438#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9439#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:49,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {9439#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9440#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:49,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {9440#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9441#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:49,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {9441#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9442#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:49,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {9442#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9443#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:49,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {9443#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9444#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:49,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {9444#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9445#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:49,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {9445#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9446#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:49,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {9446#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9447#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:49,330 INFO L273 TraceCheckUtils]: 21: Hoare triple {9447#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9448#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:49,331 INFO L273 TraceCheckUtils]: 22: Hoare triple {9448#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9449#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:49,332 INFO L273 TraceCheckUtils]: 23: Hoare triple {9449#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9450#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:49,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {9450#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9451#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:49,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {9451#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9452#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:49,335 INFO L273 TraceCheckUtils]: 26: Hoare triple {9452#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9453#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:49,336 INFO L273 TraceCheckUtils]: 27: Hoare triple {9453#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9454#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:49,337 INFO L273 TraceCheckUtils]: 28: Hoare triple {9454#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9455#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:49,338 INFO L273 TraceCheckUtils]: 29: Hoare triple {9455#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9456#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:49,339 INFO L273 TraceCheckUtils]: 30: Hoare triple {9456#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9457#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:49,340 INFO L273 TraceCheckUtils]: 31: Hoare triple {9457#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9458#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:49,341 INFO L273 TraceCheckUtils]: 32: Hoare triple {9458#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9459#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:49,342 INFO L273 TraceCheckUtils]: 33: Hoare triple {9459#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9460#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:49,343 INFO L273 TraceCheckUtils]: 34: Hoare triple {9460#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9461#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:49,344 INFO L273 TraceCheckUtils]: 35: Hoare triple {9461#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9462#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:49,345 INFO L273 TraceCheckUtils]: 36: Hoare triple {9462#(<= main_~i~0 30)} assume !(~i~0 < 100000); {9431#false} is VALID [2018-11-23 12:08:49,345 INFO L273 TraceCheckUtils]: 37: Hoare triple {9431#false} ~i~0 := 1; {9431#false} is VALID [2018-11-23 12:08:49,345 INFO L273 TraceCheckUtils]: 38: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:08:49,345 INFO L273 TraceCheckUtils]: 39: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:08:49,346 INFO L273 TraceCheckUtils]: 40: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:08:49,346 INFO L273 TraceCheckUtils]: 41: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:08:49,346 INFO L273 TraceCheckUtils]: 42: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:08:49,346 INFO L273 TraceCheckUtils]: 43: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:08:49,346 INFO L273 TraceCheckUtils]: 44: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:08:49,347 INFO L273 TraceCheckUtils]: 45: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:08:49,347 INFO L273 TraceCheckUtils]: 46: Hoare triple {9431#false} assume !(~i~0 < 100000); {9431#false} is VALID [2018-11-23 12:08:49,347 INFO L273 TraceCheckUtils]: 47: Hoare triple {9431#false} ~i~0 := 1;~j~0 := 0; {9431#false} is VALID [2018-11-23 12:08:49,347 INFO L273 TraceCheckUtils]: 48: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {9431#false} is VALID [2018-11-23 12:08:49,347 INFO L256 TraceCheckUtils]: 49: Hoare triple {9431#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9431#false} is VALID [2018-11-23 12:08:49,348 INFO L273 TraceCheckUtils]: 50: Hoare triple {9431#false} ~cond := #in~cond; {9431#false} is VALID [2018-11-23 12:08:49,348 INFO L273 TraceCheckUtils]: 51: Hoare triple {9431#false} assume 0 == ~cond; {9431#false} is VALID [2018-11-23 12:08:49,348 INFO L273 TraceCheckUtils]: 52: Hoare triple {9431#false} assume !false; {9431#false} is VALID [2018-11-23 12:08:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:08:49,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:49,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:49,360 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:09:05,439 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-23 12:09:05,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:05,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:05,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {9430#true} call ULTIMATE.init(); {9430#true} is VALID [2018-11-23 12:09:05,664 INFO L273 TraceCheckUtils]: 1: Hoare triple {9430#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9430#true} is VALID [2018-11-23 12:09:05,664 INFO L273 TraceCheckUtils]: 2: Hoare triple {9430#true} assume true; {9430#true} is VALID [2018-11-23 12:09:05,664 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9430#true} {9430#true} #60#return; {9430#true} is VALID [2018-11-23 12:09:05,664 INFO L256 TraceCheckUtils]: 4: Hoare triple {9430#true} call #t~ret4 := main(); {9430#true} is VALID [2018-11-23 12:09:05,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {9430#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; {9481#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:05,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {9481#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9433#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:05,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {9433#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9434#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:05,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {9434#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9435#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:05,667 INFO L273 TraceCheckUtils]: 9: Hoare triple {9435#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9436#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:05,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {9436#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9437#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:05,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {9437#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9438#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:05,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {9438#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9439#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:05,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {9439#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9440#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:05,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {9440#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9441#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:05,673 INFO L273 TraceCheckUtils]: 15: Hoare triple {9441#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9442#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:05,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {9442#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9443#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:05,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {9443#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9444#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:05,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {9444#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9445#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:05,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {9445#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9446#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:05,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {9446#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9447#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:05,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {9447#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9448#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:05,680 INFO L273 TraceCheckUtils]: 22: Hoare triple {9448#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9449#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:05,681 INFO L273 TraceCheckUtils]: 23: Hoare triple {9449#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9450#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:05,682 INFO L273 TraceCheckUtils]: 24: Hoare triple {9450#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9451#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:05,683 INFO L273 TraceCheckUtils]: 25: Hoare triple {9451#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9452#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:05,684 INFO L273 TraceCheckUtils]: 26: Hoare triple {9452#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9453#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:05,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {9453#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9454#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:05,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {9454#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9455#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:05,686 INFO L273 TraceCheckUtils]: 29: Hoare triple {9455#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9456#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:05,687 INFO L273 TraceCheckUtils]: 30: Hoare triple {9456#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9457#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:05,688 INFO L273 TraceCheckUtils]: 31: Hoare triple {9457#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9458#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:05,689 INFO L273 TraceCheckUtils]: 32: Hoare triple {9458#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9459#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:05,690 INFO L273 TraceCheckUtils]: 33: Hoare triple {9459#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9460#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:05,691 INFO L273 TraceCheckUtils]: 34: Hoare triple {9460#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9461#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:05,692 INFO L273 TraceCheckUtils]: 35: Hoare triple {9461#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9462#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:05,693 INFO L273 TraceCheckUtils]: 36: Hoare triple {9462#(<= main_~i~0 30)} assume !(~i~0 < 100000); {9431#false} is VALID [2018-11-23 12:09:05,693 INFO L273 TraceCheckUtils]: 37: Hoare triple {9431#false} ~i~0 := 1; {9431#false} is VALID [2018-11-23 12:09:05,693 INFO L273 TraceCheckUtils]: 38: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:09:05,693 INFO L273 TraceCheckUtils]: 39: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:09:05,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:09:05,694 INFO L273 TraceCheckUtils]: 41: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:09:05,694 INFO L273 TraceCheckUtils]: 42: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:09:05,694 INFO L273 TraceCheckUtils]: 43: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:09:05,694 INFO L273 TraceCheckUtils]: 44: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:09:05,694 INFO L273 TraceCheckUtils]: 45: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {9431#false} is VALID [2018-11-23 12:09:05,695 INFO L273 TraceCheckUtils]: 46: Hoare triple {9431#false} assume !(~i~0 < 100000); {9431#false} is VALID [2018-11-23 12:09:05,695 INFO L273 TraceCheckUtils]: 47: Hoare triple {9431#false} ~i~0 := 1;~j~0 := 0; {9431#false} is VALID [2018-11-23 12:09:05,695 INFO L273 TraceCheckUtils]: 48: Hoare triple {9431#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {9431#false} is VALID [2018-11-23 12:09:05,695 INFO L256 TraceCheckUtils]: 49: Hoare triple {9431#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9431#false} is VALID [2018-11-23 12:09:05,695 INFO L273 TraceCheckUtils]: 50: Hoare triple {9431#false} ~cond := #in~cond; {9431#false} is VALID [2018-11-23 12:09:05,696 INFO L273 TraceCheckUtils]: 51: Hoare triple {9431#false} assume 0 == ~cond; {9431#false} is VALID [2018-11-23 12:09:05,696 INFO L273 TraceCheckUtils]: 52: Hoare triple {9431#false} assume !false; {9431#false} is VALID [2018-11-23 12:09:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:09:05,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:05,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 12:09:05,721 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2018-11-23 12:09:05,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:05,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:09:05,757 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-23 12:09:05,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:09:05,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:09:05,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:09:05,758 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 34 states. [2018-11-23 12:09:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:06,892 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2018-11-23 12:09:06,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:09:06,893 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2018-11-23 12:09:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:09:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 106 transitions. [2018-11-23 12:09:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:09:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 106 transitions. [2018-11-23 12:09:06,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 106 transitions. [2018-11-23 12:09:07,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:07,113 INFO L225 Difference]: With dead ends: 102 [2018-11-23 12:09:07,113 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 12:09:07,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:09:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 12:09:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2018-11-23 12:09:07,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:07,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 58 states. [2018-11-23 12:09:07,270 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 58 states. [2018-11-23 12:09:07,270 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 58 states. [2018-11-23 12:09:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:07,272 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-11-23 12:09:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-11-23 12:09:07,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:07,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:07,272 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 82 states. [2018-11-23 12:09:07,272 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 82 states. [2018-11-23 12:09:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:07,274 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-11-23 12:09:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-11-23 12:09:07,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:07,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:07,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:07,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:09:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-23 12:09:07,276 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 53 [2018-11-23 12:09:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:07,277 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-23 12:09:07,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:09:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 12:09:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:09:07,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:07,278 INFO L402 BasicCegarLoop]: trace histogram [31, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:07,278 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:07,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:07,278 INFO L82 PathProgramCache]: Analyzing trace with hash 90376650, now seen corresponding path program 24 times [2018-11-23 12:09:07,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:07,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:07,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:08,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {10070#true} call ULTIMATE.init(); {10070#true} is VALID [2018-11-23 12:09:08,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {10070#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10070#true} is VALID [2018-11-23 12:09:08,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {10070#true} assume true; {10070#true} is VALID [2018-11-23 12:09:08,312 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10070#true} {10070#true} #60#return; {10070#true} is VALID [2018-11-23 12:09:08,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {10070#true} call #t~ret4 := main(); {10070#true} is VALID [2018-11-23 12:09:08,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {10070#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; {10072#(= main_~i~0 0)} is VALID [2018-11-23 12:09:08,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {10072#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10073#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:08,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {10073#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10074#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:08,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {10074#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10075#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:08,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {10075#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10076#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:08,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {10076#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10077#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:08,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {10077#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10078#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:08,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {10078#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10079#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:08,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {10079#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10080#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:08,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {10080#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10081#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:08,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {10081#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10082#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:08,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {10082#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10083#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:08,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {10083#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10084#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:08,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {10084#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10085#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:08,337 INFO L273 TraceCheckUtils]: 19: Hoare triple {10085#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10086#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:08,337 INFO L273 TraceCheckUtils]: 20: Hoare triple {10086#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10087#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:08,338 INFO L273 TraceCheckUtils]: 21: Hoare triple {10087#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10088#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:08,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {10088#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10089#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:08,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {10089#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10090#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:08,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {10090#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10091#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:08,342 INFO L273 TraceCheckUtils]: 25: Hoare triple {10091#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10092#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:08,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {10092#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10093#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:08,344 INFO L273 TraceCheckUtils]: 27: Hoare triple {10093#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10094#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:08,345 INFO L273 TraceCheckUtils]: 28: Hoare triple {10094#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10095#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:08,346 INFO L273 TraceCheckUtils]: 29: Hoare triple {10095#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10096#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:08,347 INFO L273 TraceCheckUtils]: 30: Hoare triple {10096#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10097#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:08,348 INFO L273 TraceCheckUtils]: 31: Hoare triple {10097#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10098#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:08,349 INFO L273 TraceCheckUtils]: 32: Hoare triple {10098#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10099#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:08,349 INFO L273 TraceCheckUtils]: 33: Hoare triple {10099#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10100#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:08,350 INFO L273 TraceCheckUtils]: 34: Hoare triple {10100#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10101#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:08,351 INFO L273 TraceCheckUtils]: 35: Hoare triple {10101#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10102#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:08,352 INFO L273 TraceCheckUtils]: 36: Hoare triple {10102#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10103#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:08,353 INFO L273 TraceCheckUtils]: 37: Hoare triple {10103#(<= main_~i~0 31)} assume !(~i~0 < 100000); {10071#false} is VALID [2018-11-23 12:09:08,353 INFO L273 TraceCheckUtils]: 38: Hoare triple {10071#false} ~i~0 := 1; {10071#false} is VALID [2018-11-23 12:09:08,353 INFO L273 TraceCheckUtils]: 39: Hoare triple {10071#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10071#false} is VALID [2018-11-23 12:09:08,353 INFO L273 TraceCheckUtils]: 40: Hoare triple {10071#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10071#false} is VALID [2018-11-23 12:09:08,354 INFO L273 TraceCheckUtils]: 41: Hoare triple {10071#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10071#false} is VALID [2018-11-23 12:09:08,354 INFO L273 TraceCheckUtils]: 42: Hoare triple {10071#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10071#false} is VALID [2018-11-23 12:09:08,354 INFO L273 TraceCheckUtils]: 43: Hoare triple {10071#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10071#false} is VALID [2018-11-23 12:09:08,354 INFO L273 TraceCheckUtils]: 44: Hoare triple {10071#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10071#false} is VALID [2018-11-23 12:09:08,354 INFO L273 TraceCheckUtils]: 45: Hoare triple {10071#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10071#false} is VALID [2018-11-23 12:09:08,355 INFO L273 TraceCheckUtils]: 46: Hoare triple {10071#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10071#false} is VALID [2018-11-23 12:09:08,355 INFO L273 TraceCheckUtils]: 47: Hoare triple {10071#false} assume !(~i~0 < 100000); {10071#false} is VALID [2018-11-23 12:09:08,355 INFO L273 TraceCheckUtils]: 48: Hoare triple {10071#false} ~i~0 := 1;~j~0 := 0; {10071#false} is VALID [2018-11-23 12:09:08,355 INFO L273 TraceCheckUtils]: 49: Hoare triple {10071#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {10071#false} is VALID [2018-11-23 12:09:08,355 INFO L256 TraceCheckUtils]: 50: Hoare triple {10071#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10071#false} is VALID [2018-11-23 12:09:08,355 INFO L273 TraceCheckUtils]: 51: Hoare triple {10071#false} ~cond := #in~cond; {10071#false} is VALID [2018-11-23 12:09:08,356 INFO L273 TraceCheckUtils]: 52: Hoare triple {10071#false} assume 0 == ~cond; {10071#false} is VALID [2018-11-23 12:09:08,356 INFO L273 TraceCheckUtils]: 53: Hoare triple {10071#false} assume !false; {10071#false} is VALID [2018-11-23 12:09:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:09:08,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:08,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:08,367 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:09:09,381 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:09:09,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:09,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:09,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {10070#true} call ULTIMATE.init(); {10070#true} is VALID [2018-11-23 12:09:09,521 INFO L273 TraceCheckUtils]: 1: Hoare triple {10070#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10070#true} is VALID [2018-11-23 12:09:09,522 INFO L273 TraceCheckUtils]: 2: Hoare triple {10070#true} assume true; {10070#true} is VALID [2018-11-23 12:09:09,522 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10070#true} {10070#true} #60#return; {10070#true} is VALID [2018-11-23 12:09:09,522 INFO L256 TraceCheckUtils]: 4: Hoare triple {10070#true} call #t~ret4 := main(); {10070#true} is VALID [2018-11-23 12:09:09,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {10070#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; {10070#true} is VALID [2018-11-23 12:09:09,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,523 INFO L273 TraceCheckUtils]: 11: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,524 INFO L273 TraceCheckUtils]: 22: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,524 INFO L273 TraceCheckUtils]: 24: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,524 INFO L273 TraceCheckUtils]: 25: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,525 INFO L273 TraceCheckUtils]: 26: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,525 INFO L273 TraceCheckUtils]: 27: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,525 INFO L273 TraceCheckUtils]: 28: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,525 INFO L273 TraceCheckUtils]: 29: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,525 INFO L273 TraceCheckUtils]: 30: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,525 INFO L273 TraceCheckUtils]: 31: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,525 INFO L273 TraceCheckUtils]: 32: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,526 INFO L273 TraceCheckUtils]: 34: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,526 INFO L273 TraceCheckUtils]: 36: Hoare triple {10070#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10070#true} is VALID [2018-11-23 12:09:09,526 INFO L273 TraceCheckUtils]: 37: Hoare triple {10070#true} assume !(~i~0 < 100000); {10070#true} is VALID [2018-11-23 12:09:09,526 INFO L273 TraceCheckUtils]: 38: Hoare triple {10070#true} ~i~0 := 1; {10073#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:09,527 INFO L273 TraceCheckUtils]: 39: Hoare triple {10073#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10077#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:09,528 INFO L273 TraceCheckUtils]: 40: Hoare triple {10077#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10081#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:09,528 INFO L273 TraceCheckUtils]: 41: Hoare triple {10081#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10085#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:09,529 INFO L273 TraceCheckUtils]: 42: Hoare triple {10085#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10089#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:09,529 INFO L273 TraceCheckUtils]: 43: Hoare triple {10089#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10093#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:09,530 INFO L273 TraceCheckUtils]: 44: Hoare triple {10093#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10097#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:09,531 INFO L273 TraceCheckUtils]: 45: Hoare triple {10097#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10101#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:09,532 INFO L273 TraceCheckUtils]: 46: Hoare triple {10101#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10245#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:09,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {10245#(<= main_~i~0 33)} assume !(~i~0 < 100000); {10071#false} is VALID [2018-11-23 12:09:09,533 INFO L273 TraceCheckUtils]: 48: Hoare triple {10071#false} ~i~0 := 1;~j~0 := 0; {10071#false} is VALID [2018-11-23 12:09:09,533 INFO L273 TraceCheckUtils]: 49: Hoare triple {10071#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {10071#false} is VALID [2018-11-23 12:09:09,533 INFO L256 TraceCheckUtils]: 50: Hoare triple {10071#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10071#false} is VALID [2018-11-23 12:09:09,533 INFO L273 TraceCheckUtils]: 51: Hoare triple {10071#false} ~cond := #in~cond; {10071#false} is VALID [2018-11-23 12:09:09,534 INFO L273 TraceCheckUtils]: 52: Hoare triple {10071#false} assume 0 == ~cond; {10071#false} is VALID [2018-11-23 12:09:09,534 INFO L273 TraceCheckUtils]: 53: Hoare triple {10071#false} assume !false; {10071#false} is VALID [2018-11-23 12:09:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-23 12:09:09,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:09,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 11] total 35 [2018-11-23 12:09:09,558 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 54 [2018-11-23 12:09:09,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:09,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:09:09,609 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-23 12:09:09,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:09:09,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:09:09,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:09:09,610 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 35 states. [2018-11-23 12:09:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:10,657 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-11-23 12:09:10,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:09:10,657 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 54 [2018-11-23 12:09:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:09:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 115 transitions. [2018-11-23 12:09:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:09:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 115 transitions. [2018-11-23 12:09:10,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 115 transitions. [2018-11-23 12:09:10,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:10,797 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:09:10,797 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:09:10,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:09:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:09:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 61. [2018-11-23 12:09:10,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:10,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 61 states. [2018-11-23 12:09:10,842 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 61 states. [2018-11-23 12:09:10,842 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 61 states. [2018-11-23 12:09:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:10,845 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-23 12:09:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-11-23 12:09:10,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:10,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:10,846 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 88 states. [2018-11-23 12:09:10,846 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 88 states. [2018-11-23 12:09:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:10,847 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-23 12:09:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-11-23 12:09:10,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:10,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:10,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:10,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:09:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-23 12:09:10,849 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 54 [2018-11-23 12:09:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:10,849 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-23 12:09:10,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:09:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-23 12:09:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:09:10,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:10,850 INFO L402 BasicCegarLoop]: trace histogram [33, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:10,850 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:10,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:10,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2006070853, now seen corresponding path program 25 times [2018-11-23 12:09:10,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:10,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:10,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:10,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:10,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:11,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {10743#true} call ULTIMATE.init(); {10743#true} is VALID [2018-11-23 12:09:11,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {10743#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10743#true} is VALID [2018-11-23 12:09:11,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {10743#true} assume true; {10743#true} is VALID [2018-11-23 12:09:11,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10743#true} {10743#true} #60#return; {10743#true} is VALID [2018-11-23 12:09:11,496 INFO L256 TraceCheckUtils]: 4: Hoare triple {10743#true} call #t~ret4 := main(); {10743#true} is VALID [2018-11-23 12:09:11,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {10743#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; {10745#(= main_~i~0 0)} is VALID [2018-11-23 12:09:11,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {10745#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10746#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:11,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {10746#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10747#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:11,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {10747#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10748#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:11,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {10748#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10749#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:11,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {10749#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10750#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:11,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {10750#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10751#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:11,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {10751#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10752#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:11,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {10752#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10753#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:11,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {10753#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10754#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:11,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {10754#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10755#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:11,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {10755#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10756#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:11,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {10756#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10757#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:11,507 INFO L273 TraceCheckUtils]: 18: Hoare triple {10757#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10758#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:11,508 INFO L273 TraceCheckUtils]: 19: Hoare triple {10758#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10759#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:11,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {10759#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10760#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:11,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {10760#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10761#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:11,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {10761#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10762#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:11,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {10762#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10763#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:11,513 INFO L273 TraceCheckUtils]: 24: Hoare triple {10763#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10764#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:11,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {10764#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10765#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:11,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {10765#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10766#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:11,516 INFO L273 TraceCheckUtils]: 27: Hoare triple {10766#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10767#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:11,517 INFO L273 TraceCheckUtils]: 28: Hoare triple {10767#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10768#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:11,518 INFO L273 TraceCheckUtils]: 29: Hoare triple {10768#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10769#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:11,519 INFO L273 TraceCheckUtils]: 30: Hoare triple {10769#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10770#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:11,520 INFO L273 TraceCheckUtils]: 31: Hoare triple {10770#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10771#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:11,521 INFO L273 TraceCheckUtils]: 32: Hoare triple {10771#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10772#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:11,522 INFO L273 TraceCheckUtils]: 33: Hoare triple {10772#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10773#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:11,523 INFO L273 TraceCheckUtils]: 34: Hoare triple {10773#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10774#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:11,524 INFO L273 TraceCheckUtils]: 35: Hoare triple {10774#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10775#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:11,525 INFO L273 TraceCheckUtils]: 36: Hoare triple {10775#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10776#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:11,526 INFO L273 TraceCheckUtils]: 37: Hoare triple {10776#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10777#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:11,527 INFO L273 TraceCheckUtils]: 38: Hoare triple {10777#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10778#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:11,527 INFO L273 TraceCheckUtils]: 39: Hoare triple {10778#(<= main_~i~0 33)} assume !(~i~0 < 100000); {10744#false} is VALID [2018-11-23 12:09:11,528 INFO L273 TraceCheckUtils]: 40: Hoare triple {10744#false} ~i~0 := 1; {10744#false} is VALID [2018-11-23 12:09:11,528 INFO L273 TraceCheckUtils]: 41: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,528 INFO L273 TraceCheckUtils]: 42: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,528 INFO L273 TraceCheckUtils]: 43: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,529 INFO L273 TraceCheckUtils]: 44: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,529 INFO L273 TraceCheckUtils]: 45: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,529 INFO L273 TraceCheckUtils]: 46: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,529 INFO L273 TraceCheckUtils]: 47: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,529 INFO L273 TraceCheckUtils]: 48: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,530 INFO L273 TraceCheckUtils]: 49: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,530 INFO L273 TraceCheckUtils]: 50: Hoare triple {10744#false} assume !(~i~0 < 100000); {10744#false} is VALID [2018-11-23 12:09:11,530 INFO L273 TraceCheckUtils]: 51: Hoare triple {10744#false} ~i~0 := 1;~j~0 := 0; {10744#false} is VALID [2018-11-23 12:09:11,530 INFO L273 TraceCheckUtils]: 52: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {10744#false} is VALID [2018-11-23 12:09:11,530 INFO L256 TraceCheckUtils]: 53: Hoare triple {10744#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10744#false} is VALID [2018-11-23 12:09:11,531 INFO L273 TraceCheckUtils]: 54: Hoare triple {10744#false} ~cond := #in~cond; {10744#false} is VALID [2018-11-23 12:09:11,531 INFO L273 TraceCheckUtils]: 55: Hoare triple {10744#false} assume 0 == ~cond; {10744#false} is VALID [2018-11-23 12:09:11,531 INFO L273 TraceCheckUtils]: 56: Hoare triple {10744#false} assume !false; {10744#false} is VALID [2018-11-23 12:09:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:09:11,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:11,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:11,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:11,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:11,802 INFO L256 TraceCheckUtils]: 0: Hoare triple {10743#true} call ULTIMATE.init(); {10743#true} is VALID [2018-11-23 12:09:11,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {10743#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10743#true} is VALID [2018-11-23 12:09:11,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {10743#true} assume true; {10743#true} is VALID [2018-11-23 12:09:11,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10743#true} {10743#true} #60#return; {10743#true} is VALID [2018-11-23 12:09:11,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {10743#true} call #t~ret4 := main(); {10743#true} is VALID [2018-11-23 12:09:11,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {10743#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; {10797#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:11,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {10797#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10746#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:11,805 INFO L273 TraceCheckUtils]: 7: Hoare triple {10746#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10747#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:11,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {10747#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10748#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:11,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {10748#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10749#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:11,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {10749#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10750#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:11,809 INFO L273 TraceCheckUtils]: 11: Hoare triple {10750#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10751#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:11,810 INFO L273 TraceCheckUtils]: 12: Hoare triple {10751#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10752#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:11,811 INFO L273 TraceCheckUtils]: 13: Hoare triple {10752#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10753#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:11,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {10753#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10754#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:11,813 INFO L273 TraceCheckUtils]: 15: Hoare triple {10754#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10755#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:11,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {10755#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10756#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:11,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {10756#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10757#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:11,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {10757#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10758#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:11,817 INFO L273 TraceCheckUtils]: 19: Hoare triple {10758#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10759#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:11,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {10759#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10760#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:11,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {10760#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10761#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:11,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {10761#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10762#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:11,821 INFO L273 TraceCheckUtils]: 23: Hoare triple {10762#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10763#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:11,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {10763#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10764#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:11,823 INFO L273 TraceCheckUtils]: 25: Hoare triple {10764#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10765#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:11,824 INFO L273 TraceCheckUtils]: 26: Hoare triple {10765#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10766#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:11,825 INFO L273 TraceCheckUtils]: 27: Hoare triple {10766#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10767#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:11,826 INFO L273 TraceCheckUtils]: 28: Hoare triple {10767#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10768#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:11,827 INFO L273 TraceCheckUtils]: 29: Hoare triple {10768#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10769#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:11,828 INFO L273 TraceCheckUtils]: 30: Hoare triple {10769#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10770#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:11,829 INFO L273 TraceCheckUtils]: 31: Hoare triple {10770#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10771#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:11,830 INFO L273 TraceCheckUtils]: 32: Hoare triple {10771#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10772#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:11,831 INFO L273 TraceCheckUtils]: 33: Hoare triple {10772#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10773#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:11,832 INFO L273 TraceCheckUtils]: 34: Hoare triple {10773#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10774#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:11,833 INFO L273 TraceCheckUtils]: 35: Hoare triple {10774#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10775#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:11,834 INFO L273 TraceCheckUtils]: 36: Hoare triple {10775#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10776#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:11,835 INFO L273 TraceCheckUtils]: 37: Hoare triple {10776#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10777#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:11,836 INFO L273 TraceCheckUtils]: 38: Hoare triple {10777#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10778#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:11,837 INFO L273 TraceCheckUtils]: 39: Hoare triple {10778#(<= main_~i~0 33)} assume !(~i~0 < 100000); {10744#false} is VALID [2018-11-23 12:09:11,837 INFO L273 TraceCheckUtils]: 40: Hoare triple {10744#false} ~i~0 := 1; {10744#false} is VALID [2018-11-23 12:09:11,837 INFO L273 TraceCheckUtils]: 41: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,837 INFO L273 TraceCheckUtils]: 42: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,837 INFO L273 TraceCheckUtils]: 43: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,838 INFO L273 TraceCheckUtils]: 44: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,838 INFO L273 TraceCheckUtils]: 45: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,838 INFO L273 TraceCheckUtils]: 46: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,838 INFO L273 TraceCheckUtils]: 47: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,838 INFO L273 TraceCheckUtils]: 48: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,839 INFO L273 TraceCheckUtils]: 49: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {10744#false} is VALID [2018-11-23 12:09:11,839 INFO L273 TraceCheckUtils]: 50: Hoare triple {10744#false} assume !(~i~0 < 100000); {10744#false} is VALID [2018-11-23 12:09:11,839 INFO L273 TraceCheckUtils]: 51: Hoare triple {10744#false} ~i~0 := 1;~j~0 := 0; {10744#false} is VALID [2018-11-23 12:09:11,839 INFO L273 TraceCheckUtils]: 52: Hoare triple {10744#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {10744#false} is VALID [2018-11-23 12:09:11,839 INFO L256 TraceCheckUtils]: 53: Hoare triple {10744#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10744#false} is VALID [2018-11-23 12:09:11,840 INFO L273 TraceCheckUtils]: 54: Hoare triple {10744#false} ~cond := #in~cond; {10744#false} is VALID [2018-11-23 12:09:11,840 INFO L273 TraceCheckUtils]: 55: Hoare triple {10744#false} assume 0 == ~cond; {10744#false} is VALID [2018-11-23 12:09:11,840 INFO L273 TraceCheckUtils]: 56: Hoare triple {10744#false} assume !false; {10744#false} is VALID [2018-11-23 12:09:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:09:11,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:11,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 12:09:11,862 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 57 [2018-11-23 12:09:11,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:11,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:09:11,901 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-23 12:09:11,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:09:11,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:09:11,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:09:11,903 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 37 states. [2018-11-23 12:09:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:13,187 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2018-11-23 12:09:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:09:13,188 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 57 [2018-11-23 12:09:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:09:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 114 transitions. [2018-11-23 12:09:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:09:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 114 transitions. [2018-11-23 12:09:13,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 114 transitions. [2018-11-23 12:09:13,297 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-23 12:09:13,299 INFO L225 Difference]: With dead ends: 110 [2018-11-23 12:09:13,299 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:09:13,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:09:13,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:09:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2018-11-23 12:09:13,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:13,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 62 states. [2018-11-23 12:09:13,339 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 62 states. [2018-11-23 12:09:13,339 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 62 states. [2018-11-23 12:09:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:13,341 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-11-23 12:09:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-11-23 12:09:13,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:13,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:13,342 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 89 states. [2018-11-23 12:09:13,342 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 89 states. [2018-11-23 12:09:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:13,344 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-11-23 12:09:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-11-23 12:09:13,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:13,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:13,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:13,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:09:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-23 12:09:13,345 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 57 [2018-11-23 12:09:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:13,345 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-23 12:09:13,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:09:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 12:09:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:09:13,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:13,346 INFO L402 BasicCegarLoop]: trace histogram [34, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:13,347 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:13,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:13,347 INFO L82 PathProgramCache]: Analyzing trace with hash 644431209, now seen corresponding path program 26 times [2018-11-23 12:09:13,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:13,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:13,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:13,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:13,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:14,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {11435#true} call ULTIMATE.init(); {11435#true} is VALID [2018-11-23 12:09:14,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {11435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11435#true} is VALID [2018-11-23 12:09:14,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {11435#true} assume true; {11435#true} is VALID [2018-11-23 12:09:14,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11435#true} {11435#true} #60#return; {11435#true} is VALID [2018-11-23 12:09:14,447 INFO L256 TraceCheckUtils]: 4: Hoare triple {11435#true} call #t~ret4 := main(); {11435#true} is VALID [2018-11-23 12:09:14,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {11435#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; {11437#(= main_~i~0 0)} is VALID [2018-11-23 12:09:14,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {11437#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11438#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:14,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {11438#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11439#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:14,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {11439#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11440#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:14,452 INFO L273 TraceCheckUtils]: 9: Hoare triple {11440#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11441#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:14,453 INFO L273 TraceCheckUtils]: 10: Hoare triple {11441#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11442#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:14,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {11442#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11443#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:14,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {11443#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11444#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:14,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {11444#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11445#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:14,457 INFO L273 TraceCheckUtils]: 14: Hoare triple {11445#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11446#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:14,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {11446#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11447#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:14,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {11447#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11448#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:14,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {11448#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11449#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:14,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {11449#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11450#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:14,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {11450#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11451#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:14,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {11451#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11452#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:14,464 INFO L273 TraceCheckUtils]: 21: Hoare triple {11452#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11453#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:14,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {11453#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11454#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:14,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {11454#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11455#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:14,467 INFO L273 TraceCheckUtils]: 24: Hoare triple {11455#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11456#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:14,468 INFO L273 TraceCheckUtils]: 25: Hoare triple {11456#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11457#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:14,469 INFO L273 TraceCheckUtils]: 26: Hoare triple {11457#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11458#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:14,470 INFO L273 TraceCheckUtils]: 27: Hoare triple {11458#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11459#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:14,471 INFO L273 TraceCheckUtils]: 28: Hoare triple {11459#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11460#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:14,472 INFO L273 TraceCheckUtils]: 29: Hoare triple {11460#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11461#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:14,473 INFO L273 TraceCheckUtils]: 30: Hoare triple {11461#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11462#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:14,474 INFO L273 TraceCheckUtils]: 31: Hoare triple {11462#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11463#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:14,475 INFO L273 TraceCheckUtils]: 32: Hoare triple {11463#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11464#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:14,476 INFO L273 TraceCheckUtils]: 33: Hoare triple {11464#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11465#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:14,477 INFO L273 TraceCheckUtils]: 34: Hoare triple {11465#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11466#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:14,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {11466#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11467#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:14,480 INFO L273 TraceCheckUtils]: 36: Hoare triple {11467#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11468#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:14,481 INFO L273 TraceCheckUtils]: 37: Hoare triple {11468#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11469#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:14,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {11469#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11470#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:14,483 INFO L273 TraceCheckUtils]: 39: Hoare triple {11470#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11471#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:14,483 INFO L273 TraceCheckUtils]: 40: Hoare triple {11471#(<= main_~i~0 34)} assume !(~i~0 < 100000); {11436#false} is VALID [2018-11-23 12:09:14,484 INFO L273 TraceCheckUtils]: 41: Hoare triple {11436#false} ~i~0 := 1; {11436#false} is VALID [2018-11-23 12:09:14,484 INFO L273 TraceCheckUtils]: 42: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,484 INFO L273 TraceCheckUtils]: 43: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,484 INFO L273 TraceCheckUtils]: 44: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,484 INFO L273 TraceCheckUtils]: 45: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,485 INFO L273 TraceCheckUtils]: 46: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,485 INFO L273 TraceCheckUtils]: 47: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,485 INFO L273 TraceCheckUtils]: 48: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,485 INFO L273 TraceCheckUtils]: 49: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,485 INFO L273 TraceCheckUtils]: 50: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,486 INFO L273 TraceCheckUtils]: 51: Hoare triple {11436#false} assume !(~i~0 < 100000); {11436#false} is VALID [2018-11-23 12:09:14,486 INFO L273 TraceCheckUtils]: 52: Hoare triple {11436#false} ~i~0 := 1;~j~0 := 0; {11436#false} is VALID [2018-11-23 12:09:14,486 INFO L273 TraceCheckUtils]: 53: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {11436#false} is VALID [2018-11-23 12:09:14,486 INFO L256 TraceCheckUtils]: 54: Hoare triple {11436#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11436#false} is VALID [2018-11-23 12:09:14,486 INFO L273 TraceCheckUtils]: 55: Hoare triple {11436#false} ~cond := #in~cond; {11436#false} is VALID [2018-11-23 12:09:14,487 INFO L273 TraceCheckUtils]: 56: Hoare triple {11436#false} assume 0 == ~cond; {11436#false} is VALID [2018-11-23 12:09:14,487 INFO L273 TraceCheckUtils]: 57: Hoare triple {11436#false} assume !false; {11436#false} is VALID [2018-11-23 12:09:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:09:14,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:14,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:14,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:09:14,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:09:14,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:14,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:14,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {11435#true} call ULTIMATE.init(); {11435#true} is VALID [2018-11-23 12:09:14,843 INFO L273 TraceCheckUtils]: 1: Hoare triple {11435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11435#true} is VALID [2018-11-23 12:09:14,844 INFO L273 TraceCheckUtils]: 2: Hoare triple {11435#true} assume true; {11435#true} is VALID [2018-11-23 12:09:14,844 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11435#true} {11435#true} #60#return; {11435#true} is VALID [2018-11-23 12:09:14,844 INFO L256 TraceCheckUtils]: 4: Hoare triple {11435#true} call #t~ret4 := main(); {11435#true} is VALID [2018-11-23 12:09:14,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {11435#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; {11490#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:14,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {11490#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11438#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:14,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {11438#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11439#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:14,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {11439#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11440#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:14,848 INFO L273 TraceCheckUtils]: 9: Hoare triple {11440#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11441#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:14,850 INFO L273 TraceCheckUtils]: 10: Hoare triple {11441#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11442#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:14,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {11442#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11443#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:14,852 INFO L273 TraceCheckUtils]: 12: Hoare triple {11443#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11444#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:14,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {11444#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11445#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:14,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {11445#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11446#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:14,855 INFO L273 TraceCheckUtils]: 15: Hoare triple {11446#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11447#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:14,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {11447#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11448#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:14,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {11448#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11449#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:14,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {11449#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11450#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:14,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {11450#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11451#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:14,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {11451#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11452#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:14,862 INFO L273 TraceCheckUtils]: 21: Hoare triple {11452#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11453#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:14,863 INFO L273 TraceCheckUtils]: 22: Hoare triple {11453#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11454#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:14,864 INFO L273 TraceCheckUtils]: 23: Hoare triple {11454#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11455#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:14,865 INFO L273 TraceCheckUtils]: 24: Hoare triple {11455#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11456#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:14,866 INFO L273 TraceCheckUtils]: 25: Hoare triple {11456#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11457#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:14,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {11457#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11458#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:14,869 INFO L273 TraceCheckUtils]: 27: Hoare triple {11458#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11459#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:14,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {11459#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11460#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:14,871 INFO L273 TraceCheckUtils]: 29: Hoare triple {11460#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11461#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:14,872 INFO L273 TraceCheckUtils]: 30: Hoare triple {11461#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11462#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:14,873 INFO L273 TraceCheckUtils]: 31: Hoare triple {11462#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11463#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:14,874 INFO L273 TraceCheckUtils]: 32: Hoare triple {11463#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11464#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:14,875 INFO L273 TraceCheckUtils]: 33: Hoare triple {11464#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11465#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:14,877 INFO L273 TraceCheckUtils]: 34: Hoare triple {11465#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11466#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:14,878 INFO L273 TraceCheckUtils]: 35: Hoare triple {11466#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11467#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:14,879 INFO L273 TraceCheckUtils]: 36: Hoare triple {11467#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11468#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:14,880 INFO L273 TraceCheckUtils]: 37: Hoare triple {11468#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11469#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:14,881 INFO L273 TraceCheckUtils]: 38: Hoare triple {11469#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11470#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:14,882 INFO L273 TraceCheckUtils]: 39: Hoare triple {11470#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11471#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:14,883 INFO L273 TraceCheckUtils]: 40: Hoare triple {11471#(<= main_~i~0 34)} assume !(~i~0 < 100000); {11436#false} is VALID [2018-11-23 12:09:14,883 INFO L273 TraceCheckUtils]: 41: Hoare triple {11436#false} ~i~0 := 1; {11436#false} is VALID [2018-11-23 12:09:14,884 INFO L273 TraceCheckUtils]: 42: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,884 INFO L273 TraceCheckUtils]: 43: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,884 INFO L273 TraceCheckUtils]: 44: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,884 INFO L273 TraceCheckUtils]: 45: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,885 INFO L273 TraceCheckUtils]: 46: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,885 INFO L273 TraceCheckUtils]: 47: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,885 INFO L273 TraceCheckUtils]: 48: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,885 INFO L273 TraceCheckUtils]: 49: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,886 INFO L273 TraceCheckUtils]: 50: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {11436#false} is VALID [2018-11-23 12:09:14,886 INFO L273 TraceCheckUtils]: 51: Hoare triple {11436#false} assume !(~i~0 < 100000); {11436#false} is VALID [2018-11-23 12:09:14,886 INFO L273 TraceCheckUtils]: 52: Hoare triple {11436#false} ~i~0 := 1;~j~0 := 0; {11436#false} is VALID [2018-11-23 12:09:14,886 INFO L273 TraceCheckUtils]: 53: Hoare triple {11436#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {11436#false} is VALID [2018-11-23 12:09:14,886 INFO L256 TraceCheckUtils]: 54: Hoare triple {11436#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11436#false} is VALID [2018-11-23 12:09:14,886 INFO L273 TraceCheckUtils]: 55: Hoare triple {11436#false} ~cond := #in~cond; {11436#false} is VALID [2018-11-23 12:09:14,886 INFO L273 TraceCheckUtils]: 56: Hoare triple {11436#false} assume 0 == ~cond; {11436#false} is VALID [2018-11-23 12:09:14,887 INFO L273 TraceCheckUtils]: 57: Hoare triple {11436#false} assume !false; {11436#false} is VALID [2018-11-23 12:09:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:09:14,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:14,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 12:09:14,910 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 58 [2018-11-23 12:09:14,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:14,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:09:14,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:14,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:09:14,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:09:14,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:09:14,978 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 38 states. [2018-11-23 12:09:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:16,233 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2018-11-23 12:09:16,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:09:16,233 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 58 [2018-11-23 12:09:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:09:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 115 transitions. [2018-11-23 12:09:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:09:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 115 transitions. [2018-11-23 12:09:16,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 115 transitions. [2018-11-23 12:09:16,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:16,345 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:09:16,345 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:09:16,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:09:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:09:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2018-11-23 12:09:16,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:16,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 63 states. [2018-11-23 12:09:16,401 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 63 states. [2018-11-23 12:09:16,401 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 63 states. [2018-11-23 12:09:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:16,403 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2018-11-23 12:09:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2018-11-23 12:09:16,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:16,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:16,405 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 90 states. [2018-11-23 12:09:16,405 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 90 states. [2018-11-23 12:09:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:16,407 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2018-11-23 12:09:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2018-11-23 12:09:16,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:16,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:16,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:16,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:09:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-23 12:09:16,408 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2018-11-23 12:09:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:16,409 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-23 12:09:16,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:09:16,409 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 12:09:16,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:09:16,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:16,410 INFO L402 BasicCegarLoop]: trace histogram [35, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:16,410 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:16,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:16,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1383275205, now seen corresponding path program 27 times [2018-11-23 12:09:16,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:16,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:16,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:16,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:16,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:17,142 INFO L256 TraceCheckUtils]: 0: Hoare triple {12137#true} call ULTIMATE.init(); {12137#true} is VALID [2018-11-23 12:09:17,142 INFO L273 TraceCheckUtils]: 1: Hoare triple {12137#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12137#true} is VALID [2018-11-23 12:09:17,142 INFO L273 TraceCheckUtils]: 2: Hoare triple {12137#true} assume true; {12137#true} is VALID [2018-11-23 12:09:17,142 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12137#true} {12137#true} #60#return; {12137#true} is VALID [2018-11-23 12:09:17,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {12137#true} call #t~ret4 := main(); {12137#true} is VALID [2018-11-23 12:09:17,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {12137#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; {12139#(= main_~i~0 0)} is VALID [2018-11-23 12:09:17,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {12139#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12140#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:17,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {12140#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12141#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:17,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {12141#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12142#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:17,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {12142#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12143#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:17,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {12143#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12144#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:17,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {12144#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12145#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:17,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {12145#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12146#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:17,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {12146#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12147#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:17,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {12147#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12148#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:17,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {12148#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12149#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:17,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {12149#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12150#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:17,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {12150#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12151#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:17,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {12151#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12152#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:17,156 INFO L273 TraceCheckUtils]: 19: Hoare triple {12152#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12153#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:17,162 INFO L273 TraceCheckUtils]: 20: Hoare triple {12153#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12154#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:17,162 INFO L273 TraceCheckUtils]: 21: Hoare triple {12154#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12155#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:17,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {12155#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12156#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:17,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {12156#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12157#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:17,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {12157#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12158#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:17,167 INFO L273 TraceCheckUtils]: 25: Hoare triple {12158#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12159#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:17,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {12159#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12160#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:17,170 INFO L273 TraceCheckUtils]: 27: Hoare triple {12160#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12161#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:17,172 INFO L273 TraceCheckUtils]: 28: Hoare triple {12161#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12162#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:17,173 INFO L273 TraceCheckUtils]: 29: Hoare triple {12162#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12163#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:17,174 INFO L273 TraceCheckUtils]: 30: Hoare triple {12163#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12164#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:17,174 INFO L273 TraceCheckUtils]: 31: Hoare triple {12164#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12165#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:17,176 INFO L273 TraceCheckUtils]: 32: Hoare triple {12165#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12166#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:17,177 INFO L273 TraceCheckUtils]: 33: Hoare triple {12166#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12167#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:17,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {12167#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12168#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:17,180 INFO L273 TraceCheckUtils]: 35: Hoare triple {12168#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12169#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:17,182 INFO L273 TraceCheckUtils]: 36: Hoare triple {12169#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12170#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:17,182 INFO L273 TraceCheckUtils]: 37: Hoare triple {12170#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12171#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:17,184 INFO L273 TraceCheckUtils]: 38: Hoare triple {12171#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12172#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:17,184 INFO L273 TraceCheckUtils]: 39: Hoare triple {12172#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12173#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:17,186 INFO L273 TraceCheckUtils]: 40: Hoare triple {12173#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12174#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:17,186 INFO L273 TraceCheckUtils]: 41: Hoare triple {12174#(<= main_~i~0 35)} assume !(~i~0 < 100000); {12138#false} is VALID [2018-11-23 12:09:17,186 INFO L273 TraceCheckUtils]: 42: Hoare triple {12138#false} ~i~0 := 1; {12138#false} is VALID [2018-11-23 12:09:17,186 INFO L273 TraceCheckUtils]: 43: Hoare triple {12138#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12138#false} is VALID [2018-11-23 12:09:17,186 INFO L273 TraceCheckUtils]: 44: Hoare triple {12138#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12138#false} is VALID [2018-11-23 12:09:17,187 INFO L273 TraceCheckUtils]: 45: Hoare triple {12138#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12138#false} is VALID [2018-11-23 12:09:17,187 INFO L273 TraceCheckUtils]: 46: Hoare triple {12138#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12138#false} is VALID [2018-11-23 12:09:17,187 INFO L273 TraceCheckUtils]: 47: Hoare triple {12138#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12138#false} is VALID [2018-11-23 12:09:17,187 INFO L273 TraceCheckUtils]: 48: Hoare triple {12138#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12138#false} is VALID [2018-11-23 12:09:17,187 INFO L273 TraceCheckUtils]: 49: Hoare triple {12138#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12138#false} is VALID [2018-11-23 12:09:17,187 INFO L273 TraceCheckUtils]: 50: Hoare triple {12138#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12138#false} is VALID [2018-11-23 12:09:17,187 INFO L273 TraceCheckUtils]: 51: Hoare triple {12138#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12138#false} is VALID [2018-11-23 12:09:17,187 INFO L273 TraceCheckUtils]: 52: Hoare triple {12138#false} assume !(~i~0 < 100000); {12138#false} is VALID [2018-11-23 12:09:17,187 INFO L273 TraceCheckUtils]: 53: Hoare triple {12138#false} ~i~0 := 1;~j~0 := 0; {12138#false} is VALID [2018-11-23 12:09:17,188 INFO L273 TraceCheckUtils]: 54: Hoare triple {12138#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {12138#false} is VALID [2018-11-23 12:09:17,188 INFO L256 TraceCheckUtils]: 55: Hoare triple {12138#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12138#false} is VALID [2018-11-23 12:09:17,188 INFO L273 TraceCheckUtils]: 56: Hoare triple {12138#false} ~cond := #in~cond; {12138#false} is VALID [2018-11-23 12:09:17,188 INFO L273 TraceCheckUtils]: 57: Hoare triple {12138#false} assume 0 == ~cond; {12138#false} is VALID [2018-11-23 12:09:17,188 INFO L273 TraceCheckUtils]: 58: Hoare triple {12138#false} assume !false; {12138#false} is VALID [2018-11-23 12:09:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:09:17,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:17,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:17,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:09:17,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:09:17,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:17,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:17,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {12137#true} call ULTIMATE.init(); {12137#true} is VALID [2018-11-23 12:09:17,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {12137#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12137#true} is VALID [2018-11-23 12:09:17,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {12137#true} assume true; {12137#true} is VALID [2018-11-23 12:09:17,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12137#true} {12137#true} #60#return; {12137#true} is VALID [2018-11-23 12:09:17,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {12137#true} call #t~ret4 := main(); {12137#true} is VALID [2018-11-23 12:09:17,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {12137#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; {12137#true} is VALID [2018-11-23 12:09:17,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,802 INFO L273 TraceCheckUtils]: 23: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,802 INFO L273 TraceCheckUtils]: 24: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,802 INFO L273 TraceCheckUtils]: 25: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,802 INFO L273 TraceCheckUtils]: 26: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,802 INFO L273 TraceCheckUtils]: 27: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,803 INFO L273 TraceCheckUtils]: 35: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,803 INFO L273 TraceCheckUtils]: 36: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,803 INFO L273 TraceCheckUtils]: 39: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,804 INFO L273 TraceCheckUtils]: 40: Hoare triple {12137#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12137#true} is VALID [2018-11-23 12:09:17,804 INFO L273 TraceCheckUtils]: 41: Hoare triple {12137#true} assume !(~i~0 < 100000); {12137#true} is VALID [2018-11-23 12:09:17,804 INFO L273 TraceCheckUtils]: 42: Hoare triple {12137#true} ~i~0 := 1; {12140#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:17,805 INFO L273 TraceCheckUtils]: 43: Hoare triple {12140#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12144#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:17,805 INFO L273 TraceCheckUtils]: 44: Hoare triple {12144#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12148#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:17,806 INFO L273 TraceCheckUtils]: 45: Hoare triple {12148#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12152#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:17,807 INFO L273 TraceCheckUtils]: 46: Hoare triple {12152#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12156#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:17,807 INFO L273 TraceCheckUtils]: 47: Hoare triple {12156#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12160#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:17,808 INFO L273 TraceCheckUtils]: 48: Hoare triple {12160#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12164#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:17,809 INFO L273 TraceCheckUtils]: 49: Hoare triple {12164#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12168#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:17,810 INFO L273 TraceCheckUtils]: 50: Hoare triple {12168#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12172#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:17,811 INFO L273 TraceCheckUtils]: 51: Hoare triple {12172#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12331#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:17,812 INFO L273 TraceCheckUtils]: 52: Hoare triple {12331#(<= main_~i~0 37)} assume !(~i~0 < 100000); {12138#false} is VALID [2018-11-23 12:09:17,812 INFO L273 TraceCheckUtils]: 53: Hoare triple {12138#false} ~i~0 := 1;~j~0 := 0; {12138#false} is VALID [2018-11-23 12:09:17,812 INFO L273 TraceCheckUtils]: 54: Hoare triple {12138#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {12138#false} is VALID [2018-11-23 12:09:17,812 INFO L256 TraceCheckUtils]: 55: Hoare triple {12138#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12138#false} is VALID [2018-11-23 12:09:17,813 INFO L273 TraceCheckUtils]: 56: Hoare triple {12138#false} ~cond := #in~cond; {12138#false} is VALID [2018-11-23 12:09:17,813 INFO L273 TraceCheckUtils]: 57: Hoare triple {12138#false} assume 0 == ~cond; {12138#false} is VALID [2018-11-23 12:09:17,813 INFO L273 TraceCheckUtils]: 58: Hoare triple {12138#false} assume !false; {12138#false} is VALID [2018-11-23 12:09:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-23 12:09:17,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:17,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 12] total 39 [2018-11-23 12:09:17,837 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 59 [2018-11-23 12:09:17,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:17,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:09:17,906 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-23 12:09:17,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:09:17,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:09:17,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:09:17,908 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 39 states. [2018-11-23 12:09:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:19,007 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2018-11-23 12:09:19,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:09:19,008 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 59 [2018-11-23 12:09:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:09:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 124 transitions. [2018-11-23 12:09:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:09:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 124 transitions. [2018-11-23 12:09:19,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 124 transitions. [2018-11-23 12:09:19,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:19,145 INFO L225 Difference]: With dead ends: 117 [2018-11-23 12:09:19,145 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:09:19,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:09:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:09:19,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2018-11-23 12:09:19,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:19,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 66 states. [2018-11-23 12:09:19,208 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 66 states. [2018-11-23 12:09:19,209 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 66 states. [2018-11-23 12:09:19,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:19,212 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-11-23 12:09:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-11-23 12:09:19,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:19,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:19,213 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 96 states. [2018-11-23 12:09:19,213 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 96 states. [2018-11-23 12:09:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:19,215 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-11-23 12:09:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-11-23 12:09:19,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:19,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:19,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:19,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:09:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-23 12:09:19,217 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 59 [2018-11-23 12:09:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:19,217 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-23 12:09:19,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:09:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 12:09:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:09:19,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:19,219 INFO L402 BasicCegarLoop]: trace histogram [37, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:19,219 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:19,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:19,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1632433238, now seen corresponding path program 28 times [2018-11-23 12:09:19,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:19,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:19,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:19,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:19,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:20,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {12872#true} call ULTIMATE.init(); {12872#true} is VALID [2018-11-23 12:09:20,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {12872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12872#true} is VALID [2018-11-23 12:09:20,649 INFO L273 TraceCheckUtils]: 2: Hoare triple {12872#true} assume true; {12872#true} is VALID [2018-11-23 12:09:20,649 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12872#true} {12872#true} #60#return; {12872#true} is VALID [2018-11-23 12:09:20,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {12872#true} call #t~ret4 := main(); {12872#true} is VALID [2018-11-23 12:09:20,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {12872#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; {12874#(= main_~i~0 0)} is VALID [2018-11-23 12:09:20,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {12874#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12875#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:20,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {12875#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12876#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:20,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {12876#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12877#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:20,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {12877#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12878#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:20,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {12878#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12879#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:20,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {12879#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12880#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:20,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {12880#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12881#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:20,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {12881#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12882#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:20,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {12882#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12883#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:20,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {12883#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12884#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:20,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {12884#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12885#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:20,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {12885#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12886#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:20,662 INFO L273 TraceCheckUtils]: 18: Hoare triple {12886#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12887#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:20,663 INFO L273 TraceCheckUtils]: 19: Hoare triple {12887#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12888#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:20,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {12888#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12889#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:20,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {12889#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12890#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:20,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {12890#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12891#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:20,667 INFO L273 TraceCheckUtils]: 23: Hoare triple {12891#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12892#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:20,668 INFO L273 TraceCheckUtils]: 24: Hoare triple {12892#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12893#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:20,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {12893#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12894#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:20,670 INFO L273 TraceCheckUtils]: 26: Hoare triple {12894#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12895#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:20,671 INFO L273 TraceCheckUtils]: 27: Hoare triple {12895#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12896#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:20,672 INFO L273 TraceCheckUtils]: 28: Hoare triple {12896#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12897#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:20,673 INFO L273 TraceCheckUtils]: 29: Hoare triple {12897#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12898#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:20,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {12898#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12899#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:20,675 INFO L273 TraceCheckUtils]: 31: Hoare triple {12899#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12900#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:20,676 INFO L273 TraceCheckUtils]: 32: Hoare triple {12900#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12901#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:20,677 INFO L273 TraceCheckUtils]: 33: Hoare triple {12901#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12902#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:20,678 INFO L273 TraceCheckUtils]: 34: Hoare triple {12902#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12903#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:20,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {12903#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12904#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:20,680 INFO L273 TraceCheckUtils]: 36: Hoare triple {12904#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12905#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:20,681 INFO L273 TraceCheckUtils]: 37: Hoare triple {12905#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12906#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:20,682 INFO L273 TraceCheckUtils]: 38: Hoare triple {12906#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12907#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:20,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {12907#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:20,684 INFO L273 TraceCheckUtils]: 40: Hoare triple {12908#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12909#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:20,685 INFO L273 TraceCheckUtils]: 41: Hoare triple {12909#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12910#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:20,686 INFO L273 TraceCheckUtils]: 42: Hoare triple {12910#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12911#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:20,686 INFO L273 TraceCheckUtils]: 43: Hoare triple {12911#(<= main_~i~0 37)} assume !(~i~0 < 100000); {12873#false} is VALID [2018-11-23 12:09:20,686 INFO L273 TraceCheckUtils]: 44: Hoare triple {12873#false} ~i~0 := 1; {12873#false} is VALID [2018-11-23 12:09:20,687 INFO L273 TraceCheckUtils]: 45: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:20,687 INFO L273 TraceCheckUtils]: 46: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:20,687 INFO L273 TraceCheckUtils]: 47: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:20,687 INFO L273 TraceCheckUtils]: 48: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:20,688 INFO L273 TraceCheckUtils]: 49: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:20,688 INFO L273 TraceCheckUtils]: 50: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:20,688 INFO L273 TraceCheckUtils]: 51: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:20,688 INFO L273 TraceCheckUtils]: 52: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:20,688 INFO L273 TraceCheckUtils]: 53: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:20,689 INFO L273 TraceCheckUtils]: 54: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:20,689 INFO L273 TraceCheckUtils]: 55: Hoare triple {12873#false} assume !(~i~0 < 100000); {12873#false} is VALID [2018-11-23 12:09:20,689 INFO L273 TraceCheckUtils]: 56: Hoare triple {12873#false} ~i~0 := 1;~j~0 := 0; {12873#false} is VALID [2018-11-23 12:09:20,689 INFO L273 TraceCheckUtils]: 57: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {12873#false} is VALID [2018-11-23 12:09:20,689 INFO L256 TraceCheckUtils]: 58: Hoare triple {12873#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12873#false} is VALID [2018-11-23 12:09:20,689 INFO L273 TraceCheckUtils]: 59: Hoare triple {12873#false} ~cond := #in~cond; {12873#false} is VALID [2018-11-23 12:09:20,690 INFO L273 TraceCheckUtils]: 60: Hoare triple {12873#false} assume 0 == ~cond; {12873#false} is VALID [2018-11-23 12:09:20,690 INFO L273 TraceCheckUtils]: 61: Hoare triple {12873#false} assume !false; {12873#false} is VALID [2018-11-23 12:09:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:09:20,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:20,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:20,702 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:09:20,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:09:20,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:20,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:21,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {12872#true} call ULTIMATE.init(); {12872#true} is VALID [2018-11-23 12:09:21,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {12872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12872#true} is VALID [2018-11-23 12:09:21,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {12872#true} assume true; {12872#true} is VALID [2018-11-23 12:09:21,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12872#true} {12872#true} #60#return; {12872#true} is VALID [2018-11-23 12:09:21,005 INFO L256 TraceCheckUtils]: 4: Hoare triple {12872#true} call #t~ret4 := main(); {12872#true} is VALID [2018-11-23 12:09:21,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {12872#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; {12930#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:21,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {12930#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12875#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:21,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {12875#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12876#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:21,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {12876#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12877#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:21,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {12877#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12878#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:21,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {12878#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12879#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:21,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {12879#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12880#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:21,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {12880#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12881#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:21,013 INFO L273 TraceCheckUtils]: 13: Hoare triple {12881#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12882#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:21,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {12882#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12883#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:21,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {12883#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12884#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:21,016 INFO L273 TraceCheckUtils]: 16: Hoare triple {12884#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12885#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:21,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {12885#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12886#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:21,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {12886#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12887#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:21,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {12887#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12888#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:21,020 INFO L273 TraceCheckUtils]: 20: Hoare triple {12888#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12889#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:21,021 INFO L273 TraceCheckUtils]: 21: Hoare triple {12889#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12890#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:21,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {12890#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12891#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:21,023 INFO L273 TraceCheckUtils]: 23: Hoare triple {12891#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12892#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:21,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {12892#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12893#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:21,025 INFO L273 TraceCheckUtils]: 25: Hoare triple {12893#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12894#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:21,026 INFO L273 TraceCheckUtils]: 26: Hoare triple {12894#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12895#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:21,027 INFO L273 TraceCheckUtils]: 27: Hoare triple {12895#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12896#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:21,028 INFO L273 TraceCheckUtils]: 28: Hoare triple {12896#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12897#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:21,029 INFO L273 TraceCheckUtils]: 29: Hoare triple {12897#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12898#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:21,030 INFO L273 TraceCheckUtils]: 30: Hoare triple {12898#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12899#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:21,031 INFO L273 TraceCheckUtils]: 31: Hoare triple {12899#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12900#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:21,032 INFO L273 TraceCheckUtils]: 32: Hoare triple {12900#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12901#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:21,033 INFO L273 TraceCheckUtils]: 33: Hoare triple {12901#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12902#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:21,034 INFO L273 TraceCheckUtils]: 34: Hoare triple {12902#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12903#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:21,035 INFO L273 TraceCheckUtils]: 35: Hoare triple {12903#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12904#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:21,036 INFO L273 TraceCheckUtils]: 36: Hoare triple {12904#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12905#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:21,037 INFO L273 TraceCheckUtils]: 37: Hoare triple {12905#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12906#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:21,038 INFO L273 TraceCheckUtils]: 38: Hoare triple {12906#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12907#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:21,039 INFO L273 TraceCheckUtils]: 39: Hoare triple {12907#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12908#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:21,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {12908#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12909#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:21,041 INFO L273 TraceCheckUtils]: 41: Hoare triple {12909#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12910#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:21,042 INFO L273 TraceCheckUtils]: 42: Hoare triple {12910#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12911#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:21,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {12911#(<= main_~i~0 37)} assume !(~i~0 < 100000); {12873#false} is VALID [2018-11-23 12:09:21,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {12873#false} ~i~0 := 1; {12873#false} is VALID [2018-11-23 12:09:21,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:21,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:21,043 INFO L273 TraceCheckUtils]: 47: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:21,043 INFO L273 TraceCheckUtils]: 48: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:21,044 INFO L273 TraceCheckUtils]: 49: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:21,044 INFO L273 TraceCheckUtils]: 50: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:21,044 INFO L273 TraceCheckUtils]: 51: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:21,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:21,044 INFO L273 TraceCheckUtils]: 53: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:21,045 INFO L273 TraceCheckUtils]: 54: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {12873#false} is VALID [2018-11-23 12:09:21,045 INFO L273 TraceCheckUtils]: 55: Hoare triple {12873#false} assume !(~i~0 < 100000); {12873#false} is VALID [2018-11-23 12:09:21,045 INFO L273 TraceCheckUtils]: 56: Hoare triple {12873#false} ~i~0 := 1;~j~0 := 0; {12873#false} is VALID [2018-11-23 12:09:21,045 INFO L273 TraceCheckUtils]: 57: Hoare triple {12873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {12873#false} is VALID [2018-11-23 12:09:21,045 INFO L256 TraceCheckUtils]: 58: Hoare triple {12873#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12873#false} is VALID [2018-11-23 12:09:21,046 INFO L273 TraceCheckUtils]: 59: Hoare triple {12873#false} ~cond := #in~cond; {12873#false} is VALID [2018-11-23 12:09:21,046 INFO L273 TraceCheckUtils]: 60: Hoare triple {12873#false} assume 0 == ~cond; {12873#false} is VALID [2018-11-23 12:09:21,046 INFO L273 TraceCheckUtils]: 61: Hoare triple {12873#false} assume !false; {12873#false} is VALID [2018-11-23 12:09:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:09:21,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:21,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:09:21,069 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 62 [2018-11-23 12:09:21,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:21,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:09:21,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:21,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:09:21,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:09:21,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:09:21,110 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 41 states. [2018-11-23 12:09:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:23,020 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2018-11-23 12:09:23,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:09:23,020 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 62 [2018-11-23 12:09:23,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:09:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 123 transitions. [2018-11-23 12:09:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:09:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 123 transitions. [2018-11-23 12:09:23,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 123 transitions. [2018-11-23 12:09:23,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:23,143 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:09:23,143 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 12:09:23,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:09:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 12:09:23,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2018-11-23 12:09:23,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:23,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 67 states. [2018-11-23 12:09:23,188 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 67 states. [2018-11-23 12:09:23,188 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 67 states. [2018-11-23 12:09:23,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:23,190 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2018-11-23 12:09:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-11-23 12:09:23,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:23,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:23,191 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 97 states. [2018-11-23 12:09:23,191 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 97 states. [2018-11-23 12:09:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:23,192 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2018-11-23 12:09:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-11-23 12:09:23,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:23,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:23,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:23,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:09:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-23 12:09:23,194 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 62 [2018-11-23 12:09:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:23,194 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-23 12:09:23,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:09:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 12:09:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:09:23,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:23,195 INFO L402 BasicCegarLoop]: trace histogram [38, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:23,195 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:23,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash -845751546, now seen corresponding path program 29 times [2018-11-23 12:09:23,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:23,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:23,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:23,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:23,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:24,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {13626#true} call ULTIMATE.init(); {13626#true} is VALID [2018-11-23 12:09:24,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {13626#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13626#true} is VALID [2018-11-23 12:09:24,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {13626#true} assume true; {13626#true} is VALID [2018-11-23 12:09:24,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13626#true} {13626#true} #60#return; {13626#true} is VALID [2018-11-23 12:09:24,068 INFO L256 TraceCheckUtils]: 4: Hoare triple {13626#true} call #t~ret4 := main(); {13626#true} is VALID [2018-11-23 12:09:24,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {13626#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; {13628#(= main_~i~0 0)} is VALID [2018-11-23 12:09:24,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {13628#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13629#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:24,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {13629#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13630#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:24,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {13630#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13631#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:24,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {13631#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13632#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:24,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {13632#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13633#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:24,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {13633#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13634#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:24,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {13634#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13635#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:24,075 INFO L273 TraceCheckUtils]: 13: Hoare triple {13635#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13636#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:24,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {13636#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13637#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:24,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {13637#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13638#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:24,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {13638#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13639#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:24,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {13639#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13640#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:24,080 INFO L273 TraceCheckUtils]: 18: Hoare triple {13640#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13641#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:24,081 INFO L273 TraceCheckUtils]: 19: Hoare triple {13641#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13642#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:24,082 INFO L273 TraceCheckUtils]: 20: Hoare triple {13642#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13643#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:24,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {13643#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13644#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:24,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {13644#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13645#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:24,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {13645#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13646#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:24,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {13646#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13647#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:24,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {13647#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13648#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:24,088 INFO L273 TraceCheckUtils]: 26: Hoare triple {13648#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13649#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:24,089 INFO L273 TraceCheckUtils]: 27: Hoare triple {13649#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13650#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:24,090 INFO L273 TraceCheckUtils]: 28: Hoare triple {13650#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13651#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:24,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {13651#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13652#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:24,092 INFO L273 TraceCheckUtils]: 30: Hoare triple {13652#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13653#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:24,093 INFO L273 TraceCheckUtils]: 31: Hoare triple {13653#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13654#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:24,094 INFO L273 TraceCheckUtils]: 32: Hoare triple {13654#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13655#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:24,095 INFO L273 TraceCheckUtils]: 33: Hoare triple {13655#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13656#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:24,096 INFO L273 TraceCheckUtils]: 34: Hoare triple {13656#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13657#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:24,097 INFO L273 TraceCheckUtils]: 35: Hoare triple {13657#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13658#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:24,098 INFO L273 TraceCheckUtils]: 36: Hoare triple {13658#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13659#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:24,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {13659#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13660#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:24,100 INFO L273 TraceCheckUtils]: 38: Hoare triple {13660#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13661#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:24,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {13661#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13662#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:24,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {13662#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13663#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:24,103 INFO L273 TraceCheckUtils]: 41: Hoare triple {13663#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13664#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:24,104 INFO L273 TraceCheckUtils]: 42: Hoare triple {13664#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13665#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:24,105 INFO L273 TraceCheckUtils]: 43: Hoare triple {13665#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13666#(<= main_~i~0 38)} is VALID [2018-11-23 12:09:24,105 INFO L273 TraceCheckUtils]: 44: Hoare triple {13666#(<= main_~i~0 38)} assume !(~i~0 < 100000); {13627#false} is VALID [2018-11-23 12:09:24,106 INFO L273 TraceCheckUtils]: 45: Hoare triple {13627#false} ~i~0 := 1; {13627#false} is VALID [2018-11-23 12:09:24,106 INFO L273 TraceCheckUtils]: 46: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:09:24,106 INFO L273 TraceCheckUtils]: 47: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:09:24,106 INFO L273 TraceCheckUtils]: 48: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:09:24,106 INFO L273 TraceCheckUtils]: 49: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:09:24,107 INFO L273 TraceCheckUtils]: 50: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:09:24,107 INFO L273 TraceCheckUtils]: 51: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:09:24,107 INFO L273 TraceCheckUtils]: 52: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:09:24,107 INFO L273 TraceCheckUtils]: 53: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:09:24,107 INFO L273 TraceCheckUtils]: 54: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:09:24,108 INFO L273 TraceCheckUtils]: 55: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:09:24,108 INFO L273 TraceCheckUtils]: 56: Hoare triple {13627#false} assume !(~i~0 < 100000); {13627#false} is VALID [2018-11-23 12:09:24,108 INFO L273 TraceCheckUtils]: 57: Hoare triple {13627#false} ~i~0 := 1;~j~0 := 0; {13627#false} is VALID [2018-11-23 12:09:24,108 INFO L273 TraceCheckUtils]: 58: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {13627#false} is VALID [2018-11-23 12:09:24,108 INFO L256 TraceCheckUtils]: 59: Hoare triple {13627#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13627#false} is VALID [2018-11-23 12:09:24,109 INFO L273 TraceCheckUtils]: 60: Hoare triple {13627#false} ~cond := #in~cond; {13627#false} is VALID [2018-11-23 12:09:24,109 INFO L273 TraceCheckUtils]: 61: Hoare triple {13627#false} assume 0 == ~cond; {13627#false} is VALID [2018-11-23 12:09:24,109 INFO L273 TraceCheckUtils]: 62: Hoare triple {13627#false} assume !false; {13627#false} is VALID [2018-11-23 12:09:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:09:24,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:24,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:24,120 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:10:02,959 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2018-11-23 12:10:02,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:03,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:03,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {13626#true} call ULTIMATE.init(); {13626#true} is VALID [2018-11-23 12:10:03,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {13626#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13626#true} is VALID [2018-11-23 12:10:03,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {13626#true} assume true; {13626#true} is VALID [2018-11-23 12:10:03,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13626#true} {13626#true} #60#return; {13626#true} is VALID [2018-11-23 12:10:03,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {13626#true} call #t~ret4 := main(); {13626#true} is VALID [2018-11-23 12:10:03,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {13626#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; {13685#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:03,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {13685#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13629#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:03,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {13629#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13630#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:03,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {13630#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13631#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:03,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {13631#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13632#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:03,230 INFO L273 TraceCheckUtils]: 10: Hoare triple {13632#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13633#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:03,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {13633#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13634#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:03,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {13634#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13635#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:03,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {13635#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13636#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:03,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {13636#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13637#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:03,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {13637#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13638#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:03,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {13638#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13639#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:03,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {13639#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13640#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:03,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {13640#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13641#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:03,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {13641#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13642#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:03,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {13642#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13643#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:03,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {13643#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13644#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:03,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {13644#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13645#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:03,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {13645#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13646#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:03,259 INFO L273 TraceCheckUtils]: 24: Hoare triple {13646#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13647#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:03,259 INFO L273 TraceCheckUtils]: 25: Hoare triple {13647#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13648#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:03,261 INFO L273 TraceCheckUtils]: 26: Hoare triple {13648#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13649#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:03,261 INFO L273 TraceCheckUtils]: 27: Hoare triple {13649#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13650#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:03,262 INFO L273 TraceCheckUtils]: 28: Hoare triple {13650#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13651#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:03,263 INFO L273 TraceCheckUtils]: 29: Hoare triple {13651#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13652#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:03,264 INFO L273 TraceCheckUtils]: 30: Hoare triple {13652#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13653#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:03,265 INFO L273 TraceCheckUtils]: 31: Hoare triple {13653#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13654#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:03,266 INFO L273 TraceCheckUtils]: 32: Hoare triple {13654#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13655#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:03,267 INFO L273 TraceCheckUtils]: 33: Hoare triple {13655#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13656#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:03,269 INFO L273 TraceCheckUtils]: 34: Hoare triple {13656#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13657#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:03,270 INFO L273 TraceCheckUtils]: 35: Hoare triple {13657#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13658#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:03,271 INFO L273 TraceCheckUtils]: 36: Hoare triple {13658#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13659#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:03,272 INFO L273 TraceCheckUtils]: 37: Hoare triple {13659#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13660#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:03,273 INFO L273 TraceCheckUtils]: 38: Hoare triple {13660#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13661#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:03,274 INFO L273 TraceCheckUtils]: 39: Hoare triple {13661#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13662#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:03,275 INFO L273 TraceCheckUtils]: 40: Hoare triple {13662#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13663#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:03,276 INFO L273 TraceCheckUtils]: 41: Hoare triple {13663#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13664#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:03,277 INFO L273 TraceCheckUtils]: 42: Hoare triple {13664#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13665#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:03,278 INFO L273 TraceCheckUtils]: 43: Hoare triple {13665#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13666#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:03,279 INFO L273 TraceCheckUtils]: 44: Hoare triple {13666#(<= main_~i~0 38)} assume !(~i~0 < 100000); {13627#false} is VALID [2018-11-23 12:10:03,279 INFO L273 TraceCheckUtils]: 45: Hoare triple {13627#false} ~i~0 := 1; {13627#false} is VALID [2018-11-23 12:10:03,279 INFO L273 TraceCheckUtils]: 46: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:10:03,279 INFO L273 TraceCheckUtils]: 47: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:10:03,280 INFO L273 TraceCheckUtils]: 48: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:10:03,280 INFO L273 TraceCheckUtils]: 49: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:10:03,280 INFO L273 TraceCheckUtils]: 50: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:10:03,280 INFO L273 TraceCheckUtils]: 51: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:10:03,280 INFO L273 TraceCheckUtils]: 52: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:10:03,281 INFO L273 TraceCheckUtils]: 53: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:10:03,281 INFO L273 TraceCheckUtils]: 54: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:10:03,281 INFO L273 TraceCheckUtils]: 55: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {13627#false} is VALID [2018-11-23 12:10:03,281 INFO L273 TraceCheckUtils]: 56: Hoare triple {13627#false} assume !(~i~0 < 100000); {13627#false} is VALID [2018-11-23 12:10:03,281 INFO L273 TraceCheckUtils]: 57: Hoare triple {13627#false} ~i~0 := 1;~j~0 := 0; {13627#false} is VALID [2018-11-23 12:10:03,282 INFO L273 TraceCheckUtils]: 58: Hoare triple {13627#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {13627#false} is VALID [2018-11-23 12:10:03,282 INFO L256 TraceCheckUtils]: 59: Hoare triple {13627#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13627#false} is VALID [2018-11-23 12:10:03,282 INFO L273 TraceCheckUtils]: 60: Hoare triple {13627#false} ~cond := #in~cond; {13627#false} is VALID [2018-11-23 12:10:03,282 INFO L273 TraceCheckUtils]: 61: Hoare triple {13627#false} assume 0 == ~cond; {13627#false} is VALID [2018-11-23 12:10:03,282 INFO L273 TraceCheckUtils]: 62: Hoare triple {13627#false} assume !false; {13627#false} is VALID [2018-11-23 12:10:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:10:03,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:03,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:10:03,312 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 63 [2018-11-23 12:10:03,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:03,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:10:03,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:03,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:10:03,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:10:03,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:10:03,371 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 42 states. [2018-11-23 12:10:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:04,874 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-11-23 12:10:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:10:04,875 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 63 [2018-11-23 12:10:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:10:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 124 transitions. [2018-11-23 12:10:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:10:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 124 transitions. [2018-11-23 12:10:04,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 124 transitions. [2018-11-23 12:10:05,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:05,013 INFO L225 Difference]: With dead ends: 120 [2018-11-23 12:10:05,013 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 12:10:05,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:10:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 12:10:05,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2018-11-23 12:10:05,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:05,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 68 states. [2018-11-23 12:10:05,068 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 68 states. [2018-11-23 12:10:05,068 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 68 states. [2018-11-23 12:10:05,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:05,071 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-11-23 12:10:05,071 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-11-23 12:10:05,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:05,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:05,071 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 98 states. [2018-11-23 12:10:05,071 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 98 states. [2018-11-23 12:10:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:05,074 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-11-23 12:10:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-11-23 12:10:05,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:05,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:05,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:05,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 12:10:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-23 12:10:05,076 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2018-11-23 12:10:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:05,076 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-23 12:10:05,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:10:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-23 12:10:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:10:05,077 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:05,077 INFO L402 BasicCegarLoop]: trace histogram [39, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:05,077 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:05,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:05,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2066544426, now seen corresponding path program 30 times [2018-11-23 12:10:05,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:05,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:05,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:05,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:05,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:06,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {14390#true} call ULTIMATE.init(); {14390#true} is VALID [2018-11-23 12:10:06,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {14390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14390#true} is VALID [2018-11-23 12:10:06,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {14390#true} assume true; {14390#true} is VALID [2018-11-23 12:10:06,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14390#true} {14390#true} #60#return; {14390#true} is VALID [2018-11-23 12:10:06,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {14390#true} call #t~ret4 := main(); {14390#true} is VALID [2018-11-23 12:10:06,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {14390#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; {14392#(= main_~i~0 0)} is VALID [2018-11-23 12:10:06,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {14392#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14393#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:06,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {14393#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14394#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:06,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {14394#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14395#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:06,024 INFO L273 TraceCheckUtils]: 9: Hoare triple {14395#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14396#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:06,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {14396#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14397#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:06,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {14397#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14398#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:06,027 INFO L273 TraceCheckUtils]: 12: Hoare triple {14398#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14399#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:06,028 INFO L273 TraceCheckUtils]: 13: Hoare triple {14399#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14400#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:06,029 INFO L273 TraceCheckUtils]: 14: Hoare triple {14400#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14401#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:06,030 INFO L273 TraceCheckUtils]: 15: Hoare triple {14401#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14402#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:06,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {14402#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14403#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:06,032 INFO L273 TraceCheckUtils]: 17: Hoare triple {14403#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14404#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:06,033 INFO L273 TraceCheckUtils]: 18: Hoare triple {14404#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14405#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:06,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {14405#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14406#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:06,035 INFO L273 TraceCheckUtils]: 20: Hoare triple {14406#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14407#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:06,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {14407#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14408#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:06,037 INFO L273 TraceCheckUtils]: 22: Hoare triple {14408#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14409#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:06,038 INFO L273 TraceCheckUtils]: 23: Hoare triple {14409#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14410#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:06,039 INFO L273 TraceCheckUtils]: 24: Hoare triple {14410#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14411#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:06,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {14411#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14412#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:06,041 INFO L273 TraceCheckUtils]: 26: Hoare triple {14412#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14413#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:06,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {14413#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14414#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:06,043 INFO L273 TraceCheckUtils]: 28: Hoare triple {14414#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14415#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:06,044 INFO L273 TraceCheckUtils]: 29: Hoare triple {14415#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14416#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:06,045 INFO L273 TraceCheckUtils]: 30: Hoare triple {14416#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14417#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:06,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {14417#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14418#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:06,047 INFO L273 TraceCheckUtils]: 32: Hoare triple {14418#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14419#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:06,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {14419#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14420#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:06,049 INFO L273 TraceCheckUtils]: 34: Hoare triple {14420#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14421#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:06,050 INFO L273 TraceCheckUtils]: 35: Hoare triple {14421#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14422#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:06,051 INFO L273 TraceCheckUtils]: 36: Hoare triple {14422#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14423#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:06,052 INFO L273 TraceCheckUtils]: 37: Hoare triple {14423#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14424#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:06,053 INFO L273 TraceCheckUtils]: 38: Hoare triple {14424#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14425#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:06,054 INFO L273 TraceCheckUtils]: 39: Hoare triple {14425#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14426#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:06,055 INFO L273 TraceCheckUtils]: 40: Hoare triple {14426#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14427#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:06,056 INFO L273 TraceCheckUtils]: 41: Hoare triple {14427#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14428#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:06,057 INFO L273 TraceCheckUtils]: 42: Hoare triple {14428#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14429#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:06,058 INFO L273 TraceCheckUtils]: 43: Hoare triple {14429#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14430#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:06,059 INFO L273 TraceCheckUtils]: 44: Hoare triple {14430#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14431#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:06,060 INFO L273 TraceCheckUtils]: 45: Hoare triple {14431#(<= main_~i~0 39)} assume !(~i~0 < 100000); {14391#false} is VALID [2018-11-23 12:10:06,060 INFO L273 TraceCheckUtils]: 46: Hoare triple {14391#false} ~i~0 := 1; {14391#false} is VALID [2018-11-23 12:10:06,060 INFO L273 TraceCheckUtils]: 47: Hoare triple {14391#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14391#false} is VALID [2018-11-23 12:10:06,060 INFO L273 TraceCheckUtils]: 48: Hoare triple {14391#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14391#false} is VALID [2018-11-23 12:10:06,060 INFO L273 TraceCheckUtils]: 49: Hoare triple {14391#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14391#false} is VALID [2018-11-23 12:10:06,061 INFO L273 TraceCheckUtils]: 50: Hoare triple {14391#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14391#false} is VALID [2018-11-23 12:10:06,061 INFO L273 TraceCheckUtils]: 51: Hoare triple {14391#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14391#false} is VALID [2018-11-23 12:10:06,061 INFO L273 TraceCheckUtils]: 52: Hoare triple {14391#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14391#false} is VALID [2018-11-23 12:10:06,061 INFO L273 TraceCheckUtils]: 53: Hoare triple {14391#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14391#false} is VALID [2018-11-23 12:10:06,061 INFO L273 TraceCheckUtils]: 54: Hoare triple {14391#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14391#false} is VALID [2018-11-23 12:10:06,062 INFO L273 TraceCheckUtils]: 55: Hoare triple {14391#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14391#false} is VALID [2018-11-23 12:10:06,062 INFO L273 TraceCheckUtils]: 56: Hoare triple {14391#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14391#false} is VALID [2018-11-23 12:10:06,062 INFO L273 TraceCheckUtils]: 57: Hoare triple {14391#false} assume !(~i~0 < 100000); {14391#false} is VALID [2018-11-23 12:10:06,062 INFO L273 TraceCheckUtils]: 58: Hoare triple {14391#false} ~i~0 := 1;~j~0 := 0; {14391#false} is VALID [2018-11-23 12:10:06,062 INFO L273 TraceCheckUtils]: 59: Hoare triple {14391#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {14391#false} is VALID [2018-11-23 12:10:06,063 INFO L256 TraceCheckUtils]: 60: Hoare triple {14391#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {14391#false} is VALID [2018-11-23 12:10:06,063 INFO L273 TraceCheckUtils]: 61: Hoare triple {14391#false} ~cond := #in~cond; {14391#false} is VALID [2018-11-23 12:10:06,063 INFO L273 TraceCheckUtils]: 62: Hoare triple {14391#false} assume 0 == ~cond; {14391#false} is VALID [2018-11-23 12:10:06,063 INFO L273 TraceCheckUtils]: 63: Hoare triple {14391#false} assume !false; {14391#false} is VALID [2018-11-23 12:10:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:10:06,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:06,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:06,080 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:10:12,754 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:10:12,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:12,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:12,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {14390#true} call ULTIMATE.init(); {14390#true} is VALID [2018-11-23 12:10:12,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {14390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14390#true} is VALID [2018-11-23 12:10:12,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {14390#true} assume true; {14390#true} is VALID [2018-11-23 12:10:12,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14390#true} {14390#true} #60#return; {14390#true} is VALID [2018-11-23 12:10:12,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {14390#true} call #t~ret4 := main(); {14390#true} is VALID [2018-11-23 12:10:12,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {14390#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; {14390#true} is VALID [2018-11-23 12:10:12,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,947 INFO L273 TraceCheckUtils]: 10: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,947 INFO L273 TraceCheckUtils]: 12: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,948 INFO L273 TraceCheckUtils]: 15: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,948 INFO L273 TraceCheckUtils]: 17: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,948 INFO L273 TraceCheckUtils]: 19: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,948 INFO L273 TraceCheckUtils]: 20: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,948 INFO L273 TraceCheckUtils]: 21: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,949 INFO L273 TraceCheckUtils]: 22: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,949 INFO L273 TraceCheckUtils]: 23: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,949 INFO L273 TraceCheckUtils]: 25: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,949 INFO L273 TraceCheckUtils]: 27: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,949 INFO L273 TraceCheckUtils]: 28: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,949 INFO L273 TraceCheckUtils]: 29: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,949 INFO L273 TraceCheckUtils]: 30: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,950 INFO L273 TraceCheckUtils]: 31: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,950 INFO L273 TraceCheckUtils]: 32: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,950 INFO L273 TraceCheckUtils]: 33: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,950 INFO L273 TraceCheckUtils]: 37: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,950 INFO L273 TraceCheckUtils]: 38: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,951 INFO L273 TraceCheckUtils]: 39: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,951 INFO L273 TraceCheckUtils]: 40: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,951 INFO L273 TraceCheckUtils]: 41: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,951 INFO L273 TraceCheckUtils]: 42: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,951 INFO L273 TraceCheckUtils]: 43: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,951 INFO L273 TraceCheckUtils]: 44: Hoare triple {14390#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14390#true} is VALID [2018-11-23 12:10:12,951 INFO L273 TraceCheckUtils]: 45: Hoare triple {14390#true} assume !(~i~0 < 100000); {14390#true} is VALID [2018-11-23 12:10:12,952 INFO L273 TraceCheckUtils]: 46: Hoare triple {14390#true} ~i~0 := 1; {14393#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:12,952 INFO L273 TraceCheckUtils]: 47: Hoare triple {14393#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14397#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:12,954 INFO L273 TraceCheckUtils]: 48: Hoare triple {14397#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14401#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:12,954 INFO L273 TraceCheckUtils]: 49: Hoare triple {14401#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14405#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:12,956 INFO L273 TraceCheckUtils]: 50: Hoare triple {14405#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14409#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:12,957 INFO L273 TraceCheckUtils]: 51: Hoare triple {14409#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14413#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:12,958 INFO L273 TraceCheckUtils]: 52: Hoare triple {14413#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14417#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:12,959 INFO L273 TraceCheckUtils]: 53: Hoare triple {14417#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14421#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:12,965 INFO L273 TraceCheckUtils]: 54: Hoare triple {14421#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14425#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:12,968 INFO L273 TraceCheckUtils]: 55: Hoare triple {14425#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14429#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:12,971 INFO L273 TraceCheckUtils]: 56: Hoare triple {14429#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {14603#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:12,974 INFO L273 TraceCheckUtils]: 57: Hoare triple {14603#(<= main_~i~0 41)} assume !(~i~0 < 100000); {14391#false} is VALID [2018-11-23 12:10:12,974 INFO L273 TraceCheckUtils]: 58: Hoare triple {14391#false} ~i~0 := 1;~j~0 := 0; {14391#false} is VALID [2018-11-23 12:10:12,974 INFO L273 TraceCheckUtils]: 59: Hoare triple {14391#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {14391#false} is VALID [2018-11-23 12:10:12,974 INFO L256 TraceCheckUtils]: 60: Hoare triple {14391#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {14391#false} is VALID [2018-11-23 12:10:12,974 INFO L273 TraceCheckUtils]: 61: Hoare triple {14391#false} ~cond := #in~cond; {14391#false} is VALID [2018-11-23 12:10:12,974 INFO L273 TraceCheckUtils]: 62: Hoare triple {14391#false} assume 0 == ~cond; {14391#false} is VALID [2018-11-23 12:10:12,974 INFO L273 TraceCheckUtils]: 63: Hoare triple {14391#false} assume !false; {14391#false} is VALID [2018-11-23 12:10:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-23 12:10:12,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:12,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 13] total 43 [2018-11-23 12:10:12,999 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 64 [2018-11-23 12:10:12,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:12,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:10:13,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:13,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:10:13,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:10:13,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:10:13,079 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 43 states. [2018-11-23 12:10:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:14,496 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2018-11-23 12:10:14,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:10:14,497 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 64 [2018-11-23 12:10:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:10:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 133 transitions. [2018-11-23 12:10:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:10:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 133 transitions. [2018-11-23 12:10:14,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 133 transitions. [2018-11-23 12:10:14,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:14,863 INFO L225 Difference]: With dead ends: 126 [2018-11-23 12:10:14,863 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:10:14,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:10:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:10:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 71. [2018-11-23 12:10:14,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:14,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 71 states. [2018-11-23 12:10:14,922 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 71 states. [2018-11-23 12:10:14,922 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 71 states. [2018-11-23 12:10:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:14,925 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-11-23 12:10:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2018-11-23 12:10:14,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:14,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:14,926 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 104 states. [2018-11-23 12:10:14,926 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 104 states. [2018-11-23 12:10:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:14,928 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-11-23 12:10:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2018-11-23 12:10:14,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:14,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:14,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:14,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:10:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-23 12:10:14,931 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 64 [2018-11-23 12:10:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:14,931 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-23 12:10:14,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:10:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-23 12:10:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:10:14,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:14,932 INFO L402 BasicCegarLoop]: trace histogram [41, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:14,932 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:14,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2083149029, now seen corresponding path program 31 times [2018-11-23 12:10:14,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:14,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:14,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:15,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {15187#true} call ULTIMATE.init(); {15187#true} is VALID [2018-11-23 12:10:15,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {15187#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15187#true} is VALID [2018-11-23 12:10:15,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {15187#true} assume true; {15187#true} is VALID [2018-11-23 12:10:15,888 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15187#true} {15187#true} #60#return; {15187#true} is VALID [2018-11-23 12:10:15,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {15187#true} call #t~ret4 := main(); {15187#true} is VALID [2018-11-23 12:10:15,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {15187#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; {15189#(= main_~i~0 0)} is VALID [2018-11-23 12:10:15,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {15189#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15190#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:15,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {15190#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15191#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:15,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {15191#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15192#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:15,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {15192#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15193#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:15,894 INFO L273 TraceCheckUtils]: 10: Hoare triple {15193#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15194#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:15,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {15194#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15195#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:15,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {15195#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15196#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:15,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {15196#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15197#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:15,898 INFO L273 TraceCheckUtils]: 14: Hoare triple {15197#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15198#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:15,899 INFO L273 TraceCheckUtils]: 15: Hoare triple {15198#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15199#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:15,900 INFO L273 TraceCheckUtils]: 16: Hoare triple {15199#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15200#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:15,901 INFO L273 TraceCheckUtils]: 17: Hoare triple {15200#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15201#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:15,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {15201#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15202#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:15,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {15202#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15203#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:15,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {15203#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15204#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:15,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {15204#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15205#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:15,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {15205#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15206#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:15,907 INFO L273 TraceCheckUtils]: 23: Hoare triple {15206#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15207#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:15,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {15207#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15208#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:15,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {15208#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15209#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:15,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {15209#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15210#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:15,911 INFO L273 TraceCheckUtils]: 27: Hoare triple {15210#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15211#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:15,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {15211#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15212#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:15,913 INFO L273 TraceCheckUtils]: 29: Hoare triple {15212#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15213#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:15,914 INFO L273 TraceCheckUtils]: 30: Hoare triple {15213#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15214#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:15,915 INFO L273 TraceCheckUtils]: 31: Hoare triple {15214#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15215#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:15,916 INFO L273 TraceCheckUtils]: 32: Hoare triple {15215#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15216#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:15,917 INFO L273 TraceCheckUtils]: 33: Hoare triple {15216#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15217#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:15,918 INFO L273 TraceCheckUtils]: 34: Hoare triple {15217#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15218#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:15,919 INFO L273 TraceCheckUtils]: 35: Hoare triple {15218#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15219#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:15,920 INFO L273 TraceCheckUtils]: 36: Hoare triple {15219#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15220#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:15,921 INFO L273 TraceCheckUtils]: 37: Hoare triple {15220#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15221#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:15,922 INFO L273 TraceCheckUtils]: 38: Hoare triple {15221#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15222#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:15,923 INFO L273 TraceCheckUtils]: 39: Hoare triple {15222#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15223#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:15,924 INFO L273 TraceCheckUtils]: 40: Hoare triple {15223#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15224#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:15,925 INFO L273 TraceCheckUtils]: 41: Hoare triple {15224#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15225#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:15,926 INFO L273 TraceCheckUtils]: 42: Hoare triple {15225#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15226#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:15,927 INFO L273 TraceCheckUtils]: 43: Hoare triple {15226#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15227#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:15,928 INFO L273 TraceCheckUtils]: 44: Hoare triple {15227#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15228#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:15,929 INFO L273 TraceCheckUtils]: 45: Hoare triple {15228#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15229#(<= main_~i~0 40)} is VALID [2018-11-23 12:10:15,930 INFO L273 TraceCheckUtils]: 46: Hoare triple {15229#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15230#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:15,930 INFO L273 TraceCheckUtils]: 47: Hoare triple {15230#(<= main_~i~0 41)} assume !(~i~0 < 100000); {15188#false} is VALID [2018-11-23 12:10:15,931 INFO L273 TraceCheckUtils]: 48: Hoare triple {15188#false} ~i~0 := 1; {15188#false} is VALID [2018-11-23 12:10:15,931 INFO L273 TraceCheckUtils]: 49: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:15,931 INFO L273 TraceCheckUtils]: 50: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:15,931 INFO L273 TraceCheckUtils]: 51: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:15,931 INFO L273 TraceCheckUtils]: 52: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:15,932 INFO L273 TraceCheckUtils]: 53: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:15,932 INFO L273 TraceCheckUtils]: 54: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:15,932 INFO L273 TraceCheckUtils]: 55: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:15,932 INFO L273 TraceCheckUtils]: 56: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:15,932 INFO L273 TraceCheckUtils]: 57: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:15,933 INFO L273 TraceCheckUtils]: 58: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:15,933 INFO L273 TraceCheckUtils]: 59: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:15,933 INFO L273 TraceCheckUtils]: 60: Hoare triple {15188#false} assume !(~i~0 < 100000); {15188#false} is VALID [2018-11-23 12:10:15,933 INFO L273 TraceCheckUtils]: 61: Hoare triple {15188#false} ~i~0 := 1;~j~0 := 0; {15188#false} is VALID [2018-11-23 12:10:15,933 INFO L273 TraceCheckUtils]: 62: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {15188#false} is VALID [2018-11-23 12:10:15,934 INFO L256 TraceCheckUtils]: 63: Hoare triple {15188#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {15188#false} is VALID [2018-11-23 12:10:15,934 INFO L273 TraceCheckUtils]: 64: Hoare triple {15188#false} ~cond := #in~cond; {15188#false} is VALID [2018-11-23 12:10:15,934 INFO L273 TraceCheckUtils]: 65: Hoare triple {15188#false} assume 0 == ~cond; {15188#false} is VALID [2018-11-23 12:10:15,934 INFO L273 TraceCheckUtils]: 66: Hoare triple {15188#false} assume !false; {15188#false} is VALID [2018-11-23 12:10:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:10:15,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:15,937 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:15,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:10:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:16,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:16,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {15187#true} call ULTIMATE.init(); {15187#true} is VALID [2018-11-23 12:10:16,410 INFO L273 TraceCheckUtils]: 1: Hoare triple {15187#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15187#true} is VALID [2018-11-23 12:10:16,410 INFO L273 TraceCheckUtils]: 2: Hoare triple {15187#true} assume true; {15187#true} is VALID [2018-11-23 12:10:16,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15187#true} {15187#true} #60#return; {15187#true} is VALID [2018-11-23 12:10:16,411 INFO L256 TraceCheckUtils]: 4: Hoare triple {15187#true} call #t~ret4 := main(); {15187#true} is VALID [2018-11-23 12:10:16,412 INFO L273 TraceCheckUtils]: 5: Hoare triple {15187#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; {15249#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:16,413 INFO L273 TraceCheckUtils]: 6: Hoare triple {15249#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15190#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:16,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {15190#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15191#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:16,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {15191#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15192#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:16,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {15192#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15193#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:16,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {15193#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15194#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:16,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {15194#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15195#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:16,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {15195#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15196#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:16,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {15196#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15197#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:16,420 INFO L273 TraceCheckUtils]: 14: Hoare triple {15197#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15198#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:16,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {15198#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15199#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:16,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {15199#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15200#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:16,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {15200#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15201#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:16,424 INFO L273 TraceCheckUtils]: 18: Hoare triple {15201#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15202#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:16,425 INFO L273 TraceCheckUtils]: 19: Hoare triple {15202#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15203#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:16,426 INFO L273 TraceCheckUtils]: 20: Hoare triple {15203#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15204#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:16,427 INFO L273 TraceCheckUtils]: 21: Hoare triple {15204#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15205#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:16,428 INFO L273 TraceCheckUtils]: 22: Hoare triple {15205#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15206#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:16,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {15206#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15207#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:16,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {15207#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15208#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:16,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {15208#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15209#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:16,432 INFO L273 TraceCheckUtils]: 26: Hoare triple {15209#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15210#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:16,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {15210#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15211#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:16,434 INFO L273 TraceCheckUtils]: 28: Hoare triple {15211#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15212#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:16,435 INFO L273 TraceCheckUtils]: 29: Hoare triple {15212#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15213#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:16,436 INFO L273 TraceCheckUtils]: 30: Hoare triple {15213#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15214#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:16,437 INFO L273 TraceCheckUtils]: 31: Hoare triple {15214#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15215#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:16,438 INFO L273 TraceCheckUtils]: 32: Hoare triple {15215#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15216#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:16,439 INFO L273 TraceCheckUtils]: 33: Hoare triple {15216#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15217#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:16,440 INFO L273 TraceCheckUtils]: 34: Hoare triple {15217#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15218#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:16,441 INFO L273 TraceCheckUtils]: 35: Hoare triple {15218#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15219#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:16,442 INFO L273 TraceCheckUtils]: 36: Hoare triple {15219#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15220#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:16,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {15220#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15221#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:16,444 INFO L273 TraceCheckUtils]: 38: Hoare triple {15221#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15222#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:16,445 INFO L273 TraceCheckUtils]: 39: Hoare triple {15222#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15223#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:16,446 INFO L273 TraceCheckUtils]: 40: Hoare triple {15223#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15224#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:16,447 INFO L273 TraceCheckUtils]: 41: Hoare triple {15224#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15225#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:16,448 INFO L273 TraceCheckUtils]: 42: Hoare triple {15225#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15226#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:16,449 INFO L273 TraceCheckUtils]: 43: Hoare triple {15226#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15227#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:16,450 INFO L273 TraceCheckUtils]: 44: Hoare triple {15227#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15228#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:16,451 INFO L273 TraceCheckUtils]: 45: Hoare triple {15228#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15229#(<= main_~i~0 40)} is VALID [2018-11-23 12:10:16,452 INFO L273 TraceCheckUtils]: 46: Hoare triple {15229#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15230#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:16,452 INFO L273 TraceCheckUtils]: 47: Hoare triple {15230#(<= main_~i~0 41)} assume !(~i~0 < 100000); {15188#false} is VALID [2018-11-23 12:10:16,453 INFO L273 TraceCheckUtils]: 48: Hoare triple {15188#false} ~i~0 := 1; {15188#false} is VALID [2018-11-23 12:10:16,453 INFO L273 TraceCheckUtils]: 49: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:16,453 INFO L273 TraceCheckUtils]: 50: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:16,453 INFO L273 TraceCheckUtils]: 51: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:16,453 INFO L273 TraceCheckUtils]: 52: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:16,454 INFO L273 TraceCheckUtils]: 53: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:16,454 INFO L273 TraceCheckUtils]: 54: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:16,454 INFO L273 TraceCheckUtils]: 55: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:16,454 INFO L273 TraceCheckUtils]: 56: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:16,454 INFO L273 TraceCheckUtils]: 57: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:16,455 INFO L273 TraceCheckUtils]: 58: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:16,455 INFO L273 TraceCheckUtils]: 59: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {15188#false} is VALID [2018-11-23 12:10:16,455 INFO L273 TraceCheckUtils]: 60: Hoare triple {15188#false} assume !(~i~0 < 100000); {15188#false} is VALID [2018-11-23 12:10:16,455 INFO L273 TraceCheckUtils]: 61: Hoare triple {15188#false} ~i~0 := 1;~j~0 := 0; {15188#false} is VALID [2018-11-23 12:10:16,455 INFO L273 TraceCheckUtils]: 62: Hoare triple {15188#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {15188#false} is VALID [2018-11-23 12:10:16,456 INFO L256 TraceCheckUtils]: 63: Hoare triple {15188#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {15188#false} is VALID [2018-11-23 12:10:16,456 INFO L273 TraceCheckUtils]: 64: Hoare triple {15188#false} ~cond := #in~cond; {15188#false} is VALID [2018-11-23 12:10:16,456 INFO L273 TraceCheckUtils]: 65: Hoare triple {15188#false} assume 0 == ~cond; {15188#false} is VALID [2018-11-23 12:10:16,456 INFO L273 TraceCheckUtils]: 66: Hoare triple {15188#false} assume !false; {15188#false} is VALID [2018-11-23 12:10:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:10:16,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:16,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-23 12:10:16,480 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 67 [2018-11-23 12:10:16,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:16,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 12:10:16,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:16,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 12:10:16,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 12:10:16,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:10:16,529 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 45 states. [2018-11-23 12:10:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:18,302 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-11-23 12:10:18,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 12:10:18,302 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 67 [2018-11-23 12:10:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:10:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 132 transitions. [2018-11-23 12:10:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:10:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 132 transitions. [2018-11-23 12:10:18,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 132 transitions. [2018-11-23 12:10:18,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:18,483 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:10:18,483 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:10:18,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:10:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:10:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2018-11-23 12:10:18,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:18,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 72 states. [2018-11-23 12:10:18,535 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 72 states. [2018-11-23 12:10:18,535 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 72 states. [2018-11-23 12:10:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:18,538 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2018-11-23 12:10:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-11-23 12:10:18,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:18,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:18,539 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 105 states. [2018-11-23 12:10:18,539 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 105 states. [2018-11-23 12:10:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:18,541 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2018-11-23 12:10:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-11-23 12:10:18,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:18,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:18,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:18,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:10:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-11-23 12:10:18,543 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 67 [2018-11-23 12:10:18,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:18,544 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-11-23 12:10:18,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 12:10:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 12:10:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:10:18,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:18,545 INFO L402 BasicCegarLoop]: trace histogram [42, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:18,545 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:18,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:18,545 INFO L82 PathProgramCache]: Analyzing trace with hash -78790903, now seen corresponding path program 32 times [2018-11-23 12:10:18,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:18,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:18,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:10:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:19,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {16003#true} call ULTIMATE.init(); {16003#true} is VALID [2018-11-23 12:10:19,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {16003#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16003#true} is VALID [2018-11-23 12:10:19,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {16003#true} assume true; {16003#true} is VALID [2018-11-23 12:10:19,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16003#true} {16003#true} #60#return; {16003#true} is VALID [2018-11-23 12:10:19,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {16003#true} call #t~ret4 := main(); {16003#true} is VALID [2018-11-23 12:10:19,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {16003#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; {16005#(= main_~i~0 0)} is VALID [2018-11-23 12:10:19,689 INFO L273 TraceCheckUtils]: 6: Hoare triple {16005#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16006#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:19,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {16006#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16007#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:19,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {16007#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16008#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:19,691 INFO L273 TraceCheckUtils]: 9: Hoare triple {16008#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16009#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:19,692 INFO L273 TraceCheckUtils]: 10: Hoare triple {16009#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16010#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:19,693 INFO L273 TraceCheckUtils]: 11: Hoare triple {16010#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16011#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:19,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {16011#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16012#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:19,695 INFO L273 TraceCheckUtils]: 13: Hoare triple {16012#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16013#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:19,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {16013#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16014#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:19,697 INFO L273 TraceCheckUtils]: 15: Hoare triple {16014#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16015#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:19,698 INFO L273 TraceCheckUtils]: 16: Hoare triple {16015#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16016#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:19,699 INFO L273 TraceCheckUtils]: 17: Hoare triple {16016#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16017#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:19,700 INFO L273 TraceCheckUtils]: 18: Hoare triple {16017#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16018#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:19,702 INFO L273 TraceCheckUtils]: 19: Hoare triple {16018#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16019#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:19,703 INFO L273 TraceCheckUtils]: 20: Hoare triple {16019#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16020#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:19,704 INFO L273 TraceCheckUtils]: 21: Hoare triple {16020#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16021#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:19,704 INFO L273 TraceCheckUtils]: 22: Hoare triple {16021#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16022#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:19,705 INFO L273 TraceCheckUtils]: 23: Hoare triple {16022#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16023#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:19,706 INFO L273 TraceCheckUtils]: 24: Hoare triple {16023#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16024#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:19,706 INFO L273 TraceCheckUtils]: 25: Hoare triple {16024#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16025#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:19,707 INFO L273 TraceCheckUtils]: 26: Hoare triple {16025#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16026#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:19,708 INFO L273 TraceCheckUtils]: 27: Hoare triple {16026#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16027#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:19,709 INFO L273 TraceCheckUtils]: 28: Hoare triple {16027#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16028#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:19,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {16028#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16029#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:19,711 INFO L273 TraceCheckUtils]: 30: Hoare triple {16029#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16030#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:19,712 INFO L273 TraceCheckUtils]: 31: Hoare triple {16030#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16031#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:19,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {16031#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16032#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:19,714 INFO L273 TraceCheckUtils]: 33: Hoare triple {16032#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16033#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:19,716 INFO L273 TraceCheckUtils]: 34: Hoare triple {16033#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16034#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:19,717 INFO L273 TraceCheckUtils]: 35: Hoare triple {16034#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16035#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:19,718 INFO L273 TraceCheckUtils]: 36: Hoare triple {16035#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16036#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:19,719 INFO L273 TraceCheckUtils]: 37: Hoare triple {16036#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16037#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:19,720 INFO L273 TraceCheckUtils]: 38: Hoare triple {16037#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16038#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:19,721 INFO L273 TraceCheckUtils]: 39: Hoare triple {16038#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16039#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:19,722 INFO L273 TraceCheckUtils]: 40: Hoare triple {16039#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16040#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:19,723 INFO L273 TraceCheckUtils]: 41: Hoare triple {16040#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16041#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:19,724 INFO L273 TraceCheckUtils]: 42: Hoare triple {16041#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16042#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:19,725 INFO L273 TraceCheckUtils]: 43: Hoare triple {16042#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16043#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:19,726 INFO L273 TraceCheckUtils]: 44: Hoare triple {16043#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16044#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:19,748 INFO L273 TraceCheckUtils]: 45: Hoare triple {16044#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16045#(<= main_~i~0 40)} is VALID [2018-11-23 12:10:19,753 INFO L273 TraceCheckUtils]: 46: Hoare triple {16045#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16046#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:19,754 INFO L273 TraceCheckUtils]: 47: Hoare triple {16046#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16047#(<= main_~i~0 42)} is VALID [2018-11-23 12:10:19,755 INFO L273 TraceCheckUtils]: 48: Hoare triple {16047#(<= main_~i~0 42)} assume !(~i~0 < 100000); {16004#false} is VALID [2018-11-23 12:10:19,755 INFO L273 TraceCheckUtils]: 49: Hoare triple {16004#false} ~i~0 := 1; {16004#false} is VALID [2018-11-23 12:10:19,755 INFO L273 TraceCheckUtils]: 50: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:19,755 INFO L273 TraceCheckUtils]: 51: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:19,755 INFO L273 TraceCheckUtils]: 52: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:19,756 INFO L273 TraceCheckUtils]: 53: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:19,756 INFO L273 TraceCheckUtils]: 54: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:19,756 INFO L273 TraceCheckUtils]: 55: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:19,756 INFO L273 TraceCheckUtils]: 56: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:19,756 INFO L273 TraceCheckUtils]: 57: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:19,756 INFO L273 TraceCheckUtils]: 58: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:19,756 INFO L273 TraceCheckUtils]: 59: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:19,756 INFO L273 TraceCheckUtils]: 60: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:19,756 INFO L273 TraceCheckUtils]: 61: Hoare triple {16004#false} assume !(~i~0 < 100000); {16004#false} is VALID [2018-11-23 12:10:19,757 INFO L273 TraceCheckUtils]: 62: Hoare triple {16004#false} ~i~0 := 1;~j~0 := 0; {16004#false} is VALID [2018-11-23 12:10:19,757 INFO L273 TraceCheckUtils]: 63: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {16004#false} is VALID [2018-11-23 12:10:19,757 INFO L256 TraceCheckUtils]: 64: Hoare triple {16004#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {16004#false} is VALID [2018-11-23 12:10:19,757 INFO L273 TraceCheckUtils]: 65: Hoare triple {16004#false} ~cond := #in~cond; {16004#false} is VALID [2018-11-23 12:10:19,757 INFO L273 TraceCheckUtils]: 66: Hoare triple {16004#false} assume 0 == ~cond; {16004#false} is VALID [2018-11-23 12:10:19,757 INFO L273 TraceCheckUtils]: 67: Hoare triple {16004#false} assume !false; {16004#false} is VALID [2018-11-23 12:10:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:10:19,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:19,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:19,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:10:19,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:10:19,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:19,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:20,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {16003#true} call ULTIMATE.init(); {16003#true} is VALID [2018-11-23 12:10:20,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {16003#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16003#true} is VALID [2018-11-23 12:10:20,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {16003#true} assume true; {16003#true} is VALID [2018-11-23 12:10:20,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16003#true} {16003#true} #60#return; {16003#true} is VALID [2018-11-23 12:10:20,098 INFO L256 TraceCheckUtils]: 4: Hoare triple {16003#true} call #t~ret4 := main(); {16003#true} is VALID [2018-11-23 12:10:20,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {16003#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; {16066#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:20,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {16066#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16006#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:20,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {16006#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16007#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:20,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {16007#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16008#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:20,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {16008#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16009#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:20,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {16009#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16010#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:20,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {16010#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16011#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:20,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {16011#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16012#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:20,109 INFO L273 TraceCheckUtils]: 13: Hoare triple {16012#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16013#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:20,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {16013#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16014#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:20,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {16014#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16015#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:20,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {16015#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16016#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:20,116 INFO L273 TraceCheckUtils]: 17: Hoare triple {16016#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16017#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:20,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {16017#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16018#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:20,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {16018#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16019#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:20,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {16019#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16020#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:20,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {16020#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16021#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:20,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {16021#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16022#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:20,123 INFO L273 TraceCheckUtils]: 23: Hoare triple {16022#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16023#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:20,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {16023#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16024#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:20,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {16024#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16025#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:20,125 INFO L273 TraceCheckUtils]: 26: Hoare triple {16025#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16026#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:20,126 INFO L273 TraceCheckUtils]: 27: Hoare triple {16026#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16027#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:20,126 INFO L273 TraceCheckUtils]: 28: Hoare triple {16027#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16028#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:20,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {16028#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16029#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:20,128 INFO L273 TraceCheckUtils]: 30: Hoare triple {16029#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16030#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:20,129 INFO L273 TraceCheckUtils]: 31: Hoare triple {16030#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16031#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:20,130 INFO L273 TraceCheckUtils]: 32: Hoare triple {16031#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16032#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:20,131 INFO L273 TraceCheckUtils]: 33: Hoare triple {16032#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16033#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:20,132 INFO L273 TraceCheckUtils]: 34: Hoare triple {16033#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16034#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:20,133 INFO L273 TraceCheckUtils]: 35: Hoare triple {16034#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16035#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:20,134 INFO L273 TraceCheckUtils]: 36: Hoare triple {16035#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16036#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:20,134 INFO L273 TraceCheckUtils]: 37: Hoare triple {16036#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16037#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:20,135 INFO L273 TraceCheckUtils]: 38: Hoare triple {16037#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16038#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:20,136 INFO L273 TraceCheckUtils]: 39: Hoare triple {16038#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16039#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:20,137 INFO L273 TraceCheckUtils]: 40: Hoare triple {16039#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16040#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:20,138 INFO L273 TraceCheckUtils]: 41: Hoare triple {16040#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16041#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:20,139 INFO L273 TraceCheckUtils]: 42: Hoare triple {16041#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16042#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:20,143 INFO L273 TraceCheckUtils]: 43: Hoare triple {16042#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16043#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:20,143 INFO L273 TraceCheckUtils]: 44: Hoare triple {16043#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16044#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:20,144 INFO L273 TraceCheckUtils]: 45: Hoare triple {16044#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16045#(<= main_~i~0 40)} is VALID [2018-11-23 12:10:20,144 INFO L273 TraceCheckUtils]: 46: Hoare triple {16045#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16046#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:20,145 INFO L273 TraceCheckUtils]: 47: Hoare triple {16046#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16047#(<= main_~i~0 42)} is VALID [2018-11-23 12:10:20,145 INFO L273 TraceCheckUtils]: 48: Hoare triple {16047#(<= main_~i~0 42)} assume !(~i~0 < 100000); {16004#false} is VALID [2018-11-23 12:10:20,146 INFO L273 TraceCheckUtils]: 49: Hoare triple {16004#false} ~i~0 := 1; {16004#false} is VALID [2018-11-23 12:10:20,146 INFO L273 TraceCheckUtils]: 50: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:20,146 INFO L273 TraceCheckUtils]: 51: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:20,146 INFO L273 TraceCheckUtils]: 52: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:20,146 INFO L273 TraceCheckUtils]: 53: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:20,146 INFO L273 TraceCheckUtils]: 54: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:20,146 INFO L273 TraceCheckUtils]: 55: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:20,146 INFO L273 TraceCheckUtils]: 56: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:20,146 INFO L273 TraceCheckUtils]: 57: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:20,147 INFO L273 TraceCheckUtils]: 58: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:20,147 INFO L273 TraceCheckUtils]: 59: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:20,147 INFO L273 TraceCheckUtils]: 60: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16004#false} is VALID [2018-11-23 12:10:20,147 INFO L273 TraceCheckUtils]: 61: Hoare triple {16004#false} assume !(~i~0 < 100000); {16004#false} is VALID [2018-11-23 12:10:20,147 INFO L273 TraceCheckUtils]: 62: Hoare triple {16004#false} ~i~0 := 1;~j~0 := 0; {16004#false} is VALID [2018-11-23 12:10:20,147 INFO L273 TraceCheckUtils]: 63: Hoare triple {16004#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {16004#false} is VALID [2018-11-23 12:10:20,148 INFO L256 TraceCheckUtils]: 64: Hoare triple {16004#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {16004#false} is VALID [2018-11-23 12:10:20,148 INFO L273 TraceCheckUtils]: 65: Hoare triple {16004#false} ~cond := #in~cond; {16004#false} is VALID [2018-11-23 12:10:20,148 INFO L273 TraceCheckUtils]: 66: Hoare triple {16004#false} assume 0 == ~cond; {16004#false} is VALID [2018-11-23 12:10:20,148 INFO L273 TraceCheckUtils]: 67: Hoare triple {16004#false} assume !false; {16004#false} is VALID [2018-11-23 12:10:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:10:20,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:20,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-11-23 12:10:20,171 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 68 [2018-11-23 12:10:20,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:20,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:10:20,214 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-23 12:10:20,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:10:20,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:10:20,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:10:20,216 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 46 states. [2018-11-23 12:10:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:21,768 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2018-11-23 12:10:21,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 12:10:21,768 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 68 [2018-11-23 12:10:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:10:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 133 transitions. [2018-11-23 12:10:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:10:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 133 transitions. [2018-11-23 12:10:21,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 133 transitions. [2018-11-23 12:10:21,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:21,898 INFO L225 Difference]: With dead ends: 129 [2018-11-23 12:10:21,898 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:10:21,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:10:21,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:10:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 73. [2018-11-23 12:10:21,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:21,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 73 states. [2018-11-23 12:10:21,958 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 73 states. [2018-11-23 12:10:21,958 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 73 states. [2018-11-23 12:10:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:21,961 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-11-23 12:10:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2018-11-23 12:10:21,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:21,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:21,961 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 106 states. [2018-11-23 12:10:21,961 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 106 states. [2018-11-23 12:10:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:21,963 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-11-23 12:10:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2018-11-23 12:10:21,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:21,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:21,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:21,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 12:10:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-11-23 12:10:21,965 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 68 [2018-11-23 12:10:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:21,965 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-11-23 12:10:21,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:10:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-11-23 12:10:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:10:21,966 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:21,966 INFO L402 BasicCegarLoop]: trace histogram [43, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:21,966 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:21,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:21,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1620547941, now seen corresponding path program 33 times [2018-11-23 12:10:21,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:21,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:21,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:21,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:21,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:24,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {16829#true} call ULTIMATE.init(); {16829#true} is VALID [2018-11-23 12:10:24,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {16829#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16829#true} is VALID [2018-11-23 12:10:24,236 INFO L273 TraceCheckUtils]: 2: Hoare triple {16829#true} assume true; {16829#true} is VALID [2018-11-23 12:10:24,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16829#true} {16829#true} #60#return; {16829#true} is VALID [2018-11-23 12:10:24,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {16829#true} call #t~ret4 := main(); {16829#true} is VALID [2018-11-23 12:10:24,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {16829#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; {16831#(= main_~i~0 0)} is VALID [2018-11-23 12:10:24,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {16831#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16832#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:24,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {16832#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16833#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:24,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {16833#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16834#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:24,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {16834#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16835#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:24,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {16835#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16836#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:24,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {16836#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16837#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:24,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {16837#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16838#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:24,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {16838#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16839#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:24,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {16839#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16840#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:24,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {16840#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16841#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:24,246 INFO L273 TraceCheckUtils]: 16: Hoare triple {16841#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16842#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:24,247 INFO L273 TraceCheckUtils]: 17: Hoare triple {16842#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16843#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:24,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {16843#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16844#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:24,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {16844#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16845#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:24,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {16845#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16846#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:24,251 INFO L273 TraceCheckUtils]: 21: Hoare triple {16846#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16847#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:24,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {16847#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16848#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:24,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {16848#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16849#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:24,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {16849#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16850#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:24,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {16850#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16851#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:24,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {16851#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16852#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:24,257 INFO L273 TraceCheckUtils]: 27: Hoare triple {16852#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16853#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:24,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {16853#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16854#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:24,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {16854#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16855#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:24,260 INFO L273 TraceCheckUtils]: 30: Hoare triple {16855#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16856#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:24,261 INFO L273 TraceCheckUtils]: 31: Hoare triple {16856#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16857#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:24,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {16857#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16858#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:24,267 INFO L273 TraceCheckUtils]: 33: Hoare triple {16858#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16859#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:24,268 INFO L273 TraceCheckUtils]: 34: Hoare triple {16859#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16860#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:24,269 INFO L273 TraceCheckUtils]: 35: Hoare triple {16860#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16861#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:24,269 INFO L273 TraceCheckUtils]: 36: Hoare triple {16861#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16862#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:24,270 INFO L273 TraceCheckUtils]: 37: Hoare triple {16862#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16863#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:24,271 INFO L273 TraceCheckUtils]: 38: Hoare triple {16863#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16864#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:24,272 INFO L273 TraceCheckUtils]: 39: Hoare triple {16864#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16865#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:24,273 INFO L273 TraceCheckUtils]: 40: Hoare triple {16865#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16866#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:24,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {16866#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16867#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:24,275 INFO L273 TraceCheckUtils]: 42: Hoare triple {16867#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16868#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:24,276 INFO L273 TraceCheckUtils]: 43: Hoare triple {16868#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16869#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:24,277 INFO L273 TraceCheckUtils]: 44: Hoare triple {16869#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16870#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:24,278 INFO L273 TraceCheckUtils]: 45: Hoare triple {16870#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16871#(<= main_~i~0 40)} is VALID [2018-11-23 12:10:24,279 INFO L273 TraceCheckUtils]: 46: Hoare triple {16871#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16872#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:24,280 INFO L273 TraceCheckUtils]: 47: Hoare triple {16872#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16873#(<= main_~i~0 42)} is VALID [2018-11-23 12:10:24,281 INFO L273 TraceCheckUtils]: 48: Hoare triple {16873#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16874#(<= main_~i~0 43)} is VALID [2018-11-23 12:10:24,282 INFO L273 TraceCheckUtils]: 49: Hoare triple {16874#(<= main_~i~0 43)} assume !(~i~0 < 100000); {16830#false} is VALID [2018-11-23 12:10:24,282 INFO L273 TraceCheckUtils]: 50: Hoare triple {16830#false} ~i~0 := 1; {16830#false} is VALID [2018-11-23 12:10:24,282 INFO L273 TraceCheckUtils]: 51: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16830#false} is VALID [2018-11-23 12:10:24,282 INFO L273 TraceCheckUtils]: 52: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16830#false} is VALID [2018-11-23 12:10:24,283 INFO L273 TraceCheckUtils]: 53: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16830#false} is VALID [2018-11-23 12:10:24,283 INFO L273 TraceCheckUtils]: 54: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16830#false} is VALID [2018-11-23 12:10:24,283 INFO L273 TraceCheckUtils]: 55: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16830#false} is VALID [2018-11-23 12:10:24,283 INFO L273 TraceCheckUtils]: 56: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16830#false} is VALID [2018-11-23 12:10:24,283 INFO L273 TraceCheckUtils]: 57: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16830#false} is VALID [2018-11-23 12:10:24,284 INFO L273 TraceCheckUtils]: 58: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16830#false} is VALID [2018-11-23 12:10:24,284 INFO L273 TraceCheckUtils]: 59: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16830#false} is VALID [2018-11-23 12:10:24,284 INFO L273 TraceCheckUtils]: 60: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16830#false} is VALID [2018-11-23 12:10:24,284 INFO L273 TraceCheckUtils]: 61: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16830#false} is VALID [2018-11-23 12:10:24,284 INFO L273 TraceCheckUtils]: 62: Hoare triple {16830#false} assume !(~i~0 < 100000); {16830#false} is VALID [2018-11-23 12:10:24,285 INFO L273 TraceCheckUtils]: 63: Hoare triple {16830#false} ~i~0 := 1;~j~0 := 0; {16830#false} is VALID [2018-11-23 12:10:24,285 INFO L273 TraceCheckUtils]: 64: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {16830#false} is VALID [2018-11-23 12:10:24,285 INFO L256 TraceCheckUtils]: 65: Hoare triple {16830#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {16830#false} is VALID [2018-11-23 12:10:24,285 INFO L273 TraceCheckUtils]: 66: Hoare triple {16830#false} ~cond := #in~cond; {16830#false} is VALID [2018-11-23 12:10:24,285 INFO L273 TraceCheckUtils]: 67: Hoare triple {16830#false} assume 0 == ~cond; {16830#false} is VALID [2018-11-23 12:10:24,286 INFO L273 TraceCheckUtils]: 68: Hoare triple {16830#false} assume !false; {16830#false} is VALID [2018-11-23 12:10:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:10:24,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:24,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:24,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:10:26,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:10:26,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:26,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:26,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {16829#true} call ULTIMATE.init(); {16829#true} is VALID [2018-11-23 12:10:26,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {16829#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16829#true} is VALID [2018-11-23 12:10:26,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {16829#true} assume true; {16829#true} is VALID [2018-11-23 12:10:26,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16829#true} {16829#true} #60#return; {16829#true} is VALID [2018-11-23 12:10:26,759 INFO L256 TraceCheckUtils]: 4: Hoare triple {16829#true} call #t~ret4 := main(); {16829#true} is VALID [2018-11-23 12:10:26,759 INFO L273 TraceCheckUtils]: 5: Hoare triple {16829#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; {16829#true} is VALID [2018-11-23 12:10:26,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,760 INFO L273 TraceCheckUtils]: 10: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,760 INFO L273 TraceCheckUtils]: 11: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,760 INFO L273 TraceCheckUtils]: 12: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,760 INFO L273 TraceCheckUtils]: 13: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,760 INFO L273 TraceCheckUtils]: 14: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,761 INFO L273 TraceCheckUtils]: 16: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,761 INFO L273 TraceCheckUtils]: 18: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,761 INFO L273 TraceCheckUtils]: 19: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,761 INFO L273 TraceCheckUtils]: 20: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,761 INFO L273 TraceCheckUtils]: 24: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,762 INFO L273 TraceCheckUtils]: 25: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,762 INFO L273 TraceCheckUtils]: 26: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,762 INFO L273 TraceCheckUtils]: 27: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,762 INFO L273 TraceCheckUtils]: 28: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,762 INFO L273 TraceCheckUtils]: 30: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,762 INFO L273 TraceCheckUtils]: 31: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,762 INFO L273 TraceCheckUtils]: 32: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,762 INFO L273 TraceCheckUtils]: 33: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,763 INFO L273 TraceCheckUtils]: 34: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,763 INFO L273 TraceCheckUtils]: 35: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,763 INFO L273 TraceCheckUtils]: 36: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,763 INFO L273 TraceCheckUtils]: 37: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,763 INFO L273 TraceCheckUtils]: 38: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,763 INFO L273 TraceCheckUtils]: 39: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,763 INFO L273 TraceCheckUtils]: 40: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,763 INFO L273 TraceCheckUtils]: 41: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,764 INFO L273 TraceCheckUtils]: 42: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,764 INFO L273 TraceCheckUtils]: 43: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,764 INFO L273 TraceCheckUtils]: 44: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,764 INFO L273 TraceCheckUtils]: 45: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,764 INFO L273 TraceCheckUtils]: 46: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,764 INFO L273 TraceCheckUtils]: 47: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,764 INFO L273 TraceCheckUtils]: 48: Hoare triple {16829#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16829#true} is VALID [2018-11-23 12:10:26,764 INFO L273 TraceCheckUtils]: 49: Hoare triple {16829#true} assume !(~i~0 < 100000); {16829#true} is VALID [2018-11-23 12:10:26,765 INFO L273 TraceCheckUtils]: 50: Hoare triple {16829#true} ~i~0 := 1; {16832#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:26,765 INFO L273 TraceCheckUtils]: 51: Hoare triple {16832#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16836#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:26,766 INFO L273 TraceCheckUtils]: 52: Hoare triple {16836#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16840#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:26,767 INFO L273 TraceCheckUtils]: 53: Hoare triple {16840#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16844#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:26,767 INFO L273 TraceCheckUtils]: 54: Hoare triple {16844#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16848#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:26,768 INFO L273 TraceCheckUtils]: 55: Hoare triple {16848#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16852#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:26,769 INFO L273 TraceCheckUtils]: 56: Hoare triple {16852#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16856#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:26,770 INFO L273 TraceCheckUtils]: 57: Hoare triple {16856#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16860#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:26,771 INFO L273 TraceCheckUtils]: 58: Hoare triple {16860#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16864#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:26,772 INFO L273 TraceCheckUtils]: 59: Hoare triple {16864#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16868#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:26,773 INFO L273 TraceCheckUtils]: 60: Hoare triple {16868#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {16872#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:26,774 INFO L273 TraceCheckUtils]: 61: Hoare triple {16872#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17061#(<= main_~i~0 45)} is VALID [2018-11-23 12:10:26,775 INFO L273 TraceCheckUtils]: 62: Hoare triple {17061#(<= main_~i~0 45)} assume !(~i~0 < 100000); {16830#false} is VALID [2018-11-23 12:10:26,775 INFO L273 TraceCheckUtils]: 63: Hoare triple {16830#false} ~i~0 := 1;~j~0 := 0; {16830#false} is VALID [2018-11-23 12:10:26,775 INFO L273 TraceCheckUtils]: 64: Hoare triple {16830#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {16830#false} is VALID [2018-11-23 12:10:26,775 INFO L256 TraceCheckUtils]: 65: Hoare triple {16830#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {16830#false} is VALID [2018-11-23 12:10:26,776 INFO L273 TraceCheckUtils]: 66: Hoare triple {16830#false} ~cond := #in~cond; {16830#false} is VALID [2018-11-23 12:10:26,776 INFO L273 TraceCheckUtils]: 67: Hoare triple {16830#false} assume 0 == ~cond; {16830#false} is VALID [2018-11-23 12:10:26,776 INFO L273 TraceCheckUtils]: 68: Hoare triple {16830#false} assume !false; {16830#false} is VALID [2018-11-23 12:10:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-11-23 12:10:26,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:26,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 14] total 47 [2018-11-23 12:10:26,801 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 69 [2018-11-23 12:10:26,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:26,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 12:10:26,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:26,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 12:10:26,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 12:10:26,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:10:26,871 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2018-11-23 12:10:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:28,808 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2018-11-23 12:10:28,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 12:10:28,808 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 69 [2018-11-23 12:10:28,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:10:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 142 transitions. [2018-11-23 12:10:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:10:28,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 142 transitions. [2018-11-23 12:10:28,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 142 transitions. [2018-11-23 12:10:29,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:29,008 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:10:29,008 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 12:10:29,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:10:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 12:10:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 76. [2018-11-23 12:10:29,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:29,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 76 states. [2018-11-23 12:10:29,118 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 76 states. [2018-11-23 12:10:29,118 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 76 states. [2018-11-23 12:10:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:29,121 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2018-11-23 12:10:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-11-23 12:10:29,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:29,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:29,121 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 112 states. [2018-11-23 12:10:29,121 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 112 states. [2018-11-23 12:10:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:29,123 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2018-11-23 12:10:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-11-23 12:10:29,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:29,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:29,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:29,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:10:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-11-23 12:10:29,125 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 69 [2018-11-23 12:10:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:29,125 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-23 12:10:29,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 12:10:29,126 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 12:10:29,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:10:29,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:29,126 INFO L402 BasicCegarLoop]: trace histogram [45, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:29,127 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:29,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:29,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2075525386, now seen corresponding path program 34 times [2018-11-23 12:10:29,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:29,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:29,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:29,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:29,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:30,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {17688#true} call ULTIMATE.init(); {17688#true} is VALID [2018-11-23 12:10:30,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {17688#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17688#true} is VALID [2018-11-23 12:10:30,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {17688#true} assume true; {17688#true} is VALID [2018-11-23 12:10:30,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17688#true} {17688#true} #60#return; {17688#true} is VALID [2018-11-23 12:10:30,933 INFO L256 TraceCheckUtils]: 4: Hoare triple {17688#true} call #t~ret4 := main(); {17688#true} is VALID [2018-11-23 12:10:30,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {17688#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; {17690#(= main_~i~0 0)} is VALID [2018-11-23 12:10:30,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {17690#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17691#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:30,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {17691#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17692#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:30,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {17692#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17693#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:30,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {17693#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17694#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:30,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {17694#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17695#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:30,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {17695#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17696#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:30,939 INFO L273 TraceCheckUtils]: 12: Hoare triple {17696#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17697#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:30,940 INFO L273 TraceCheckUtils]: 13: Hoare triple {17697#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17698#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:30,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {17698#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17699#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:30,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {17699#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17700#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:30,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {17700#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17701#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:30,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {17701#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17702#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:30,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {17702#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17703#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:30,945 INFO L273 TraceCheckUtils]: 19: Hoare triple {17703#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17704#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:30,946 INFO L273 TraceCheckUtils]: 20: Hoare triple {17704#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17705#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:30,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {17705#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17706#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:30,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {17706#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17707#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:30,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {17707#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17708#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:30,983 INFO L273 TraceCheckUtils]: 24: Hoare triple {17708#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17709#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:30,983 INFO L273 TraceCheckUtils]: 25: Hoare triple {17709#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17710#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:30,984 INFO L273 TraceCheckUtils]: 26: Hoare triple {17710#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17711#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:30,984 INFO L273 TraceCheckUtils]: 27: Hoare triple {17711#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17712#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:30,985 INFO L273 TraceCheckUtils]: 28: Hoare triple {17712#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17713#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:30,986 INFO L273 TraceCheckUtils]: 29: Hoare triple {17713#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17714#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:30,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {17714#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17715#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:30,988 INFO L273 TraceCheckUtils]: 31: Hoare triple {17715#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17716#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:30,989 INFO L273 TraceCheckUtils]: 32: Hoare triple {17716#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17717#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:30,990 INFO L273 TraceCheckUtils]: 33: Hoare triple {17717#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17718#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:30,991 INFO L273 TraceCheckUtils]: 34: Hoare triple {17718#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17719#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:30,992 INFO L273 TraceCheckUtils]: 35: Hoare triple {17719#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17720#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:30,993 INFO L273 TraceCheckUtils]: 36: Hoare triple {17720#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17721#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:30,994 INFO L273 TraceCheckUtils]: 37: Hoare triple {17721#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17722#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:30,995 INFO L273 TraceCheckUtils]: 38: Hoare triple {17722#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17723#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:30,996 INFO L273 TraceCheckUtils]: 39: Hoare triple {17723#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17724#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:30,997 INFO L273 TraceCheckUtils]: 40: Hoare triple {17724#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17725#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:30,998 INFO L273 TraceCheckUtils]: 41: Hoare triple {17725#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17726#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:30,999 INFO L273 TraceCheckUtils]: 42: Hoare triple {17726#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17727#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:31,000 INFO L273 TraceCheckUtils]: 43: Hoare triple {17727#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17728#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:31,001 INFO L273 TraceCheckUtils]: 44: Hoare triple {17728#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17729#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:31,002 INFO L273 TraceCheckUtils]: 45: Hoare triple {17729#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17730#(<= main_~i~0 40)} is VALID [2018-11-23 12:10:31,003 INFO L273 TraceCheckUtils]: 46: Hoare triple {17730#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17731#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:31,004 INFO L273 TraceCheckUtils]: 47: Hoare triple {17731#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17732#(<= main_~i~0 42)} is VALID [2018-11-23 12:10:31,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {17732#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17733#(<= main_~i~0 43)} is VALID [2018-11-23 12:10:31,006 INFO L273 TraceCheckUtils]: 49: Hoare triple {17733#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17734#(<= main_~i~0 44)} is VALID [2018-11-23 12:10:31,007 INFO L273 TraceCheckUtils]: 50: Hoare triple {17734#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17735#(<= main_~i~0 45)} is VALID [2018-11-23 12:10:31,007 INFO L273 TraceCheckUtils]: 51: Hoare triple {17735#(<= main_~i~0 45)} assume !(~i~0 < 100000); {17689#false} is VALID [2018-11-23 12:10:31,008 INFO L273 TraceCheckUtils]: 52: Hoare triple {17689#false} ~i~0 := 1; {17689#false} is VALID [2018-11-23 12:10:31,008 INFO L273 TraceCheckUtils]: 53: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,008 INFO L273 TraceCheckUtils]: 54: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,008 INFO L273 TraceCheckUtils]: 55: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,009 INFO L273 TraceCheckUtils]: 56: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,009 INFO L273 TraceCheckUtils]: 57: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,009 INFO L273 TraceCheckUtils]: 58: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,009 INFO L273 TraceCheckUtils]: 59: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,009 INFO L273 TraceCheckUtils]: 60: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,009 INFO L273 TraceCheckUtils]: 61: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,010 INFO L273 TraceCheckUtils]: 62: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,010 INFO L273 TraceCheckUtils]: 63: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,010 INFO L273 TraceCheckUtils]: 64: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,010 INFO L273 TraceCheckUtils]: 65: Hoare triple {17689#false} assume !(~i~0 < 100000); {17689#false} is VALID [2018-11-23 12:10:31,010 INFO L273 TraceCheckUtils]: 66: Hoare triple {17689#false} ~i~0 := 1;~j~0 := 0; {17689#false} is VALID [2018-11-23 12:10:31,011 INFO L273 TraceCheckUtils]: 67: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {17689#false} is VALID [2018-11-23 12:10:31,011 INFO L256 TraceCheckUtils]: 68: Hoare triple {17689#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {17689#false} is VALID [2018-11-23 12:10:31,011 INFO L273 TraceCheckUtils]: 69: Hoare triple {17689#false} ~cond := #in~cond; {17689#false} is VALID [2018-11-23 12:10:31,011 INFO L273 TraceCheckUtils]: 70: Hoare triple {17689#false} assume 0 == ~cond; {17689#false} is VALID [2018-11-23 12:10:31,011 INFO L273 TraceCheckUtils]: 71: Hoare triple {17689#false} assume !false; {17689#false} is VALID [2018-11-23 12:10:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:10:31,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:31,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:31,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:10:31,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:10:31,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:31,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:31,347 INFO L256 TraceCheckUtils]: 0: Hoare triple {17688#true} call ULTIMATE.init(); {17688#true} is VALID [2018-11-23 12:10:31,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {17688#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17688#true} is VALID [2018-11-23 12:10:31,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {17688#true} assume true; {17688#true} is VALID [2018-11-23 12:10:31,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17688#true} {17688#true} #60#return; {17688#true} is VALID [2018-11-23 12:10:31,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {17688#true} call #t~ret4 := main(); {17688#true} is VALID [2018-11-23 12:10:31,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {17688#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; {17754#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:31,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {17754#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17691#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:31,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {17691#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17692#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:31,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {17692#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17693#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:31,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {17693#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17694#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:31,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {17694#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17695#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:31,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {17695#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17696#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:31,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {17696#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17697#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:31,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {17697#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17698#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:31,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {17698#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17699#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:31,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {17699#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17700#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:31,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {17700#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17701#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:31,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {17701#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17702#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:31,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {17702#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17703#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:31,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {17703#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17704#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:31,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {17704#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17705#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:31,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {17705#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17706#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:31,364 INFO L273 TraceCheckUtils]: 22: Hoare triple {17706#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17707#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:31,365 INFO L273 TraceCheckUtils]: 23: Hoare triple {17707#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17708#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:31,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {17708#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17709#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:31,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {17709#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17710#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:31,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {17710#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17711#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:31,368 INFO L273 TraceCheckUtils]: 27: Hoare triple {17711#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17712#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:31,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {17712#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17713#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:31,370 INFO L273 TraceCheckUtils]: 29: Hoare triple {17713#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17714#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:31,371 INFO L273 TraceCheckUtils]: 30: Hoare triple {17714#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17715#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:31,372 INFO L273 TraceCheckUtils]: 31: Hoare triple {17715#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17716#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:31,373 INFO L273 TraceCheckUtils]: 32: Hoare triple {17716#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17717#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:31,374 INFO L273 TraceCheckUtils]: 33: Hoare triple {17717#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17718#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:31,375 INFO L273 TraceCheckUtils]: 34: Hoare triple {17718#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17719#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:31,376 INFO L273 TraceCheckUtils]: 35: Hoare triple {17719#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17720#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:31,377 INFO L273 TraceCheckUtils]: 36: Hoare triple {17720#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17721#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:31,378 INFO L273 TraceCheckUtils]: 37: Hoare triple {17721#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17722#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:31,379 INFO L273 TraceCheckUtils]: 38: Hoare triple {17722#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17723#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:31,380 INFO L273 TraceCheckUtils]: 39: Hoare triple {17723#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17724#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:31,381 INFO L273 TraceCheckUtils]: 40: Hoare triple {17724#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17725#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:31,382 INFO L273 TraceCheckUtils]: 41: Hoare triple {17725#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17726#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:31,383 INFO L273 TraceCheckUtils]: 42: Hoare triple {17726#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17727#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:31,384 INFO L273 TraceCheckUtils]: 43: Hoare triple {17727#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17728#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:31,385 INFO L273 TraceCheckUtils]: 44: Hoare triple {17728#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17729#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:31,386 INFO L273 TraceCheckUtils]: 45: Hoare triple {17729#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17730#(<= main_~i~0 40)} is VALID [2018-11-23 12:10:31,387 INFO L273 TraceCheckUtils]: 46: Hoare triple {17730#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17731#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:31,388 INFO L273 TraceCheckUtils]: 47: Hoare triple {17731#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17732#(<= main_~i~0 42)} is VALID [2018-11-23 12:10:31,389 INFO L273 TraceCheckUtils]: 48: Hoare triple {17732#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17733#(<= main_~i~0 43)} is VALID [2018-11-23 12:10:31,390 INFO L273 TraceCheckUtils]: 49: Hoare triple {17733#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17734#(<= main_~i~0 44)} is VALID [2018-11-23 12:10:31,391 INFO L273 TraceCheckUtils]: 50: Hoare triple {17734#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17735#(<= main_~i~0 45)} is VALID [2018-11-23 12:10:31,392 INFO L273 TraceCheckUtils]: 51: Hoare triple {17735#(<= main_~i~0 45)} assume !(~i~0 < 100000); {17689#false} is VALID [2018-11-23 12:10:31,392 INFO L273 TraceCheckUtils]: 52: Hoare triple {17689#false} ~i~0 := 1; {17689#false} is VALID [2018-11-23 12:10:31,392 INFO L273 TraceCheckUtils]: 53: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,392 INFO L273 TraceCheckUtils]: 54: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,392 INFO L273 TraceCheckUtils]: 55: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,393 INFO L273 TraceCheckUtils]: 56: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,393 INFO L273 TraceCheckUtils]: 57: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,393 INFO L273 TraceCheckUtils]: 58: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,393 INFO L273 TraceCheckUtils]: 59: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,393 INFO L273 TraceCheckUtils]: 60: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,394 INFO L273 TraceCheckUtils]: 61: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,394 INFO L273 TraceCheckUtils]: 62: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,394 INFO L273 TraceCheckUtils]: 63: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,394 INFO L273 TraceCheckUtils]: 64: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {17689#false} is VALID [2018-11-23 12:10:31,394 INFO L273 TraceCheckUtils]: 65: Hoare triple {17689#false} assume !(~i~0 < 100000); {17689#false} is VALID [2018-11-23 12:10:31,395 INFO L273 TraceCheckUtils]: 66: Hoare triple {17689#false} ~i~0 := 1;~j~0 := 0; {17689#false} is VALID [2018-11-23 12:10:31,395 INFO L273 TraceCheckUtils]: 67: Hoare triple {17689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {17689#false} is VALID [2018-11-23 12:10:31,395 INFO L256 TraceCheckUtils]: 68: Hoare triple {17689#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {17689#false} is VALID [2018-11-23 12:10:31,395 INFO L273 TraceCheckUtils]: 69: Hoare triple {17689#false} ~cond := #in~cond; {17689#false} is VALID [2018-11-23 12:10:31,395 INFO L273 TraceCheckUtils]: 70: Hoare triple {17689#false} assume 0 == ~cond; {17689#false} is VALID [2018-11-23 12:10:31,395 INFO L273 TraceCheckUtils]: 71: Hoare triple {17689#false} assume !false; {17689#false} is VALID [2018-11-23 12:10:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:10:31,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:31,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-11-23 12:10:31,418 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 72 [2018-11-23 12:10:31,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:31,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:10:31,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:31,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:10:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:10:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:10:31,484 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 49 states. [2018-11-23 12:10:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:32,804 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-11-23 12:10:32,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:10:32,804 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 72 [2018-11-23 12:10:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:10:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 141 transitions. [2018-11-23 12:10:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:10:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 141 transitions. [2018-11-23 12:10:32,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 141 transitions. [2018-11-23 12:10:32,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:32,940 INFO L225 Difference]: With dead ends: 137 [2018-11-23 12:10:32,940 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 12:10:32,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:10:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 12:10:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 77. [2018-11-23 12:10:33,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:33,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 77 states. [2018-11-23 12:10:33,032 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 77 states. [2018-11-23 12:10:33,032 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 77 states. [2018-11-23 12:10:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:33,034 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2018-11-23 12:10:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-11-23 12:10:33,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:33,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:33,037 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 113 states. [2018-11-23 12:10:33,037 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 113 states. [2018-11-23 12:10:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:33,039 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2018-11-23 12:10:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-11-23 12:10:33,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:33,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:33,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:33,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:10:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-11-23 12:10:33,041 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 72 [2018-11-23 12:10:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:33,041 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-11-23 12:10:33,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:10:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-11-23 12:10:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:10:33,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:33,042 INFO L402 BasicCegarLoop]: trace histogram [46, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:33,042 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:33,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:33,043 INFO L82 PathProgramCache]: Analyzing trace with hash 429084006, now seen corresponding path program 35 times [2018-11-23 12:10:33,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:33,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:33,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:33,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:33,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:35,687 INFO L256 TraceCheckUtils]: 0: Hoare triple {18566#true} call ULTIMATE.init(); {18566#true} is VALID [2018-11-23 12:10:35,687 INFO L273 TraceCheckUtils]: 1: Hoare triple {18566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18566#true} is VALID [2018-11-23 12:10:35,687 INFO L273 TraceCheckUtils]: 2: Hoare triple {18566#true} assume true; {18566#true} is VALID [2018-11-23 12:10:35,687 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18566#true} {18566#true} #60#return; {18566#true} is VALID [2018-11-23 12:10:35,688 INFO L256 TraceCheckUtils]: 4: Hoare triple {18566#true} call #t~ret4 := main(); {18566#true} is VALID [2018-11-23 12:10:35,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {18566#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; {18568#(= main_~i~0 0)} is VALID [2018-11-23 12:10:35,689 INFO L273 TraceCheckUtils]: 6: Hoare triple {18568#(= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18569#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:35,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {18569#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18570#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:35,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {18570#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18571#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:35,692 INFO L273 TraceCheckUtils]: 9: Hoare triple {18571#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18572#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:35,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {18572#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18573#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:35,694 INFO L273 TraceCheckUtils]: 11: Hoare triple {18573#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18574#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:35,695 INFO L273 TraceCheckUtils]: 12: Hoare triple {18574#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18575#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:35,696 INFO L273 TraceCheckUtils]: 13: Hoare triple {18575#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18576#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:35,697 INFO L273 TraceCheckUtils]: 14: Hoare triple {18576#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18577#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:35,698 INFO L273 TraceCheckUtils]: 15: Hoare triple {18577#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18578#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:35,699 INFO L273 TraceCheckUtils]: 16: Hoare triple {18578#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18579#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:35,700 INFO L273 TraceCheckUtils]: 17: Hoare triple {18579#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18580#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:35,701 INFO L273 TraceCheckUtils]: 18: Hoare triple {18580#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18581#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:35,702 INFO L273 TraceCheckUtils]: 19: Hoare triple {18581#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18582#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:35,703 INFO L273 TraceCheckUtils]: 20: Hoare triple {18582#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18583#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:35,704 INFO L273 TraceCheckUtils]: 21: Hoare triple {18583#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18584#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:35,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {18584#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18585#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:35,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {18585#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18586#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:35,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {18586#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18587#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:35,708 INFO L273 TraceCheckUtils]: 25: Hoare triple {18587#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18588#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:35,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {18588#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18589#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:35,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {18589#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18590#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:35,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {18590#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18591#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:35,712 INFO L273 TraceCheckUtils]: 29: Hoare triple {18591#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18592#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:35,713 INFO L273 TraceCheckUtils]: 30: Hoare triple {18592#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18593#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:35,714 INFO L273 TraceCheckUtils]: 31: Hoare triple {18593#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18594#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:35,715 INFO L273 TraceCheckUtils]: 32: Hoare triple {18594#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18595#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:35,716 INFO L273 TraceCheckUtils]: 33: Hoare triple {18595#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18596#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:35,716 INFO L273 TraceCheckUtils]: 34: Hoare triple {18596#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18597#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:35,717 INFO L273 TraceCheckUtils]: 35: Hoare triple {18597#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18598#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:35,718 INFO L273 TraceCheckUtils]: 36: Hoare triple {18598#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18599#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:35,719 INFO L273 TraceCheckUtils]: 37: Hoare triple {18599#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18600#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:35,720 INFO L273 TraceCheckUtils]: 38: Hoare triple {18600#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18601#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:35,721 INFO L273 TraceCheckUtils]: 39: Hoare triple {18601#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18602#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:35,722 INFO L273 TraceCheckUtils]: 40: Hoare triple {18602#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18603#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:35,723 INFO L273 TraceCheckUtils]: 41: Hoare triple {18603#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18604#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:35,724 INFO L273 TraceCheckUtils]: 42: Hoare triple {18604#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18605#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:35,725 INFO L273 TraceCheckUtils]: 43: Hoare triple {18605#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18606#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:35,726 INFO L273 TraceCheckUtils]: 44: Hoare triple {18606#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18607#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:35,727 INFO L273 TraceCheckUtils]: 45: Hoare triple {18607#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18608#(<= main_~i~0 40)} is VALID [2018-11-23 12:10:35,728 INFO L273 TraceCheckUtils]: 46: Hoare triple {18608#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18609#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:35,729 INFO L273 TraceCheckUtils]: 47: Hoare triple {18609#(<= 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 + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18610#(<= main_~i~0 42)} is VALID [2018-11-23 12:10:35,730 INFO L273 TraceCheckUtils]: 48: Hoare triple {18610#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18611#(<= main_~i~0 43)} is VALID [2018-11-23 12:10:35,731 INFO L273 TraceCheckUtils]: 49: Hoare triple {18611#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18612#(<= main_~i~0 44)} is VALID [2018-11-23 12:10:35,732 INFO L273 TraceCheckUtils]: 50: Hoare triple {18612#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18613#(<= main_~i~0 45)} is VALID [2018-11-23 12:10:35,733 INFO L273 TraceCheckUtils]: 51: Hoare triple {18613#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18614#(<= main_~i~0 46)} is VALID [2018-11-23 12:10:35,734 INFO L273 TraceCheckUtils]: 52: Hoare triple {18614#(<= main_~i~0 46)} assume !(~i~0 < 100000); {18567#false} is VALID [2018-11-23 12:10:35,734 INFO L273 TraceCheckUtils]: 53: Hoare triple {18567#false} ~i~0 := 1; {18567#false} is VALID [2018-11-23 12:10:35,734 INFO L273 TraceCheckUtils]: 54: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {18567#false} is VALID [2018-11-23 12:10:35,734 INFO L273 TraceCheckUtils]: 55: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {18567#false} is VALID [2018-11-23 12:10:35,735 INFO L273 TraceCheckUtils]: 56: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {18567#false} is VALID [2018-11-23 12:10:35,735 INFO L273 TraceCheckUtils]: 57: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {18567#false} is VALID [2018-11-23 12:10:35,735 INFO L273 TraceCheckUtils]: 58: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {18567#false} is VALID [2018-11-23 12:10:35,735 INFO L273 TraceCheckUtils]: 59: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {18567#false} is VALID [2018-11-23 12:10:35,735 INFO L273 TraceCheckUtils]: 60: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {18567#false} is VALID [2018-11-23 12:10:35,736 INFO L273 TraceCheckUtils]: 61: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {18567#false} is VALID [2018-11-23 12:10:35,736 INFO L273 TraceCheckUtils]: 62: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {18567#false} is VALID [2018-11-23 12:10:35,736 INFO L273 TraceCheckUtils]: 63: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {18567#false} is VALID [2018-11-23 12:10:35,736 INFO L273 TraceCheckUtils]: 64: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {18567#false} is VALID [2018-11-23 12:10:35,736 INFO L273 TraceCheckUtils]: 65: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 4 + ~i~0;~j~0 := 1 + ~j~0; {18567#false} is VALID [2018-11-23 12:10:35,737 INFO L273 TraceCheckUtils]: 66: Hoare triple {18567#false} assume !(~i~0 < 100000); {18567#false} is VALID [2018-11-23 12:10:35,737 INFO L273 TraceCheckUtils]: 67: Hoare triple {18567#false} ~i~0 := 1;~j~0 := 0; {18567#false} is VALID [2018-11-23 12:10:35,737 INFO L273 TraceCheckUtils]: 68: Hoare triple {18567#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 4 * ~j~0), 4); {18567#false} is VALID [2018-11-23 12:10:35,737 INFO L256 TraceCheckUtils]: 69: Hoare triple {18567#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {18567#false} is VALID [2018-11-23 12:10:35,737 INFO L273 TraceCheckUtils]: 70: Hoare triple {18567#false} ~cond := #in~cond; {18567#false} is VALID [2018-11-23 12:10:35,737 INFO L273 TraceCheckUtils]: 71: Hoare triple {18567#false} assume 0 == ~cond; {18567#false} is VALID [2018-11-23 12:10:35,738 INFO L273 TraceCheckUtils]: 72: Hoare triple {18567#false} assume !false; {18567#false} is VALID [2018-11-23 12:10:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:10:35,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:35,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:35,772 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1