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_copy2_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:51,817 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:51,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:51,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:51,832 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:51,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:51,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:51,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:51,843 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:51,844 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:51,846 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:51,846 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:51,847 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:51,850 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:51,857 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:51,861 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:51,862 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:51,864 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:51,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:51,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:51,875 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:51,876 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:51,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:51,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:51,879 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:51,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:51,881 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:51,882 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:51,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:51,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:51,886 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:51,886 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:51,887 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:51,887 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:51,889 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:51,890 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:51,890 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 11:58:51,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:51,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:51,922 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:51,922 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:51,923 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:51,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:51,926 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:51,927 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:51,927 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:51,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:51,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:51,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:51,928 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:51,928 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:51,928 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:51,928 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:51,928 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:51,930 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:51,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:51,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:51,931 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:51,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:51,931 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:51,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:51,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:51,932 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:51,932 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:51,932 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:51,933 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:51,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:51,933 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:52,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:52,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:52,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:52,027 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:52,027 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:52,028 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy2_true-unreach-call_ground.i [2018-11-23 11:58:52,100 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/851f12dd4/7522a09b7e9a4f1197af27efc33ee6c9/FLAGadeee825e [2018-11-23 11:58:52,522 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:52,523 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy2_true-unreach-call_ground.i [2018-11-23 11:58:52,530 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/851f12dd4/7522a09b7e9a4f1197af27efc33ee6c9/FLAGadeee825e [2018-11-23 11:58:52,903 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/851f12dd4/7522a09b7e9a4f1197af27efc33ee6c9 [2018-11-23 11:58:52,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:58:52,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:58:52,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:52,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:58:52,920 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:58:52,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7594bbe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52, skipping insertion in model container [2018-11-23 11:58:52,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:58:52,964 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:58:53,237 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:53,242 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:58:53,270 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:53,305 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:58:53,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:53 WrapperNode [2018-11-23 11:58:53,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:53,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:53,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:58:53,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:58:53,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:53" (1/1) ... [2018-11-23 11:58:53,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:53" (1/1) ... [2018-11-23 11:58:53,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:53,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:58:53,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:58:53,338 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:58:53,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:53" (1/1) ... [2018-11-23 11:58:53,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:53" (1/1) ... [2018-11-23 11:58:53,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:53" (1/1) ... [2018-11-23 11:58:53,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:53" (1/1) ... [2018-11-23 11:58:53,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:53" (1/1) ... [2018-11-23 11:58:53,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:53" (1/1) ... [2018-11-23 11:58:53,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:53" (1/1) ... [2018-11-23 11:58:53,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:58:53,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:58:53,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:58:53,376 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:58:53,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:53" (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 11:58:53,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:58:53,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:58:53,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:58:53,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:58:53,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:58:53,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:58:53,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:58:53,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:58:53,507 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:58:53,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:58:53,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:58:53,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:58:54,092 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:58:54,093 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:58:54,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:54 BoogieIcfgContainer [2018-11-23 11:58:54,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:58:54,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:58:54,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:58:54,098 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:58:54,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:58:52" (1/3) ... [2018-11-23 11:58:54,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180fda15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:54, skipping insertion in model container [2018-11-23 11:58:54,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:53" (2/3) ... [2018-11-23 11:58:54,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180fda15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:54, skipping insertion in model container [2018-11-23 11:58:54,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:54" (3/3) ... [2018-11-23 11:58:54,102 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy2_true-unreach-call_ground.i [2018-11-23 11:58:54,114 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:58:54,123 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:58:54,142 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:58:54,176 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:58:54,177 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:58:54,177 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:58:54,177 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:58:54,177 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:58:54,178 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:58:54,178 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:58:54,178 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:58:54,178 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:58:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 11:58:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:58:54,205 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:54,206 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 11:58:54,209 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:54,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:54,216 INFO L82 PathProgramCache]: Analyzing trace with hash 415311520, now seen corresponding path program 1 times [2018-11-23 11:58:54,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:54,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:54,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:54,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:54,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:54,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 11:58:54,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-23 11:58:54,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 11:58:54,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #77#return; {33#true} is VALID [2018-11-23 11:58:54,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret9 := main(); {33#true} is VALID [2018-11-23 11:58:54,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {33#true} is VALID [2018-11-23 11:58:54,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 11:58:54,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} havoc ~i~0;~i~0 := 0; {34#false} is VALID [2018-11-23 11:58:54,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !(~i~0 < 100000); {34#false} is VALID [2018-11-23 11:58:54,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0; {34#false} is VALID [2018-11-23 11:58:54,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !(~i~0 < 100000); {34#false} is VALID [2018-11-23 11:58:54,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} havoc ~x~0;~x~0 := 0; {34#false} is VALID [2018-11-23 11:58:54,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {34#false} is VALID [2018-11-23 11:58:54,405 INFO L256 TraceCheckUtils]: 13: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {34#false} is VALID [2018-11-23 11:58:54,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 11:58:54,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-23 11:58:54,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 11:58:54,410 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 11:58:54,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:54,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:58:54,418 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 11:58:54,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:54,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:58:54,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:54,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:58:54,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:58:54,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:58:54,578 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 11:58:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:54,900 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-23 11:58:54,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:58:54,901 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 11:58:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:54,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-23 11:58:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-23 11:58:54,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2018-11-23 11:58:55,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:55,386 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:58:55,386 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:58:55,389 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 11:58:55,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:58:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 11:58:55,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:55,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 11:58:55,431 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:58:55,431 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:58:55,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,435 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 11:58:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:58:55,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:55,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:55,437 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:58:55,437 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:58:55,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,441 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 11:58:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:58:55,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:55,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:55,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:55,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:58:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 11:58:55,447 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2018-11-23 11:58:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:55,448 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 11:58:55,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:58:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:58:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:58:55,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:55,452 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 11:58:55,452 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:55,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:55,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1687882214, now seen corresponding path program 1 times [2018-11-23 11:58:55,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:55,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:55,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:55,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:55,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:55,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 11:58:55,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {189#true} is VALID [2018-11-23 11:58:55,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 11:58:55,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #77#return; {189#true} is VALID [2018-11-23 11:58:55,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret9 := main(); {189#true} is VALID [2018-11-23 11:58:55,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {189#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {191#(= main_~a~0 0)} is VALID [2018-11-23 11:58:55,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {191#(= main_~a~0 0)} assume !(~a~0 < 100000); {190#false} is VALID [2018-11-23 11:58:55,551 INFO L273 TraceCheckUtils]: 7: Hoare triple {190#false} havoc ~i~0;~i~0 := 0; {190#false} is VALID [2018-11-23 11:58:55,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {190#false} assume !(~i~0 < 100000); {190#false} is VALID [2018-11-23 11:58:55,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {190#false} ~i~0 := 0; {190#false} is VALID [2018-11-23 11:58:55,552 INFO L273 TraceCheckUtils]: 10: Hoare triple {190#false} assume !(~i~0 < 100000); {190#false} is VALID [2018-11-23 11:58:55,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} havoc ~x~0;~x~0 := 0; {190#false} is VALID [2018-11-23 11:58:55,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {190#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {190#false} is VALID [2018-11-23 11:58:55,553 INFO L256 TraceCheckUtils]: 13: Hoare triple {190#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {190#false} is VALID [2018-11-23 11:58:55,554 INFO L273 TraceCheckUtils]: 14: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2018-11-23 11:58:55,554 INFO L273 TraceCheckUtils]: 15: Hoare triple {190#false} assume 0 == ~cond; {190#false} is VALID [2018-11-23 11:58:55,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 11:58:55,556 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 11:58:55,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:55,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:55,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:58:55,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:55,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:55,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:55,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:55,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:55,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:55,650 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-11-23 11:58:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,815 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 11:58:55,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:55,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:58:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-23 11:58:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-23 11:58:55,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-23 11:58:56,207 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 11:58:56,210 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:58:56,210 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:58:56,211 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 11:58:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:58:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 11:58:56,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:56,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 11:58:56,234 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 11:58:56,234 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 11:58:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,237 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 11:58:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 11:58:56,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:56,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:56,238 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 11:58:56,239 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 11:58:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,241 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 11:58:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 11:58:56,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:56,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:56,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:56,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:58:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 11:58:56,245 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2018-11-23 11:58:56,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:56,246 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 11:58:56,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 11:58:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:58:56,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:56,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:56,247 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:56,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:56,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1114616120, now seen corresponding path program 1 times [2018-11-23 11:58:56,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:56,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:56,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:56,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:56,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:56,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2018-11-23 11:58:56,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {345#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {345#true} is VALID [2018-11-23 11:58:56,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {345#true} assume true; {345#true} is VALID [2018-11-23 11:58:56,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {345#true} {345#true} #77#return; {345#true} is VALID [2018-11-23 11:58:56,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {345#true} call #t~ret9 := main(); {345#true} is VALID [2018-11-23 11:58:56,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {345#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {345#true} is VALID [2018-11-23 11:58:56,366 INFO L273 TraceCheckUtils]: 6: Hoare triple {345#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {345#true} is VALID [2018-11-23 11:58:56,366 INFO L273 TraceCheckUtils]: 7: Hoare triple {345#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {345#true} is VALID [2018-11-23 11:58:56,367 INFO L273 TraceCheckUtils]: 8: Hoare triple {345#true} assume !(~a~0 < 100000); {345#true} is VALID [2018-11-23 11:58:56,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {345#true} havoc ~i~0;~i~0 := 0; {347#(= main_~i~0 0)} is VALID [2018-11-23 11:58:56,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#(= main_~i~0 0)} assume !(~i~0 < 100000); {346#false} is VALID [2018-11-23 11:58:56,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {346#false} ~i~0 := 0; {346#false} is VALID [2018-11-23 11:58:56,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {346#false} assume !(~i~0 < 100000); {346#false} is VALID [2018-11-23 11:58:56,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {346#false} havoc ~x~0;~x~0 := 0; {346#false} is VALID [2018-11-23 11:58:56,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {346#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {346#false} is VALID [2018-11-23 11:58:56,372 INFO L256 TraceCheckUtils]: 15: Hoare triple {346#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {346#false} is VALID [2018-11-23 11:58:56,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {346#false} ~cond := #in~cond; {346#false} is VALID [2018-11-23 11:58:56,373 INFO L273 TraceCheckUtils]: 17: Hoare triple {346#false} assume 0 == ~cond; {346#false} is VALID [2018-11-23 11:58:56,373 INFO L273 TraceCheckUtils]: 18: Hoare triple {346#false} assume !false; {346#false} is VALID [2018-11-23 11:58:56,374 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 11:58:56,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:56,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:56,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:58:56,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:56,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:56,415 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 11:58:56,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:56,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:56,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:56,417 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 3 states. [2018-11-23 11:58:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,707 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 11:58:56,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:56,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:58:56,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 11:58:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 11:58:56,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2018-11-23 11:58:56,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:56,807 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:58:56,807 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 11:58:56,808 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 11:58:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 11:58:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-23 11:58:56,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:56,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2018-11-23 11:58:56,828 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2018-11-23 11:58:56,828 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2018-11-23 11:58:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,831 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 11:58:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 11:58:56,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:56,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:56,833 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2018-11-23 11:58:56,833 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2018-11-23 11:58:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,835 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 11:58:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 11:58:56,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:56,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:56,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:56,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:58:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 11:58:56,839 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 19 [2018-11-23 11:58:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:56,840 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 11:58:56,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 11:58:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:58:56,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:56,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:56,842 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:56,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:56,842 INFO L82 PathProgramCache]: Analyzing trace with hash -825329612, now seen corresponding path program 1 times [2018-11-23 11:58:56,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:56,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:56,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:56,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:56,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:56,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2018-11-23 11:58:56,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {512#true} is VALID [2018-11-23 11:58:56,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2018-11-23 11:58:56,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #77#return; {512#true} is VALID [2018-11-23 11:58:56,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret9 := main(); {512#true} is VALID [2018-11-23 11:58:56,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {512#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {514#(= main_~a~0 0)} is VALID [2018-11-23 11:58:56,986 INFO L273 TraceCheckUtils]: 6: Hoare triple {514#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {514#(= main_~a~0 0)} is VALID [2018-11-23 11:58:56,986 INFO L273 TraceCheckUtils]: 7: Hoare triple {514#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {515#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:56,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {515#(<= main_~a~0 1)} assume !(~a~0 < 100000); {513#false} is VALID [2018-11-23 11:58:56,988 INFO L273 TraceCheckUtils]: 9: Hoare triple {513#false} havoc ~i~0;~i~0 := 0; {513#false} is VALID [2018-11-23 11:58:56,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {513#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {513#false} is VALID [2018-11-23 11:58:56,989 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {513#false} is VALID [2018-11-23 11:58:56,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#false} assume !(~i~0 < 100000); {513#false} is VALID [2018-11-23 11:58:56,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {513#false} ~i~0 := 0; {513#false} is VALID [2018-11-23 11:58:56,990 INFO L273 TraceCheckUtils]: 14: Hoare triple {513#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {513#false} is VALID [2018-11-23 11:58:56,990 INFO L273 TraceCheckUtils]: 15: Hoare triple {513#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {513#false} is VALID [2018-11-23 11:58:56,990 INFO L273 TraceCheckUtils]: 16: Hoare triple {513#false} assume !(~i~0 < 100000); {513#false} is VALID [2018-11-23 11:58:56,991 INFO L273 TraceCheckUtils]: 17: Hoare triple {513#false} havoc ~x~0;~x~0 := 0; {513#false} is VALID [2018-11-23 11:58:56,991 INFO L273 TraceCheckUtils]: 18: Hoare triple {513#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {513#false} is VALID [2018-11-23 11:58:56,991 INFO L256 TraceCheckUtils]: 19: Hoare triple {513#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {513#false} is VALID [2018-11-23 11:58:56,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {513#false} ~cond := #in~cond; {513#false} is VALID [2018-11-23 11:58:56,991 INFO L273 TraceCheckUtils]: 21: Hoare triple {513#false} assume 0 == ~cond; {513#false} is VALID [2018-11-23 11:58:56,992 INFO L273 TraceCheckUtils]: 22: Hoare triple {513#false} assume !false; {513#false} is VALID [2018-11-23 11:58:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:58:56,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:56,993 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 11:58:57,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:57,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:57,347 INFO L256 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2018-11-23 11:58:57,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {512#true} is VALID [2018-11-23 11:58:57,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2018-11-23 11:58:57,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #77#return; {512#true} is VALID [2018-11-23 11:58:57,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret9 := main(); {512#true} is VALID [2018-11-23 11:58:57,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {512#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {534#(<= main_~a~0 0)} is VALID [2018-11-23 11:58:57,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {534#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {534#(<= main_~a~0 0)} is VALID [2018-11-23 11:58:57,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {534#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {515#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:57,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {515#(<= main_~a~0 1)} assume !(~a~0 < 100000); {513#false} is VALID [2018-11-23 11:58:57,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {513#false} havoc ~i~0;~i~0 := 0; {513#false} is VALID [2018-11-23 11:58:57,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {513#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {513#false} is VALID [2018-11-23 11:58:57,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {513#false} is VALID [2018-11-23 11:58:57,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#false} assume !(~i~0 < 100000); {513#false} is VALID [2018-11-23 11:58:57,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {513#false} ~i~0 := 0; {513#false} is VALID [2018-11-23 11:58:57,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {513#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {513#false} is VALID [2018-11-23 11:58:57,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {513#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {513#false} is VALID [2018-11-23 11:58:57,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {513#false} assume !(~i~0 < 100000); {513#false} is VALID [2018-11-23 11:58:57,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {513#false} havoc ~x~0;~x~0 := 0; {513#false} is VALID [2018-11-23 11:58:57,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {513#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {513#false} is VALID [2018-11-23 11:58:57,357 INFO L256 TraceCheckUtils]: 19: Hoare triple {513#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {513#false} is VALID [2018-11-23 11:58:57,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {513#false} ~cond := #in~cond; {513#false} is VALID [2018-11-23 11:58:57,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {513#false} assume 0 == ~cond; {513#false} is VALID [2018-11-23 11:58:57,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {513#false} assume !false; {513#false} is VALID [2018-11-23 11:58:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:58:57,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:57,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:58:57,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 11:58:57,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:57,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:58:57,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:57,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:58:57,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:58:57,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:57,536 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2018-11-23 11:58:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:57,864 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 11:58:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:58:57,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 11:58:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-23 11:58:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-23 11:58:57,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2018-11-23 11:58:58,003 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 11:58:58,004 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:58:58,005 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:58:58,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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 11:58:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:58:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 11:58:58,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:58,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 11:58:58,024 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 11:58:58,024 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 11:58:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,026 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 11:58:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 11:58:58,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:58,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:58,028 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 11:58:58,028 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 11:58:58,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,030 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 11:58:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 11:58:58,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:58,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:58,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:58,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:58:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-23 11:58:58,033 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2018-11-23 11:58:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:58,034 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-23 11:58:58,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:58:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 11:58:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:58:58,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:58,035 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:58,036 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:58,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:58,036 INFO L82 PathProgramCache]: Analyzing trace with hash -425990958, now seen corresponding path program 2 times [2018-11-23 11:58:58,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:58,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:58,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:58,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:58,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:58,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {762#true} call ULTIMATE.init(); {762#true} is VALID [2018-11-23 11:58:58,163 INFO L273 TraceCheckUtils]: 1: Hoare triple {762#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {762#true} is VALID [2018-11-23 11:58:58,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {762#true} assume true; {762#true} is VALID [2018-11-23 11:58:58,163 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {762#true} {762#true} #77#return; {762#true} is VALID [2018-11-23 11:58:58,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {762#true} call #t~ret9 := main(); {762#true} is VALID [2018-11-23 11:58:58,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {762#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {764#(= main_~a~0 0)} is VALID [2018-11-23 11:58:58,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {764#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {764#(= main_~a~0 0)} is VALID [2018-11-23 11:58:58,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {764#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {765#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:58,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {765#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {765#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:58,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {765#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {766#(<= main_~a~0 2)} is VALID [2018-11-23 11:58:58,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {766#(<= main_~a~0 2)} assume !(~a~0 < 100000); {763#false} is VALID [2018-11-23 11:58:58,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {763#false} havoc ~i~0;~i~0 := 0; {763#false} is VALID [2018-11-23 11:58:58,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {763#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {763#false} is VALID [2018-11-23 11:58:58,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {763#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {763#false} is VALID [2018-11-23 11:58:58,176 INFO L273 TraceCheckUtils]: 14: Hoare triple {763#false} assume !(~i~0 < 100000); {763#false} is VALID [2018-11-23 11:58:58,177 INFO L273 TraceCheckUtils]: 15: Hoare triple {763#false} ~i~0 := 0; {763#false} is VALID [2018-11-23 11:58:58,177 INFO L273 TraceCheckUtils]: 16: Hoare triple {763#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {763#false} is VALID [2018-11-23 11:58:58,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {763#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {763#false} is VALID [2018-11-23 11:58:58,178 INFO L273 TraceCheckUtils]: 18: Hoare triple {763#false} assume !(~i~0 < 100000); {763#false} is VALID [2018-11-23 11:58:58,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {763#false} havoc ~x~0;~x~0 := 0; {763#false} is VALID [2018-11-23 11:58:58,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {763#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {763#false} is VALID [2018-11-23 11:58:58,178 INFO L256 TraceCheckUtils]: 21: Hoare triple {763#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {763#false} is VALID [2018-11-23 11:58:58,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {763#false} ~cond := #in~cond; {763#false} is VALID [2018-11-23 11:58:58,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {763#false} assume 0 == ~cond; {763#false} is VALID [2018-11-23 11:58:58,179 INFO L273 TraceCheckUtils]: 24: Hoare triple {763#false} assume !false; {763#false} is VALID [2018-11-23 11:58:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:58:58,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:58,181 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 11:58:58,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:58,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:58,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:58,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:58,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {762#true} call ULTIMATE.init(); {762#true} is VALID [2018-11-23 11:58:58,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {762#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {762#true} is VALID [2018-11-23 11:58:58,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {762#true} assume true; {762#true} is VALID [2018-11-23 11:58:58,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {762#true} {762#true} #77#return; {762#true} is VALID [2018-11-23 11:58:58,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {762#true} call #t~ret9 := main(); {762#true} is VALID [2018-11-23 11:58:58,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {762#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {762#true} is VALID [2018-11-23 11:58:58,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {762#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {762#true} is VALID [2018-11-23 11:58:58,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {762#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {762#true} is VALID [2018-11-23 11:58:58,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {762#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {762#true} is VALID [2018-11-23 11:58:58,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {762#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {762#true} is VALID [2018-11-23 11:58:58,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {762#true} assume !(~a~0 < 100000); {762#true} is VALID [2018-11-23 11:58:58,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {762#true} havoc ~i~0;~i~0 := 0; {762#true} is VALID [2018-11-23 11:58:58,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {762#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {762#true} is VALID [2018-11-23 11:58:58,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {762#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {762#true} is VALID [2018-11-23 11:58:58,341 INFO L273 TraceCheckUtils]: 14: Hoare triple {762#true} assume !(~i~0 < 100000); {762#true} is VALID [2018-11-23 11:58:58,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {762#true} ~i~0 := 0; {815#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:58,345 INFO L273 TraceCheckUtils]: 16: Hoare triple {815#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {815#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:58,346 INFO L273 TraceCheckUtils]: 17: Hoare triple {815#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {822#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {822#(<= main_~i~0 1)} assume !(~i~0 < 100000); {763#false} is VALID [2018-11-23 11:58:58,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {763#false} havoc ~x~0;~x~0 := 0; {763#false} is VALID [2018-11-23 11:58:58,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {763#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {763#false} is VALID [2018-11-23 11:58:58,353 INFO L256 TraceCheckUtils]: 21: Hoare triple {763#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {763#false} is VALID [2018-11-23 11:58:58,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {763#false} ~cond := #in~cond; {763#false} is VALID [2018-11-23 11:58:58,353 INFO L273 TraceCheckUtils]: 23: Hoare triple {763#false} assume 0 == ~cond; {763#false} is VALID [2018-11-23 11:58:58,353 INFO L273 TraceCheckUtils]: 24: Hoare triple {763#false} assume !false; {763#false} is VALID [2018-11-23 11:58:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:58:58,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:58,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 11:58:58,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:58:58,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:58,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:58:58,418 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 11:58:58,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:58:58,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:58:58,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:58:58,419 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2018-11-23 11:58:58,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,808 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-23 11:58:58,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:58:58,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:58:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:58:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2018-11-23 11:58:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:58:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2018-11-23 11:58:58,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2018-11-23 11:58:58,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:58,909 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:58:58,910 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:58:58,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:58:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:58:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 11:58:58,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:58,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2018-11-23 11:58:58,928 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2018-11-23 11:58:58,928 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2018-11-23 11:58:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,931 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 11:58:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 11:58:58,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:58,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:58,933 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2018-11-23 11:58:58,933 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2018-11-23 11:58:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,935 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 11:58:58,935 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 11:58:58,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:58,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:58,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:58,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:58:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-11-23 11:58:58,938 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 25 [2018-11-23 11:58:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:58,939 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-23 11:58:58,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:58:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 11:58:58,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:58:58,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:58,940 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:58,941 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:58,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:58,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2001812716, now seen corresponding path program 3 times [2018-11-23 11:58:58,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:58,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:58,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:58,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:59,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2018-11-23 11:58:59,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {1056#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1056#true} is VALID [2018-11-23 11:58:59,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {1056#true} assume true; {1056#true} is VALID [2018-11-23 11:58:59,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} #77#return; {1056#true} is VALID [2018-11-23 11:58:59,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {1056#true} call #t~ret9 := main(); {1056#true} is VALID [2018-11-23 11:58:59,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {1056#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1058#(= main_~a~0 0)} is VALID [2018-11-23 11:58:59,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {1058#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1058#(= main_~a~0 0)} is VALID [2018-11-23 11:58:59,111 INFO L273 TraceCheckUtils]: 7: Hoare triple {1058#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1059#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:59,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {1059#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1059#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:59,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {1059#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1060#(<= main_~a~0 2)} is VALID [2018-11-23 11:58:59,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {1060#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1060#(<= main_~a~0 2)} is VALID [2018-11-23 11:58:59,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {1060#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1061#(<= main_~a~0 3)} is VALID [2018-11-23 11:58:59,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {1061#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1057#false} is VALID [2018-11-23 11:58:59,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {1057#false} havoc ~i~0;~i~0 := 0; {1057#false} is VALID [2018-11-23 11:58:59,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {1057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1057#false} is VALID [2018-11-23 11:58:59,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {1057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1057#false} is VALID [2018-11-23 11:58:59,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {1057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1057#false} is VALID [2018-11-23 11:58:59,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {1057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1057#false} is VALID [2018-11-23 11:58:59,174 INFO L273 TraceCheckUtils]: 18: Hoare triple {1057#false} assume !(~i~0 < 100000); {1057#false} is VALID [2018-11-23 11:58:59,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {1057#false} ~i~0 := 0; {1057#false} is VALID [2018-11-23 11:58:59,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {1057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1057#false} is VALID [2018-11-23 11:58:59,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {1057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1057#false} is VALID [2018-11-23 11:58:59,175 INFO L273 TraceCheckUtils]: 22: Hoare triple {1057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1057#false} is VALID [2018-11-23 11:58:59,175 INFO L273 TraceCheckUtils]: 23: Hoare triple {1057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1057#false} is VALID [2018-11-23 11:58:59,176 INFO L273 TraceCheckUtils]: 24: Hoare triple {1057#false} assume !(~i~0 < 100000); {1057#false} is VALID [2018-11-23 11:58:59,176 INFO L273 TraceCheckUtils]: 25: Hoare triple {1057#false} havoc ~x~0;~x~0 := 0; {1057#false} is VALID [2018-11-23 11:58:59,176 INFO L273 TraceCheckUtils]: 26: Hoare triple {1057#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1057#false} is VALID [2018-11-23 11:58:59,176 INFO L256 TraceCheckUtils]: 27: Hoare triple {1057#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1057#false} is VALID [2018-11-23 11:58:59,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2018-11-23 11:58:59,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2018-11-23 11:58:59,177 INFO L273 TraceCheckUtils]: 30: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2018-11-23 11:58:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 11:58:59,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:59,179 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 11:58:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:59,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:58:59,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:59,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:59,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2018-11-23 11:58:59,352 INFO L273 TraceCheckUtils]: 1: Hoare triple {1056#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1056#true} is VALID [2018-11-23 11:58:59,352 INFO L273 TraceCheckUtils]: 2: Hoare triple {1056#true} assume true; {1056#true} is VALID [2018-11-23 11:58:59,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} #77#return; {1056#true} is VALID [2018-11-23 11:58:59,353 INFO L256 TraceCheckUtils]: 4: Hoare triple {1056#true} call #t~ret9 := main(); {1056#true} is VALID [2018-11-23 11:58:59,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {1056#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1056#true} is VALID [2018-11-23 11:58:59,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {1056#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1056#true} is VALID [2018-11-23 11:58:59,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {1056#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1056#true} is VALID [2018-11-23 11:58:59,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {1056#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1056#true} is VALID [2018-11-23 11:58:59,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {1056#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1056#true} is VALID [2018-11-23 11:58:59,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {1056#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1056#true} is VALID [2018-11-23 11:58:59,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {1056#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1056#true} is VALID [2018-11-23 11:58:59,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {1056#true} assume !(~a~0 < 100000); {1056#true} is VALID [2018-11-23 11:58:59,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {1056#true} havoc ~i~0;~i~0 := 0; {1056#true} is VALID [2018-11-23 11:58:59,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {1056#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1056#true} is VALID [2018-11-23 11:58:59,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {1056#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1056#true} is VALID [2018-11-23 11:58:59,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {1056#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1056#true} is VALID [2018-11-23 11:58:59,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {1056#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1056#true} is VALID [2018-11-23 11:58:59,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {1056#true} assume !(~i~0 < 100000); {1056#true} is VALID [2018-11-23 11:58:59,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {1056#true} ~i~0 := 0; {1122#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:59,363 INFO L273 TraceCheckUtils]: 20: Hoare triple {1122#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1122#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:59,382 INFO L273 TraceCheckUtils]: 21: Hoare triple {1122#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1129#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:59,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {1129#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1129#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:59,405 INFO L273 TraceCheckUtils]: 23: Hoare triple {1129#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1136#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:59,411 INFO L273 TraceCheckUtils]: 24: Hoare triple {1136#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1057#false} is VALID [2018-11-23 11:58:59,411 INFO L273 TraceCheckUtils]: 25: Hoare triple {1057#false} havoc ~x~0;~x~0 := 0; {1057#false} is VALID [2018-11-23 11:58:59,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {1057#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1057#false} is VALID [2018-11-23 11:58:59,412 INFO L256 TraceCheckUtils]: 27: Hoare triple {1057#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1057#false} is VALID [2018-11-23 11:58:59,412 INFO L273 TraceCheckUtils]: 28: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2018-11-23 11:58:59,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2018-11-23 11:58:59,412 INFO L273 TraceCheckUtils]: 30: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2018-11-23 11:58:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:58:59,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:59,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:58:59,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:58:59,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:59,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:58:59,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:59,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:58:59,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:58:59,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:58:59,489 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 9 states. [2018-11-23 11:58:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,774 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2018-11-23 11:58:59,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:58:59,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:58:59,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:58:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2018-11-23 11:58:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:58:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2018-11-23 11:58:59,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2018-11-23 11:58:59,883 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 11:58:59,885 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:58:59,886 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:58:59,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:58:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:58:59,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 11:58:59,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:59,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-23 11:58:59,922 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-23 11:58:59,922 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-23 11:58:59,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,924 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-23 11:58:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-23 11:58:59,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:59,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:59,926 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-23 11:58:59,926 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-23 11:58:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,928 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-23 11:58:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-23 11:58:59,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:59,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:59,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:59,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:58:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-23 11:58:59,932 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 31 [2018-11-23 11:58:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:59,932 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-23 11:58:59,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:58:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 11:58:59,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:58:59,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:59,934 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:59,934 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:59,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:59,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1767528838, now seen corresponding path program 4 times [2018-11-23 11:58:59,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:59,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:59,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:59,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:59,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:00,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {1406#true} call ULTIMATE.init(); {1406#true} is VALID [2018-11-23 11:59:00,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {1406#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1406#true} is VALID [2018-11-23 11:59:00,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {1406#true} assume true; {1406#true} is VALID [2018-11-23 11:59:00,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1406#true} {1406#true} #77#return; {1406#true} is VALID [2018-11-23 11:59:00,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {1406#true} call #t~ret9 := main(); {1406#true} is VALID [2018-11-23 11:59:00,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {1406#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1408#(= main_~a~0 0)} is VALID [2018-11-23 11:59:00,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {1408#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1408#(= main_~a~0 0)} is VALID [2018-11-23 11:59:00,222 INFO L273 TraceCheckUtils]: 7: Hoare triple {1408#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1409#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:00,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {1409#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1409#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:00,223 INFO L273 TraceCheckUtils]: 9: Hoare triple {1409#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1410#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:00,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {1410#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1410#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:00,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {1410#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1411#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:00,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {1411#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1411#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:00,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {1411#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1412#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:00,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {1412#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1407#false} is VALID [2018-11-23 11:59:00,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {1407#false} havoc ~i~0;~i~0 := 0; {1407#false} is VALID [2018-11-23 11:59:00,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1407#false} is VALID [2018-11-23 11:59:00,228 INFO L273 TraceCheckUtils]: 17: Hoare triple {1407#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1407#false} is VALID [2018-11-23 11:59:00,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1407#false} is VALID [2018-11-23 11:59:00,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {1407#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1407#false} is VALID [2018-11-23 11:59:00,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1407#false} is VALID [2018-11-23 11:59:00,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {1407#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1407#false} is VALID [2018-11-23 11:59:00,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {1407#false} assume !(~i~0 < 100000); {1407#false} is VALID [2018-11-23 11:59:00,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {1407#false} ~i~0 := 0; {1407#false} is VALID [2018-11-23 11:59:00,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1407#false} is VALID [2018-11-23 11:59:00,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {1407#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1407#false} is VALID [2018-11-23 11:59:00,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1407#false} is VALID [2018-11-23 11:59:00,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {1407#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1407#false} is VALID [2018-11-23 11:59:00,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1407#false} is VALID [2018-11-23 11:59:00,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {1407#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1407#false} is VALID [2018-11-23 11:59:00,232 INFO L273 TraceCheckUtils]: 30: Hoare triple {1407#false} assume !(~i~0 < 100000); {1407#false} is VALID [2018-11-23 11:59:00,232 INFO L273 TraceCheckUtils]: 31: Hoare triple {1407#false} havoc ~x~0;~x~0 := 0; {1407#false} is VALID [2018-11-23 11:59:00,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {1407#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1407#false} is VALID [2018-11-23 11:59:00,233 INFO L256 TraceCheckUtils]: 33: Hoare triple {1407#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1407#false} is VALID [2018-11-23 11:59:00,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {1407#false} ~cond := #in~cond; {1407#false} is VALID [2018-11-23 11:59:00,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {1407#false} assume 0 == ~cond; {1407#false} is VALID [2018-11-23 11:59:00,233 INFO L273 TraceCheckUtils]: 36: Hoare triple {1407#false} assume !false; {1407#false} is VALID [2018-11-23 11:59:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:59:00,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:00,236 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 11:59:00,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:00,304 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:00,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:00,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:00,498 INFO L256 TraceCheckUtils]: 0: Hoare triple {1406#true} call ULTIMATE.init(); {1406#true} is VALID [2018-11-23 11:59:00,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {1406#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1406#true} is VALID [2018-11-23 11:59:00,499 INFO L273 TraceCheckUtils]: 2: Hoare triple {1406#true} assume true; {1406#true} is VALID [2018-11-23 11:59:00,499 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1406#true} {1406#true} #77#return; {1406#true} is VALID [2018-11-23 11:59:00,500 INFO L256 TraceCheckUtils]: 4: Hoare triple {1406#true} call #t~ret9 := main(); {1406#true} is VALID [2018-11-23 11:59:00,502 INFO L273 TraceCheckUtils]: 5: Hoare triple {1406#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1431#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:00,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {1431#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1431#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:00,507 INFO L273 TraceCheckUtils]: 7: Hoare triple {1431#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1409#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:00,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {1409#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1409#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:00,510 INFO L273 TraceCheckUtils]: 9: Hoare triple {1409#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1410#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:00,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {1410#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1410#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:00,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {1410#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1411#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:00,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {1411#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1411#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:00,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {1411#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1412#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:00,513 INFO L273 TraceCheckUtils]: 14: Hoare triple {1412#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1407#false} is VALID [2018-11-23 11:59:00,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {1407#false} havoc ~i~0;~i~0 := 0; {1407#false} is VALID [2018-11-23 11:59:00,513 INFO L273 TraceCheckUtils]: 16: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1407#false} is VALID [2018-11-23 11:59:00,514 INFO L273 TraceCheckUtils]: 17: Hoare triple {1407#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1407#false} is VALID [2018-11-23 11:59:00,514 INFO L273 TraceCheckUtils]: 18: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1407#false} is VALID [2018-11-23 11:59:00,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {1407#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1407#false} is VALID [2018-11-23 11:59:00,514 INFO L273 TraceCheckUtils]: 20: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1407#false} is VALID [2018-11-23 11:59:00,515 INFO L273 TraceCheckUtils]: 21: Hoare triple {1407#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1407#false} is VALID [2018-11-23 11:59:00,515 INFO L273 TraceCheckUtils]: 22: Hoare triple {1407#false} assume !(~i~0 < 100000); {1407#false} is VALID [2018-11-23 11:59:00,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {1407#false} ~i~0 := 0; {1407#false} is VALID [2018-11-23 11:59:00,516 INFO L273 TraceCheckUtils]: 24: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1407#false} is VALID [2018-11-23 11:59:00,516 INFO L273 TraceCheckUtils]: 25: Hoare triple {1407#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1407#false} is VALID [2018-11-23 11:59:00,516 INFO L273 TraceCheckUtils]: 26: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1407#false} is VALID [2018-11-23 11:59:00,517 INFO L273 TraceCheckUtils]: 27: Hoare triple {1407#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1407#false} is VALID [2018-11-23 11:59:00,517 INFO L273 TraceCheckUtils]: 28: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1407#false} is VALID [2018-11-23 11:59:00,517 INFO L273 TraceCheckUtils]: 29: Hoare triple {1407#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1407#false} is VALID [2018-11-23 11:59:00,518 INFO L273 TraceCheckUtils]: 30: Hoare triple {1407#false} assume !(~i~0 < 100000); {1407#false} is VALID [2018-11-23 11:59:00,518 INFO L273 TraceCheckUtils]: 31: Hoare triple {1407#false} havoc ~x~0;~x~0 := 0; {1407#false} is VALID [2018-11-23 11:59:00,518 INFO L273 TraceCheckUtils]: 32: Hoare triple {1407#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1407#false} is VALID [2018-11-23 11:59:00,518 INFO L256 TraceCheckUtils]: 33: Hoare triple {1407#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1407#false} is VALID [2018-11-23 11:59:00,519 INFO L273 TraceCheckUtils]: 34: Hoare triple {1407#false} ~cond := #in~cond; {1407#false} is VALID [2018-11-23 11:59:00,519 INFO L273 TraceCheckUtils]: 35: Hoare triple {1407#false} assume 0 == ~cond; {1407#false} is VALID [2018-11-23 11:59:00,519 INFO L273 TraceCheckUtils]: 36: Hoare triple {1407#false} assume !false; {1407#false} is VALID [2018-11-23 11:59:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:59:00,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:00,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:59:00,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 11:59:00,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:00,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:59:00,611 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 11:59:00,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:59:00,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:59:00,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:59:00,612 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 8 states. [2018-11-23 11:59:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,811 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-23 11:59:00,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:59:00,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 11:59:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:59:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-23 11:59:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:59:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-23 11:59:00,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2018-11-23 11:59:00,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:00,926 INFO L225 Difference]: With dead ends: 72 [2018-11-23 11:59:00,926 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:59:00,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:59:00,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:59:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 11:59:00,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:00,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-23 11:59:00,962 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-23 11:59:00,962 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-23 11:59:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,964 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-23 11:59:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-23 11:59:00,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:00,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:00,965 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-23 11:59:00,965 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-23 11:59:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,967 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-23 11:59:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-23 11:59:00,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:00,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:00,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:00,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:59:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-23 11:59:00,969 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 37 [2018-11-23 11:59:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:00,970 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-23 11:59:00,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:59:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-23 11:59:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:59:00,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:00,971 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:00,971 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:00,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1554405796, now seen corresponding path program 5 times [2018-11-23 11:59:00,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:00,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:00,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:00,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:00,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:01,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {1783#true} call ULTIMATE.init(); {1783#true} is VALID [2018-11-23 11:59:01,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {1783#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1783#true} is VALID [2018-11-23 11:59:01,127 INFO L273 TraceCheckUtils]: 2: Hoare triple {1783#true} assume true; {1783#true} is VALID [2018-11-23 11:59:01,127 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1783#true} {1783#true} #77#return; {1783#true} is VALID [2018-11-23 11:59:01,128 INFO L256 TraceCheckUtils]: 4: Hoare triple {1783#true} call #t~ret9 := main(); {1783#true} is VALID [2018-11-23 11:59:01,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {1783#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1785#(= main_~a~0 0)} is VALID [2018-11-23 11:59:01,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {1785#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1785#(= main_~a~0 0)} is VALID [2018-11-23 11:59:01,130 INFO L273 TraceCheckUtils]: 7: Hoare triple {1785#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1786#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:01,130 INFO L273 TraceCheckUtils]: 8: Hoare triple {1786#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1786#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:01,131 INFO L273 TraceCheckUtils]: 9: Hoare triple {1786#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1787#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:01,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {1787#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1787#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:01,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {1787#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1788#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:01,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {1788#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1788#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:01,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {1788#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1789#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:01,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {1789#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1789#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:01,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {1789#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1790#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:01,143 INFO L273 TraceCheckUtils]: 16: Hoare triple {1790#(<= main_~a~0 5)} assume !(~a~0 < 100000); {1784#false} is VALID [2018-11-23 11:59:01,143 INFO L273 TraceCheckUtils]: 17: Hoare triple {1784#false} havoc ~i~0;~i~0 := 0; {1784#false} is VALID [2018-11-23 11:59:01,143 INFO L273 TraceCheckUtils]: 18: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1784#false} is VALID [2018-11-23 11:59:01,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {1784#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1784#false} is VALID [2018-11-23 11:59:01,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1784#false} is VALID [2018-11-23 11:59:01,144 INFO L273 TraceCheckUtils]: 21: Hoare triple {1784#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1784#false} is VALID [2018-11-23 11:59:01,144 INFO L273 TraceCheckUtils]: 22: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1784#false} is VALID [2018-11-23 11:59:01,144 INFO L273 TraceCheckUtils]: 23: Hoare triple {1784#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1784#false} is VALID [2018-11-23 11:59:01,145 INFO L273 TraceCheckUtils]: 24: Hoare triple {1784#false} assume !(~i~0 < 100000); {1784#false} is VALID [2018-11-23 11:59:01,145 INFO L273 TraceCheckUtils]: 25: Hoare triple {1784#false} ~i~0 := 0; {1784#false} is VALID [2018-11-23 11:59:01,145 INFO L273 TraceCheckUtils]: 26: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1784#false} is VALID [2018-11-23 11:59:01,145 INFO L273 TraceCheckUtils]: 27: Hoare triple {1784#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1784#false} is VALID [2018-11-23 11:59:01,146 INFO L273 TraceCheckUtils]: 28: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1784#false} is VALID [2018-11-23 11:59:01,146 INFO L273 TraceCheckUtils]: 29: Hoare triple {1784#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1784#false} is VALID [2018-11-23 11:59:01,146 INFO L273 TraceCheckUtils]: 30: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1784#false} is VALID [2018-11-23 11:59:01,146 INFO L273 TraceCheckUtils]: 31: Hoare triple {1784#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1784#false} is VALID [2018-11-23 11:59:01,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {1784#false} assume !(~i~0 < 100000); {1784#false} is VALID [2018-11-23 11:59:01,147 INFO L273 TraceCheckUtils]: 33: Hoare triple {1784#false} havoc ~x~0;~x~0 := 0; {1784#false} is VALID [2018-11-23 11:59:01,147 INFO L273 TraceCheckUtils]: 34: Hoare triple {1784#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1784#false} is VALID [2018-11-23 11:59:01,147 INFO L256 TraceCheckUtils]: 35: Hoare triple {1784#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1784#false} is VALID [2018-11-23 11:59:01,147 INFO L273 TraceCheckUtils]: 36: Hoare triple {1784#false} ~cond := #in~cond; {1784#false} is VALID [2018-11-23 11:59:01,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {1784#false} assume 0 == ~cond; {1784#false} is VALID [2018-11-23 11:59:01,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {1784#false} assume !false; {1784#false} is VALID [2018-11-23 11:59:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:59:01,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:01,149 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 11:59:01,162 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:01,337 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:59:01,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:01,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:01,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {1783#true} call ULTIMATE.init(); {1783#true} is VALID [2018-11-23 11:59:01,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {1783#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1783#true} is VALID [2018-11-23 11:59:01,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {1783#true} assume true; {1783#true} is VALID [2018-11-23 11:59:01,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1783#true} {1783#true} #77#return; {1783#true} is VALID [2018-11-23 11:59:01,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {1783#true} call #t~ret9 := main(); {1783#true} is VALID [2018-11-23 11:59:01,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {1783#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1783#true} is VALID [2018-11-23 11:59:01,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {1783#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1783#true} is VALID [2018-11-23 11:59:01,585 INFO L273 TraceCheckUtils]: 7: Hoare triple {1783#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1783#true} is VALID [2018-11-23 11:59:01,585 INFO L273 TraceCheckUtils]: 8: Hoare triple {1783#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1783#true} is VALID [2018-11-23 11:59:01,585 INFO L273 TraceCheckUtils]: 9: Hoare triple {1783#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1783#true} is VALID [2018-11-23 11:59:01,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {1783#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1783#true} is VALID [2018-11-23 11:59:01,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {1783#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1783#true} is VALID [2018-11-23 11:59:01,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {1783#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1783#true} is VALID [2018-11-23 11:59:01,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {1783#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1783#true} is VALID [2018-11-23 11:59:01,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {1783#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1783#true} is VALID [2018-11-23 11:59:01,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {1783#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1783#true} is VALID [2018-11-23 11:59:01,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {1783#true} assume !(~a~0 < 100000); {1783#true} is VALID [2018-11-23 11:59:01,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {1783#true} havoc ~i~0;~i~0 := 0; {1845#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:01,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {1845#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1845#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:01,589 INFO L273 TraceCheckUtils]: 19: Hoare triple {1845#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1852#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:01,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {1852#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1852#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:01,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {1852#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1859#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,610 INFO L273 TraceCheckUtils]: 22: Hoare triple {1859#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1859#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {1859#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1866#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {1866#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1784#false} is VALID [2018-11-23 11:59:01,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {1784#false} ~i~0 := 0; {1784#false} is VALID [2018-11-23 11:59:01,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1784#false} is VALID [2018-11-23 11:59:01,612 INFO L273 TraceCheckUtils]: 27: Hoare triple {1784#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1784#false} is VALID [2018-11-23 11:59:01,613 INFO L273 TraceCheckUtils]: 28: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1784#false} is VALID [2018-11-23 11:59:01,613 INFO L273 TraceCheckUtils]: 29: Hoare triple {1784#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1784#false} is VALID [2018-11-23 11:59:01,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1784#false} is VALID [2018-11-23 11:59:01,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {1784#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1784#false} is VALID [2018-11-23 11:59:01,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {1784#false} assume !(~i~0 < 100000); {1784#false} is VALID [2018-11-23 11:59:01,614 INFO L273 TraceCheckUtils]: 33: Hoare triple {1784#false} havoc ~x~0;~x~0 := 0; {1784#false} is VALID [2018-11-23 11:59:01,614 INFO L273 TraceCheckUtils]: 34: Hoare triple {1784#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1784#false} is VALID [2018-11-23 11:59:01,615 INFO L256 TraceCheckUtils]: 35: Hoare triple {1784#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {1784#false} is VALID [2018-11-23 11:59:01,615 INFO L273 TraceCheckUtils]: 36: Hoare triple {1784#false} ~cond := #in~cond; {1784#false} is VALID [2018-11-23 11:59:01,615 INFO L273 TraceCheckUtils]: 37: Hoare triple {1784#false} assume 0 == ~cond; {1784#false} is VALID [2018-11-23 11:59:01,616 INFO L273 TraceCheckUtils]: 38: Hoare triple {1784#false} assume !false; {1784#false} is VALID [2018-11-23 11:59:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 11:59:01,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:01,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 11:59:01,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-23 11:59:01,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:01,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:59:01,688 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 11:59:01,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:01,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:01,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:01,690 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 12 states. [2018-11-23 11:59:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,121 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 11:59:02,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:59:02,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-23 11:59:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2018-11-23 11:59:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2018-11-23 11:59:02,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 78 transitions. [2018-11-23 11:59:02,411 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 11:59:02,413 INFO L225 Difference]: With dead ends: 80 [2018-11-23 11:59:02,413 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:59:02,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:59:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-11-23 11:59:02,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:02,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 50 states. [2018-11-23 11:59:02,450 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 50 states. [2018-11-23 11:59:02,450 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 50 states. [2018-11-23 11:59:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,453 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 11:59:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 11:59:02,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,454 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 53 states. [2018-11-23 11:59:02,454 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 53 states. [2018-11-23 11:59:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,456 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 11:59:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 11:59:02,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:02,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:59:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-23 11:59:02,459 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 39 [2018-11-23 11:59:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:02,459 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-23 11:59:02,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-23 11:59:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:59:02,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:02,461 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:02,461 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:02,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:02,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1783680062, now seen corresponding path program 6 times [2018-11-23 11:59:02,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:02,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:02,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:02,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:02,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 11:59:02,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 11:59:02,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 11:59:02,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #77#return; {2206#true} is VALID [2018-11-23 11:59:02,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret9 := main(); {2206#true} is VALID [2018-11-23 11:59:02,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2208#(= main_~a~0 0)} is VALID [2018-11-23 11:59:02,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2208#(= main_~a~0 0)} is VALID [2018-11-23 11:59:02,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {2208#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2209#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:02,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2209#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:02,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {2209#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2210#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:02,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2210#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:02,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {2210#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2211#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:02,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2211#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:02,735 INFO L273 TraceCheckUtils]: 13: Hoare triple {2211#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2212#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:02,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2212#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:02,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {2212#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2213#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:02,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2213#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:02,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {2213#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2214#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:02,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {2214#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2207#false} is VALID [2018-11-23 11:59:02,740 INFO L273 TraceCheckUtils]: 19: Hoare triple {2207#false} havoc ~i~0;~i~0 := 0; {2207#false} is VALID [2018-11-23 11:59:02,740 INFO L273 TraceCheckUtils]: 20: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2207#false} is VALID [2018-11-23 11:59:02,741 INFO L273 TraceCheckUtils]: 21: Hoare triple {2207#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2207#false} is VALID [2018-11-23 11:59:02,741 INFO L273 TraceCheckUtils]: 22: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2207#false} is VALID [2018-11-23 11:59:02,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {2207#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2207#false} is VALID [2018-11-23 11:59:02,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2207#false} is VALID [2018-11-23 11:59:02,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2207#false} is VALID [2018-11-23 11:59:02,742 INFO L273 TraceCheckUtils]: 26: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2207#false} is VALID [2018-11-23 11:59:02,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2207#false} is VALID [2018-11-23 11:59:02,742 INFO L273 TraceCheckUtils]: 28: Hoare triple {2207#false} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 11:59:02,742 INFO L273 TraceCheckUtils]: 29: Hoare triple {2207#false} ~i~0 := 0; {2207#false} is VALID [2018-11-23 11:59:02,743 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2207#false} is VALID [2018-11-23 11:59:02,743 INFO L273 TraceCheckUtils]: 31: Hoare triple {2207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2207#false} is VALID [2018-11-23 11:59:02,743 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2207#false} is VALID [2018-11-23 11:59:02,743 INFO L273 TraceCheckUtils]: 33: Hoare triple {2207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2207#false} is VALID [2018-11-23 11:59:02,743 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2207#false} is VALID [2018-11-23 11:59:02,744 INFO L273 TraceCheckUtils]: 35: Hoare triple {2207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2207#false} is VALID [2018-11-23 11:59:02,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2207#false} is VALID [2018-11-23 11:59:02,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {2207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2207#false} is VALID [2018-11-23 11:59:02,744 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#false} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 11:59:02,744 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} havoc ~x~0;~x~0 := 0; {2207#false} is VALID [2018-11-23 11:59:02,745 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {2207#false} is VALID [2018-11-23 11:59:02,745 INFO L256 TraceCheckUtils]: 41: Hoare triple {2207#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {2207#false} is VALID [2018-11-23 11:59:02,745 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} ~cond := #in~cond; {2207#false} is VALID [2018-11-23 11:59:02,745 INFO L273 TraceCheckUtils]: 43: Hoare triple {2207#false} assume 0 == ~cond; {2207#false} is VALID [2018-11-23 11:59:02,745 INFO L273 TraceCheckUtils]: 44: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 11:59:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 11:59:02,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:02,747 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 11:59:02,769 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:02,893 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:59:02,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:02,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:03,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 11:59:03,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 11:59:03,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 11:59:03,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #77#return; {2206#true} is VALID [2018-11-23 11:59:03,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret9 := main(); {2206#true} is VALID [2018-11-23 11:59:03,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2206#true} is VALID [2018-11-23 11:59:03,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2206#true} is VALID [2018-11-23 11:59:03,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {2206#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 11:59:03,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2206#true} is VALID [2018-11-23 11:59:03,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {2206#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 11:59:03,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2206#true} is VALID [2018-11-23 11:59:03,496 INFO L273 TraceCheckUtils]: 11: Hoare triple {2206#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 11:59:03,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2206#true} is VALID [2018-11-23 11:59:03,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {2206#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 11:59:03,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2206#true} is VALID [2018-11-23 11:59:03,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {2206#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 11:59:03,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2206#true} is VALID [2018-11-23 11:59:03,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {2206#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 11:59:03,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#true} assume !(~a~0 < 100000); {2206#true} is VALID [2018-11-23 11:59:03,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} havoc ~i~0;~i~0 := 0; {2206#true} is VALID [2018-11-23 11:59:03,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2206#true} is VALID [2018-11-23 11:59:03,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2206#true} is VALID [2018-11-23 11:59:03,497 INFO L273 TraceCheckUtils]: 22: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2206#true} is VALID [2018-11-23 11:59:03,497 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2206#true} is VALID [2018-11-23 11:59:03,497 INFO L273 TraceCheckUtils]: 24: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2206#true} is VALID [2018-11-23 11:59:03,497 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2206#true} is VALID [2018-11-23 11:59:03,498 INFO L273 TraceCheckUtils]: 26: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2206#true} is VALID [2018-11-23 11:59:03,498 INFO L273 TraceCheckUtils]: 27: Hoare triple {2206#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2206#true} is VALID [2018-11-23 11:59:03,498 INFO L273 TraceCheckUtils]: 28: Hoare triple {2206#true} assume !(~i~0 < 100000); {2206#true} is VALID [2018-11-23 11:59:03,498 INFO L273 TraceCheckUtils]: 29: Hoare triple {2206#true} ~i~0 := 0; {2305#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:03,499 INFO L273 TraceCheckUtils]: 30: Hoare triple {2305#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2305#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:03,499 INFO L273 TraceCheckUtils]: 31: Hoare triple {2305#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2312#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,500 INFO L273 TraceCheckUtils]: 32: Hoare triple {2312#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2312#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:03,500 INFO L273 TraceCheckUtils]: 33: Hoare triple {2312#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2319#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,501 INFO L273 TraceCheckUtils]: 34: Hoare triple {2319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2319#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:03,501 INFO L273 TraceCheckUtils]: 35: Hoare triple {2319#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2326#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,502 INFO L273 TraceCheckUtils]: 36: Hoare triple {2326#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2326#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:03,503 INFO L273 TraceCheckUtils]: 37: Hoare triple {2326#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2333#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:03,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {2333#(<= main_~i~0 4)} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 11:59:03,504 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} havoc ~x~0;~x~0 := 0; {2207#false} is VALID [2018-11-23 11:59:03,504 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {2207#false} is VALID [2018-11-23 11:59:03,504 INFO L256 TraceCheckUtils]: 41: Hoare triple {2207#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {2207#false} is VALID [2018-11-23 11:59:03,505 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} ~cond := #in~cond; {2207#false} is VALID [2018-11-23 11:59:03,505 INFO L273 TraceCheckUtils]: 43: Hoare triple {2207#false} assume 0 == ~cond; {2207#false} is VALID [2018-11-23 11:59:03,505 INFO L273 TraceCheckUtils]: 44: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 11:59:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 11:59:03,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:03,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 11:59:03,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-23 11:59:03,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:03,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:59:03,582 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 11:59:03,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:59:03,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:59:03,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:03,583 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 14 states. [2018-11-23 11:59:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,152 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-23 11:59:04,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:59:04,152 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-23 11:59:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 84 transitions. [2018-11-23 11:59:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 84 transitions. [2018-11-23 11:59:04,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 84 transitions. [2018-11-23 11:59:04,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:04,261 INFO L225 Difference]: With dead ends: 90 [2018-11-23 11:59:04,262 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:59:04,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:59:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-11-23 11:59:04,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:04,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 56 states. [2018-11-23 11:59:04,291 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 56 states. [2018-11-23 11:59:04,291 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 56 states. [2018-11-23 11:59:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,293 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 11:59:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 11:59:04,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,294 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 59 states. [2018-11-23 11:59:04,294 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 59 states. [2018-11-23 11:59:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,296 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 11:59:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 11:59:04,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:04,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:59:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-23 11:59:04,299 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 45 [2018-11-23 11:59:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:04,300 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-23 11:59:04,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:59:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-23 11:59:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:59:04,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:04,301 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:04,301 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:04,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash -52354216, now seen corresponding path program 7 times [2018-11-23 11:59:04,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:04,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:04,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:04,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {2685#true} call ULTIMATE.init(); {2685#true} is VALID [2018-11-23 11:59:04,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {2685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2685#true} is VALID [2018-11-23 11:59:04,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {2685#true} assume true; {2685#true} is VALID [2018-11-23 11:59:04,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2685#true} {2685#true} #77#return; {2685#true} is VALID [2018-11-23 11:59:04,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {2685#true} call #t~ret9 := main(); {2685#true} is VALID [2018-11-23 11:59:04,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {2685#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2687#(= main_~a~0 0)} is VALID [2018-11-23 11:59:04,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {2687#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2687#(= main_~a~0 0)} is VALID [2018-11-23 11:59:04,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {2687#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2688#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {2688#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2688#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,553 INFO L273 TraceCheckUtils]: 9: Hoare triple {2688#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2689#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:04,553 INFO L273 TraceCheckUtils]: 10: Hoare triple {2689#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2689#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:04,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {2689#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2690#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:04,554 INFO L273 TraceCheckUtils]: 12: Hoare triple {2690#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2690#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:04,555 INFO L273 TraceCheckUtils]: 13: Hoare triple {2690#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2691#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:04,555 INFO L273 TraceCheckUtils]: 14: Hoare triple {2691#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2691#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:04,555 INFO L273 TraceCheckUtils]: 15: Hoare triple {2691#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2692#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:04,556 INFO L273 TraceCheckUtils]: 16: Hoare triple {2692#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2692#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:04,556 INFO L273 TraceCheckUtils]: 17: Hoare triple {2692#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2693#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:04,557 INFO L273 TraceCheckUtils]: 18: Hoare triple {2693#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2693#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:04,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {2693#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2694#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:04,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {2694#(<= main_~a~0 7)} assume !(~a~0 < 100000); {2686#false} is VALID [2018-11-23 11:59:04,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {2686#false} havoc ~i~0;~i~0 := 0; {2686#false} is VALID [2018-11-23 11:59:04,559 INFO L273 TraceCheckUtils]: 22: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2686#false} is VALID [2018-11-23 11:59:04,559 INFO L273 TraceCheckUtils]: 23: Hoare triple {2686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2686#false} is VALID [2018-11-23 11:59:04,559 INFO L273 TraceCheckUtils]: 24: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2686#false} is VALID [2018-11-23 11:59:04,560 INFO L273 TraceCheckUtils]: 25: Hoare triple {2686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2686#false} is VALID [2018-11-23 11:59:04,560 INFO L273 TraceCheckUtils]: 26: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2686#false} is VALID [2018-11-23 11:59:04,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {2686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2686#false} is VALID [2018-11-23 11:59:04,560 INFO L273 TraceCheckUtils]: 28: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2686#false} is VALID [2018-11-23 11:59:04,560 INFO L273 TraceCheckUtils]: 29: Hoare triple {2686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2686#false} is VALID [2018-11-23 11:59:04,561 INFO L273 TraceCheckUtils]: 30: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2686#false} is VALID [2018-11-23 11:59:04,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {2686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2686#false} is VALID [2018-11-23 11:59:04,561 INFO L273 TraceCheckUtils]: 32: Hoare triple {2686#false} assume !(~i~0 < 100000); {2686#false} is VALID [2018-11-23 11:59:04,561 INFO L273 TraceCheckUtils]: 33: Hoare triple {2686#false} ~i~0 := 0; {2686#false} is VALID [2018-11-23 11:59:04,561 INFO L273 TraceCheckUtils]: 34: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2686#false} is VALID [2018-11-23 11:59:04,561 INFO L273 TraceCheckUtils]: 35: Hoare triple {2686#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2686#false} is VALID [2018-11-23 11:59:04,561 INFO L273 TraceCheckUtils]: 36: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2686#false} is VALID [2018-11-23 11:59:04,562 INFO L273 TraceCheckUtils]: 37: Hoare triple {2686#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2686#false} is VALID [2018-11-23 11:59:04,562 INFO L273 TraceCheckUtils]: 38: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2686#false} is VALID [2018-11-23 11:59:04,562 INFO L273 TraceCheckUtils]: 39: Hoare triple {2686#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2686#false} is VALID [2018-11-23 11:59:04,562 INFO L273 TraceCheckUtils]: 40: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2686#false} is VALID [2018-11-23 11:59:04,562 INFO L273 TraceCheckUtils]: 41: Hoare triple {2686#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2686#false} is VALID [2018-11-23 11:59:04,562 INFO L273 TraceCheckUtils]: 42: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2686#false} is VALID [2018-11-23 11:59:04,563 INFO L273 TraceCheckUtils]: 43: Hoare triple {2686#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2686#false} is VALID [2018-11-23 11:59:04,563 INFO L273 TraceCheckUtils]: 44: Hoare triple {2686#false} assume !(~i~0 < 100000); {2686#false} is VALID [2018-11-23 11:59:04,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {2686#false} havoc ~x~0;~x~0 := 0; {2686#false} is VALID [2018-11-23 11:59:04,563 INFO L273 TraceCheckUtils]: 46: Hoare triple {2686#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {2686#false} is VALID [2018-11-23 11:59:04,563 INFO L256 TraceCheckUtils]: 47: Hoare triple {2686#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {2686#false} is VALID [2018-11-23 11:59:04,564 INFO L273 TraceCheckUtils]: 48: Hoare triple {2686#false} ~cond := #in~cond; {2686#false} is VALID [2018-11-23 11:59:04,564 INFO L273 TraceCheckUtils]: 49: Hoare triple {2686#false} assume 0 == ~cond; {2686#false} is VALID [2018-11-23 11:59:04,564 INFO L273 TraceCheckUtils]: 50: Hoare triple {2686#false} assume !false; {2686#false} is VALID [2018-11-23 11:59:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:59:04,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:04,566 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 11:59:04,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:04,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {2685#true} call ULTIMATE.init(); {2685#true} is VALID [2018-11-23 11:59:04,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {2685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2685#true} is VALID [2018-11-23 11:59:04,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {2685#true} assume true; {2685#true} is VALID [2018-11-23 11:59:04,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2685#true} {2685#true} #77#return; {2685#true} is VALID [2018-11-23 11:59:04,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {2685#true} call #t~ret9 := main(); {2685#true} is VALID [2018-11-23 11:59:04,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {2685#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2713#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:04,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {2713#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2713#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:04,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {2713#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2688#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {2688#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2688#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {2688#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2689#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:04,903 INFO L273 TraceCheckUtils]: 10: Hoare triple {2689#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2689#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:04,904 INFO L273 TraceCheckUtils]: 11: Hoare triple {2689#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2690#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:04,905 INFO L273 TraceCheckUtils]: 12: Hoare triple {2690#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2690#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:04,905 INFO L273 TraceCheckUtils]: 13: Hoare triple {2690#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2691#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:04,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {2691#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2691#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:04,907 INFO L273 TraceCheckUtils]: 15: Hoare triple {2691#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2692#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:04,907 INFO L273 TraceCheckUtils]: 16: Hoare triple {2692#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2692#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:04,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {2692#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2693#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:04,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {2693#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2693#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:04,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {2693#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2694#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:04,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {2694#(<= main_~a~0 7)} assume !(~a~0 < 100000); {2686#false} is VALID [2018-11-23 11:59:04,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {2686#false} havoc ~i~0;~i~0 := 0; {2686#false} is VALID [2018-11-23 11:59:04,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2686#false} is VALID [2018-11-23 11:59:04,911 INFO L273 TraceCheckUtils]: 23: Hoare triple {2686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2686#false} is VALID [2018-11-23 11:59:04,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2686#false} is VALID [2018-11-23 11:59:04,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {2686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2686#false} is VALID [2018-11-23 11:59:04,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2686#false} is VALID [2018-11-23 11:59:04,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {2686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2686#false} is VALID [2018-11-23 11:59:04,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2686#false} is VALID [2018-11-23 11:59:04,913 INFO L273 TraceCheckUtils]: 29: Hoare triple {2686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2686#false} is VALID [2018-11-23 11:59:04,913 INFO L273 TraceCheckUtils]: 30: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2686#false} is VALID [2018-11-23 11:59:04,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {2686#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2686#false} is VALID [2018-11-23 11:59:04,913 INFO L273 TraceCheckUtils]: 32: Hoare triple {2686#false} assume !(~i~0 < 100000); {2686#false} is VALID [2018-11-23 11:59:04,913 INFO L273 TraceCheckUtils]: 33: Hoare triple {2686#false} ~i~0 := 0; {2686#false} is VALID [2018-11-23 11:59:04,913 INFO L273 TraceCheckUtils]: 34: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2686#false} is VALID [2018-11-23 11:59:04,914 INFO L273 TraceCheckUtils]: 35: Hoare triple {2686#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2686#false} is VALID [2018-11-23 11:59:04,914 INFO L273 TraceCheckUtils]: 36: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2686#false} is VALID [2018-11-23 11:59:04,914 INFO L273 TraceCheckUtils]: 37: Hoare triple {2686#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2686#false} is VALID [2018-11-23 11:59:04,914 INFO L273 TraceCheckUtils]: 38: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2686#false} is VALID [2018-11-23 11:59:04,914 INFO L273 TraceCheckUtils]: 39: Hoare triple {2686#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2686#false} is VALID [2018-11-23 11:59:04,914 INFO L273 TraceCheckUtils]: 40: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2686#false} is VALID [2018-11-23 11:59:04,914 INFO L273 TraceCheckUtils]: 41: Hoare triple {2686#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2686#false} is VALID [2018-11-23 11:59:04,914 INFO L273 TraceCheckUtils]: 42: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2686#false} is VALID [2018-11-23 11:59:04,915 INFO L273 TraceCheckUtils]: 43: Hoare triple {2686#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2686#false} is VALID [2018-11-23 11:59:04,915 INFO L273 TraceCheckUtils]: 44: Hoare triple {2686#false} assume !(~i~0 < 100000); {2686#false} is VALID [2018-11-23 11:59:04,915 INFO L273 TraceCheckUtils]: 45: Hoare triple {2686#false} havoc ~x~0;~x~0 := 0; {2686#false} is VALID [2018-11-23 11:59:04,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {2686#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {2686#false} is VALID [2018-11-23 11:59:04,915 INFO L256 TraceCheckUtils]: 47: Hoare triple {2686#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {2686#false} is VALID [2018-11-23 11:59:04,915 INFO L273 TraceCheckUtils]: 48: Hoare triple {2686#false} ~cond := #in~cond; {2686#false} is VALID [2018-11-23 11:59:04,915 INFO L273 TraceCheckUtils]: 49: Hoare triple {2686#false} assume 0 == ~cond; {2686#false} is VALID [2018-11-23 11:59:04,915 INFO L273 TraceCheckUtils]: 50: Hoare triple {2686#false} assume !false; {2686#false} is VALID [2018-11-23 11:59:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:59:04,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:04,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:59:04,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-11-23 11:59:04,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:04,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:59:04,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:04,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:59:04,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:59:04,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:04,974 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 11 states. [2018-11-23 11:59:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,207 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-11-23 11:59:05,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:59:05,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-11-23 11:59:05,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 64 transitions. [2018-11-23 11:59:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 64 transitions. [2018-11-23 11:59:05,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 64 transitions. [2018-11-23 11:59:05,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:05,350 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:59:05,350 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:59:05,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:59:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-23 11:59:05,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:05,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2018-11-23 11:59:05,379 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2018-11-23 11:59:05,379 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2018-11-23 11:59:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,381 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 11:59:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 11:59:05,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:05,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:05,381 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2018-11-23 11:59:05,382 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2018-11-23 11:59:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,383 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 11:59:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 11:59:05,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:05,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:05,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:05,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:59:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-23 11:59:05,386 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 51 [2018-11-23 11:59:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:05,386 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-23 11:59:05,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:59:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 11:59:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:59:05,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:05,387 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:05,387 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:05,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:05,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1025272074, now seen corresponding path program 8 times [2018-11-23 11:59:05,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:05,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:05,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:05,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,565 INFO L256 TraceCheckUtils]: 0: Hoare triple {3189#true} call ULTIMATE.init(); {3189#true} is VALID [2018-11-23 11:59:05,565 INFO L273 TraceCheckUtils]: 1: Hoare triple {3189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3189#true} is VALID [2018-11-23 11:59:05,565 INFO L273 TraceCheckUtils]: 2: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 11:59:05,566 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3189#true} {3189#true} #77#return; {3189#true} is VALID [2018-11-23 11:59:05,566 INFO L256 TraceCheckUtils]: 4: Hoare triple {3189#true} call #t~ret9 := main(); {3189#true} is VALID [2018-11-23 11:59:05,566 INFO L273 TraceCheckUtils]: 5: Hoare triple {3189#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3191#(= main_~a~0 0)} is VALID [2018-11-23 11:59:05,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {3191#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3191#(= main_~a~0 0)} is VALID [2018-11-23 11:59:05,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {3191#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3192#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {3192#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3192#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {3192#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3193#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:05,568 INFO L273 TraceCheckUtils]: 10: Hoare triple {3193#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3193#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:05,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {3193#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3194#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:05,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {3194#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3194#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:05,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {3194#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3195#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:05,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {3195#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3195#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:05,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {3195#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3196#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:05,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {3196#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3196#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:05,572 INFO L273 TraceCheckUtils]: 17: Hoare triple {3196#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3197#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:05,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {3197#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3197#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:05,573 INFO L273 TraceCheckUtils]: 19: Hoare triple {3197#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3198#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:05,574 INFO L273 TraceCheckUtils]: 20: Hoare triple {3198#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3198#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:05,575 INFO L273 TraceCheckUtils]: 21: Hoare triple {3198#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3199#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:05,575 INFO L273 TraceCheckUtils]: 22: Hoare triple {3199#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3190#false} is VALID [2018-11-23 11:59:05,576 INFO L273 TraceCheckUtils]: 23: Hoare triple {3190#false} havoc ~i~0;~i~0 := 0; {3190#false} is VALID [2018-11-23 11:59:05,576 INFO L273 TraceCheckUtils]: 24: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3190#false} is VALID [2018-11-23 11:59:05,576 INFO L273 TraceCheckUtils]: 25: Hoare triple {3190#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3190#false} is VALID [2018-11-23 11:59:05,576 INFO L273 TraceCheckUtils]: 26: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3190#false} is VALID [2018-11-23 11:59:05,576 INFO L273 TraceCheckUtils]: 27: Hoare triple {3190#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3190#false} is VALID [2018-11-23 11:59:05,577 INFO L273 TraceCheckUtils]: 28: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3190#false} is VALID [2018-11-23 11:59:05,577 INFO L273 TraceCheckUtils]: 29: Hoare triple {3190#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3190#false} is VALID [2018-11-23 11:59:05,577 INFO L273 TraceCheckUtils]: 30: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3190#false} is VALID [2018-11-23 11:59:05,577 INFO L273 TraceCheckUtils]: 31: Hoare triple {3190#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3190#false} is VALID [2018-11-23 11:59:05,577 INFO L273 TraceCheckUtils]: 32: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3190#false} is VALID [2018-11-23 11:59:05,578 INFO L273 TraceCheckUtils]: 33: Hoare triple {3190#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3190#false} is VALID [2018-11-23 11:59:05,578 INFO L273 TraceCheckUtils]: 34: Hoare triple {3190#false} assume !(~i~0 < 100000); {3190#false} is VALID [2018-11-23 11:59:05,578 INFO L273 TraceCheckUtils]: 35: Hoare triple {3190#false} ~i~0 := 0; {3190#false} is VALID [2018-11-23 11:59:05,578 INFO L273 TraceCheckUtils]: 36: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3190#false} is VALID [2018-11-23 11:59:05,578 INFO L273 TraceCheckUtils]: 37: Hoare triple {3190#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3190#false} is VALID [2018-11-23 11:59:05,579 INFO L273 TraceCheckUtils]: 38: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3190#false} is VALID [2018-11-23 11:59:05,579 INFO L273 TraceCheckUtils]: 39: Hoare triple {3190#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3190#false} is VALID [2018-11-23 11:59:05,579 INFO L273 TraceCheckUtils]: 40: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3190#false} is VALID [2018-11-23 11:59:05,579 INFO L273 TraceCheckUtils]: 41: Hoare triple {3190#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3190#false} is VALID [2018-11-23 11:59:05,579 INFO L273 TraceCheckUtils]: 42: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3190#false} is VALID [2018-11-23 11:59:05,580 INFO L273 TraceCheckUtils]: 43: Hoare triple {3190#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3190#false} is VALID [2018-11-23 11:59:05,580 INFO L273 TraceCheckUtils]: 44: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3190#false} is VALID [2018-11-23 11:59:05,580 INFO L273 TraceCheckUtils]: 45: Hoare triple {3190#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3190#false} is VALID [2018-11-23 11:59:05,580 INFO L273 TraceCheckUtils]: 46: Hoare triple {3190#false} assume !(~i~0 < 100000); {3190#false} is VALID [2018-11-23 11:59:05,580 INFO L273 TraceCheckUtils]: 47: Hoare triple {3190#false} havoc ~x~0;~x~0 := 0; {3190#false} is VALID [2018-11-23 11:59:05,580 INFO L273 TraceCheckUtils]: 48: Hoare triple {3190#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {3190#false} is VALID [2018-11-23 11:59:05,581 INFO L256 TraceCheckUtils]: 49: Hoare triple {3190#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {3190#false} is VALID [2018-11-23 11:59:05,581 INFO L273 TraceCheckUtils]: 50: Hoare triple {3190#false} ~cond := #in~cond; {3190#false} is VALID [2018-11-23 11:59:05,581 INFO L273 TraceCheckUtils]: 51: Hoare triple {3190#false} assume 0 == ~cond; {3190#false} is VALID [2018-11-23 11:59:05,581 INFO L273 TraceCheckUtils]: 52: Hoare triple {3190#false} assume !false; {3190#false} is VALID [2018-11-23 11:59:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:59:05,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:05,584 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 11:59:05,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:05,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:05,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:05,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {3189#true} call ULTIMATE.init(); {3189#true} is VALID [2018-11-23 11:59:05,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {3189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3189#true} is VALID [2018-11-23 11:59:05,870 INFO L273 TraceCheckUtils]: 2: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 11:59:05,870 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3189#true} {3189#true} #77#return; {3189#true} is VALID [2018-11-23 11:59:05,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {3189#true} call #t~ret9 := main(); {3189#true} is VALID [2018-11-23 11:59:05,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {3189#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3218#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:05,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {3218#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3218#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:05,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {3218#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3192#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {3192#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3192#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {3192#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3193#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:05,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {3193#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3193#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:05,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {3193#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3194#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:05,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {3194#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3194#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:05,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {3194#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3195#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:05,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {3195#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3195#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:05,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {3195#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3196#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:05,877 INFO L273 TraceCheckUtils]: 16: Hoare triple {3196#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3196#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:05,878 INFO L273 TraceCheckUtils]: 17: Hoare triple {3196#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3197#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:05,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {3197#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3197#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:05,879 INFO L273 TraceCheckUtils]: 19: Hoare triple {3197#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3198#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:05,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {3198#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3198#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:05,881 INFO L273 TraceCheckUtils]: 21: Hoare triple {3198#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3199#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:05,881 INFO L273 TraceCheckUtils]: 22: Hoare triple {3199#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3190#false} is VALID [2018-11-23 11:59:05,882 INFO L273 TraceCheckUtils]: 23: Hoare triple {3190#false} havoc ~i~0;~i~0 := 0; {3190#false} is VALID [2018-11-23 11:59:05,882 INFO L273 TraceCheckUtils]: 24: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3190#false} is VALID [2018-11-23 11:59:05,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {3190#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3190#false} is VALID [2018-11-23 11:59:05,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3190#false} is VALID [2018-11-23 11:59:05,883 INFO L273 TraceCheckUtils]: 27: Hoare triple {3190#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3190#false} is VALID [2018-11-23 11:59:05,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3190#false} is VALID [2018-11-23 11:59:05,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {3190#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3190#false} is VALID [2018-11-23 11:59:05,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3190#false} is VALID [2018-11-23 11:59:05,883 INFO L273 TraceCheckUtils]: 31: Hoare triple {3190#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3190#false} is VALID [2018-11-23 11:59:05,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3190#false} is VALID [2018-11-23 11:59:05,884 INFO L273 TraceCheckUtils]: 33: Hoare triple {3190#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3190#false} is VALID [2018-11-23 11:59:05,884 INFO L273 TraceCheckUtils]: 34: Hoare triple {3190#false} assume !(~i~0 < 100000); {3190#false} is VALID [2018-11-23 11:59:05,884 INFO L273 TraceCheckUtils]: 35: Hoare triple {3190#false} ~i~0 := 0; {3190#false} is VALID [2018-11-23 11:59:05,884 INFO L273 TraceCheckUtils]: 36: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3190#false} is VALID [2018-11-23 11:59:05,885 INFO L273 TraceCheckUtils]: 37: Hoare triple {3190#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3190#false} is VALID [2018-11-23 11:59:05,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3190#false} is VALID [2018-11-23 11:59:05,885 INFO L273 TraceCheckUtils]: 39: Hoare triple {3190#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3190#false} is VALID [2018-11-23 11:59:05,885 INFO L273 TraceCheckUtils]: 40: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3190#false} is VALID [2018-11-23 11:59:05,885 INFO L273 TraceCheckUtils]: 41: Hoare triple {3190#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3190#false} is VALID [2018-11-23 11:59:05,885 INFO L273 TraceCheckUtils]: 42: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3190#false} is VALID [2018-11-23 11:59:05,885 INFO L273 TraceCheckUtils]: 43: Hoare triple {3190#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3190#false} is VALID [2018-11-23 11:59:05,886 INFO L273 TraceCheckUtils]: 44: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3190#false} is VALID [2018-11-23 11:59:05,886 INFO L273 TraceCheckUtils]: 45: Hoare triple {3190#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3190#false} is VALID [2018-11-23 11:59:05,886 INFO L273 TraceCheckUtils]: 46: Hoare triple {3190#false} assume !(~i~0 < 100000); {3190#false} is VALID [2018-11-23 11:59:05,886 INFO L273 TraceCheckUtils]: 47: Hoare triple {3190#false} havoc ~x~0;~x~0 := 0; {3190#false} is VALID [2018-11-23 11:59:05,886 INFO L273 TraceCheckUtils]: 48: Hoare triple {3190#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {3190#false} is VALID [2018-11-23 11:59:05,886 INFO L256 TraceCheckUtils]: 49: Hoare triple {3190#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {3190#false} is VALID [2018-11-23 11:59:05,886 INFO L273 TraceCheckUtils]: 50: Hoare triple {3190#false} ~cond := #in~cond; {3190#false} is VALID [2018-11-23 11:59:05,886 INFO L273 TraceCheckUtils]: 51: Hoare triple {3190#false} assume 0 == ~cond; {3190#false} is VALID [2018-11-23 11:59:05,887 INFO L273 TraceCheckUtils]: 52: Hoare triple {3190#false} assume !false; {3190#false} is VALID [2018-11-23 11:59:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:59:05,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:05,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:59:05,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 11:59:05,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:05,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:59:05,959 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 11:59:05,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:05,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:05,961 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 12 states. [2018-11-23 11:59:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,202 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-11-23 11:59:06,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:59:06,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 11:59:06,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2018-11-23 11:59:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2018-11-23 11:59:06,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2018-11-23 11:59:06,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:06,289 INFO L225 Difference]: With dead ends: 96 [2018-11-23 11:59:06,289 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:59:06,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:59:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-23 11:59:06,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:06,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2018-11-23 11:59:06,313 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2018-11-23 11:59:06,314 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2018-11-23 11:59:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,316 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 11:59:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-23 11:59:06,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,316 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2018-11-23 11:59:06,316 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2018-11-23 11:59:06,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,317 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 11:59:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-23 11:59:06,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:06,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:59:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-11-23 11:59:06,319 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 53 [2018-11-23 11:59:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:06,319 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-11-23 11:59:06,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-23 11:59:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:59:06,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:06,321 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:06,321 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:06,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:06,321 INFO L82 PathProgramCache]: Analyzing trace with hash 303536916, now seen corresponding path program 9 times [2018-11-23 11:59:06,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:06,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:06,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:06,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {3710#true} call ULTIMATE.init(); {3710#true} is VALID [2018-11-23 11:59:07,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {3710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3710#true} is VALID [2018-11-23 11:59:07,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {3710#true} assume true; {3710#true} is VALID [2018-11-23 11:59:07,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3710#true} {3710#true} #77#return; {3710#true} is VALID [2018-11-23 11:59:07,035 INFO L256 TraceCheckUtils]: 4: Hoare triple {3710#true} call #t~ret9 := main(); {3710#true} is VALID [2018-11-23 11:59:07,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {3710#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3712#(= main_~a~0 0)} is VALID [2018-11-23 11:59:07,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {3712#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3712#(= main_~a~0 0)} is VALID [2018-11-23 11:59:07,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {3712#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3713#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {3713#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3713#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {3713#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3714#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {3714#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3714#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {3714#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3715#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {3715#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3715#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,062 INFO L273 TraceCheckUtils]: 13: Hoare triple {3715#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:07,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {3716#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3716#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:07,062 INFO L273 TraceCheckUtils]: 15: Hoare triple {3716#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3717#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:07,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {3717#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3717#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:07,063 INFO L273 TraceCheckUtils]: 17: Hoare triple {3717#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3718#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:07,064 INFO L273 TraceCheckUtils]: 18: Hoare triple {3718#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3718#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:07,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {3718#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3719#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:07,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {3719#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3719#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:07,065 INFO L273 TraceCheckUtils]: 21: Hoare triple {3719#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3720#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:07,066 INFO L273 TraceCheckUtils]: 22: Hoare triple {3720#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3720#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:07,067 INFO L273 TraceCheckUtils]: 23: Hoare triple {3720#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3721#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:07,067 INFO L273 TraceCheckUtils]: 24: Hoare triple {3721#(<= main_~a~0 9)} assume !(~a~0 < 100000); {3711#false} is VALID [2018-11-23 11:59:07,068 INFO L273 TraceCheckUtils]: 25: Hoare triple {3711#false} havoc ~i~0;~i~0 := 0; {3711#false} is VALID [2018-11-23 11:59:07,068 INFO L273 TraceCheckUtils]: 26: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3711#false} is VALID [2018-11-23 11:59:07,068 INFO L273 TraceCheckUtils]: 27: Hoare triple {3711#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3711#false} is VALID [2018-11-23 11:59:07,068 INFO L273 TraceCheckUtils]: 28: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3711#false} is VALID [2018-11-23 11:59:07,068 INFO L273 TraceCheckUtils]: 29: Hoare triple {3711#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3711#false} is VALID [2018-11-23 11:59:07,069 INFO L273 TraceCheckUtils]: 30: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3711#false} is VALID [2018-11-23 11:59:07,069 INFO L273 TraceCheckUtils]: 31: Hoare triple {3711#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3711#false} is VALID [2018-11-23 11:59:07,069 INFO L273 TraceCheckUtils]: 32: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3711#false} is VALID [2018-11-23 11:59:07,069 INFO L273 TraceCheckUtils]: 33: Hoare triple {3711#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3711#false} is VALID [2018-11-23 11:59:07,070 INFO L273 TraceCheckUtils]: 34: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3711#false} is VALID [2018-11-23 11:59:07,070 INFO L273 TraceCheckUtils]: 35: Hoare triple {3711#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3711#false} is VALID [2018-11-23 11:59:07,070 INFO L273 TraceCheckUtils]: 36: Hoare triple {3711#false} assume !(~i~0 < 100000); {3711#false} is VALID [2018-11-23 11:59:07,070 INFO L273 TraceCheckUtils]: 37: Hoare triple {3711#false} ~i~0 := 0; {3711#false} is VALID [2018-11-23 11:59:07,070 INFO L273 TraceCheckUtils]: 38: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3711#false} is VALID [2018-11-23 11:59:07,071 INFO L273 TraceCheckUtils]: 39: Hoare triple {3711#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3711#false} is VALID [2018-11-23 11:59:07,071 INFO L273 TraceCheckUtils]: 40: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3711#false} is VALID [2018-11-23 11:59:07,071 INFO L273 TraceCheckUtils]: 41: Hoare triple {3711#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3711#false} is VALID [2018-11-23 11:59:07,071 INFO L273 TraceCheckUtils]: 42: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3711#false} is VALID [2018-11-23 11:59:07,071 INFO L273 TraceCheckUtils]: 43: Hoare triple {3711#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3711#false} is VALID [2018-11-23 11:59:07,072 INFO L273 TraceCheckUtils]: 44: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3711#false} is VALID [2018-11-23 11:59:07,072 INFO L273 TraceCheckUtils]: 45: Hoare triple {3711#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3711#false} is VALID [2018-11-23 11:59:07,072 INFO L273 TraceCheckUtils]: 46: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3711#false} is VALID [2018-11-23 11:59:07,072 INFO L273 TraceCheckUtils]: 47: Hoare triple {3711#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3711#false} is VALID [2018-11-23 11:59:07,072 INFO L273 TraceCheckUtils]: 48: Hoare triple {3711#false} assume !(~i~0 < 100000); {3711#false} is VALID [2018-11-23 11:59:07,072 INFO L273 TraceCheckUtils]: 49: Hoare triple {3711#false} havoc ~x~0;~x~0 := 0; {3711#false} is VALID [2018-11-23 11:59:07,073 INFO L273 TraceCheckUtils]: 50: Hoare triple {3711#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {3711#false} is VALID [2018-11-23 11:59:07,073 INFO L256 TraceCheckUtils]: 51: Hoare triple {3711#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {3711#false} is VALID [2018-11-23 11:59:07,073 INFO L273 TraceCheckUtils]: 52: Hoare triple {3711#false} ~cond := #in~cond; {3711#false} is VALID [2018-11-23 11:59:07,073 INFO L273 TraceCheckUtils]: 53: Hoare triple {3711#false} assume 0 == ~cond; {3711#false} is VALID [2018-11-23 11:59:07,073 INFO L273 TraceCheckUtils]: 54: Hoare triple {3711#false} assume !false; {3711#false} is VALID [2018-11-23 11:59:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:59:07,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:07,075 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 11:59:07,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:07,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:59:07,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:07,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {3710#true} call ULTIMATE.init(); {3710#true} is VALID [2018-11-23 11:59:07,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {3710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3710#true} is VALID [2018-11-23 11:59:07,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {3710#true} assume true; {3710#true} is VALID [2018-11-23 11:59:07,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3710#true} {3710#true} #77#return; {3710#true} is VALID [2018-11-23 11:59:07,307 INFO L256 TraceCheckUtils]: 4: Hoare triple {3710#true} call #t~ret9 := main(); {3710#true} is VALID [2018-11-23 11:59:07,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {3710#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3710#true} is VALID [2018-11-23 11:59:07,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3710#true} is VALID [2018-11-23 11:59:07,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:59:07,308 INFO L273 TraceCheckUtils]: 8: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3710#true} is VALID [2018-11-23 11:59:07,308 INFO L273 TraceCheckUtils]: 9: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:59:07,308 INFO L273 TraceCheckUtils]: 10: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3710#true} is VALID [2018-11-23 11:59:07,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:59:07,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3710#true} is VALID [2018-11-23 11:59:07,309 INFO L273 TraceCheckUtils]: 13: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:59:07,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3710#true} is VALID [2018-11-23 11:59:07,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:59:07,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3710#true} is VALID [2018-11-23 11:59:07,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:59:07,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3710#true} is VALID [2018-11-23 11:59:07,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:59:07,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3710#true} is VALID [2018-11-23 11:59:07,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:59:07,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3710#true} is VALID [2018-11-23 11:59:07,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:59:07,310 INFO L273 TraceCheckUtils]: 24: Hoare triple {3710#true} assume !(~a~0 < 100000); {3710#true} is VALID [2018-11-23 11:59:07,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {3710#true} havoc ~i~0;~i~0 := 0; {3710#true} is VALID [2018-11-23 11:59:07,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {3710#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3710#true} is VALID [2018-11-23 11:59:07,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {3710#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3710#true} is VALID [2018-11-23 11:59:07,311 INFO L273 TraceCheckUtils]: 28: Hoare triple {3710#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3710#true} is VALID [2018-11-23 11:59:07,311 INFO L273 TraceCheckUtils]: 29: Hoare triple {3710#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3710#true} is VALID [2018-11-23 11:59:07,311 INFO L273 TraceCheckUtils]: 30: Hoare triple {3710#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3710#true} is VALID [2018-11-23 11:59:07,312 INFO L273 TraceCheckUtils]: 31: Hoare triple {3710#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3710#true} is VALID [2018-11-23 11:59:07,312 INFO L273 TraceCheckUtils]: 32: Hoare triple {3710#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3710#true} is VALID [2018-11-23 11:59:07,312 INFO L273 TraceCheckUtils]: 33: Hoare triple {3710#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3710#true} is VALID [2018-11-23 11:59:07,312 INFO L273 TraceCheckUtils]: 34: Hoare triple {3710#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3710#true} is VALID [2018-11-23 11:59:07,312 INFO L273 TraceCheckUtils]: 35: Hoare triple {3710#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3710#true} is VALID [2018-11-23 11:59:07,312 INFO L273 TraceCheckUtils]: 36: Hoare triple {3710#true} assume !(~i~0 < 100000); {3710#true} is VALID [2018-11-23 11:59:07,320 INFO L273 TraceCheckUtils]: 37: Hoare triple {3710#true} ~i~0 := 0; {3836#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:07,320 INFO L273 TraceCheckUtils]: 38: Hoare triple {3836#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3836#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:07,321 INFO L273 TraceCheckUtils]: 39: Hoare triple {3836#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3843#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,321 INFO L273 TraceCheckUtils]: 40: Hoare triple {3843#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3843#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:07,322 INFO L273 TraceCheckUtils]: 41: Hoare triple {3843#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3850#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,322 INFO L273 TraceCheckUtils]: 42: Hoare triple {3850#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3850#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,322 INFO L273 TraceCheckUtils]: 43: Hoare triple {3850#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3857#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,323 INFO L273 TraceCheckUtils]: 44: Hoare triple {3857#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3857#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,324 INFO L273 TraceCheckUtils]: 45: Hoare triple {3857#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3864#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,324 INFO L273 TraceCheckUtils]: 46: Hoare triple {3864#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3864#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,325 INFO L273 TraceCheckUtils]: 47: Hoare triple {3864#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3871#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,326 INFO L273 TraceCheckUtils]: 48: Hoare triple {3871#(<= main_~i~0 5)} assume !(~i~0 < 100000); {3711#false} is VALID [2018-11-23 11:59:07,326 INFO L273 TraceCheckUtils]: 49: Hoare triple {3711#false} havoc ~x~0;~x~0 := 0; {3711#false} is VALID [2018-11-23 11:59:07,326 INFO L273 TraceCheckUtils]: 50: Hoare triple {3711#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {3711#false} is VALID [2018-11-23 11:59:07,327 INFO L256 TraceCheckUtils]: 51: Hoare triple {3711#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {3711#false} is VALID [2018-11-23 11:59:07,327 INFO L273 TraceCheckUtils]: 52: Hoare triple {3711#false} ~cond := #in~cond; {3711#false} is VALID [2018-11-23 11:59:07,327 INFO L273 TraceCheckUtils]: 53: Hoare triple {3711#false} assume 0 == ~cond; {3711#false} is VALID [2018-11-23 11:59:07,327 INFO L273 TraceCheckUtils]: 54: Hoare triple {3711#false} assume !false; {3711#false} is VALID [2018-11-23 11:59:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-23 11:59:07,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:07,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-11-23 11:59:07,352 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-23 11:59:07,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:07,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:59:07,409 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 11:59:07,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:59:07,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:59:07,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:59:07,410 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 18 states. [2018-11-23 11:59:08,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,144 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 11:59:08,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:59:08,145 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-23 11:59:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:59:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2018-11-23 11:59:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:59:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2018-11-23 11:59:08,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2018-11-23 11:59:08,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:08,288 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:59:08,288 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 11:59:08,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:59:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 11:59:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-11-23 11:59:08,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:08,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 66 states. [2018-11-23 11:59:08,332 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 66 states. [2018-11-23 11:59:08,332 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 66 states. [2018-11-23 11:59:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,333 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 11:59:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 11:59:08,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,334 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 69 states. [2018-11-23 11:59:08,334 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 69 states. [2018-11-23 11:59:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,336 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 11:59:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 11:59:08,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:08,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:59:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-23 11:59:08,338 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 55 [2018-11-23 11:59:08,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:08,339 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-23 11:59:08,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:59:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-11-23 11:59:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:59:08,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:08,340 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:08,340 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:08,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash -169428562, now seen corresponding path program 10 times [2018-11-23 11:59:08,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:08,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:08,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:08,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {4279#true} call ULTIMATE.init(); {4279#true} is VALID [2018-11-23 11:59:09,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {4279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4279#true} is VALID [2018-11-23 11:59:09,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {4279#true} assume true; {4279#true} is VALID [2018-11-23 11:59:09,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4279#true} {4279#true} #77#return; {4279#true} is VALID [2018-11-23 11:59:09,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {4279#true} call #t~ret9 := main(); {4279#true} is VALID [2018-11-23 11:59:09,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {4279#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4281#(= main_~a~0 0)} is VALID [2018-11-23 11:59:09,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {4281#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4281#(= main_~a~0 0)} is VALID [2018-11-23 11:59:09,161 INFO L273 TraceCheckUtils]: 7: Hoare triple {4281#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4282#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {4282#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4282#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,189 INFO L273 TraceCheckUtils]: 9: Hoare triple {4282#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4283#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {4283#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4283#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {4283#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4284#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:09,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {4284#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4284#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:09,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {4284#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4285#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:09,218 INFO L273 TraceCheckUtils]: 14: Hoare triple {4285#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4285#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:09,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {4285#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4286#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:09,237 INFO L273 TraceCheckUtils]: 16: Hoare triple {4286#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4286#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:09,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {4286#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4287#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:09,238 INFO L273 TraceCheckUtils]: 18: Hoare triple {4287#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4287#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:09,239 INFO L273 TraceCheckUtils]: 19: Hoare triple {4287#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4288#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:09,239 INFO L273 TraceCheckUtils]: 20: Hoare triple {4288#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4288#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:09,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {4288#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4289#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:09,240 INFO L273 TraceCheckUtils]: 22: Hoare triple {4289#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4289#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:09,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {4289#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4290#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:09,241 INFO L273 TraceCheckUtils]: 24: Hoare triple {4290#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4290#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:09,241 INFO L273 TraceCheckUtils]: 25: Hoare triple {4290#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4291#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:09,242 INFO L273 TraceCheckUtils]: 26: Hoare triple {4291#(<= main_~a~0 10)} assume !(~a~0 < 100000); {4280#false} is VALID [2018-11-23 11:59:09,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {4280#false} havoc ~i~0;~i~0 := 0; {4280#false} is VALID [2018-11-23 11:59:09,243 INFO L273 TraceCheckUtils]: 28: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4280#false} is VALID [2018-11-23 11:59:09,243 INFO L273 TraceCheckUtils]: 29: Hoare triple {4280#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4280#false} is VALID [2018-11-23 11:59:09,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4280#false} is VALID [2018-11-23 11:59:09,244 INFO L273 TraceCheckUtils]: 31: Hoare triple {4280#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4280#false} is VALID [2018-11-23 11:59:09,244 INFO L273 TraceCheckUtils]: 32: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4280#false} is VALID [2018-11-23 11:59:09,244 INFO L273 TraceCheckUtils]: 33: Hoare triple {4280#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4280#false} is VALID [2018-11-23 11:59:09,244 INFO L273 TraceCheckUtils]: 34: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4280#false} is VALID [2018-11-23 11:59:09,245 INFO L273 TraceCheckUtils]: 35: Hoare triple {4280#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4280#false} is VALID [2018-11-23 11:59:09,245 INFO L273 TraceCheckUtils]: 36: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4280#false} is VALID [2018-11-23 11:59:09,245 INFO L273 TraceCheckUtils]: 37: Hoare triple {4280#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4280#false} is VALID [2018-11-23 11:59:09,245 INFO L273 TraceCheckUtils]: 38: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4280#false} is VALID [2018-11-23 11:59:09,246 INFO L273 TraceCheckUtils]: 39: Hoare triple {4280#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4280#false} is VALID [2018-11-23 11:59:09,246 INFO L273 TraceCheckUtils]: 40: Hoare triple {4280#false} assume !(~i~0 < 100000); {4280#false} is VALID [2018-11-23 11:59:09,246 INFO L273 TraceCheckUtils]: 41: Hoare triple {4280#false} ~i~0 := 0; {4280#false} is VALID [2018-11-23 11:59:09,246 INFO L273 TraceCheckUtils]: 42: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4280#false} is VALID [2018-11-23 11:59:09,246 INFO L273 TraceCheckUtils]: 43: Hoare triple {4280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4280#false} is VALID [2018-11-23 11:59:09,247 INFO L273 TraceCheckUtils]: 44: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4280#false} is VALID [2018-11-23 11:59:09,247 INFO L273 TraceCheckUtils]: 45: Hoare triple {4280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4280#false} is VALID [2018-11-23 11:59:09,247 INFO L273 TraceCheckUtils]: 46: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4280#false} is VALID [2018-11-23 11:59:09,247 INFO L273 TraceCheckUtils]: 47: Hoare triple {4280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4280#false} is VALID [2018-11-23 11:59:09,247 INFO L273 TraceCheckUtils]: 48: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4280#false} is VALID [2018-11-23 11:59:09,247 INFO L273 TraceCheckUtils]: 49: Hoare triple {4280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4280#false} is VALID [2018-11-23 11:59:09,248 INFO L273 TraceCheckUtils]: 50: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4280#false} is VALID [2018-11-23 11:59:09,248 INFO L273 TraceCheckUtils]: 51: Hoare triple {4280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4280#false} is VALID [2018-11-23 11:59:09,248 INFO L273 TraceCheckUtils]: 52: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4280#false} is VALID [2018-11-23 11:59:09,248 INFO L273 TraceCheckUtils]: 53: Hoare triple {4280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4280#false} is VALID [2018-11-23 11:59:09,248 INFO L273 TraceCheckUtils]: 54: Hoare triple {4280#false} assume !(~i~0 < 100000); {4280#false} is VALID [2018-11-23 11:59:09,248 INFO L273 TraceCheckUtils]: 55: Hoare triple {4280#false} havoc ~x~0;~x~0 := 0; {4280#false} is VALID [2018-11-23 11:59:09,249 INFO L273 TraceCheckUtils]: 56: Hoare triple {4280#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {4280#false} is VALID [2018-11-23 11:59:09,249 INFO L256 TraceCheckUtils]: 57: Hoare triple {4280#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {4280#false} is VALID [2018-11-23 11:59:09,249 INFO L273 TraceCheckUtils]: 58: Hoare triple {4280#false} ~cond := #in~cond; {4280#false} is VALID [2018-11-23 11:59:09,249 INFO L273 TraceCheckUtils]: 59: Hoare triple {4280#false} assume 0 == ~cond; {4280#false} is VALID [2018-11-23 11:59:09,249 INFO L273 TraceCheckUtils]: 60: Hoare triple {4280#false} assume !false; {4280#false} is VALID [2018-11-23 11:59:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:59:09,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:09,253 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 11:59:09,263 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:09,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:09,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:09,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {4279#true} call ULTIMATE.init(); {4279#true} is VALID [2018-11-23 11:59:09,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {4279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4279#true} is VALID [2018-11-23 11:59:09,488 INFO L273 TraceCheckUtils]: 2: Hoare triple {4279#true} assume true; {4279#true} is VALID [2018-11-23 11:59:09,488 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4279#true} {4279#true} #77#return; {4279#true} is VALID [2018-11-23 11:59:09,488 INFO L256 TraceCheckUtils]: 4: Hoare triple {4279#true} call #t~ret9 := main(); {4279#true} is VALID [2018-11-23 11:59:09,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {4279#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4310#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:09,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {4310#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4310#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:09,490 INFO L273 TraceCheckUtils]: 7: Hoare triple {4310#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4282#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {4282#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4282#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,491 INFO L273 TraceCheckUtils]: 9: Hoare triple {4282#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4283#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,492 INFO L273 TraceCheckUtils]: 10: Hoare triple {4283#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4283#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {4283#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4284#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:09,493 INFO L273 TraceCheckUtils]: 12: Hoare triple {4284#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4284#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:09,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {4284#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4285#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:09,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {4285#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4285#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:09,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {4285#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4286#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:09,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {4286#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4286#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:09,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {4286#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4287#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:09,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {4287#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4287#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:09,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {4287#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4288#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:09,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {4288#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4288#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:09,499 INFO L273 TraceCheckUtils]: 21: Hoare triple {4288#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4289#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:09,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {4289#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4289#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:09,501 INFO L273 TraceCheckUtils]: 23: Hoare triple {4289#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4290#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:09,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {4290#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4290#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:09,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {4290#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4291#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:09,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {4291#(<= main_~a~0 10)} assume !(~a~0 < 100000); {4280#false} is VALID [2018-11-23 11:59:09,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {4280#false} havoc ~i~0;~i~0 := 0; {4280#false} is VALID [2018-11-23 11:59:09,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4280#false} is VALID [2018-11-23 11:59:09,504 INFO L273 TraceCheckUtils]: 29: Hoare triple {4280#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4280#false} is VALID [2018-11-23 11:59:09,504 INFO L273 TraceCheckUtils]: 30: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4280#false} is VALID [2018-11-23 11:59:09,504 INFO L273 TraceCheckUtils]: 31: Hoare triple {4280#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4280#false} is VALID [2018-11-23 11:59:09,505 INFO L273 TraceCheckUtils]: 32: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4280#false} is VALID [2018-11-23 11:59:09,505 INFO L273 TraceCheckUtils]: 33: Hoare triple {4280#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4280#false} is VALID [2018-11-23 11:59:09,505 INFO L273 TraceCheckUtils]: 34: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4280#false} is VALID [2018-11-23 11:59:09,505 INFO L273 TraceCheckUtils]: 35: Hoare triple {4280#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4280#false} is VALID [2018-11-23 11:59:09,506 INFO L273 TraceCheckUtils]: 36: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4280#false} is VALID [2018-11-23 11:59:09,506 INFO L273 TraceCheckUtils]: 37: Hoare triple {4280#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4280#false} is VALID [2018-11-23 11:59:09,506 INFO L273 TraceCheckUtils]: 38: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4280#false} is VALID [2018-11-23 11:59:09,507 INFO L273 TraceCheckUtils]: 39: Hoare triple {4280#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4280#false} is VALID [2018-11-23 11:59:09,507 INFO L273 TraceCheckUtils]: 40: Hoare triple {4280#false} assume !(~i~0 < 100000); {4280#false} is VALID [2018-11-23 11:59:09,507 INFO L273 TraceCheckUtils]: 41: Hoare triple {4280#false} ~i~0 := 0; {4280#false} is VALID [2018-11-23 11:59:09,507 INFO L273 TraceCheckUtils]: 42: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4280#false} is VALID [2018-11-23 11:59:09,507 INFO L273 TraceCheckUtils]: 43: Hoare triple {4280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4280#false} is VALID [2018-11-23 11:59:09,507 INFO L273 TraceCheckUtils]: 44: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4280#false} is VALID [2018-11-23 11:59:09,507 INFO L273 TraceCheckUtils]: 45: Hoare triple {4280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4280#false} is VALID [2018-11-23 11:59:09,508 INFO L273 TraceCheckUtils]: 46: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4280#false} is VALID [2018-11-23 11:59:09,508 INFO L273 TraceCheckUtils]: 47: Hoare triple {4280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4280#false} is VALID [2018-11-23 11:59:09,508 INFO L273 TraceCheckUtils]: 48: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4280#false} is VALID [2018-11-23 11:59:09,508 INFO L273 TraceCheckUtils]: 49: Hoare triple {4280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4280#false} is VALID [2018-11-23 11:59:09,508 INFO L273 TraceCheckUtils]: 50: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4280#false} is VALID [2018-11-23 11:59:09,508 INFO L273 TraceCheckUtils]: 51: Hoare triple {4280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4280#false} is VALID [2018-11-23 11:59:09,509 INFO L273 TraceCheckUtils]: 52: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4280#false} is VALID [2018-11-23 11:59:09,509 INFO L273 TraceCheckUtils]: 53: Hoare triple {4280#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4280#false} is VALID [2018-11-23 11:59:09,509 INFO L273 TraceCheckUtils]: 54: Hoare triple {4280#false} assume !(~i~0 < 100000); {4280#false} is VALID [2018-11-23 11:59:09,509 INFO L273 TraceCheckUtils]: 55: Hoare triple {4280#false} havoc ~x~0;~x~0 := 0; {4280#false} is VALID [2018-11-23 11:59:09,509 INFO L273 TraceCheckUtils]: 56: Hoare triple {4280#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {4280#false} is VALID [2018-11-23 11:59:09,509 INFO L256 TraceCheckUtils]: 57: Hoare triple {4280#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {4280#false} is VALID [2018-11-23 11:59:09,509 INFO L273 TraceCheckUtils]: 58: Hoare triple {4280#false} ~cond := #in~cond; {4280#false} is VALID [2018-11-23 11:59:09,510 INFO L273 TraceCheckUtils]: 59: Hoare triple {4280#false} assume 0 == ~cond; {4280#false} is VALID [2018-11-23 11:59:09,510 INFO L273 TraceCheckUtils]: 60: Hoare triple {4280#false} assume !false; {4280#false} is VALID [2018-11-23 11:59:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:59:09,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:09,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:59:09,536 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-11-23 11:59:09,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:09,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:59:09,588 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 11:59:09,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:59:09,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:59:09,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:09,589 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 14 states. [2018-11-23 11:59:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:09,835 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-11-23 11:59:09,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:59:09,836 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-11-23 11:59:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2018-11-23 11:59:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2018-11-23 11:59:09,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 70 transitions. [2018-11-23 11:59:09,942 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 11:59:09,943 INFO L225 Difference]: With dead ends: 108 [2018-11-23 11:59:09,944 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 11:59:09,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 11:59:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-23 11:59:09,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:09,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-23 11:59:09,969 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-23 11:59:09,969 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-23 11:59:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:09,971 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 11:59:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 11:59:09,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:09,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:09,972 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-23 11:59:09,972 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-23 11:59:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:09,974 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 11:59:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 11:59:09,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:09,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:09,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:09,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 11:59:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-23 11:59:09,976 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 61 [2018-11-23 11:59:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:09,977 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-23 11:59:09,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:59:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-23 11:59:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 11:59:09,978 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:09,978 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:09,978 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:09,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:09,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1121697740, now seen corresponding path program 11 times [2018-11-23 11:59:09,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:09,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:09,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:09,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:09,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:10,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {4872#true} call ULTIMATE.init(); {4872#true} is VALID [2018-11-23 11:59:10,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {4872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4872#true} is VALID [2018-11-23 11:59:10,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {4872#true} assume true; {4872#true} is VALID [2018-11-23 11:59:10,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4872#true} {4872#true} #77#return; {4872#true} is VALID [2018-11-23 11:59:10,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {4872#true} call #t~ret9 := main(); {4872#true} is VALID [2018-11-23 11:59:10,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {4872#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4874#(= main_~a~0 0)} is VALID [2018-11-23 11:59:10,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {4874#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4874#(= main_~a~0 0)} is VALID [2018-11-23 11:59:10,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {4874#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4875#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:10,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {4875#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4875#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:10,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {4875#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4876#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:10,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {4876#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4876#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:10,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {4876#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4877#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:10,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {4877#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4877#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:10,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {4877#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4878#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:10,794 INFO L273 TraceCheckUtils]: 14: Hoare triple {4878#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4878#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:10,795 INFO L273 TraceCheckUtils]: 15: Hoare triple {4878#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4879#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:10,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {4879#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4879#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:10,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {4879#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4880#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:10,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {4880#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4880#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:10,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {4880#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4881#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:10,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {4881#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4881#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:10,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {4881#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4882#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:10,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {4882#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4882#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:10,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {4882#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4883#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:10,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {4883#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4883#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:10,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {4883#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4884#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:10,802 INFO L273 TraceCheckUtils]: 26: Hoare triple {4884#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4884#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:10,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {4884#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4885#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:10,803 INFO L273 TraceCheckUtils]: 28: Hoare triple {4885#(<= main_~a~0 11)} assume !(~a~0 < 100000); {4873#false} is VALID [2018-11-23 11:59:10,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {4873#false} havoc ~i~0;~i~0 := 0; {4873#false} is VALID [2018-11-23 11:59:10,804 INFO L273 TraceCheckUtils]: 30: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4873#false} is VALID [2018-11-23 11:59:10,804 INFO L273 TraceCheckUtils]: 31: Hoare triple {4873#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4873#false} is VALID [2018-11-23 11:59:10,804 INFO L273 TraceCheckUtils]: 32: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4873#false} is VALID [2018-11-23 11:59:10,804 INFO L273 TraceCheckUtils]: 33: Hoare triple {4873#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4873#false} is VALID [2018-11-23 11:59:10,805 INFO L273 TraceCheckUtils]: 34: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4873#false} is VALID [2018-11-23 11:59:10,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {4873#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4873#false} is VALID [2018-11-23 11:59:10,805 INFO L273 TraceCheckUtils]: 36: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4873#false} is VALID [2018-11-23 11:59:10,805 INFO L273 TraceCheckUtils]: 37: Hoare triple {4873#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4873#false} is VALID [2018-11-23 11:59:10,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4873#false} is VALID [2018-11-23 11:59:10,806 INFO L273 TraceCheckUtils]: 39: Hoare triple {4873#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4873#false} is VALID [2018-11-23 11:59:10,806 INFO L273 TraceCheckUtils]: 40: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4873#false} is VALID [2018-11-23 11:59:10,806 INFO L273 TraceCheckUtils]: 41: Hoare triple {4873#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4873#false} is VALID [2018-11-23 11:59:10,806 INFO L273 TraceCheckUtils]: 42: Hoare triple {4873#false} assume !(~i~0 < 100000); {4873#false} is VALID [2018-11-23 11:59:10,806 INFO L273 TraceCheckUtils]: 43: Hoare triple {4873#false} ~i~0 := 0; {4873#false} is VALID [2018-11-23 11:59:10,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4873#false} is VALID [2018-11-23 11:59:10,807 INFO L273 TraceCheckUtils]: 45: Hoare triple {4873#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4873#false} is VALID [2018-11-23 11:59:10,807 INFO L273 TraceCheckUtils]: 46: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4873#false} is VALID [2018-11-23 11:59:10,807 INFO L273 TraceCheckUtils]: 47: Hoare triple {4873#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4873#false} is VALID [2018-11-23 11:59:10,807 INFO L273 TraceCheckUtils]: 48: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4873#false} is VALID [2018-11-23 11:59:10,807 INFO L273 TraceCheckUtils]: 49: Hoare triple {4873#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4873#false} is VALID [2018-11-23 11:59:10,808 INFO L273 TraceCheckUtils]: 50: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4873#false} is VALID [2018-11-23 11:59:10,808 INFO L273 TraceCheckUtils]: 51: Hoare triple {4873#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4873#false} is VALID [2018-11-23 11:59:10,808 INFO L273 TraceCheckUtils]: 52: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4873#false} is VALID [2018-11-23 11:59:10,808 INFO L273 TraceCheckUtils]: 53: Hoare triple {4873#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4873#false} is VALID [2018-11-23 11:59:10,808 INFO L273 TraceCheckUtils]: 54: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4873#false} is VALID [2018-11-23 11:59:10,808 INFO L273 TraceCheckUtils]: 55: Hoare triple {4873#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4873#false} is VALID [2018-11-23 11:59:10,808 INFO L273 TraceCheckUtils]: 56: Hoare triple {4873#false} assume !(~i~0 < 100000); {4873#false} is VALID [2018-11-23 11:59:10,808 INFO L273 TraceCheckUtils]: 57: Hoare triple {4873#false} havoc ~x~0;~x~0 := 0; {4873#false} is VALID [2018-11-23 11:59:10,809 INFO L273 TraceCheckUtils]: 58: Hoare triple {4873#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {4873#false} is VALID [2018-11-23 11:59:10,809 INFO L256 TraceCheckUtils]: 59: Hoare triple {4873#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {4873#false} is VALID [2018-11-23 11:59:10,809 INFO L273 TraceCheckUtils]: 60: Hoare triple {4873#false} ~cond := #in~cond; {4873#false} is VALID [2018-11-23 11:59:10,809 INFO L273 TraceCheckUtils]: 61: Hoare triple {4873#false} assume 0 == ~cond; {4873#false} is VALID [2018-11-23 11:59:10,809 INFO L273 TraceCheckUtils]: 62: Hoare triple {4873#false} assume !false; {4873#false} is VALID [2018-11-23 11:59:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:59:10,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:10,812 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 11:59:10,820 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:15,156 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:59:15,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:15,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:15,334 INFO L256 TraceCheckUtils]: 0: Hoare triple {4872#true} call ULTIMATE.init(); {4872#true} is VALID [2018-11-23 11:59:15,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {4872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4872#true} is VALID [2018-11-23 11:59:15,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {4872#true} assume true; {4872#true} is VALID [2018-11-23 11:59:15,335 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4872#true} {4872#true} #77#return; {4872#true} is VALID [2018-11-23 11:59:15,336 INFO L256 TraceCheckUtils]: 4: Hoare triple {4872#true} call #t~ret9 := main(); {4872#true} is VALID [2018-11-23 11:59:15,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {4872#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4872#true} is VALID [2018-11-23 11:59:15,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {4872#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4872#true} is VALID [2018-11-23 11:59:15,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {4872#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4872#true} is VALID [2018-11-23 11:59:15,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {4872#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4872#true} is VALID [2018-11-23 11:59:15,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {4872#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4872#true} is VALID [2018-11-23 11:59:15,337 INFO L273 TraceCheckUtils]: 10: Hoare triple {4872#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4872#true} is VALID [2018-11-23 11:59:15,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {4872#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4872#true} is VALID [2018-11-23 11:59:15,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {4872#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4872#true} is VALID [2018-11-23 11:59:15,337 INFO L273 TraceCheckUtils]: 13: Hoare triple {4872#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4872#true} is VALID [2018-11-23 11:59:15,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {4872#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4872#true} is VALID [2018-11-23 11:59:15,337 INFO L273 TraceCheckUtils]: 15: Hoare triple {4872#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4872#true} is VALID [2018-11-23 11:59:15,337 INFO L273 TraceCheckUtils]: 16: Hoare triple {4872#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4872#true} is VALID [2018-11-23 11:59:15,338 INFO L273 TraceCheckUtils]: 17: Hoare triple {4872#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4872#true} is VALID [2018-11-23 11:59:15,338 INFO L273 TraceCheckUtils]: 18: Hoare triple {4872#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4872#true} is VALID [2018-11-23 11:59:15,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {4872#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4872#true} is VALID [2018-11-23 11:59:15,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {4872#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4872#true} is VALID [2018-11-23 11:59:15,338 INFO L273 TraceCheckUtils]: 21: Hoare triple {4872#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4872#true} is VALID [2018-11-23 11:59:15,338 INFO L273 TraceCheckUtils]: 22: Hoare triple {4872#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4872#true} is VALID [2018-11-23 11:59:15,338 INFO L273 TraceCheckUtils]: 23: Hoare triple {4872#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4872#true} is VALID [2018-11-23 11:59:15,338 INFO L273 TraceCheckUtils]: 24: Hoare triple {4872#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4872#true} is VALID [2018-11-23 11:59:15,338 INFO L273 TraceCheckUtils]: 25: Hoare triple {4872#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4872#true} is VALID [2018-11-23 11:59:15,339 INFO L273 TraceCheckUtils]: 26: Hoare triple {4872#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4872#true} is VALID [2018-11-23 11:59:15,339 INFO L273 TraceCheckUtils]: 27: Hoare triple {4872#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4872#true} is VALID [2018-11-23 11:59:15,339 INFO L273 TraceCheckUtils]: 28: Hoare triple {4872#true} assume !(~a~0 < 100000); {4872#true} is VALID [2018-11-23 11:59:15,339 INFO L273 TraceCheckUtils]: 29: Hoare triple {4872#true} havoc ~i~0;~i~0 := 0; {4872#true} is VALID [2018-11-23 11:59:15,339 INFO L273 TraceCheckUtils]: 30: Hoare triple {4872#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4872#true} is VALID [2018-11-23 11:59:15,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {4872#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4872#true} is VALID [2018-11-23 11:59:15,339 INFO L273 TraceCheckUtils]: 32: Hoare triple {4872#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4872#true} is VALID [2018-11-23 11:59:15,339 INFO L273 TraceCheckUtils]: 33: Hoare triple {4872#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4872#true} is VALID [2018-11-23 11:59:15,340 INFO L273 TraceCheckUtils]: 34: Hoare triple {4872#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4872#true} is VALID [2018-11-23 11:59:15,340 INFO L273 TraceCheckUtils]: 35: Hoare triple {4872#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4872#true} is VALID [2018-11-23 11:59:15,340 INFO L273 TraceCheckUtils]: 36: Hoare triple {4872#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4872#true} is VALID [2018-11-23 11:59:15,340 INFO L273 TraceCheckUtils]: 37: Hoare triple {4872#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4872#true} is VALID [2018-11-23 11:59:15,340 INFO L273 TraceCheckUtils]: 38: Hoare triple {4872#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4872#true} is VALID [2018-11-23 11:59:15,340 INFO L273 TraceCheckUtils]: 39: Hoare triple {4872#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4872#true} is VALID [2018-11-23 11:59:15,340 INFO L273 TraceCheckUtils]: 40: Hoare triple {4872#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4872#true} is VALID [2018-11-23 11:59:15,340 INFO L273 TraceCheckUtils]: 41: Hoare triple {4872#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4872#true} is VALID [2018-11-23 11:59:15,341 INFO L273 TraceCheckUtils]: 42: Hoare triple {4872#true} assume !(~i~0 < 100000); {4872#true} is VALID [2018-11-23 11:59:15,341 INFO L273 TraceCheckUtils]: 43: Hoare triple {4872#true} ~i~0 := 0; {5018#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:15,341 INFO L273 TraceCheckUtils]: 44: Hoare triple {5018#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5018#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:15,342 INFO L273 TraceCheckUtils]: 45: Hoare triple {5018#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5025#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:15,342 INFO L273 TraceCheckUtils]: 46: Hoare triple {5025#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5025#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:15,342 INFO L273 TraceCheckUtils]: 47: Hoare triple {5025#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5032#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:15,343 INFO L273 TraceCheckUtils]: 48: Hoare triple {5032#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5032#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:15,343 INFO L273 TraceCheckUtils]: 49: Hoare triple {5032#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5039#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:15,344 INFO L273 TraceCheckUtils]: 50: Hoare triple {5039#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5039#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:15,344 INFO L273 TraceCheckUtils]: 51: Hoare triple {5039#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5046#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:15,345 INFO L273 TraceCheckUtils]: 52: Hoare triple {5046#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5046#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:15,345 INFO L273 TraceCheckUtils]: 53: Hoare triple {5046#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5053#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:15,346 INFO L273 TraceCheckUtils]: 54: Hoare triple {5053#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5053#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:15,347 INFO L273 TraceCheckUtils]: 55: Hoare triple {5053#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5060#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:15,347 INFO L273 TraceCheckUtils]: 56: Hoare triple {5060#(<= main_~i~0 6)} assume !(~i~0 < 100000); {4873#false} is VALID [2018-11-23 11:59:15,348 INFO L273 TraceCheckUtils]: 57: Hoare triple {4873#false} havoc ~x~0;~x~0 := 0; {4873#false} is VALID [2018-11-23 11:59:15,348 INFO L273 TraceCheckUtils]: 58: Hoare triple {4873#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {4873#false} is VALID [2018-11-23 11:59:15,348 INFO L256 TraceCheckUtils]: 59: Hoare triple {4873#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {4873#false} is VALID [2018-11-23 11:59:15,348 INFO L273 TraceCheckUtils]: 60: Hoare triple {4873#false} ~cond := #in~cond; {4873#false} is VALID [2018-11-23 11:59:15,348 INFO L273 TraceCheckUtils]: 61: Hoare triple {4873#false} assume 0 == ~cond; {4873#false} is VALID [2018-11-23 11:59:15,348 INFO L273 TraceCheckUtils]: 62: Hoare triple {4873#false} assume !false; {4873#false} is VALID [2018-11-23 11:59:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-11-23 11:59:15,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:15,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2018-11-23 11:59:15,374 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-11-23 11:59:15,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:15,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:59:15,432 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 11:59:15,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:59:15,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:59:15,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:59:15,433 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 21 states. [2018-11-23 11:59:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:16,200 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-11-23 11:59:16,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:59:16,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-11-23 11:59:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:59:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 102 transitions. [2018-11-23 11:59:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:59:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 102 transitions. [2018-11-23 11:59:16,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 102 transitions. [2018-11-23 11:59:16,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:16,712 INFO L225 Difference]: With dead ends: 116 [2018-11-23 11:59:16,712 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 11:59:16,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:59:16,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 11:59:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-11-23 11:59:16,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:16,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 74 states. [2018-11-23 11:59:16,780 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 74 states. [2018-11-23 11:59:16,780 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 74 states. [2018-11-23 11:59:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:16,782 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-11-23 11:59:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-11-23 11:59:16,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:16,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:16,782 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 77 states. [2018-11-23 11:59:16,782 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 77 states. [2018-11-23 11:59:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:16,784 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-11-23 11:59:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-11-23 11:59:16,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:16,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:16,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:16,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 11:59:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-23 11:59:16,787 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 63 [2018-11-23 11:59:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:16,787 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-23 11:59:16,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:59:16,787 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-23 11:59:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 11:59:16,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:16,788 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:16,789 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:16,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:16,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1865299046, now seen corresponding path program 12 times [2018-11-23 11:59:16,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:16,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:16,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:16,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:16,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:17,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {5514#true} call ULTIMATE.init(); {5514#true} is VALID [2018-11-23 11:59:17,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {5514#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5514#true} is VALID [2018-11-23 11:59:17,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {5514#true} assume true; {5514#true} is VALID [2018-11-23 11:59:17,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5514#true} {5514#true} #77#return; {5514#true} is VALID [2018-11-23 11:59:17,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {5514#true} call #t~ret9 := main(); {5514#true} is VALID [2018-11-23 11:59:17,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {5514#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5516#(= main_~a~0 0)} is VALID [2018-11-23 11:59:17,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {5516#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5516#(= main_~a~0 0)} is VALID [2018-11-23 11:59:17,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {5516#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5517#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:17,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {5517#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5517#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:17,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {5517#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5518#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:17,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {5518#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5518#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:17,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {5518#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5519#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:17,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {5519#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5519#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:17,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {5519#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5520#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:17,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {5520#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5520#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:17,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {5520#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5521#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:17,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {5521#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5521#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:17,374 INFO L273 TraceCheckUtils]: 17: Hoare triple {5521#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5522#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:17,374 INFO L273 TraceCheckUtils]: 18: Hoare triple {5522#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5522#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:17,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {5522#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5523#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:17,376 INFO L273 TraceCheckUtils]: 20: Hoare triple {5523#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5523#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:17,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {5523#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5524#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:17,377 INFO L273 TraceCheckUtils]: 22: Hoare triple {5524#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5524#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:17,378 INFO L273 TraceCheckUtils]: 23: Hoare triple {5524#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5525#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:17,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {5525#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5525#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:17,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {5525#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5526#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:17,380 INFO L273 TraceCheckUtils]: 26: Hoare triple {5526#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5526#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:17,381 INFO L273 TraceCheckUtils]: 27: Hoare triple {5526#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5527#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:17,382 INFO L273 TraceCheckUtils]: 28: Hoare triple {5527#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5527#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:17,383 INFO L273 TraceCheckUtils]: 29: Hoare triple {5527#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5528#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:17,383 INFO L273 TraceCheckUtils]: 30: Hoare triple {5528#(<= main_~a~0 12)} assume !(~a~0 < 100000); {5515#false} is VALID [2018-11-23 11:59:17,384 INFO L273 TraceCheckUtils]: 31: Hoare triple {5515#false} havoc ~i~0;~i~0 := 0; {5515#false} is VALID [2018-11-23 11:59:17,384 INFO L273 TraceCheckUtils]: 32: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5515#false} is VALID [2018-11-23 11:59:17,384 INFO L273 TraceCheckUtils]: 33: Hoare triple {5515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5515#false} is VALID [2018-11-23 11:59:17,384 INFO L273 TraceCheckUtils]: 34: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5515#false} is VALID [2018-11-23 11:59:17,384 INFO L273 TraceCheckUtils]: 35: Hoare triple {5515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5515#false} is VALID [2018-11-23 11:59:17,385 INFO L273 TraceCheckUtils]: 36: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5515#false} is VALID [2018-11-23 11:59:17,385 INFO L273 TraceCheckUtils]: 37: Hoare triple {5515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5515#false} is VALID [2018-11-23 11:59:17,385 INFO L273 TraceCheckUtils]: 38: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5515#false} is VALID [2018-11-23 11:59:17,385 INFO L273 TraceCheckUtils]: 39: Hoare triple {5515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5515#false} is VALID [2018-11-23 11:59:17,385 INFO L273 TraceCheckUtils]: 40: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5515#false} is VALID [2018-11-23 11:59:17,386 INFO L273 TraceCheckUtils]: 41: Hoare triple {5515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5515#false} is VALID [2018-11-23 11:59:17,386 INFO L273 TraceCheckUtils]: 42: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5515#false} is VALID [2018-11-23 11:59:17,386 INFO L273 TraceCheckUtils]: 43: Hoare triple {5515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5515#false} is VALID [2018-11-23 11:59:17,386 INFO L273 TraceCheckUtils]: 44: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5515#false} is VALID [2018-11-23 11:59:17,386 INFO L273 TraceCheckUtils]: 45: Hoare triple {5515#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5515#false} is VALID [2018-11-23 11:59:17,386 INFO L273 TraceCheckUtils]: 46: Hoare triple {5515#false} assume !(~i~0 < 100000); {5515#false} is VALID [2018-11-23 11:59:17,386 INFO L273 TraceCheckUtils]: 47: Hoare triple {5515#false} ~i~0 := 0; {5515#false} is VALID [2018-11-23 11:59:17,386 INFO L273 TraceCheckUtils]: 48: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:17,387 INFO L273 TraceCheckUtils]: 49: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:17,387 INFO L273 TraceCheckUtils]: 50: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:17,387 INFO L273 TraceCheckUtils]: 51: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:17,387 INFO L273 TraceCheckUtils]: 52: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:17,387 INFO L273 TraceCheckUtils]: 53: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:17,387 INFO L273 TraceCheckUtils]: 54: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:17,387 INFO L273 TraceCheckUtils]: 55: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:17,387 INFO L273 TraceCheckUtils]: 56: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:17,387 INFO L273 TraceCheckUtils]: 57: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:17,388 INFO L273 TraceCheckUtils]: 58: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:17,388 INFO L273 TraceCheckUtils]: 59: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:17,388 INFO L273 TraceCheckUtils]: 60: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:17,388 INFO L273 TraceCheckUtils]: 61: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:17,388 INFO L273 TraceCheckUtils]: 62: Hoare triple {5515#false} assume !(~i~0 < 100000); {5515#false} is VALID [2018-11-23 11:59:17,388 INFO L273 TraceCheckUtils]: 63: Hoare triple {5515#false} havoc ~x~0;~x~0 := 0; {5515#false} is VALID [2018-11-23 11:59:17,388 INFO L273 TraceCheckUtils]: 64: Hoare triple {5515#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {5515#false} is VALID [2018-11-23 11:59:17,388 INFO L256 TraceCheckUtils]: 65: Hoare triple {5515#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {5515#false} is VALID [2018-11-23 11:59:17,389 INFO L273 TraceCheckUtils]: 66: Hoare triple {5515#false} ~cond := #in~cond; {5515#false} is VALID [2018-11-23 11:59:17,389 INFO L273 TraceCheckUtils]: 67: Hoare triple {5515#false} assume 0 == ~cond; {5515#false} is VALID [2018-11-23 11:59:17,389 INFO L273 TraceCheckUtils]: 68: Hoare triple {5515#false} assume !false; {5515#false} is VALID [2018-11-23 11:59:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-23 11:59:17,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:17,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 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 11:59:17,400 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:19,813 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:59:19,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:19,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:20,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {5514#true} call ULTIMATE.init(); {5514#true} is VALID [2018-11-23 11:59:20,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {5514#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5514#true} is VALID [2018-11-23 11:59:20,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {5514#true} assume true; {5514#true} is VALID [2018-11-23 11:59:20,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5514#true} {5514#true} #77#return; {5514#true} is VALID [2018-11-23 11:59:20,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {5514#true} call #t~ret9 := main(); {5514#true} is VALID [2018-11-23 11:59:20,020 INFO L273 TraceCheckUtils]: 5: Hoare triple {5514#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5514#true} is VALID [2018-11-23 11:59:20,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {5514#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5514#true} is VALID [2018-11-23 11:59:20,021 INFO L273 TraceCheckUtils]: 7: Hoare triple {5514#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5514#true} is VALID [2018-11-23 11:59:20,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {5514#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5514#true} is VALID [2018-11-23 11:59:20,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {5514#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5514#true} is VALID [2018-11-23 11:59:20,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {5514#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5514#true} is VALID [2018-11-23 11:59:20,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {5514#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5514#true} is VALID [2018-11-23 11:59:20,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {5514#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5514#true} is VALID [2018-11-23 11:59:20,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {5514#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5514#true} is VALID [2018-11-23 11:59:20,022 INFO L273 TraceCheckUtils]: 14: Hoare triple {5514#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5514#true} is VALID [2018-11-23 11:59:20,022 INFO L273 TraceCheckUtils]: 15: Hoare triple {5514#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5514#true} is VALID [2018-11-23 11:59:20,023 INFO L273 TraceCheckUtils]: 16: Hoare triple {5514#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5514#true} is VALID [2018-11-23 11:59:20,023 INFO L273 TraceCheckUtils]: 17: Hoare triple {5514#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5514#true} is VALID [2018-11-23 11:59:20,023 INFO L273 TraceCheckUtils]: 18: Hoare triple {5514#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5514#true} is VALID [2018-11-23 11:59:20,023 INFO L273 TraceCheckUtils]: 19: Hoare triple {5514#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5514#true} is VALID [2018-11-23 11:59:20,023 INFO L273 TraceCheckUtils]: 20: Hoare triple {5514#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5514#true} is VALID [2018-11-23 11:59:20,023 INFO L273 TraceCheckUtils]: 21: Hoare triple {5514#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5514#true} is VALID [2018-11-23 11:59:20,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {5514#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5514#true} is VALID [2018-11-23 11:59:20,023 INFO L273 TraceCheckUtils]: 23: Hoare triple {5514#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5514#true} is VALID [2018-11-23 11:59:20,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {5514#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5514#true} is VALID [2018-11-23 11:59:20,024 INFO L273 TraceCheckUtils]: 25: Hoare triple {5514#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5514#true} is VALID [2018-11-23 11:59:20,024 INFO L273 TraceCheckUtils]: 26: Hoare triple {5514#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5514#true} is VALID [2018-11-23 11:59:20,024 INFO L273 TraceCheckUtils]: 27: Hoare triple {5514#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5514#true} is VALID [2018-11-23 11:59:20,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {5514#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {5514#true} is VALID [2018-11-23 11:59:20,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {5514#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5514#true} is VALID [2018-11-23 11:59:20,024 INFO L273 TraceCheckUtils]: 30: Hoare triple {5514#true} assume !(~a~0 < 100000); {5514#true} is VALID [2018-11-23 11:59:20,025 INFO L273 TraceCheckUtils]: 31: Hoare triple {5514#true} havoc ~i~0;~i~0 := 0; {5625#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:20,025 INFO L273 TraceCheckUtils]: 32: Hoare triple {5625#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5625#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:20,026 INFO L273 TraceCheckUtils]: 33: Hoare triple {5625#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5632#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:20,026 INFO L273 TraceCheckUtils]: 34: Hoare triple {5632#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5632#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:20,026 INFO L273 TraceCheckUtils]: 35: Hoare triple {5632#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5639#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:20,027 INFO L273 TraceCheckUtils]: 36: Hoare triple {5639#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5639#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:20,027 INFO L273 TraceCheckUtils]: 37: Hoare triple {5639#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5646#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:20,027 INFO L273 TraceCheckUtils]: 38: Hoare triple {5646#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5646#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:20,028 INFO L273 TraceCheckUtils]: 39: Hoare triple {5646#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5653#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:20,029 INFO L273 TraceCheckUtils]: 40: Hoare triple {5653#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5653#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:20,029 INFO L273 TraceCheckUtils]: 41: Hoare triple {5653#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5660#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:20,030 INFO L273 TraceCheckUtils]: 42: Hoare triple {5660#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5660#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:20,031 INFO L273 TraceCheckUtils]: 43: Hoare triple {5660#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5667#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:20,031 INFO L273 TraceCheckUtils]: 44: Hoare triple {5667#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5667#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:20,032 INFO L273 TraceCheckUtils]: 45: Hoare triple {5667#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5674#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:20,033 INFO L273 TraceCheckUtils]: 46: Hoare triple {5674#(<= main_~i~0 7)} assume !(~i~0 < 100000); {5515#false} is VALID [2018-11-23 11:59:20,033 INFO L273 TraceCheckUtils]: 47: Hoare triple {5515#false} ~i~0 := 0; {5515#false} is VALID [2018-11-23 11:59:20,033 INFO L273 TraceCheckUtils]: 48: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:20,033 INFO L273 TraceCheckUtils]: 49: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:20,033 INFO L273 TraceCheckUtils]: 50: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:20,034 INFO L273 TraceCheckUtils]: 51: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:20,034 INFO L273 TraceCheckUtils]: 52: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:20,034 INFO L273 TraceCheckUtils]: 53: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:20,034 INFO L273 TraceCheckUtils]: 54: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:20,035 INFO L273 TraceCheckUtils]: 55: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:20,035 INFO L273 TraceCheckUtils]: 56: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:20,035 INFO L273 TraceCheckUtils]: 57: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:20,035 INFO L273 TraceCheckUtils]: 58: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:20,035 INFO L273 TraceCheckUtils]: 59: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:20,036 INFO L273 TraceCheckUtils]: 60: Hoare triple {5515#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {5515#false} is VALID [2018-11-23 11:59:20,036 INFO L273 TraceCheckUtils]: 61: Hoare triple {5515#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#false} is VALID [2018-11-23 11:59:20,036 INFO L273 TraceCheckUtils]: 62: Hoare triple {5515#false} assume !(~i~0 < 100000); {5515#false} is VALID [2018-11-23 11:59:20,036 INFO L273 TraceCheckUtils]: 63: Hoare triple {5515#false} havoc ~x~0;~x~0 := 0; {5515#false} is VALID [2018-11-23 11:59:20,036 INFO L273 TraceCheckUtils]: 64: Hoare triple {5515#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {5515#false} is VALID [2018-11-23 11:59:20,037 INFO L256 TraceCheckUtils]: 65: Hoare triple {5515#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {5515#false} is VALID [2018-11-23 11:59:20,037 INFO L273 TraceCheckUtils]: 66: Hoare triple {5515#false} ~cond := #in~cond; {5515#false} is VALID [2018-11-23 11:59:20,037 INFO L273 TraceCheckUtils]: 67: Hoare triple {5515#false} assume 0 == ~cond; {5515#false} is VALID [2018-11-23 11:59:20,037 INFO L273 TraceCheckUtils]: 68: Hoare triple {5515#false} assume !false; {5515#false} is VALID [2018-11-23 11:59:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-11-23 11:59:20,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:20,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-11-23 11:59:20,061 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-11-23 11:59:20,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:20,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:59:20,124 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 11:59:20,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:59:20,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:59:20,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:59:20,126 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 23 states. [2018-11-23 11:59:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:20,730 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-11-23 11:59:20,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:59:20,730 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-11-23 11:59:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:59:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 108 transitions. [2018-11-23 11:59:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:59:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 108 transitions. [2018-11-23 11:59:20,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 108 transitions. [2018-11-23 11:59:21,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:21,736 INFO L225 Difference]: With dead ends: 126 [2018-11-23 11:59:21,736 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:59:21,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:59:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:59:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2018-11-23 11:59:21,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:21,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 80 states. [2018-11-23 11:59:21,778 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 80 states. [2018-11-23 11:59:21,778 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 80 states. [2018-11-23 11:59:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:21,780 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-11-23 11:59:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-11-23 11:59:21,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:21,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:21,781 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 83 states. [2018-11-23 11:59:21,781 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 83 states. [2018-11-23 11:59:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:21,783 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-11-23 11:59:21,783 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-11-23 11:59:21,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:21,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:21,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:21,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:59:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-11-23 11:59:21,786 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 69 [2018-11-23 11:59:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:21,786 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-11-23 11:59:21,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:59:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-23 11:59:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 11:59:21,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:21,787 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:21,787 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:21,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1692070528, now seen corresponding path program 13 times [2018-11-23 11:59:21,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:21,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:21,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:23,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {6212#true} call ULTIMATE.init(); {6212#true} is VALID [2018-11-23 11:59:23,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {6212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6212#true} is VALID [2018-11-23 11:59:23,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {6212#true} assume true; {6212#true} is VALID [2018-11-23 11:59:23,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6212#true} {6212#true} #77#return; {6212#true} is VALID [2018-11-23 11:59:23,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {6212#true} call #t~ret9 := main(); {6212#true} is VALID [2018-11-23 11:59:23,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {6212#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6214#(= main_~a~0 0)} is VALID [2018-11-23 11:59:23,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {6214#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6214#(= main_~a~0 0)} is VALID [2018-11-23 11:59:23,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {6214#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6215#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:23,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {6215#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6215#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:23,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {6215#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6216#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:23,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {6216#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6216#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:23,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {6216#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6217#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:23,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {6217#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6217#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:23,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {6217#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6218#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:23,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {6218#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6218#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:23,090 INFO L273 TraceCheckUtils]: 15: Hoare triple {6218#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6219#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:23,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {6219#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6219#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:23,091 INFO L273 TraceCheckUtils]: 17: Hoare triple {6219#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6220#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:23,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {6220#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6220#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:23,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {6220#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6221#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:23,093 INFO L273 TraceCheckUtils]: 20: Hoare triple {6221#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6221#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:23,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {6221#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6222#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:23,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {6222#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6222#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:23,095 INFO L273 TraceCheckUtils]: 23: Hoare triple {6222#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6223#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:23,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {6223#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6223#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:23,096 INFO L273 TraceCheckUtils]: 25: Hoare triple {6223#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6224#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:23,097 INFO L273 TraceCheckUtils]: 26: Hoare triple {6224#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6224#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:23,097 INFO L273 TraceCheckUtils]: 27: Hoare triple {6224#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6225#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:23,098 INFO L273 TraceCheckUtils]: 28: Hoare triple {6225#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6225#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:23,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {6225#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6226#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:23,099 INFO L273 TraceCheckUtils]: 30: Hoare triple {6226#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6226#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:23,100 INFO L273 TraceCheckUtils]: 31: Hoare triple {6226#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6227#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:23,101 INFO L273 TraceCheckUtils]: 32: Hoare triple {6227#(<= main_~a~0 13)} assume !(~a~0 < 100000); {6213#false} is VALID [2018-11-23 11:59:23,101 INFO L273 TraceCheckUtils]: 33: Hoare triple {6213#false} havoc ~i~0;~i~0 := 0; {6213#false} is VALID [2018-11-23 11:59:23,101 INFO L273 TraceCheckUtils]: 34: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,101 INFO L273 TraceCheckUtils]: 35: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,102 INFO L273 TraceCheckUtils]: 36: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,102 INFO L273 TraceCheckUtils]: 37: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,102 INFO L273 TraceCheckUtils]: 38: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,102 INFO L273 TraceCheckUtils]: 39: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,103 INFO L273 TraceCheckUtils]: 41: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,103 INFO L273 TraceCheckUtils]: 42: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,103 INFO L273 TraceCheckUtils]: 43: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,103 INFO L273 TraceCheckUtils]: 44: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,103 INFO L273 TraceCheckUtils]: 45: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,104 INFO L273 TraceCheckUtils]: 46: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,104 INFO L273 TraceCheckUtils]: 47: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,104 INFO L273 TraceCheckUtils]: 48: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,104 INFO L273 TraceCheckUtils]: 49: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,104 INFO L273 TraceCheckUtils]: 50: Hoare triple {6213#false} assume !(~i~0 < 100000); {6213#false} is VALID [2018-11-23 11:59:23,104 INFO L273 TraceCheckUtils]: 51: Hoare triple {6213#false} ~i~0 := 0; {6213#false} is VALID [2018-11-23 11:59:23,104 INFO L273 TraceCheckUtils]: 52: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,104 INFO L273 TraceCheckUtils]: 53: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,104 INFO L273 TraceCheckUtils]: 54: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,105 INFO L273 TraceCheckUtils]: 55: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,105 INFO L273 TraceCheckUtils]: 56: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,105 INFO L273 TraceCheckUtils]: 57: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,105 INFO L273 TraceCheckUtils]: 58: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,105 INFO L273 TraceCheckUtils]: 59: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,105 INFO L273 TraceCheckUtils]: 60: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,105 INFO L273 TraceCheckUtils]: 61: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,105 INFO L273 TraceCheckUtils]: 62: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,106 INFO L273 TraceCheckUtils]: 63: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,106 INFO L273 TraceCheckUtils]: 64: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,106 INFO L273 TraceCheckUtils]: 65: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,106 INFO L273 TraceCheckUtils]: 66: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,106 INFO L273 TraceCheckUtils]: 67: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,106 INFO L273 TraceCheckUtils]: 68: Hoare triple {6213#false} assume !(~i~0 < 100000); {6213#false} is VALID [2018-11-23 11:59:23,106 INFO L273 TraceCheckUtils]: 69: Hoare triple {6213#false} havoc ~x~0;~x~0 := 0; {6213#false} is VALID [2018-11-23 11:59:23,106 INFO L273 TraceCheckUtils]: 70: Hoare triple {6213#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {6213#false} is VALID [2018-11-23 11:59:23,107 INFO L256 TraceCheckUtils]: 71: Hoare triple {6213#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {6213#false} is VALID [2018-11-23 11:59:23,107 INFO L273 TraceCheckUtils]: 72: Hoare triple {6213#false} ~cond := #in~cond; {6213#false} is VALID [2018-11-23 11:59:23,107 INFO L273 TraceCheckUtils]: 73: Hoare triple {6213#false} assume 0 == ~cond; {6213#false} is VALID [2018-11-23 11:59:23,107 INFO L273 TraceCheckUtils]: 74: Hoare triple {6213#false} assume !false; {6213#false} is VALID [2018-11-23 11:59:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:59:23,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:23,110 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 11:59:23,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:23,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:23,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {6212#true} call ULTIMATE.init(); {6212#true} is VALID [2018-11-23 11:59:23,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {6212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6212#true} is VALID [2018-11-23 11:59:23,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {6212#true} assume true; {6212#true} is VALID [2018-11-23 11:59:23,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6212#true} {6212#true} #77#return; {6212#true} is VALID [2018-11-23 11:59:23,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {6212#true} call #t~ret9 := main(); {6212#true} is VALID [2018-11-23 11:59:23,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {6212#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6246#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:23,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {6246#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6246#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:23,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {6246#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6215#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:23,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {6215#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6215#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:23,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {6215#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6216#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:23,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {6216#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6216#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:23,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {6216#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6217#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:23,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {6217#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6217#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:23,518 INFO L273 TraceCheckUtils]: 13: Hoare triple {6217#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6218#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:23,518 INFO L273 TraceCheckUtils]: 14: Hoare triple {6218#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6218#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:23,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {6218#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6219#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:23,524 INFO L273 TraceCheckUtils]: 16: Hoare triple {6219#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6219#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:23,526 INFO L273 TraceCheckUtils]: 17: Hoare triple {6219#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6220#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:23,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {6220#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6220#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:23,528 INFO L273 TraceCheckUtils]: 19: Hoare triple {6220#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6221#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:23,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {6221#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6221#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:23,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {6221#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6222#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:23,530 INFO L273 TraceCheckUtils]: 22: Hoare triple {6222#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6222#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:23,532 INFO L273 TraceCheckUtils]: 23: Hoare triple {6222#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6223#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:23,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {6223#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6223#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:23,535 INFO L273 TraceCheckUtils]: 25: Hoare triple {6223#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6224#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:23,535 INFO L273 TraceCheckUtils]: 26: Hoare triple {6224#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6224#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:23,538 INFO L273 TraceCheckUtils]: 27: Hoare triple {6224#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6225#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:23,538 INFO L273 TraceCheckUtils]: 28: Hoare triple {6225#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6225#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:23,541 INFO L273 TraceCheckUtils]: 29: Hoare triple {6225#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6226#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:23,541 INFO L273 TraceCheckUtils]: 30: Hoare triple {6226#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6226#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:23,543 INFO L273 TraceCheckUtils]: 31: Hoare triple {6226#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6227#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:23,543 INFO L273 TraceCheckUtils]: 32: Hoare triple {6227#(<= main_~a~0 13)} assume !(~a~0 < 100000); {6213#false} is VALID [2018-11-23 11:59:23,543 INFO L273 TraceCheckUtils]: 33: Hoare triple {6213#false} havoc ~i~0;~i~0 := 0; {6213#false} is VALID [2018-11-23 11:59:23,543 INFO L273 TraceCheckUtils]: 34: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,543 INFO L273 TraceCheckUtils]: 35: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,544 INFO L273 TraceCheckUtils]: 36: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,544 INFO L273 TraceCheckUtils]: 37: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,544 INFO L273 TraceCheckUtils]: 38: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,544 INFO L273 TraceCheckUtils]: 39: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,544 INFO L273 TraceCheckUtils]: 40: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,544 INFO L273 TraceCheckUtils]: 41: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,544 INFO L273 TraceCheckUtils]: 42: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,544 INFO L273 TraceCheckUtils]: 43: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,545 INFO L273 TraceCheckUtils]: 44: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,545 INFO L273 TraceCheckUtils]: 45: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,545 INFO L273 TraceCheckUtils]: 46: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,545 INFO L273 TraceCheckUtils]: 47: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,545 INFO L273 TraceCheckUtils]: 48: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6213#false} is VALID [2018-11-23 11:59:23,545 INFO L273 TraceCheckUtils]: 49: Hoare triple {6213#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6213#false} is VALID [2018-11-23 11:59:23,545 INFO L273 TraceCheckUtils]: 50: Hoare triple {6213#false} assume !(~i~0 < 100000); {6213#false} is VALID [2018-11-23 11:59:23,545 INFO L273 TraceCheckUtils]: 51: Hoare triple {6213#false} ~i~0 := 0; {6213#false} is VALID [2018-11-23 11:59:23,545 INFO L273 TraceCheckUtils]: 52: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,546 INFO L273 TraceCheckUtils]: 53: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,546 INFO L273 TraceCheckUtils]: 54: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,546 INFO L273 TraceCheckUtils]: 55: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,546 INFO L273 TraceCheckUtils]: 56: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,546 INFO L273 TraceCheckUtils]: 57: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,546 INFO L273 TraceCheckUtils]: 58: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,546 INFO L273 TraceCheckUtils]: 59: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,546 INFO L273 TraceCheckUtils]: 60: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,547 INFO L273 TraceCheckUtils]: 61: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,547 INFO L273 TraceCheckUtils]: 62: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,547 INFO L273 TraceCheckUtils]: 63: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,547 INFO L273 TraceCheckUtils]: 64: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,547 INFO L273 TraceCheckUtils]: 65: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,547 INFO L273 TraceCheckUtils]: 66: Hoare triple {6213#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6213#false} is VALID [2018-11-23 11:59:23,547 INFO L273 TraceCheckUtils]: 67: Hoare triple {6213#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6213#false} is VALID [2018-11-23 11:59:23,547 INFO L273 TraceCheckUtils]: 68: Hoare triple {6213#false} assume !(~i~0 < 100000); {6213#false} is VALID [2018-11-23 11:59:23,547 INFO L273 TraceCheckUtils]: 69: Hoare triple {6213#false} havoc ~x~0;~x~0 := 0; {6213#false} is VALID [2018-11-23 11:59:23,548 INFO L273 TraceCheckUtils]: 70: Hoare triple {6213#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {6213#false} is VALID [2018-11-23 11:59:23,548 INFO L256 TraceCheckUtils]: 71: Hoare triple {6213#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {6213#false} is VALID [2018-11-23 11:59:23,548 INFO L273 TraceCheckUtils]: 72: Hoare triple {6213#false} ~cond := #in~cond; {6213#false} is VALID [2018-11-23 11:59:23,548 INFO L273 TraceCheckUtils]: 73: Hoare triple {6213#false} assume 0 == ~cond; {6213#false} is VALID [2018-11-23 11:59:23,548 INFO L273 TraceCheckUtils]: 74: Hoare triple {6213#false} assume !false; {6213#false} is VALID [2018-11-23 11:59:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:59:23,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:23,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:59:23,570 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-11-23 11:59:23,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:23,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:59:23,639 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 11:59:23,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:59:23,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:59:23,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:59:23,640 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 17 states. [2018-11-23 11:59:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,419 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-11-23 11:59:24,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:59:24,420 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-11-23 11:59:24,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:59:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2018-11-23 11:59:24,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:59:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2018-11-23 11:59:24,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 76 transitions. [2018-11-23 11:59:24,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:24,883 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:59:24,884 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:59:24,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:59:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:59:24,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-11-23 11:59:24,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:24,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 82 states. [2018-11-23 11:59:24,916 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 82 states. [2018-11-23 11:59:24,916 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 82 states. [2018-11-23 11:59:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,918 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-11-23 11:59:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-11-23 11:59:24,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:24,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:24,919 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 83 states. [2018-11-23 11:59:24,919 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 83 states. [2018-11-23 11:59:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,921 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-11-23 11:59:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-11-23 11:59:24,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:24,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:24,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:24,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:59:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-23 11:59:24,923 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 75 [2018-11-23 11:59:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:24,924 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-23 11:59:24,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:59:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 11:59:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:59:24,925 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:24,925 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:24,925 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:24,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:24,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1133381406, now seen corresponding path program 14 times [2018-11-23 11:59:24,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:24,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:24,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:24,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:24,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:25,555 INFO L256 TraceCheckUtils]: 0: Hoare triple {6932#true} call ULTIMATE.init(); {6932#true} is VALID [2018-11-23 11:59:25,556 INFO L273 TraceCheckUtils]: 1: Hoare triple {6932#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6932#true} is VALID [2018-11-23 11:59:25,556 INFO L273 TraceCheckUtils]: 2: Hoare triple {6932#true} assume true; {6932#true} is VALID [2018-11-23 11:59:25,556 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6932#true} {6932#true} #77#return; {6932#true} is VALID [2018-11-23 11:59:25,557 INFO L256 TraceCheckUtils]: 4: Hoare triple {6932#true} call #t~ret9 := main(); {6932#true} is VALID [2018-11-23 11:59:25,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {6932#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6934#(= main_~a~0 0)} is VALID [2018-11-23 11:59:25,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {6934#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6934#(= main_~a~0 0)} is VALID [2018-11-23 11:59:25,559 INFO L273 TraceCheckUtils]: 7: Hoare triple {6934#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6935#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:25,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {6935#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6935#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:25,560 INFO L273 TraceCheckUtils]: 9: Hoare triple {6935#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6936#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:25,560 INFO L273 TraceCheckUtils]: 10: Hoare triple {6936#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6936#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:25,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {6936#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6937#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:25,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {6937#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6937#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:25,562 INFO L273 TraceCheckUtils]: 13: Hoare triple {6937#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6938#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:25,562 INFO L273 TraceCheckUtils]: 14: Hoare triple {6938#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6938#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:25,563 INFO L273 TraceCheckUtils]: 15: Hoare triple {6938#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6939#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:25,564 INFO L273 TraceCheckUtils]: 16: Hoare triple {6939#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6939#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:25,565 INFO L273 TraceCheckUtils]: 17: Hoare triple {6939#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6940#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:25,565 INFO L273 TraceCheckUtils]: 18: Hoare triple {6940#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6940#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:25,566 INFO L273 TraceCheckUtils]: 19: Hoare triple {6940#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6941#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:25,567 INFO L273 TraceCheckUtils]: 20: Hoare triple {6941#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6941#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:25,568 INFO L273 TraceCheckUtils]: 21: Hoare triple {6941#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6942#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:25,568 INFO L273 TraceCheckUtils]: 22: Hoare triple {6942#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6942#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:25,569 INFO L273 TraceCheckUtils]: 23: Hoare triple {6942#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6943#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:25,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {6943#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6943#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:25,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {6943#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6944#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:25,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {6944#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6944#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:25,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {6944#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6945#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:25,573 INFO L273 TraceCheckUtils]: 28: Hoare triple {6945#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6945#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:25,574 INFO L273 TraceCheckUtils]: 29: Hoare triple {6945#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6946#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:25,574 INFO L273 TraceCheckUtils]: 30: Hoare triple {6946#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6946#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:25,575 INFO L273 TraceCheckUtils]: 31: Hoare triple {6946#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6947#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:25,576 INFO L273 TraceCheckUtils]: 32: Hoare triple {6947#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6947#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:25,577 INFO L273 TraceCheckUtils]: 33: Hoare triple {6947#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6948#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:25,578 INFO L273 TraceCheckUtils]: 34: Hoare triple {6948#(<= main_~a~0 14)} assume !(~a~0 < 100000); {6933#false} is VALID [2018-11-23 11:59:25,578 INFO L273 TraceCheckUtils]: 35: Hoare triple {6933#false} havoc ~i~0;~i~0 := 0; {6933#false} is VALID [2018-11-23 11:59:25,578 INFO L273 TraceCheckUtils]: 36: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,579 INFO L273 TraceCheckUtils]: 37: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,579 INFO L273 TraceCheckUtils]: 38: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,579 INFO L273 TraceCheckUtils]: 39: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,580 INFO L273 TraceCheckUtils]: 40: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,580 INFO L273 TraceCheckUtils]: 41: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,580 INFO L273 TraceCheckUtils]: 42: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,581 INFO L273 TraceCheckUtils]: 43: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,581 INFO L273 TraceCheckUtils]: 44: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,581 INFO L273 TraceCheckUtils]: 45: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,581 INFO L273 TraceCheckUtils]: 46: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,581 INFO L273 TraceCheckUtils]: 47: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,582 INFO L273 TraceCheckUtils]: 48: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,582 INFO L273 TraceCheckUtils]: 49: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,582 INFO L273 TraceCheckUtils]: 50: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,582 INFO L273 TraceCheckUtils]: 51: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,582 INFO L273 TraceCheckUtils]: 52: Hoare triple {6933#false} assume !(~i~0 < 100000); {6933#false} is VALID [2018-11-23 11:59:25,583 INFO L273 TraceCheckUtils]: 53: Hoare triple {6933#false} ~i~0 := 0; {6933#false} is VALID [2018-11-23 11:59:25,583 INFO L273 TraceCheckUtils]: 54: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,583 INFO L273 TraceCheckUtils]: 55: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,583 INFO L273 TraceCheckUtils]: 56: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,583 INFO L273 TraceCheckUtils]: 57: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,584 INFO L273 TraceCheckUtils]: 58: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,584 INFO L273 TraceCheckUtils]: 59: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,584 INFO L273 TraceCheckUtils]: 60: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,584 INFO L273 TraceCheckUtils]: 61: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,585 INFO L273 TraceCheckUtils]: 62: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,585 INFO L273 TraceCheckUtils]: 63: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,585 INFO L273 TraceCheckUtils]: 64: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,585 INFO L273 TraceCheckUtils]: 65: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,585 INFO L273 TraceCheckUtils]: 66: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,586 INFO L273 TraceCheckUtils]: 67: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,586 INFO L273 TraceCheckUtils]: 68: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,586 INFO L273 TraceCheckUtils]: 69: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,586 INFO L273 TraceCheckUtils]: 70: Hoare triple {6933#false} assume !(~i~0 < 100000); {6933#false} is VALID [2018-11-23 11:59:25,586 INFO L273 TraceCheckUtils]: 71: Hoare triple {6933#false} havoc ~x~0;~x~0 := 0; {6933#false} is VALID [2018-11-23 11:59:25,587 INFO L273 TraceCheckUtils]: 72: Hoare triple {6933#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {6933#false} is VALID [2018-11-23 11:59:25,587 INFO L256 TraceCheckUtils]: 73: Hoare triple {6933#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {6933#false} is VALID [2018-11-23 11:59:25,587 INFO L273 TraceCheckUtils]: 74: Hoare triple {6933#false} ~cond := #in~cond; {6933#false} is VALID [2018-11-23 11:59:25,587 INFO L273 TraceCheckUtils]: 75: Hoare triple {6933#false} assume 0 == ~cond; {6933#false} is VALID [2018-11-23 11:59:25,587 INFO L273 TraceCheckUtils]: 76: Hoare triple {6933#false} assume !false; {6933#false} is VALID [2018-11-23 11:59:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:59:25,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:25,595 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 11:59:25,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:25,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:25,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:25,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:25,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {6932#true} call ULTIMATE.init(); {6932#true} is VALID [2018-11-23 11:59:25,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {6932#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6932#true} is VALID [2018-11-23 11:59:25,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {6932#true} assume true; {6932#true} is VALID [2018-11-23 11:59:25,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6932#true} {6932#true} #77#return; {6932#true} is VALID [2018-11-23 11:59:25,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {6932#true} call #t~ret9 := main(); {6932#true} is VALID [2018-11-23 11:59:25,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {6932#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6967#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:25,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {6967#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6967#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:25,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {6967#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6935#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:25,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {6935#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6935#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:25,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {6935#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6936#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:25,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {6936#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6936#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:25,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {6936#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6937#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:25,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {6937#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6937#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:25,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {6937#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6938#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:25,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {6938#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6938#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:25,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {6938#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6939#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:25,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {6939#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6939#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:25,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {6939#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6940#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:25,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {6940#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6940#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:25,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {6940#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6941#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:25,849 INFO L273 TraceCheckUtils]: 20: Hoare triple {6941#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6941#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:25,850 INFO L273 TraceCheckUtils]: 21: Hoare triple {6941#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6942#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:25,850 INFO L273 TraceCheckUtils]: 22: Hoare triple {6942#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6942#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:25,851 INFO L273 TraceCheckUtils]: 23: Hoare triple {6942#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6943#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:25,852 INFO L273 TraceCheckUtils]: 24: Hoare triple {6943#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6943#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:25,853 INFO L273 TraceCheckUtils]: 25: Hoare triple {6943#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6944#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:25,854 INFO L273 TraceCheckUtils]: 26: Hoare triple {6944#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6944#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:25,854 INFO L273 TraceCheckUtils]: 27: Hoare triple {6944#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6945#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:25,855 INFO L273 TraceCheckUtils]: 28: Hoare triple {6945#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6945#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:25,856 INFO L273 TraceCheckUtils]: 29: Hoare triple {6945#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6946#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:25,857 INFO L273 TraceCheckUtils]: 30: Hoare triple {6946#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6946#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:25,857 INFO L273 TraceCheckUtils]: 31: Hoare triple {6946#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6947#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:25,858 INFO L273 TraceCheckUtils]: 32: Hoare triple {6947#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {6947#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:25,859 INFO L273 TraceCheckUtils]: 33: Hoare triple {6947#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6948#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:25,860 INFO L273 TraceCheckUtils]: 34: Hoare triple {6948#(<= main_~a~0 14)} assume !(~a~0 < 100000); {6933#false} is VALID [2018-11-23 11:59:25,860 INFO L273 TraceCheckUtils]: 35: Hoare triple {6933#false} havoc ~i~0;~i~0 := 0; {6933#false} is VALID [2018-11-23 11:59:25,860 INFO L273 TraceCheckUtils]: 36: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,860 INFO L273 TraceCheckUtils]: 37: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,861 INFO L273 TraceCheckUtils]: 38: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,861 INFO L273 TraceCheckUtils]: 39: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,861 INFO L273 TraceCheckUtils]: 40: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,862 INFO L273 TraceCheckUtils]: 41: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,862 INFO L273 TraceCheckUtils]: 42: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,862 INFO L273 TraceCheckUtils]: 43: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,862 INFO L273 TraceCheckUtils]: 44: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,863 INFO L273 TraceCheckUtils]: 45: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,863 INFO L273 TraceCheckUtils]: 46: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,863 INFO L273 TraceCheckUtils]: 47: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,863 INFO L273 TraceCheckUtils]: 48: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,863 INFO L273 TraceCheckUtils]: 49: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,863 INFO L273 TraceCheckUtils]: 50: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6933#false} is VALID [2018-11-23 11:59:25,863 INFO L273 TraceCheckUtils]: 51: Hoare triple {6933#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6933#false} is VALID [2018-11-23 11:59:25,864 INFO L273 TraceCheckUtils]: 52: Hoare triple {6933#false} assume !(~i~0 < 100000); {6933#false} is VALID [2018-11-23 11:59:25,864 INFO L273 TraceCheckUtils]: 53: Hoare triple {6933#false} ~i~0 := 0; {6933#false} is VALID [2018-11-23 11:59:25,864 INFO L273 TraceCheckUtils]: 54: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,864 INFO L273 TraceCheckUtils]: 55: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,864 INFO L273 TraceCheckUtils]: 56: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,864 INFO L273 TraceCheckUtils]: 57: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,865 INFO L273 TraceCheckUtils]: 58: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,865 INFO L273 TraceCheckUtils]: 59: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,865 INFO L273 TraceCheckUtils]: 60: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,865 INFO L273 TraceCheckUtils]: 61: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,865 INFO L273 TraceCheckUtils]: 62: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,865 INFO L273 TraceCheckUtils]: 63: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,865 INFO L273 TraceCheckUtils]: 64: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,866 INFO L273 TraceCheckUtils]: 65: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,866 INFO L273 TraceCheckUtils]: 66: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,866 INFO L273 TraceCheckUtils]: 67: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,866 INFO L273 TraceCheckUtils]: 68: Hoare triple {6933#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6933#false} is VALID [2018-11-23 11:59:25,866 INFO L273 TraceCheckUtils]: 69: Hoare triple {6933#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6933#false} is VALID [2018-11-23 11:59:25,866 INFO L273 TraceCheckUtils]: 70: Hoare triple {6933#false} assume !(~i~0 < 100000); {6933#false} is VALID [2018-11-23 11:59:25,866 INFO L273 TraceCheckUtils]: 71: Hoare triple {6933#false} havoc ~x~0;~x~0 := 0; {6933#false} is VALID [2018-11-23 11:59:25,867 INFO L273 TraceCheckUtils]: 72: Hoare triple {6933#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {6933#false} is VALID [2018-11-23 11:59:25,867 INFO L256 TraceCheckUtils]: 73: Hoare triple {6933#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {6933#false} is VALID [2018-11-23 11:59:25,867 INFO L273 TraceCheckUtils]: 74: Hoare triple {6933#false} ~cond := #in~cond; {6933#false} is VALID [2018-11-23 11:59:25,867 INFO L273 TraceCheckUtils]: 75: Hoare triple {6933#false} assume 0 == ~cond; {6933#false} is VALID [2018-11-23 11:59:25,867 INFO L273 TraceCheckUtils]: 76: Hoare triple {6933#false} assume !false; {6933#false} is VALID [2018-11-23 11:59:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:59:25,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:25,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:59:25,893 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-11-23 11:59:25,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:25,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:59:25,952 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 11:59:25,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:59:25,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:59:25,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:59:25,953 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 18 states. [2018-11-23 11:59:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:26,315 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2018-11-23 11:59:26,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:59:26,315 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-11-23 11:59:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:59:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2018-11-23 11:59:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:59:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2018-11-23 11:59:26,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 78 transitions. [2018-11-23 11:59:26,394 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 11:59:26,396 INFO L225 Difference]: With dead ends: 132 [2018-11-23 11:59:26,397 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:59:26,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:59:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:59:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-23 11:59:26,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:26,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 84 states. [2018-11-23 11:59:26,429 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 84 states. [2018-11-23 11:59:26,430 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 84 states. [2018-11-23 11:59:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:26,431 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-23 11:59:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-23 11:59:26,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:26,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:26,432 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 85 states. [2018-11-23 11:59:26,432 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 85 states. [2018-11-23 11:59:26,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:26,433 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-23 11:59:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-23 11:59:26,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:26,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:26,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:26,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:59:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-11-23 11:59:26,436 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 77 [2018-11-23 11:59:26,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:26,436 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-11-23 11:59:26,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:59:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-23 11:59:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:59:26,437 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:26,437 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:26,437 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:26,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:26,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1973358908, now seen corresponding path program 15 times [2018-11-23 11:59:26,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:26,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:26,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:26,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:26,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:26,683 INFO L256 TraceCheckUtils]: 0: Hoare triple {7669#true} call ULTIMATE.init(); {7669#true} is VALID [2018-11-23 11:59:26,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {7669#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7669#true} is VALID [2018-11-23 11:59:26,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {7669#true} assume true; {7669#true} is VALID [2018-11-23 11:59:26,684 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7669#true} {7669#true} #77#return; {7669#true} is VALID [2018-11-23 11:59:26,684 INFO L256 TraceCheckUtils]: 4: Hoare triple {7669#true} call #t~ret9 := main(); {7669#true} is VALID [2018-11-23 11:59:26,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {7669#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7671#(= main_~a~0 0)} is VALID [2018-11-23 11:59:26,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {7671#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7671#(= main_~a~0 0)} is VALID [2018-11-23 11:59:26,686 INFO L273 TraceCheckUtils]: 7: Hoare triple {7671#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7672#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:26,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {7672#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7672#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:26,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {7672#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7673#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:26,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {7673#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7673#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:26,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {7673#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7674#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:26,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {7674#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7674#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:26,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {7674#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7675#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:26,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {7675#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7675#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:26,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {7675#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7676#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:26,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {7676#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7676#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:26,691 INFO L273 TraceCheckUtils]: 17: Hoare triple {7676#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7677#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:26,692 INFO L273 TraceCheckUtils]: 18: Hoare triple {7677#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7677#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:26,692 INFO L273 TraceCheckUtils]: 19: Hoare triple {7677#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7678#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:26,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {7678#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7678#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:26,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {7678#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7679#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:26,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {7679#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7679#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:26,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {7679#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7680#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:26,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {7680#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7680#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:26,696 INFO L273 TraceCheckUtils]: 25: Hoare triple {7680#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7681#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:26,697 INFO L273 TraceCheckUtils]: 26: Hoare triple {7681#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7681#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:26,697 INFO L273 TraceCheckUtils]: 27: Hoare triple {7681#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7682#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:26,698 INFO L273 TraceCheckUtils]: 28: Hoare triple {7682#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7682#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:26,699 INFO L273 TraceCheckUtils]: 29: Hoare triple {7682#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7683#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:26,699 INFO L273 TraceCheckUtils]: 30: Hoare triple {7683#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7683#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:26,700 INFO L273 TraceCheckUtils]: 31: Hoare triple {7683#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7684#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:26,701 INFO L273 TraceCheckUtils]: 32: Hoare triple {7684#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7684#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:26,701 INFO L273 TraceCheckUtils]: 33: Hoare triple {7684#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7685#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:26,702 INFO L273 TraceCheckUtils]: 34: Hoare triple {7685#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7685#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:26,703 INFO L273 TraceCheckUtils]: 35: Hoare triple {7685#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7686#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:26,703 INFO L273 TraceCheckUtils]: 36: Hoare triple {7686#(<= main_~a~0 15)} assume !(~a~0 < 100000); {7670#false} is VALID [2018-11-23 11:59:26,703 INFO L273 TraceCheckUtils]: 37: Hoare triple {7670#false} havoc ~i~0;~i~0 := 0; {7670#false} is VALID [2018-11-23 11:59:26,704 INFO L273 TraceCheckUtils]: 38: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7670#false} is VALID [2018-11-23 11:59:26,704 INFO L273 TraceCheckUtils]: 39: Hoare triple {7670#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7670#false} is VALID [2018-11-23 11:59:26,704 INFO L273 TraceCheckUtils]: 40: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7670#false} is VALID [2018-11-23 11:59:26,704 INFO L273 TraceCheckUtils]: 41: Hoare triple {7670#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7670#false} is VALID [2018-11-23 11:59:26,704 INFO L273 TraceCheckUtils]: 42: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7670#false} is VALID [2018-11-23 11:59:26,705 INFO L273 TraceCheckUtils]: 43: Hoare triple {7670#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7670#false} is VALID [2018-11-23 11:59:26,705 INFO L273 TraceCheckUtils]: 44: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7670#false} is VALID [2018-11-23 11:59:26,705 INFO L273 TraceCheckUtils]: 45: Hoare triple {7670#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7670#false} is VALID [2018-11-23 11:59:26,705 INFO L273 TraceCheckUtils]: 46: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7670#false} is VALID [2018-11-23 11:59:26,705 INFO L273 TraceCheckUtils]: 47: Hoare triple {7670#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7670#false} is VALID [2018-11-23 11:59:26,706 INFO L273 TraceCheckUtils]: 48: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7670#false} is VALID [2018-11-23 11:59:26,706 INFO L273 TraceCheckUtils]: 49: Hoare triple {7670#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7670#false} is VALID [2018-11-23 11:59:26,706 INFO L273 TraceCheckUtils]: 50: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7670#false} is VALID [2018-11-23 11:59:26,706 INFO L273 TraceCheckUtils]: 51: Hoare triple {7670#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7670#false} is VALID [2018-11-23 11:59:26,706 INFO L273 TraceCheckUtils]: 52: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7670#false} is VALID [2018-11-23 11:59:26,706 INFO L273 TraceCheckUtils]: 53: Hoare triple {7670#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7670#false} is VALID [2018-11-23 11:59:26,707 INFO L273 TraceCheckUtils]: 54: Hoare triple {7670#false} assume !(~i~0 < 100000); {7670#false} is VALID [2018-11-23 11:59:26,707 INFO L273 TraceCheckUtils]: 55: Hoare triple {7670#false} ~i~0 := 0; {7670#false} is VALID [2018-11-23 11:59:26,707 INFO L273 TraceCheckUtils]: 56: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:26,707 INFO L273 TraceCheckUtils]: 57: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:26,707 INFO L273 TraceCheckUtils]: 58: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:26,707 INFO L273 TraceCheckUtils]: 59: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:26,707 INFO L273 TraceCheckUtils]: 60: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:26,707 INFO L273 TraceCheckUtils]: 61: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:26,708 INFO L273 TraceCheckUtils]: 62: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:26,708 INFO L273 TraceCheckUtils]: 63: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:26,708 INFO L273 TraceCheckUtils]: 64: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:26,708 INFO L273 TraceCheckUtils]: 65: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:26,708 INFO L273 TraceCheckUtils]: 66: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:26,708 INFO L273 TraceCheckUtils]: 67: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:26,708 INFO L273 TraceCheckUtils]: 68: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:26,708 INFO L273 TraceCheckUtils]: 69: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:26,708 INFO L273 TraceCheckUtils]: 70: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:26,709 INFO L273 TraceCheckUtils]: 71: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:26,709 INFO L273 TraceCheckUtils]: 72: Hoare triple {7670#false} assume !(~i~0 < 100000); {7670#false} is VALID [2018-11-23 11:59:26,709 INFO L273 TraceCheckUtils]: 73: Hoare triple {7670#false} havoc ~x~0;~x~0 := 0; {7670#false} is VALID [2018-11-23 11:59:26,709 INFO L273 TraceCheckUtils]: 74: Hoare triple {7670#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {7670#false} is VALID [2018-11-23 11:59:26,709 INFO L256 TraceCheckUtils]: 75: Hoare triple {7670#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {7670#false} is VALID [2018-11-23 11:59:26,709 INFO L273 TraceCheckUtils]: 76: Hoare triple {7670#false} ~cond := #in~cond; {7670#false} is VALID [2018-11-23 11:59:26,709 INFO L273 TraceCheckUtils]: 77: Hoare triple {7670#false} assume 0 == ~cond; {7670#false} is VALID [2018-11-23 11:59:26,709 INFO L273 TraceCheckUtils]: 78: Hoare triple {7670#false} assume !false; {7670#false} is VALID [2018-11-23 11:59:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:59:26,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:26,713 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 11:59:26,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:27,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:59:27,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:27,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:28,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {7669#true} call ULTIMATE.init(); {7669#true} is VALID [2018-11-23 11:59:28,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {7669#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7669#true} is VALID [2018-11-23 11:59:28,223 INFO L273 TraceCheckUtils]: 2: Hoare triple {7669#true} assume true; {7669#true} is VALID [2018-11-23 11:59:28,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7669#true} {7669#true} #77#return; {7669#true} is VALID [2018-11-23 11:59:28,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {7669#true} call #t~ret9 := main(); {7669#true} is VALID [2018-11-23 11:59:28,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {7669#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7669#true} is VALID [2018-11-23 11:59:28,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,225 INFO L273 TraceCheckUtils]: 14: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,226 INFO L273 TraceCheckUtils]: 19: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,226 INFO L273 TraceCheckUtils]: 20: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,226 INFO L273 TraceCheckUtils]: 21: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,226 INFO L273 TraceCheckUtils]: 25: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,227 INFO L273 TraceCheckUtils]: 26: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,227 INFO L273 TraceCheckUtils]: 27: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,227 INFO L273 TraceCheckUtils]: 28: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,227 INFO L273 TraceCheckUtils]: 29: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,227 INFO L273 TraceCheckUtils]: 33: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,227 INFO L273 TraceCheckUtils]: 34: Hoare triple {7669#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7669#true} is VALID [2018-11-23 11:59:28,228 INFO L273 TraceCheckUtils]: 35: Hoare triple {7669#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7669#true} is VALID [2018-11-23 11:59:28,228 INFO L273 TraceCheckUtils]: 36: Hoare triple {7669#true} assume !(~a~0 < 100000); {7669#true} is VALID [2018-11-23 11:59:28,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {7669#true} havoc ~i~0;~i~0 := 0; {7801#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:28,228 INFO L273 TraceCheckUtils]: 38: Hoare triple {7801#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7801#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:28,229 INFO L273 TraceCheckUtils]: 39: Hoare triple {7801#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7808#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:28,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {7808#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7808#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:28,230 INFO L273 TraceCheckUtils]: 41: Hoare triple {7808#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7815#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:28,230 INFO L273 TraceCheckUtils]: 42: Hoare triple {7815#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7815#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:28,230 INFO L273 TraceCheckUtils]: 43: Hoare triple {7815#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7822#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:28,231 INFO L273 TraceCheckUtils]: 44: Hoare triple {7822#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7822#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:28,231 INFO L273 TraceCheckUtils]: 45: Hoare triple {7822#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7829#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:28,232 INFO L273 TraceCheckUtils]: 46: Hoare triple {7829#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7829#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:28,233 INFO L273 TraceCheckUtils]: 47: Hoare triple {7829#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7836#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:28,233 INFO L273 TraceCheckUtils]: 48: Hoare triple {7836#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7836#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:28,234 INFO L273 TraceCheckUtils]: 49: Hoare triple {7836#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7843#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:28,234 INFO L273 TraceCheckUtils]: 50: Hoare triple {7843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7843#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:28,235 INFO L273 TraceCheckUtils]: 51: Hoare triple {7843#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7850#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:28,236 INFO L273 TraceCheckUtils]: 52: Hoare triple {7850#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7850#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:28,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {7850#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7857#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:28,237 INFO L273 TraceCheckUtils]: 54: Hoare triple {7857#(<= main_~i~0 8)} assume !(~i~0 < 100000); {7670#false} is VALID [2018-11-23 11:59:28,237 INFO L273 TraceCheckUtils]: 55: Hoare triple {7670#false} ~i~0 := 0; {7670#false} is VALID [2018-11-23 11:59:28,238 INFO L273 TraceCheckUtils]: 56: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:28,238 INFO L273 TraceCheckUtils]: 57: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:28,238 INFO L273 TraceCheckUtils]: 58: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:28,238 INFO L273 TraceCheckUtils]: 59: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:28,238 INFO L273 TraceCheckUtils]: 60: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:28,239 INFO L273 TraceCheckUtils]: 61: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:28,239 INFO L273 TraceCheckUtils]: 62: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:28,239 INFO L273 TraceCheckUtils]: 63: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:28,239 INFO L273 TraceCheckUtils]: 64: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:28,239 INFO L273 TraceCheckUtils]: 65: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:28,240 INFO L273 TraceCheckUtils]: 66: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:28,240 INFO L273 TraceCheckUtils]: 67: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:28,240 INFO L273 TraceCheckUtils]: 68: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:28,240 INFO L273 TraceCheckUtils]: 69: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:28,240 INFO L273 TraceCheckUtils]: 70: Hoare triple {7670#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7670#false} is VALID [2018-11-23 11:59:28,241 INFO L273 TraceCheckUtils]: 71: Hoare triple {7670#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7670#false} is VALID [2018-11-23 11:59:28,241 INFO L273 TraceCheckUtils]: 72: Hoare triple {7670#false} assume !(~i~0 < 100000); {7670#false} is VALID [2018-11-23 11:59:28,241 INFO L273 TraceCheckUtils]: 73: Hoare triple {7670#false} havoc ~x~0;~x~0 := 0; {7670#false} is VALID [2018-11-23 11:59:28,241 INFO L273 TraceCheckUtils]: 74: Hoare triple {7670#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {7670#false} is VALID [2018-11-23 11:59:28,241 INFO L256 TraceCheckUtils]: 75: Hoare triple {7670#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {7670#false} is VALID [2018-11-23 11:59:28,241 INFO L273 TraceCheckUtils]: 76: Hoare triple {7670#false} ~cond := #in~cond; {7670#false} is VALID [2018-11-23 11:59:28,242 INFO L273 TraceCheckUtils]: 77: Hoare triple {7670#false} assume 0 == ~cond; {7670#false} is VALID [2018-11-23 11:59:28,242 INFO L273 TraceCheckUtils]: 78: Hoare triple {7670#false} assume !false; {7670#false} is VALID [2018-11-23 11:59:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-23 11:59:28,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:28,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2018-11-23 11:59:28,266 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 79 [2018-11-23 11:59:28,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:28,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:59:28,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:28,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:59:28,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:59:28,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:59:28,340 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 27 states. [2018-11-23 11:59:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:29,378 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-23 11:59:29,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:59:29,378 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 79 [2018-11-23 11:59:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:59:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 118 transitions. [2018-11-23 11:59:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:59:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 118 transitions. [2018-11-23 11:59:29,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 118 transitions. [2018-11-23 11:59:29,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:29,534 INFO L225 Difference]: With dead ends: 140 [2018-11-23 11:59:29,534 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 11:59:29,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:59:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 11:59:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-11-23 11:59:29,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:29,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 90 states. [2018-11-23 11:59:29,572 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 90 states. [2018-11-23 11:59:29,572 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 90 states. [2018-11-23 11:59:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:29,575 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-11-23 11:59:29,575 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-11-23 11:59:29,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:29,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:29,575 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 93 states. [2018-11-23 11:59:29,575 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 93 states. [2018-11-23 11:59:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:29,577 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-11-23 11:59:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-11-23 11:59:29,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:29,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:29,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:29,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:59:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-11-23 11:59:29,580 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 79 [2018-11-23 11:59:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:29,580 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-11-23 11:59:29,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:59:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-11-23 11:59:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 11:59:29,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:29,582 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:29,582 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:29,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash -254135850, now seen corresponding path program 16 times [2018-11-23 11:59:29,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:29,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:29,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:29,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:29,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:29,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {8457#true} call ULTIMATE.init(); {8457#true} is VALID [2018-11-23 11:59:29,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {8457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8457#true} is VALID [2018-11-23 11:59:29,911 INFO L273 TraceCheckUtils]: 2: Hoare triple {8457#true} assume true; {8457#true} is VALID [2018-11-23 11:59:29,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8457#true} {8457#true} #77#return; {8457#true} is VALID [2018-11-23 11:59:29,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {8457#true} call #t~ret9 := main(); {8457#true} is VALID [2018-11-23 11:59:29,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {8457#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8459#(= main_~a~0 0)} is VALID [2018-11-23 11:59:29,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {8459#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8459#(= main_~a~0 0)} is VALID [2018-11-23 11:59:29,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {8459#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8460#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:29,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {8460#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8460#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:29,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {8460#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8461#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:29,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {8461#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8461#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:29,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {8461#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8462#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:29,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {8462#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8462#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:29,917 INFO L273 TraceCheckUtils]: 13: Hoare triple {8462#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8463#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:29,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {8463#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8463#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:29,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {8463#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8464#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:29,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {8464#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8464#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:29,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {8464#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8465#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:29,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {8465#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8465#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:29,921 INFO L273 TraceCheckUtils]: 19: Hoare triple {8465#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8466#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:29,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {8466#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8466#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:29,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {8466#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8467#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:29,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {8467#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8467#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:29,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {8467#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8468#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:29,924 INFO L273 TraceCheckUtils]: 24: Hoare triple {8468#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8468#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:29,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {8468#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8469#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:29,925 INFO L273 TraceCheckUtils]: 26: Hoare triple {8469#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8469#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:29,926 INFO L273 TraceCheckUtils]: 27: Hoare triple {8469#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8470#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:29,926 INFO L273 TraceCheckUtils]: 28: Hoare triple {8470#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8470#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:29,927 INFO L273 TraceCheckUtils]: 29: Hoare triple {8470#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8471#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:29,928 INFO L273 TraceCheckUtils]: 30: Hoare triple {8471#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8471#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:29,928 INFO L273 TraceCheckUtils]: 31: Hoare triple {8471#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8472#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:29,929 INFO L273 TraceCheckUtils]: 32: Hoare triple {8472#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8472#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:29,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {8472#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8473#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:29,930 INFO L273 TraceCheckUtils]: 34: Hoare triple {8473#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8473#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:29,931 INFO L273 TraceCheckUtils]: 35: Hoare triple {8473#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8474#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:29,931 INFO L273 TraceCheckUtils]: 36: Hoare triple {8474#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8474#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:29,932 INFO L273 TraceCheckUtils]: 37: Hoare triple {8474#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8475#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:29,933 INFO L273 TraceCheckUtils]: 38: Hoare triple {8475#(<= main_~a~0 16)} assume !(~a~0 < 100000); {8458#false} is VALID [2018-11-23 11:59:29,933 INFO L273 TraceCheckUtils]: 39: Hoare triple {8458#false} havoc ~i~0;~i~0 := 0; {8458#false} is VALID [2018-11-23 11:59:29,933 INFO L273 TraceCheckUtils]: 40: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8458#false} is VALID [2018-11-23 11:59:29,934 INFO L273 TraceCheckUtils]: 41: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 11:59:29,934 INFO L273 TraceCheckUtils]: 42: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8458#false} is VALID [2018-11-23 11:59:29,934 INFO L273 TraceCheckUtils]: 43: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 11:59:29,934 INFO L273 TraceCheckUtils]: 44: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8458#false} is VALID [2018-11-23 11:59:29,934 INFO L273 TraceCheckUtils]: 45: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 11:59:29,935 INFO L273 TraceCheckUtils]: 46: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8458#false} is VALID [2018-11-23 11:59:29,935 INFO L273 TraceCheckUtils]: 47: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 11:59:29,935 INFO L273 TraceCheckUtils]: 48: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8458#false} is VALID [2018-11-23 11:59:29,935 INFO L273 TraceCheckUtils]: 49: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 11:59:29,935 INFO L273 TraceCheckUtils]: 50: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8458#false} is VALID [2018-11-23 11:59:29,935 INFO L273 TraceCheckUtils]: 51: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 11:59:29,936 INFO L273 TraceCheckUtils]: 52: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8458#false} is VALID [2018-11-23 11:59:29,936 INFO L273 TraceCheckUtils]: 53: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 11:59:29,936 INFO L273 TraceCheckUtils]: 54: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8458#false} is VALID [2018-11-23 11:59:29,936 INFO L273 TraceCheckUtils]: 55: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 11:59:29,936 INFO L273 TraceCheckUtils]: 56: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8458#false} is VALID [2018-11-23 11:59:29,936 INFO L273 TraceCheckUtils]: 57: Hoare triple {8458#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8458#false} is VALID [2018-11-23 11:59:29,936 INFO L273 TraceCheckUtils]: 58: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 11:59:29,936 INFO L273 TraceCheckUtils]: 59: Hoare triple {8458#false} ~i~0 := 0; {8458#false} is VALID [2018-11-23 11:59:29,937 INFO L273 TraceCheckUtils]: 60: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8458#false} is VALID [2018-11-23 11:59:29,937 INFO L273 TraceCheckUtils]: 61: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 11:59:29,937 INFO L273 TraceCheckUtils]: 62: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8458#false} is VALID [2018-11-23 11:59:29,937 INFO L273 TraceCheckUtils]: 63: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 11:59:29,937 INFO L273 TraceCheckUtils]: 64: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8458#false} is VALID [2018-11-23 11:59:29,937 INFO L273 TraceCheckUtils]: 65: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 11:59:29,937 INFO L273 TraceCheckUtils]: 66: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8458#false} is VALID [2018-11-23 11:59:29,937 INFO L273 TraceCheckUtils]: 67: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 11:59:29,938 INFO L273 TraceCheckUtils]: 68: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8458#false} is VALID [2018-11-23 11:59:29,938 INFO L273 TraceCheckUtils]: 69: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 11:59:29,938 INFO L273 TraceCheckUtils]: 70: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8458#false} is VALID [2018-11-23 11:59:29,938 INFO L273 TraceCheckUtils]: 71: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 11:59:29,938 INFO L273 TraceCheckUtils]: 72: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8458#false} is VALID [2018-11-23 11:59:29,938 INFO L273 TraceCheckUtils]: 73: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 11:59:29,938 INFO L273 TraceCheckUtils]: 74: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8458#false} is VALID [2018-11-23 11:59:29,938 INFO L273 TraceCheckUtils]: 75: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 11:59:29,938 INFO L273 TraceCheckUtils]: 76: Hoare triple {8458#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8458#false} is VALID [2018-11-23 11:59:29,939 INFO L273 TraceCheckUtils]: 77: Hoare triple {8458#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8458#false} is VALID [2018-11-23 11:59:29,939 INFO L273 TraceCheckUtils]: 78: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 11:59:29,939 INFO L273 TraceCheckUtils]: 79: Hoare triple {8458#false} havoc ~x~0;~x~0 := 0; {8458#false} is VALID [2018-11-23 11:59:29,939 INFO L273 TraceCheckUtils]: 80: Hoare triple {8458#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {8458#false} is VALID [2018-11-23 11:59:29,939 INFO L256 TraceCheckUtils]: 81: Hoare triple {8458#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {8458#false} is VALID [2018-11-23 11:59:29,939 INFO L273 TraceCheckUtils]: 82: Hoare triple {8458#false} ~cond := #in~cond; {8458#false} is VALID [2018-11-23 11:59:29,940 INFO L273 TraceCheckUtils]: 83: Hoare triple {8458#false} assume 0 == ~cond; {8458#false} is VALID [2018-11-23 11:59:29,940 INFO L273 TraceCheckUtils]: 84: Hoare triple {8458#false} assume !false; {8458#false} is VALID [2018-11-23 11:59:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-23 11:59:29,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:29,945 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 11:59:29,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:30,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:30,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:30,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:30,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {8457#true} call ULTIMATE.init(); {8457#true} is VALID [2018-11-23 11:59:30,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {8457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8457#true} is VALID [2018-11-23 11:59:30,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {8457#true} assume true; {8457#true} is VALID [2018-11-23 11:59:30,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8457#true} {8457#true} #77#return; {8457#true} is VALID [2018-11-23 11:59:30,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {8457#true} call #t~ret9 := main(); {8457#true} is VALID [2018-11-23 11:59:30,305 INFO L273 TraceCheckUtils]: 5: Hoare triple {8457#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8457#true} is VALID [2018-11-23 11:59:30,305 INFO L273 TraceCheckUtils]: 6: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,306 INFO L273 TraceCheckUtils]: 10: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,307 INFO L273 TraceCheckUtils]: 18: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,307 INFO L273 TraceCheckUtils]: 21: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,307 INFO L273 TraceCheckUtils]: 22: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,308 INFO L273 TraceCheckUtils]: 23: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,308 INFO L273 TraceCheckUtils]: 24: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,308 INFO L273 TraceCheckUtils]: 25: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,308 INFO L273 TraceCheckUtils]: 26: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,308 INFO L273 TraceCheckUtils]: 27: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,308 INFO L273 TraceCheckUtils]: 28: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,308 INFO L273 TraceCheckUtils]: 29: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,308 INFO L273 TraceCheckUtils]: 30: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,309 INFO L273 TraceCheckUtils]: 31: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,309 INFO L273 TraceCheckUtils]: 32: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,309 INFO L273 TraceCheckUtils]: 34: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,309 INFO L273 TraceCheckUtils]: 35: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,309 INFO L273 TraceCheckUtils]: 36: Hoare triple {8457#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8457#true} is VALID [2018-11-23 11:59:30,310 INFO L273 TraceCheckUtils]: 37: Hoare triple {8457#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#true} is VALID [2018-11-23 11:59:30,310 INFO L273 TraceCheckUtils]: 38: Hoare triple {8457#true} assume !(~a~0 < 100000); {8457#true} is VALID [2018-11-23 11:59:30,310 INFO L273 TraceCheckUtils]: 39: Hoare triple {8457#true} havoc ~i~0;~i~0 := 0; {8457#true} is VALID [2018-11-23 11:59:30,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {8457#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8457#true} is VALID [2018-11-23 11:59:30,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {8457#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8457#true} is VALID [2018-11-23 11:59:30,311 INFO L273 TraceCheckUtils]: 42: Hoare triple {8457#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8457#true} is VALID [2018-11-23 11:59:30,311 INFO L273 TraceCheckUtils]: 43: Hoare triple {8457#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8457#true} is VALID [2018-11-23 11:59:30,311 INFO L273 TraceCheckUtils]: 44: Hoare triple {8457#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8457#true} is VALID [2018-11-23 11:59:30,311 INFO L273 TraceCheckUtils]: 45: Hoare triple {8457#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8457#true} is VALID [2018-11-23 11:59:30,311 INFO L273 TraceCheckUtils]: 46: Hoare triple {8457#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8457#true} is VALID [2018-11-23 11:59:30,311 INFO L273 TraceCheckUtils]: 47: Hoare triple {8457#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8457#true} is VALID [2018-11-23 11:59:30,312 INFO L273 TraceCheckUtils]: 48: Hoare triple {8457#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8457#true} is VALID [2018-11-23 11:59:30,312 INFO L273 TraceCheckUtils]: 49: Hoare triple {8457#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8457#true} is VALID [2018-11-23 11:59:30,312 INFO L273 TraceCheckUtils]: 50: Hoare triple {8457#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8457#true} is VALID [2018-11-23 11:59:30,312 INFO L273 TraceCheckUtils]: 51: Hoare triple {8457#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8457#true} is VALID [2018-11-23 11:59:30,312 INFO L273 TraceCheckUtils]: 52: Hoare triple {8457#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8457#true} is VALID [2018-11-23 11:59:30,313 INFO L273 TraceCheckUtils]: 53: Hoare triple {8457#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8457#true} is VALID [2018-11-23 11:59:30,313 INFO L273 TraceCheckUtils]: 54: Hoare triple {8457#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8457#true} is VALID [2018-11-23 11:59:30,313 INFO L273 TraceCheckUtils]: 55: Hoare triple {8457#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8457#true} is VALID [2018-11-23 11:59:30,313 INFO L273 TraceCheckUtils]: 56: Hoare triple {8457#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8457#true} is VALID [2018-11-23 11:59:30,313 INFO L273 TraceCheckUtils]: 57: Hoare triple {8457#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8457#true} is VALID [2018-11-23 11:59:30,313 INFO L273 TraceCheckUtils]: 58: Hoare triple {8457#true} assume !(~i~0 < 100000); {8457#true} is VALID [2018-11-23 11:59:30,329 INFO L273 TraceCheckUtils]: 59: Hoare triple {8457#true} ~i~0 := 0; {8656#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:30,338 INFO L273 TraceCheckUtils]: 60: Hoare triple {8656#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8656#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:30,354 INFO L273 TraceCheckUtils]: 61: Hoare triple {8656#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8663#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:30,361 INFO L273 TraceCheckUtils]: 62: Hoare triple {8663#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8663#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:30,362 INFO L273 TraceCheckUtils]: 63: Hoare triple {8663#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8670#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:30,362 INFO L273 TraceCheckUtils]: 64: Hoare triple {8670#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8670#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:30,365 INFO L273 TraceCheckUtils]: 65: Hoare triple {8670#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8677#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:30,365 INFO L273 TraceCheckUtils]: 66: Hoare triple {8677#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8677#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:30,367 INFO L273 TraceCheckUtils]: 67: Hoare triple {8677#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8684#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:30,367 INFO L273 TraceCheckUtils]: 68: Hoare triple {8684#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8684#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:30,367 INFO L273 TraceCheckUtils]: 69: Hoare triple {8684#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8691#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:30,368 INFO L273 TraceCheckUtils]: 70: Hoare triple {8691#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8691#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:30,368 INFO L273 TraceCheckUtils]: 71: Hoare triple {8691#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8698#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:30,368 INFO L273 TraceCheckUtils]: 72: Hoare triple {8698#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8698#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:30,369 INFO L273 TraceCheckUtils]: 73: Hoare triple {8698#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8705#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:30,369 INFO L273 TraceCheckUtils]: 74: Hoare triple {8705#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8705#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:30,370 INFO L273 TraceCheckUtils]: 75: Hoare triple {8705#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8712#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:30,370 INFO L273 TraceCheckUtils]: 76: Hoare triple {8712#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8712#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:30,371 INFO L273 TraceCheckUtils]: 77: Hoare triple {8712#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8719#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:30,371 INFO L273 TraceCheckUtils]: 78: Hoare triple {8719#(<= main_~i~0 9)} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 11:59:30,372 INFO L273 TraceCheckUtils]: 79: Hoare triple {8458#false} havoc ~x~0;~x~0 := 0; {8458#false} is VALID [2018-11-23 11:59:30,372 INFO L273 TraceCheckUtils]: 80: Hoare triple {8458#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {8458#false} is VALID [2018-11-23 11:59:30,372 INFO L256 TraceCheckUtils]: 81: Hoare triple {8458#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {8458#false} is VALID [2018-11-23 11:59:30,372 INFO L273 TraceCheckUtils]: 82: Hoare triple {8458#false} ~cond := #in~cond; {8458#false} is VALID [2018-11-23 11:59:30,372 INFO L273 TraceCheckUtils]: 83: Hoare triple {8458#false} assume 0 == ~cond; {8458#false} is VALID [2018-11-23 11:59:30,373 INFO L273 TraceCheckUtils]: 84: Hoare triple {8458#false} assume !false; {8458#false} is VALID [2018-11-23 11:59:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-11-23 11:59:30,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:30,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2018-11-23 11:59:30,397 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-11-23 11:59:30,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:30,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:59:30,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:30,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:59:30,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:59:30,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=576, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:59:30,486 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 29 states. [2018-11-23 11:59:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:31,233 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-11-23 11:59:31,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:59:31,233 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-11-23 11:59:31,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:59:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2018-11-23 11:59:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:59:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 124 transitions. [2018-11-23 11:59:31,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 124 transitions. [2018-11-23 11:59:31,360 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 11:59:31,363 INFO L225 Difference]: With dead ends: 150 [2018-11-23 11:59:31,363 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 11:59:31,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=576, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:59:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 11:59:31,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-11-23 11:59:31,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:31,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 96 states. [2018-11-23 11:59:31,402 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 96 states. [2018-11-23 11:59:31,402 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 96 states. [2018-11-23 11:59:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:31,405 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-11-23 11:59:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-11-23 11:59:31,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:31,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:31,406 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 99 states. [2018-11-23 11:59:31,406 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 99 states. [2018-11-23 11:59:31,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:31,408 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-11-23 11:59:31,408 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-11-23 11:59:31,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:31,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:31,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:31,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:59:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2018-11-23 11:59:31,410 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 85 [2018-11-23 11:59:31,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:31,410 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2018-11-23 11:59:31,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:59:31,411 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2018-11-23 11:59:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 11:59:31,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:31,412 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:31,412 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:31,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:31,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1136178928, now seen corresponding path program 17 times [2018-11-23 11:59:31,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:31,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:31,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:31,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:31,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:31,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {9301#true} call ULTIMATE.init(); {9301#true} is VALID [2018-11-23 11:59:31,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {9301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9301#true} is VALID [2018-11-23 11:59:31,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {9301#true} assume true; {9301#true} is VALID [2018-11-23 11:59:31,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9301#true} {9301#true} #77#return; {9301#true} is VALID [2018-11-23 11:59:31,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {9301#true} call #t~ret9 := main(); {9301#true} is VALID [2018-11-23 11:59:31,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {9301#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9303#(= main_~a~0 0)} is VALID [2018-11-23 11:59:31,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {9303#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9303#(= main_~a~0 0)} is VALID [2018-11-23 11:59:31,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {9303#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9304#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:31,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {9304#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9304#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:31,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {9304#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9305#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:31,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {9305#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9305#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:31,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {9305#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9306#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:31,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {9306#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9306#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:31,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {9306#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9307#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:31,915 INFO L273 TraceCheckUtils]: 14: Hoare triple {9307#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9307#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:31,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {9307#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9308#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:31,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {9308#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9308#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:31,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {9308#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9309#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:31,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {9309#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9309#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:31,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {9309#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9310#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:31,919 INFO L273 TraceCheckUtils]: 20: Hoare triple {9310#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9310#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:31,919 INFO L273 TraceCheckUtils]: 21: Hoare triple {9310#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9311#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:31,920 INFO L273 TraceCheckUtils]: 22: Hoare triple {9311#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9311#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:31,921 INFO L273 TraceCheckUtils]: 23: Hoare triple {9311#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9312#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:31,921 INFO L273 TraceCheckUtils]: 24: Hoare triple {9312#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9312#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:31,922 INFO L273 TraceCheckUtils]: 25: Hoare triple {9312#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9313#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:31,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {9313#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9313#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:31,923 INFO L273 TraceCheckUtils]: 27: Hoare triple {9313#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9314#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:31,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {9314#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9314#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:31,925 INFO L273 TraceCheckUtils]: 29: Hoare triple {9314#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9315#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:31,925 INFO L273 TraceCheckUtils]: 30: Hoare triple {9315#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9315#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:31,926 INFO L273 TraceCheckUtils]: 31: Hoare triple {9315#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9316#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:31,926 INFO L273 TraceCheckUtils]: 32: Hoare triple {9316#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9316#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:31,927 INFO L273 TraceCheckUtils]: 33: Hoare triple {9316#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9317#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:31,928 INFO L273 TraceCheckUtils]: 34: Hoare triple {9317#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9317#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:31,928 INFO L273 TraceCheckUtils]: 35: Hoare triple {9317#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9318#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:31,929 INFO L273 TraceCheckUtils]: 36: Hoare triple {9318#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9318#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:31,930 INFO L273 TraceCheckUtils]: 37: Hoare triple {9318#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9319#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:31,930 INFO L273 TraceCheckUtils]: 38: Hoare triple {9319#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9319#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:31,931 INFO L273 TraceCheckUtils]: 39: Hoare triple {9319#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9320#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:31,932 INFO L273 TraceCheckUtils]: 40: Hoare triple {9320#(<= main_~a~0 17)} assume !(~a~0 < 100000); {9302#false} is VALID [2018-11-23 11:59:31,932 INFO L273 TraceCheckUtils]: 41: Hoare triple {9302#false} havoc ~i~0;~i~0 := 0; {9302#false} is VALID [2018-11-23 11:59:31,932 INFO L273 TraceCheckUtils]: 42: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9302#false} is VALID [2018-11-23 11:59:31,932 INFO L273 TraceCheckUtils]: 43: Hoare triple {9302#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9302#false} is VALID [2018-11-23 11:59:31,932 INFO L273 TraceCheckUtils]: 44: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9302#false} is VALID [2018-11-23 11:59:31,933 INFO L273 TraceCheckUtils]: 45: Hoare triple {9302#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9302#false} is VALID [2018-11-23 11:59:31,933 INFO L273 TraceCheckUtils]: 46: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9302#false} is VALID [2018-11-23 11:59:31,933 INFO L273 TraceCheckUtils]: 47: Hoare triple {9302#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9302#false} is VALID [2018-11-23 11:59:31,933 INFO L273 TraceCheckUtils]: 48: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9302#false} is VALID [2018-11-23 11:59:31,933 INFO L273 TraceCheckUtils]: 49: Hoare triple {9302#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9302#false} is VALID [2018-11-23 11:59:31,934 INFO L273 TraceCheckUtils]: 50: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9302#false} is VALID [2018-11-23 11:59:31,934 INFO L273 TraceCheckUtils]: 51: Hoare triple {9302#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9302#false} is VALID [2018-11-23 11:59:31,934 INFO L273 TraceCheckUtils]: 52: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9302#false} is VALID [2018-11-23 11:59:31,934 INFO L273 TraceCheckUtils]: 53: Hoare triple {9302#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9302#false} is VALID [2018-11-23 11:59:31,934 INFO L273 TraceCheckUtils]: 54: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9302#false} is VALID [2018-11-23 11:59:31,935 INFO L273 TraceCheckUtils]: 55: Hoare triple {9302#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9302#false} is VALID [2018-11-23 11:59:31,935 INFO L273 TraceCheckUtils]: 56: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9302#false} is VALID [2018-11-23 11:59:31,935 INFO L273 TraceCheckUtils]: 57: Hoare triple {9302#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9302#false} is VALID [2018-11-23 11:59:31,935 INFO L273 TraceCheckUtils]: 58: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9302#false} is VALID [2018-11-23 11:59:31,935 INFO L273 TraceCheckUtils]: 59: Hoare triple {9302#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9302#false} is VALID [2018-11-23 11:59:31,936 INFO L273 TraceCheckUtils]: 60: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9302#false} is VALID [2018-11-23 11:59:31,936 INFO L273 TraceCheckUtils]: 61: Hoare triple {9302#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9302#false} is VALID [2018-11-23 11:59:31,936 INFO L273 TraceCheckUtils]: 62: Hoare triple {9302#false} assume !(~i~0 < 100000); {9302#false} is VALID [2018-11-23 11:59:31,936 INFO L273 TraceCheckUtils]: 63: Hoare triple {9302#false} ~i~0 := 0; {9302#false} is VALID [2018-11-23 11:59:31,936 INFO L273 TraceCheckUtils]: 64: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9302#false} is VALID [2018-11-23 11:59:31,936 INFO L273 TraceCheckUtils]: 65: Hoare triple {9302#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9302#false} is VALID [2018-11-23 11:59:31,936 INFO L273 TraceCheckUtils]: 66: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9302#false} is VALID [2018-11-23 11:59:31,937 INFO L273 TraceCheckUtils]: 67: Hoare triple {9302#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9302#false} is VALID [2018-11-23 11:59:31,937 INFO L273 TraceCheckUtils]: 68: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9302#false} is VALID [2018-11-23 11:59:31,937 INFO L273 TraceCheckUtils]: 69: Hoare triple {9302#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9302#false} is VALID [2018-11-23 11:59:31,937 INFO L273 TraceCheckUtils]: 70: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9302#false} is VALID [2018-11-23 11:59:31,937 INFO L273 TraceCheckUtils]: 71: Hoare triple {9302#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9302#false} is VALID [2018-11-23 11:59:31,937 INFO L273 TraceCheckUtils]: 72: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9302#false} is VALID [2018-11-23 11:59:31,937 INFO L273 TraceCheckUtils]: 73: Hoare triple {9302#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9302#false} is VALID [2018-11-23 11:59:31,937 INFO L273 TraceCheckUtils]: 74: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9302#false} is VALID [2018-11-23 11:59:31,937 INFO L273 TraceCheckUtils]: 75: Hoare triple {9302#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9302#false} is VALID [2018-11-23 11:59:31,938 INFO L273 TraceCheckUtils]: 76: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9302#false} is VALID [2018-11-23 11:59:31,938 INFO L273 TraceCheckUtils]: 77: Hoare triple {9302#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9302#false} is VALID [2018-11-23 11:59:31,938 INFO L273 TraceCheckUtils]: 78: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9302#false} is VALID [2018-11-23 11:59:31,938 INFO L273 TraceCheckUtils]: 79: Hoare triple {9302#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9302#false} is VALID [2018-11-23 11:59:31,938 INFO L273 TraceCheckUtils]: 80: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9302#false} is VALID [2018-11-23 11:59:31,938 INFO L273 TraceCheckUtils]: 81: Hoare triple {9302#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9302#false} is VALID [2018-11-23 11:59:31,938 INFO L273 TraceCheckUtils]: 82: Hoare triple {9302#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9302#false} is VALID [2018-11-23 11:59:31,938 INFO L273 TraceCheckUtils]: 83: Hoare triple {9302#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9302#false} is VALID [2018-11-23 11:59:31,938 INFO L273 TraceCheckUtils]: 84: Hoare triple {9302#false} assume !(~i~0 < 100000); {9302#false} is VALID [2018-11-23 11:59:31,939 INFO L273 TraceCheckUtils]: 85: Hoare triple {9302#false} havoc ~x~0;~x~0 := 0; {9302#false} is VALID [2018-11-23 11:59:31,939 INFO L273 TraceCheckUtils]: 86: Hoare triple {9302#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {9302#false} is VALID [2018-11-23 11:59:31,939 INFO L256 TraceCheckUtils]: 87: Hoare triple {9302#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {9302#false} is VALID [2018-11-23 11:59:31,939 INFO L273 TraceCheckUtils]: 88: Hoare triple {9302#false} ~cond := #in~cond; {9302#false} is VALID [2018-11-23 11:59:31,939 INFO L273 TraceCheckUtils]: 89: Hoare triple {9302#false} assume 0 == ~cond; {9302#false} is VALID [2018-11-23 11:59:31,939 INFO L273 TraceCheckUtils]: 90: Hoare triple {9302#false} assume !false; {9302#false} is VALID [2018-11-23 11:59:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 11:59:31,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:31,944 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 11:59:31,953 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:00:21,464 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 12:00:21,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:21,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:21,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {9301#true} call ULTIMATE.init(); {9301#true} is VALID [2018-11-23 12:00:21,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {9301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9301#true} is VALID [2018-11-23 12:00:21,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {9301#true} assume true; {9301#true} is VALID [2018-11-23 12:00:21,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9301#true} {9301#true} #77#return; {9301#true} is VALID [2018-11-23 12:00:21,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {9301#true} call #t~ret9 := main(); {9301#true} is VALID [2018-11-23 12:00:21,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {9301#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9301#true} is VALID [2018-11-23 12:00:21,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,871 INFO L273 TraceCheckUtils]: 19: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,871 INFO L273 TraceCheckUtils]: 20: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,871 INFO L273 TraceCheckUtils]: 21: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,872 INFO L273 TraceCheckUtils]: 22: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,872 INFO L273 TraceCheckUtils]: 23: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,872 INFO L273 TraceCheckUtils]: 28: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,872 INFO L273 TraceCheckUtils]: 29: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,872 INFO L273 TraceCheckUtils]: 30: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,873 INFO L273 TraceCheckUtils]: 31: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,873 INFO L273 TraceCheckUtils]: 32: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,873 INFO L273 TraceCheckUtils]: 34: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,873 INFO L273 TraceCheckUtils]: 35: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,873 INFO L273 TraceCheckUtils]: 36: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,873 INFO L273 TraceCheckUtils]: 37: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,873 INFO L273 TraceCheckUtils]: 38: Hoare triple {9301#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9301#true} is VALID [2018-11-23 12:00:21,873 INFO L273 TraceCheckUtils]: 39: Hoare triple {9301#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#true} is VALID [2018-11-23 12:00:21,874 INFO L273 TraceCheckUtils]: 40: Hoare triple {9301#true} assume !(~a~0 < 100000); {9301#true} is VALID [2018-11-23 12:00:21,874 INFO L273 TraceCheckUtils]: 41: Hoare triple {9301#true} havoc ~i~0;~i~0 := 0; {9301#true} is VALID [2018-11-23 12:00:21,874 INFO L273 TraceCheckUtils]: 42: Hoare triple {9301#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9301#true} is VALID [2018-11-23 12:00:21,874 INFO L273 TraceCheckUtils]: 43: Hoare triple {9301#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9301#true} is VALID [2018-11-23 12:00:21,874 INFO L273 TraceCheckUtils]: 44: Hoare triple {9301#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9301#true} is VALID [2018-11-23 12:00:21,874 INFO L273 TraceCheckUtils]: 45: Hoare triple {9301#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9301#true} is VALID [2018-11-23 12:00:21,874 INFO L273 TraceCheckUtils]: 46: Hoare triple {9301#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9301#true} is VALID [2018-11-23 12:00:21,874 INFO L273 TraceCheckUtils]: 47: Hoare triple {9301#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9301#true} is VALID [2018-11-23 12:00:21,874 INFO L273 TraceCheckUtils]: 48: Hoare triple {9301#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9301#true} is VALID [2018-11-23 12:00:21,875 INFO L273 TraceCheckUtils]: 49: Hoare triple {9301#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9301#true} is VALID [2018-11-23 12:00:21,875 INFO L273 TraceCheckUtils]: 50: Hoare triple {9301#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9301#true} is VALID [2018-11-23 12:00:21,875 INFO L273 TraceCheckUtils]: 51: Hoare triple {9301#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9301#true} is VALID [2018-11-23 12:00:21,875 INFO L273 TraceCheckUtils]: 52: Hoare triple {9301#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9301#true} is VALID [2018-11-23 12:00:21,875 INFO L273 TraceCheckUtils]: 53: Hoare triple {9301#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9301#true} is VALID [2018-11-23 12:00:21,875 INFO L273 TraceCheckUtils]: 54: Hoare triple {9301#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9301#true} is VALID [2018-11-23 12:00:21,875 INFO L273 TraceCheckUtils]: 55: Hoare triple {9301#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9301#true} is VALID [2018-11-23 12:00:21,875 INFO L273 TraceCheckUtils]: 56: Hoare triple {9301#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9301#true} is VALID [2018-11-23 12:00:21,875 INFO L273 TraceCheckUtils]: 57: Hoare triple {9301#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9301#true} is VALID [2018-11-23 12:00:21,876 INFO L273 TraceCheckUtils]: 58: Hoare triple {9301#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9301#true} is VALID [2018-11-23 12:00:21,876 INFO L273 TraceCheckUtils]: 59: Hoare triple {9301#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9301#true} is VALID [2018-11-23 12:00:21,876 INFO L273 TraceCheckUtils]: 60: Hoare triple {9301#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9301#true} is VALID [2018-11-23 12:00:21,876 INFO L273 TraceCheckUtils]: 61: Hoare triple {9301#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9301#true} is VALID [2018-11-23 12:00:21,876 INFO L273 TraceCheckUtils]: 62: Hoare triple {9301#true} assume !(~i~0 < 100000); {9301#true} is VALID [2018-11-23 12:00:21,876 INFO L273 TraceCheckUtils]: 63: Hoare triple {9301#true} ~i~0 := 0; {9513#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:21,877 INFO L273 TraceCheckUtils]: 64: Hoare triple {9513#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9513#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:21,877 INFO L273 TraceCheckUtils]: 65: Hoare triple {9513#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9520#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:21,877 INFO L273 TraceCheckUtils]: 66: Hoare triple {9520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9520#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:21,878 INFO L273 TraceCheckUtils]: 67: Hoare triple {9520#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9527#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:21,878 INFO L273 TraceCheckUtils]: 68: Hoare triple {9527#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9527#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:21,879 INFO L273 TraceCheckUtils]: 69: Hoare triple {9527#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9534#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:21,879 INFO L273 TraceCheckUtils]: 70: Hoare triple {9534#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9534#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:21,880 INFO L273 TraceCheckUtils]: 71: Hoare triple {9534#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9541#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:21,880 INFO L273 TraceCheckUtils]: 72: Hoare triple {9541#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9541#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:21,881 INFO L273 TraceCheckUtils]: 73: Hoare triple {9541#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9548#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:21,882 INFO L273 TraceCheckUtils]: 74: Hoare triple {9548#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9548#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:21,882 INFO L273 TraceCheckUtils]: 75: Hoare triple {9548#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9555#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:21,883 INFO L273 TraceCheckUtils]: 76: Hoare triple {9555#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9555#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:21,884 INFO L273 TraceCheckUtils]: 77: Hoare triple {9555#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9562#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:21,884 INFO L273 TraceCheckUtils]: 78: Hoare triple {9562#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9562#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:21,885 INFO L273 TraceCheckUtils]: 79: Hoare triple {9562#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9569#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:21,885 INFO L273 TraceCheckUtils]: 80: Hoare triple {9569#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9569#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:21,886 INFO L273 TraceCheckUtils]: 81: Hoare triple {9569#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9576#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:21,886 INFO L273 TraceCheckUtils]: 82: Hoare triple {9576#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {9576#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:21,887 INFO L273 TraceCheckUtils]: 83: Hoare triple {9576#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9583#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:21,888 INFO L273 TraceCheckUtils]: 84: Hoare triple {9583#(<= main_~i~0 10)} assume !(~i~0 < 100000); {9302#false} is VALID [2018-11-23 12:00:21,888 INFO L273 TraceCheckUtils]: 85: Hoare triple {9302#false} havoc ~x~0;~x~0 := 0; {9302#false} is VALID [2018-11-23 12:00:21,888 INFO L273 TraceCheckUtils]: 86: Hoare triple {9302#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {9302#false} is VALID [2018-11-23 12:00:21,888 INFO L256 TraceCheckUtils]: 87: Hoare triple {9302#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {9302#false} is VALID [2018-11-23 12:00:21,888 INFO L273 TraceCheckUtils]: 88: Hoare triple {9302#false} ~cond := #in~cond; {9302#false} is VALID [2018-11-23 12:00:21,889 INFO L273 TraceCheckUtils]: 89: Hoare triple {9302#false} assume 0 == ~cond; {9302#false} is VALID [2018-11-23 12:00:21,889 INFO L273 TraceCheckUtils]: 90: Hoare triple {9302#false} assume !false; {9302#false} is VALID [2018-11-23 12:00:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2018-11-23 12:00:21,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:21,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 31 [2018-11-23 12:00:21,920 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 91 [2018-11-23 12:00:21,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:21,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:00:22,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:22,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:00:22,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:00:22,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=663, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:00:22,002 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 31 states. [2018-11-23 12:00:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:22,966 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2018-11-23 12:00:22,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:00:22,966 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 91 [2018-11-23 12:00:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:00:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 130 transitions. [2018-11-23 12:00:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:00:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 130 transitions. [2018-11-23 12:00:22,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 130 transitions. [2018-11-23 12:00:23,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:23,093 INFO L225 Difference]: With dead ends: 160 [2018-11-23 12:00:23,093 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:00:23,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=267, Invalid=663, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:00:23,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:00:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-11-23 12:00:23,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:23,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 102 states. [2018-11-23 12:00:23,132 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 102 states. [2018-11-23 12:00:23,132 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 102 states. [2018-11-23 12:00:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:23,134 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-11-23 12:00:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2018-11-23 12:00:23,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:23,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:23,135 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 105 states. [2018-11-23 12:00:23,135 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 105 states. [2018-11-23 12:00:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:23,136 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-11-23 12:00:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2018-11-23 12:00:23,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:23,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:23,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:23,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 12:00:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-11-23 12:00:23,138 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 91 [2018-11-23 12:00:23,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:23,138 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-11-23 12:00:23,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:00:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-11-23 12:00:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 12:00:23,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:23,140 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:23,140 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:23,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash -430620534, now seen corresponding path program 18 times [2018-11-23 12:00:23,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:23,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:23,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:23,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:23,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:23,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {10201#true} call ULTIMATE.init(); {10201#true} is VALID [2018-11-23 12:00:23,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {10201#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10201#true} is VALID [2018-11-23 12:00:23,722 INFO L273 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2018-11-23 12:00:23,722 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10201#true} #77#return; {10201#true} is VALID [2018-11-23 12:00:23,722 INFO L256 TraceCheckUtils]: 4: Hoare triple {10201#true} call #t~ret9 := main(); {10201#true} is VALID [2018-11-23 12:00:23,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {10201#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10203#(= main_~a~0 0)} is VALID [2018-11-23 12:00:23,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {10203#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10203#(= main_~a~0 0)} is VALID [2018-11-23 12:00:23,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {10203#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10204#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:23,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {10204#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10204#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:23,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {10204#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10205#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:23,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {10205#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10205#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:23,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {10205#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10206#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:23,727 INFO L273 TraceCheckUtils]: 12: Hoare triple {10206#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10206#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:23,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {10206#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10207#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:23,728 INFO L273 TraceCheckUtils]: 14: Hoare triple {10207#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10207#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:23,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {10207#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10208#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:23,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {10208#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10208#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:23,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {10208#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10209#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:23,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {10209#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10209#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:23,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {10209#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10210#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:23,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {10210#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10210#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:23,733 INFO L273 TraceCheckUtils]: 21: Hoare triple {10210#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10211#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:23,733 INFO L273 TraceCheckUtils]: 22: Hoare triple {10211#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10211#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:23,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {10211#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10212#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:23,734 INFO L273 TraceCheckUtils]: 24: Hoare triple {10212#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10212#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:23,735 INFO L273 TraceCheckUtils]: 25: Hoare triple {10212#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10213#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:23,736 INFO L273 TraceCheckUtils]: 26: Hoare triple {10213#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10213#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:23,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {10213#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10214#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:23,737 INFO L273 TraceCheckUtils]: 28: Hoare triple {10214#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10214#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:23,738 INFO L273 TraceCheckUtils]: 29: Hoare triple {10214#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10215#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:23,738 INFO L273 TraceCheckUtils]: 30: Hoare triple {10215#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10215#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:23,739 INFO L273 TraceCheckUtils]: 31: Hoare triple {10215#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10216#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:23,739 INFO L273 TraceCheckUtils]: 32: Hoare triple {10216#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10216#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:23,740 INFO L273 TraceCheckUtils]: 33: Hoare triple {10216#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10217#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:23,741 INFO L273 TraceCheckUtils]: 34: Hoare triple {10217#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10217#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:23,741 INFO L273 TraceCheckUtils]: 35: Hoare triple {10217#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10218#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:23,742 INFO L273 TraceCheckUtils]: 36: Hoare triple {10218#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10218#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:23,743 INFO L273 TraceCheckUtils]: 37: Hoare triple {10218#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10219#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:23,743 INFO L273 TraceCheckUtils]: 38: Hoare triple {10219#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10219#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:23,744 INFO L273 TraceCheckUtils]: 39: Hoare triple {10219#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10220#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:23,744 INFO L273 TraceCheckUtils]: 40: Hoare triple {10220#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10220#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:23,745 INFO L273 TraceCheckUtils]: 41: Hoare triple {10220#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10221#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:23,746 INFO L273 TraceCheckUtils]: 42: Hoare triple {10221#(<= main_~a~0 18)} assume !(~a~0 < 100000); {10202#false} is VALID [2018-11-23 12:00:23,746 INFO L273 TraceCheckUtils]: 43: Hoare triple {10202#false} havoc ~i~0;~i~0 := 0; {10202#false} is VALID [2018-11-23 12:00:23,746 INFO L273 TraceCheckUtils]: 44: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:23,746 INFO L273 TraceCheckUtils]: 45: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:23,747 INFO L273 TraceCheckUtils]: 46: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:23,747 INFO L273 TraceCheckUtils]: 47: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:23,747 INFO L273 TraceCheckUtils]: 48: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:23,747 INFO L273 TraceCheckUtils]: 49: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:23,747 INFO L273 TraceCheckUtils]: 50: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:23,748 INFO L273 TraceCheckUtils]: 51: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:23,748 INFO L273 TraceCheckUtils]: 52: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:23,748 INFO L273 TraceCheckUtils]: 53: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:23,748 INFO L273 TraceCheckUtils]: 54: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:23,748 INFO L273 TraceCheckUtils]: 55: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:23,748 INFO L273 TraceCheckUtils]: 56: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:23,749 INFO L273 TraceCheckUtils]: 57: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:23,749 INFO L273 TraceCheckUtils]: 58: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:23,749 INFO L273 TraceCheckUtils]: 59: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:23,749 INFO L273 TraceCheckUtils]: 60: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:23,749 INFO L273 TraceCheckUtils]: 61: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:23,749 INFO L273 TraceCheckUtils]: 62: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:23,749 INFO L273 TraceCheckUtils]: 63: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:23,749 INFO L273 TraceCheckUtils]: 64: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:23,749 INFO L273 TraceCheckUtils]: 65: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:23,750 INFO L273 TraceCheckUtils]: 66: Hoare triple {10202#false} assume !(~i~0 < 100000); {10202#false} is VALID [2018-11-23 12:00:23,750 INFO L273 TraceCheckUtils]: 67: Hoare triple {10202#false} ~i~0 := 0; {10202#false} is VALID [2018-11-23 12:00:23,750 INFO L273 TraceCheckUtils]: 68: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:23,750 INFO L273 TraceCheckUtils]: 69: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:23,750 INFO L273 TraceCheckUtils]: 70: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:23,750 INFO L273 TraceCheckUtils]: 71: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:23,750 INFO L273 TraceCheckUtils]: 72: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:23,750 INFO L273 TraceCheckUtils]: 73: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:23,750 INFO L273 TraceCheckUtils]: 74: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:23,751 INFO L273 TraceCheckUtils]: 75: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:23,751 INFO L273 TraceCheckUtils]: 76: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:23,751 INFO L273 TraceCheckUtils]: 77: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:23,751 INFO L273 TraceCheckUtils]: 78: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:23,751 INFO L273 TraceCheckUtils]: 79: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:23,751 INFO L273 TraceCheckUtils]: 80: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:23,751 INFO L273 TraceCheckUtils]: 81: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:23,751 INFO L273 TraceCheckUtils]: 82: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:23,752 INFO L273 TraceCheckUtils]: 83: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:23,752 INFO L273 TraceCheckUtils]: 84: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:23,752 INFO L273 TraceCheckUtils]: 85: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:23,752 INFO L273 TraceCheckUtils]: 86: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:23,752 INFO L273 TraceCheckUtils]: 87: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:23,752 INFO L273 TraceCheckUtils]: 88: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:23,752 INFO L273 TraceCheckUtils]: 89: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:23,753 INFO L273 TraceCheckUtils]: 90: Hoare triple {10202#false} assume !(~i~0 < 100000); {10202#false} is VALID [2018-11-23 12:00:23,753 INFO L273 TraceCheckUtils]: 91: Hoare triple {10202#false} havoc ~x~0;~x~0 := 0; {10202#false} is VALID [2018-11-23 12:00:23,753 INFO L273 TraceCheckUtils]: 92: Hoare triple {10202#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {10202#false} is VALID [2018-11-23 12:00:23,753 INFO L256 TraceCheckUtils]: 93: Hoare triple {10202#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {10202#false} is VALID [2018-11-23 12:00:23,753 INFO L273 TraceCheckUtils]: 94: Hoare triple {10202#false} ~cond := #in~cond; {10202#false} is VALID [2018-11-23 12:00:23,753 INFO L273 TraceCheckUtils]: 95: Hoare triple {10202#false} assume 0 == ~cond; {10202#false} is VALID [2018-11-23 12:00:23,753 INFO L273 TraceCheckUtils]: 96: Hoare triple {10202#false} assume !false; {10202#false} is VALID [2018-11-23 12:00:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 12:00:23,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:23,758 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:00:23,766 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:00:56,905 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:00:56,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:56,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:57,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {10201#true} call ULTIMATE.init(); {10201#true} is VALID [2018-11-23 12:00:57,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {10201#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10201#true} is VALID [2018-11-23 12:00:57,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2018-11-23 12:00:57,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10201#true} #77#return; {10201#true} is VALID [2018-11-23 12:00:57,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {10201#true} call #t~ret9 := main(); {10201#true} is VALID [2018-11-23 12:00:57,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {10201#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10240#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:57,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {10240#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10240#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:57,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {10240#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10204#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:57,308 INFO L273 TraceCheckUtils]: 8: Hoare triple {10204#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10204#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:57,308 INFO L273 TraceCheckUtils]: 9: Hoare triple {10204#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10205#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:57,308 INFO L273 TraceCheckUtils]: 10: Hoare triple {10205#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10205#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:57,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {10205#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10206#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:57,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {10206#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10206#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:57,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {10206#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10207#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:57,311 INFO L273 TraceCheckUtils]: 14: Hoare triple {10207#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10207#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:57,312 INFO L273 TraceCheckUtils]: 15: Hoare triple {10207#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10208#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:57,312 INFO L273 TraceCheckUtils]: 16: Hoare triple {10208#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10208#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:57,313 INFO L273 TraceCheckUtils]: 17: Hoare triple {10208#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10209#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:57,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {10209#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10209#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:57,314 INFO L273 TraceCheckUtils]: 19: Hoare triple {10209#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10210#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:57,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {10210#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10210#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:57,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {10210#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10211#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:57,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {10211#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10211#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:57,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {10211#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10212#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:57,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {10212#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10212#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:57,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {10212#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10213#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:57,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {10213#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10213#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:57,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {10213#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10214#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:57,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {10214#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10214#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:57,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {10214#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10215#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:57,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {10215#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10215#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:57,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {10215#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10216#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:57,322 INFO L273 TraceCheckUtils]: 32: Hoare triple {10216#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10216#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:57,323 INFO L273 TraceCheckUtils]: 33: Hoare triple {10216#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10217#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:57,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {10217#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10217#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:57,324 INFO L273 TraceCheckUtils]: 35: Hoare triple {10217#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10218#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:57,325 INFO L273 TraceCheckUtils]: 36: Hoare triple {10218#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10218#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:57,326 INFO L273 TraceCheckUtils]: 37: Hoare triple {10218#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10219#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:57,326 INFO L273 TraceCheckUtils]: 38: Hoare triple {10219#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10219#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:57,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {10219#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10220#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:57,328 INFO L273 TraceCheckUtils]: 40: Hoare triple {10220#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10220#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:57,328 INFO L273 TraceCheckUtils]: 41: Hoare triple {10220#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10221#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:57,329 INFO L273 TraceCheckUtils]: 42: Hoare triple {10221#(<= main_~a~0 18)} assume !(~a~0 < 100000); {10202#false} is VALID [2018-11-23 12:00:57,329 INFO L273 TraceCheckUtils]: 43: Hoare triple {10202#false} havoc ~i~0;~i~0 := 0; {10202#false} is VALID [2018-11-23 12:00:57,329 INFO L273 TraceCheckUtils]: 44: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:57,330 INFO L273 TraceCheckUtils]: 45: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:57,330 INFO L273 TraceCheckUtils]: 46: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:57,330 INFO L273 TraceCheckUtils]: 47: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:57,330 INFO L273 TraceCheckUtils]: 48: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:57,330 INFO L273 TraceCheckUtils]: 49: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:57,331 INFO L273 TraceCheckUtils]: 50: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:57,331 INFO L273 TraceCheckUtils]: 51: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:57,331 INFO L273 TraceCheckUtils]: 52: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:57,331 INFO L273 TraceCheckUtils]: 53: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:57,331 INFO L273 TraceCheckUtils]: 54: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:57,332 INFO L273 TraceCheckUtils]: 55: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:57,332 INFO L273 TraceCheckUtils]: 56: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:57,332 INFO L273 TraceCheckUtils]: 57: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:57,332 INFO L273 TraceCheckUtils]: 58: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:57,332 INFO L273 TraceCheckUtils]: 59: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:57,333 INFO L273 TraceCheckUtils]: 60: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:57,333 INFO L273 TraceCheckUtils]: 61: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:57,333 INFO L273 TraceCheckUtils]: 62: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:57,333 INFO L273 TraceCheckUtils]: 63: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:57,333 INFO L273 TraceCheckUtils]: 64: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10202#false} is VALID [2018-11-23 12:00:57,333 INFO L273 TraceCheckUtils]: 65: Hoare triple {10202#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10202#false} is VALID [2018-11-23 12:00:57,333 INFO L273 TraceCheckUtils]: 66: Hoare triple {10202#false} assume !(~i~0 < 100000); {10202#false} is VALID [2018-11-23 12:00:57,333 INFO L273 TraceCheckUtils]: 67: Hoare triple {10202#false} ~i~0 := 0; {10202#false} is VALID [2018-11-23 12:00:57,333 INFO L273 TraceCheckUtils]: 68: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:57,334 INFO L273 TraceCheckUtils]: 69: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:57,334 INFO L273 TraceCheckUtils]: 70: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:57,334 INFO L273 TraceCheckUtils]: 71: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:57,334 INFO L273 TraceCheckUtils]: 72: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:57,334 INFO L273 TraceCheckUtils]: 73: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:57,334 INFO L273 TraceCheckUtils]: 74: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:57,334 INFO L273 TraceCheckUtils]: 75: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:57,334 INFO L273 TraceCheckUtils]: 76: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:57,335 INFO L273 TraceCheckUtils]: 77: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:57,335 INFO L273 TraceCheckUtils]: 78: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:57,335 INFO L273 TraceCheckUtils]: 79: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:57,335 INFO L273 TraceCheckUtils]: 80: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:57,335 INFO L273 TraceCheckUtils]: 81: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:57,335 INFO L273 TraceCheckUtils]: 82: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:57,335 INFO L273 TraceCheckUtils]: 83: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:57,335 INFO L273 TraceCheckUtils]: 84: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:57,335 INFO L273 TraceCheckUtils]: 85: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:57,336 INFO L273 TraceCheckUtils]: 86: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:57,336 INFO L273 TraceCheckUtils]: 87: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:57,336 INFO L273 TraceCheckUtils]: 88: Hoare triple {10202#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10202#false} is VALID [2018-11-23 12:00:57,336 INFO L273 TraceCheckUtils]: 89: Hoare triple {10202#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10202#false} is VALID [2018-11-23 12:00:57,336 INFO L273 TraceCheckUtils]: 90: Hoare triple {10202#false} assume !(~i~0 < 100000); {10202#false} is VALID [2018-11-23 12:00:57,336 INFO L273 TraceCheckUtils]: 91: Hoare triple {10202#false} havoc ~x~0;~x~0 := 0; {10202#false} is VALID [2018-11-23 12:00:57,336 INFO L273 TraceCheckUtils]: 92: Hoare triple {10202#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {10202#false} is VALID [2018-11-23 12:00:57,336 INFO L256 TraceCheckUtils]: 93: Hoare triple {10202#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {10202#false} is VALID [2018-11-23 12:00:57,336 INFO L273 TraceCheckUtils]: 94: Hoare triple {10202#false} ~cond := #in~cond; {10202#false} is VALID [2018-11-23 12:00:57,337 INFO L273 TraceCheckUtils]: 95: Hoare triple {10202#false} assume 0 == ~cond; {10202#false} is VALID [2018-11-23 12:00:57,337 INFO L273 TraceCheckUtils]: 96: Hoare triple {10202#false} assume !false; {10202#false} is VALID [2018-11-23 12:00:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 12:00:57,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:57,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:00:57,368 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-11-23 12:00:57,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:57,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:00:57,429 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:00:57,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:00:57,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:00:57,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:00:57,431 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 22 states. [2018-11-23 12:00:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:57,885 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2018-11-23 12:00:57,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:00:57,885 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-11-23 12:00:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:00:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 86 transitions. [2018-11-23 12:00:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:00:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 86 transitions. [2018-11-23 12:00:57,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 86 transitions. [2018-11-23 12:00:57,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:57,997 INFO L225 Difference]: With dead ends: 164 [2018-11-23 12:00:57,997 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:00:57,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:00:57,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:00:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-11-23 12:00:58,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:58,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 104 states. [2018-11-23 12:00:58,036 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 104 states. [2018-11-23 12:00:58,036 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 104 states. [2018-11-23 12:00:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:58,038 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-11-23 12:00:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2018-11-23 12:00:58,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:58,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:58,039 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 105 states. [2018-11-23 12:00:58,039 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 105 states. [2018-11-23 12:00:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:58,041 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-11-23 12:00:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2018-11-23 12:00:58,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:58,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:58,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:58,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 12:00:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2018-11-23 12:00:58,044 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 97 [2018-11-23 12:00:58,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:58,044 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2018-11-23 12:00:58,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:00:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-23 12:00:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 12:00:58,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:58,046 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:58,046 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:58,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:58,046 INFO L82 PathProgramCache]: Analyzing trace with hash -647360600, now seen corresponding path program 19 times [2018-11-23 12:00:58,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:58,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:58,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:58,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:58,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:58,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {11120#true} call ULTIMATE.init(); {11120#true} is VALID [2018-11-23 12:00:58,501 INFO L273 TraceCheckUtils]: 1: Hoare triple {11120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11120#true} is VALID [2018-11-23 12:00:58,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {11120#true} assume true; {11120#true} is VALID [2018-11-23 12:00:58,502 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11120#true} {11120#true} #77#return; {11120#true} is VALID [2018-11-23 12:00:58,502 INFO L256 TraceCheckUtils]: 4: Hoare triple {11120#true} call #t~ret9 := main(); {11120#true} is VALID [2018-11-23 12:00:58,502 INFO L273 TraceCheckUtils]: 5: Hoare triple {11120#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11122#(= main_~a~0 0)} is VALID [2018-11-23 12:00:58,503 INFO L273 TraceCheckUtils]: 6: Hoare triple {11122#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11122#(= main_~a~0 0)} is VALID [2018-11-23 12:00:58,504 INFO L273 TraceCheckUtils]: 7: Hoare triple {11122#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11123#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:58,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {11123#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11123#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:58,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {11123#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11124#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:58,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {11124#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11124#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:58,506 INFO L273 TraceCheckUtils]: 11: Hoare triple {11124#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11125#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:58,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {11125#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11125#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:58,507 INFO L273 TraceCheckUtils]: 13: Hoare triple {11125#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11126#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:58,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {11126#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11126#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:58,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {11126#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11127#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:58,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {11127#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11127#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:58,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {11127#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11128#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:58,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {11128#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11128#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:58,511 INFO L273 TraceCheckUtils]: 19: Hoare triple {11128#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11129#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:58,512 INFO L273 TraceCheckUtils]: 20: Hoare triple {11129#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11129#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:58,513 INFO L273 TraceCheckUtils]: 21: Hoare triple {11129#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11130#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:58,513 INFO L273 TraceCheckUtils]: 22: Hoare triple {11130#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11130#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:58,514 INFO L273 TraceCheckUtils]: 23: Hoare triple {11130#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11131#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:58,514 INFO L273 TraceCheckUtils]: 24: Hoare triple {11131#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11131#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:58,515 INFO L273 TraceCheckUtils]: 25: Hoare triple {11131#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11132#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:58,516 INFO L273 TraceCheckUtils]: 26: Hoare triple {11132#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11132#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:58,516 INFO L273 TraceCheckUtils]: 27: Hoare triple {11132#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11133#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:58,517 INFO L273 TraceCheckUtils]: 28: Hoare triple {11133#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11133#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:58,518 INFO L273 TraceCheckUtils]: 29: Hoare triple {11133#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11134#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:58,518 INFO L273 TraceCheckUtils]: 30: Hoare triple {11134#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11134#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:58,519 INFO L273 TraceCheckUtils]: 31: Hoare triple {11134#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11135#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:58,519 INFO L273 TraceCheckUtils]: 32: Hoare triple {11135#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11135#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:58,520 INFO L273 TraceCheckUtils]: 33: Hoare triple {11135#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11136#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:58,521 INFO L273 TraceCheckUtils]: 34: Hoare triple {11136#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11136#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:58,521 INFO L273 TraceCheckUtils]: 35: Hoare triple {11136#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11137#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:58,522 INFO L273 TraceCheckUtils]: 36: Hoare triple {11137#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11137#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:58,523 INFO L273 TraceCheckUtils]: 37: Hoare triple {11137#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11138#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:58,523 INFO L273 TraceCheckUtils]: 38: Hoare triple {11138#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11138#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:58,524 INFO L273 TraceCheckUtils]: 39: Hoare triple {11138#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11139#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:58,525 INFO L273 TraceCheckUtils]: 40: Hoare triple {11139#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11139#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:58,525 INFO L273 TraceCheckUtils]: 41: Hoare triple {11139#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11140#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:58,526 INFO L273 TraceCheckUtils]: 42: Hoare triple {11140#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11140#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:58,527 INFO L273 TraceCheckUtils]: 43: Hoare triple {11140#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11141#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:58,527 INFO L273 TraceCheckUtils]: 44: Hoare triple {11141#(<= main_~a~0 19)} assume !(~a~0 < 100000); {11121#false} is VALID [2018-11-23 12:00:58,527 INFO L273 TraceCheckUtils]: 45: Hoare triple {11121#false} havoc ~i~0;~i~0 := 0; {11121#false} is VALID [2018-11-23 12:00:58,528 INFO L273 TraceCheckUtils]: 46: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,528 INFO L273 TraceCheckUtils]: 47: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,528 INFO L273 TraceCheckUtils]: 48: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,528 INFO L273 TraceCheckUtils]: 49: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,529 INFO L273 TraceCheckUtils]: 50: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,529 INFO L273 TraceCheckUtils]: 51: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,529 INFO L273 TraceCheckUtils]: 52: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,529 INFO L273 TraceCheckUtils]: 53: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,529 INFO L273 TraceCheckUtils]: 54: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,530 INFO L273 TraceCheckUtils]: 55: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,530 INFO L273 TraceCheckUtils]: 56: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,530 INFO L273 TraceCheckUtils]: 57: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,530 INFO L273 TraceCheckUtils]: 58: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,530 INFO L273 TraceCheckUtils]: 59: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,530 INFO L273 TraceCheckUtils]: 60: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,531 INFO L273 TraceCheckUtils]: 61: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,531 INFO L273 TraceCheckUtils]: 62: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,531 INFO L273 TraceCheckUtils]: 63: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,531 INFO L273 TraceCheckUtils]: 64: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,531 INFO L273 TraceCheckUtils]: 65: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,532 INFO L273 TraceCheckUtils]: 66: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,532 INFO L273 TraceCheckUtils]: 67: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,532 INFO L273 TraceCheckUtils]: 68: Hoare triple {11121#false} assume !(~i~0 < 100000); {11121#false} is VALID [2018-11-23 12:00:58,532 INFO L273 TraceCheckUtils]: 69: Hoare triple {11121#false} ~i~0 := 0; {11121#false} is VALID [2018-11-23 12:00:58,532 INFO L273 TraceCheckUtils]: 70: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,532 INFO L273 TraceCheckUtils]: 71: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,532 INFO L273 TraceCheckUtils]: 72: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,533 INFO L273 TraceCheckUtils]: 73: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,533 INFO L273 TraceCheckUtils]: 74: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,533 INFO L273 TraceCheckUtils]: 75: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,533 INFO L273 TraceCheckUtils]: 76: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,533 INFO L273 TraceCheckUtils]: 77: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,533 INFO L273 TraceCheckUtils]: 78: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,533 INFO L273 TraceCheckUtils]: 79: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,533 INFO L273 TraceCheckUtils]: 80: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,533 INFO L273 TraceCheckUtils]: 81: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,534 INFO L273 TraceCheckUtils]: 82: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,534 INFO L273 TraceCheckUtils]: 83: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,534 INFO L273 TraceCheckUtils]: 84: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,534 INFO L273 TraceCheckUtils]: 85: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,534 INFO L273 TraceCheckUtils]: 86: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,534 INFO L273 TraceCheckUtils]: 87: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,534 INFO L273 TraceCheckUtils]: 88: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,534 INFO L273 TraceCheckUtils]: 89: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,534 INFO L273 TraceCheckUtils]: 90: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,535 INFO L273 TraceCheckUtils]: 91: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,535 INFO L273 TraceCheckUtils]: 92: Hoare triple {11121#false} assume !(~i~0 < 100000); {11121#false} is VALID [2018-11-23 12:00:58,535 INFO L273 TraceCheckUtils]: 93: Hoare triple {11121#false} havoc ~x~0;~x~0 := 0; {11121#false} is VALID [2018-11-23 12:00:58,535 INFO L273 TraceCheckUtils]: 94: Hoare triple {11121#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {11121#false} is VALID [2018-11-23 12:00:58,535 INFO L256 TraceCheckUtils]: 95: Hoare triple {11121#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {11121#false} is VALID [2018-11-23 12:00:58,535 INFO L273 TraceCheckUtils]: 96: Hoare triple {11121#false} ~cond := #in~cond; {11121#false} is VALID [2018-11-23 12:00:58,535 INFO L273 TraceCheckUtils]: 97: Hoare triple {11121#false} assume 0 == ~cond; {11121#false} is VALID [2018-11-23 12:00:58,535 INFO L273 TraceCheckUtils]: 98: Hoare triple {11121#false} assume !false; {11121#false} is VALID [2018-11-23 12:00:58,540 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 12:00:58,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:58,540 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:00:58,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:58,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:58,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {11120#true} call ULTIMATE.init(); {11120#true} is VALID [2018-11-23 12:00:58,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {11120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11120#true} is VALID [2018-11-23 12:00:58,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {11120#true} assume true; {11120#true} is VALID [2018-11-23 12:00:58,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11120#true} {11120#true} #77#return; {11120#true} is VALID [2018-11-23 12:00:58,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {11120#true} call #t~ret9 := main(); {11120#true} is VALID [2018-11-23 12:00:58,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {11120#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11160#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:58,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {11160#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11160#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:58,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {11160#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11123#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:58,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {11123#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11123#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:58,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {11123#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11124#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:58,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {11124#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11124#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:58,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {11124#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11125#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:58,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {11125#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11125#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:58,825 INFO L273 TraceCheckUtils]: 13: Hoare triple {11125#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11126#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:58,825 INFO L273 TraceCheckUtils]: 14: Hoare triple {11126#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11126#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:58,826 INFO L273 TraceCheckUtils]: 15: Hoare triple {11126#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11127#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:58,827 INFO L273 TraceCheckUtils]: 16: Hoare triple {11127#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11127#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:58,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {11127#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11128#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:58,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {11128#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11128#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:58,829 INFO L273 TraceCheckUtils]: 19: Hoare triple {11128#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11129#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:58,829 INFO L273 TraceCheckUtils]: 20: Hoare triple {11129#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11129#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:58,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {11129#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11130#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:58,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {11130#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11130#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:58,831 INFO L273 TraceCheckUtils]: 23: Hoare triple {11130#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11131#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:58,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {11131#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11131#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:58,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {11131#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11132#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:58,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {11132#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11132#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:58,834 INFO L273 TraceCheckUtils]: 27: Hoare triple {11132#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11133#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:58,834 INFO L273 TraceCheckUtils]: 28: Hoare triple {11133#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11133#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:58,835 INFO L273 TraceCheckUtils]: 29: Hoare triple {11133#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11134#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:58,836 INFO L273 TraceCheckUtils]: 30: Hoare triple {11134#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11134#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:58,836 INFO L273 TraceCheckUtils]: 31: Hoare triple {11134#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11135#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:58,837 INFO L273 TraceCheckUtils]: 32: Hoare triple {11135#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11135#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:58,838 INFO L273 TraceCheckUtils]: 33: Hoare triple {11135#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11136#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:58,838 INFO L273 TraceCheckUtils]: 34: Hoare triple {11136#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11136#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:58,839 INFO L273 TraceCheckUtils]: 35: Hoare triple {11136#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11137#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:58,840 INFO L273 TraceCheckUtils]: 36: Hoare triple {11137#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11137#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:58,840 INFO L273 TraceCheckUtils]: 37: Hoare triple {11137#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11138#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:58,841 INFO L273 TraceCheckUtils]: 38: Hoare triple {11138#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11138#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:58,842 INFO L273 TraceCheckUtils]: 39: Hoare triple {11138#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11139#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:58,842 INFO L273 TraceCheckUtils]: 40: Hoare triple {11139#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11139#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:58,843 INFO L273 TraceCheckUtils]: 41: Hoare triple {11139#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11140#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:58,843 INFO L273 TraceCheckUtils]: 42: Hoare triple {11140#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11140#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:58,844 INFO L273 TraceCheckUtils]: 43: Hoare triple {11140#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11141#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:58,845 INFO L273 TraceCheckUtils]: 44: Hoare triple {11141#(<= main_~a~0 19)} assume !(~a~0 < 100000); {11121#false} is VALID [2018-11-23 12:00:58,845 INFO L273 TraceCheckUtils]: 45: Hoare triple {11121#false} havoc ~i~0;~i~0 := 0; {11121#false} is VALID [2018-11-23 12:00:58,845 INFO L273 TraceCheckUtils]: 46: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,845 INFO L273 TraceCheckUtils]: 47: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,846 INFO L273 TraceCheckUtils]: 48: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,846 INFO L273 TraceCheckUtils]: 49: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,846 INFO L273 TraceCheckUtils]: 50: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,846 INFO L273 TraceCheckUtils]: 51: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,846 INFO L273 TraceCheckUtils]: 52: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,847 INFO L273 TraceCheckUtils]: 53: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,847 INFO L273 TraceCheckUtils]: 54: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,847 INFO L273 TraceCheckUtils]: 55: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,847 INFO L273 TraceCheckUtils]: 56: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,847 INFO L273 TraceCheckUtils]: 57: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,848 INFO L273 TraceCheckUtils]: 58: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,848 INFO L273 TraceCheckUtils]: 59: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,848 INFO L273 TraceCheckUtils]: 60: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,848 INFO L273 TraceCheckUtils]: 61: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,848 INFO L273 TraceCheckUtils]: 62: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,848 INFO L273 TraceCheckUtils]: 63: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,848 INFO L273 TraceCheckUtils]: 64: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,848 INFO L273 TraceCheckUtils]: 65: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,848 INFO L273 TraceCheckUtils]: 66: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11121#false} is VALID [2018-11-23 12:00:58,849 INFO L273 TraceCheckUtils]: 67: Hoare triple {11121#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11121#false} is VALID [2018-11-23 12:00:58,849 INFO L273 TraceCheckUtils]: 68: Hoare triple {11121#false} assume !(~i~0 < 100000); {11121#false} is VALID [2018-11-23 12:00:58,849 INFO L273 TraceCheckUtils]: 69: Hoare triple {11121#false} ~i~0 := 0; {11121#false} is VALID [2018-11-23 12:00:58,849 INFO L273 TraceCheckUtils]: 70: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,849 INFO L273 TraceCheckUtils]: 71: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,849 INFO L273 TraceCheckUtils]: 72: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,849 INFO L273 TraceCheckUtils]: 73: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,849 INFO L273 TraceCheckUtils]: 74: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,849 INFO L273 TraceCheckUtils]: 75: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,850 INFO L273 TraceCheckUtils]: 76: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,850 INFO L273 TraceCheckUtils]: 77: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,850 INFO L273 TraceCheckUtils]: 78: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,850 INFO L273 TraceCheckUtils]: 79: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,850 INFO L273 TraceCheckUtils]: 80: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,850 INFO L273 TraceCheckUtils]: 81: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,850 INFO L273 TraceCheckUtils]: 82: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,850 INFO L273 TraceCheckUtils]: 83: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,850 INFO L273 TraceCheckUtils]: 84: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,851 INFO L273 TraceCheckUtils]: 85: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,851 INFO L273 TraceCheckUtils]: 86: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,851 INFO L273 TraceCheckUtils]: 87: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,851 INFO L273 TraceCheckUtils]: 88: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,851 INFO L273 TraceCheckUtils]: 89: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,851 INFO L273 TraceCheckUtils]: 90: Hoare triple {11121#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11121#false} is VALID [2018-11-23 12:00:58,851 INFO L273 TraceCheckUtils]: 91: Hoare triple {11121#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11121#false} is VALID [2018-11-23 12:00:58,851 INFO L273 TraceCheckUtils]: 92: Hoare triple {11121#false} assume !(~i~0 < 100000); {11121#false} is VALID [2018-11-23 12:00:58,852 INFO L273 TraceCheckUtils]: 93: Hoare triple {11121#false} havoc ~x~0;~x~0 := 0; {11121#false} is VALID [2018-11-23 12:00:58,852 INFO L273 TraceCheckUtils]: 94: Hoare triple {11121#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {11121#false} is VALID [2018-11-23 12:00:58,852 INFO L256 TraceCheckUtils]: 95: Hoare triple {11121#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {11121#false} is VALID [2018-11-23 12:00:58,852 INFO L273 TraceCheckUtils]: 96: Hoare triple {11121#false} ~cond := #in~cond; {11121#false} is VALID [2018-11-23 12:00:58,852 INFO L273 TraceCheckUtils]: 97: Hoare triple {11121#false} assume 0 == ~cond; {11121#false} is VALID [2018-11-23 12:00:58,852 INFO L273 TraceCheckUtils]: 98: Hoare triple {11121#false} assume !false; {11121#false} is VALID [2018-11-23 12:00:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 12:00:58,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:58,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:00:58,877 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2018-11-23 12:00:58,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:58,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:00:58,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:58,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:00:58,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:00:58,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:00:58,940 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 23 states. [2018-11-23 12:00:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:59,242 INFO L93 Difference]: Finished difference Result 166 states and 172 transitions. [2018-11-23 12:00:59,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:00:59,242 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2018-11-23 12:00:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:00:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 88 transitions. [2018-11-23 12:00:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:00:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 88 transitions. [2018-11-23 12:00:59,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 88 transitions. [2018-11-23 12:00:59,328 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:00:59,330 INFO L225 Difference]: With dead ends: 166 [2018-11-23 12:00:59,331 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 12:00:59,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:00:59,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 12:00:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-11-23 12:00:59,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:59,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 106 states. [2018-11-23 12:00:59,379 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 106 states. [2018-11-23 12:00:59,380 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 106 states. [2018-11-23 12:00:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:59,381 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2018-11-23 12:00:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-11-23 12:00:59,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:59,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:59,382 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 107 states. [2018-11-23 12:00:59,382 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 107 states. [2018-11-23 12:00:59,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:59,383 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2018-11-23 12:00:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-11-23 12:00:59,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:59,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:59,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:59,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 12:00:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2018-11-23 12:00:59,385 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 99 [2018-11-23 12:00:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:59,386 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2018-11-23 12:00:59,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:00:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-23 12:00:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 12:00:59,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:59,387 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:59,387 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:59,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1518833478, now seen corresponding path program 20 times [2018-11-23 12:00:59,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:59,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:59,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:59,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:00,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {12056#true} call ULTIMATE.init(); {12056#true} is VALID [2018-11-23 12:01:00,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {12056#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12056#true} is VALID [2018-11-23 12:01:00,371 INFO L273 TraceCheckUtils]: 2: Hoare triple {12056#true} assume true; {12056#true} is VALID [2018-11-23 12:01:00,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12056#true} {12056#true} #77#return; {12056#true} is VALID [2018-11-23 12:01:00,372 INFO L256 TraceCheckUtils]: 4: Hoare triple {12056#true} call #t~ret9 := main(); {12056#true} is VALID [2018-11-23 12:01:00,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {12056#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12058#(= main_~a~0 0)} is VALID [2018-11-23 12:01:00,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {12058#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12058#(= main_~a~0 0)} is VALID [2018-11-23 12:01:00,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {12058#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12059#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:00,375 INFO L273 TraceCheckUtils]: 8: Hoare triple {12059#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12059#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:00,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {12059#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12060#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:00,377 INFO L273 TraceCheckUtils]: 10: Hoare triple {12060#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12060#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:00,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {12060#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12061#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:00,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {12061#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12061#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:00,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {12061#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12062#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:00,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {12062#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12062#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:00,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {12062#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12063#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:00,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {12063#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12063#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:00,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {12063#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12064#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:00,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {12064#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12064#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:00,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {12064#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12065#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:00,389 INFO L273 TraceCheckUtils]: 20: Hoare triple {12065#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12065#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:00,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {12065#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12066#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:00,391 INFO L273 TraceCheckUtils]: 22: Hoare triple {12066#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12066#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:00,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {12066#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12067#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:00,393 INFO L273 TraceCheckUtils]: 24: Hoare triple {12067#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12067#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:00,393 INFO L273 TraceCheckUtils]: 25: Hoare triple {12067#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12068#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:00,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {12068#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12068#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:00,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {12068#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12069#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:00,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {12069#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12069#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:00,398 INFO L273 TraceCheckUtils]: 29: Hoare triple {12069#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12070#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:00,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {12070#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12070#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:00,399 INFO L273 TraceCheckUtils]: 31: Hoare triple {12070#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12071#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:00,399 INFO L273 TraceCheckUtils]: 32: Hoare triple {12071#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12071#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:00,400 INFO L273 TraceCheckUtils]: 33: Hoare triple {12071#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12072#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:00,400 INFO L273 TraceCheckUtils]: 34: Hoare triple {12072#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12072#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:00,400 INFO L273 TraceCheckUtils]: 35: Hoare triple {12072#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12073#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:00,401 INFO L273 TraceCheckUtils]: 36: Hoare triple {12073#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12073#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:00,402 INFO L273 TraceCheckUtils]: 37: Hoare triple {12073#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12074#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:00,402 INFO L273 TraceCheckUtils]: 38: Hoare triple {12074#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12074#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:00,403 INFO L273 TraceCheckUtils]: 39: Hoare triple {12074#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12075#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:00,404 INFO L273 TraceCheckUtils]: 40: Hoare triple {12075#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12075#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:00,404 INFO L273 TraceCheckUtils]: 41: Hoare triple {12075#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12076#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:00,405 INFO L273 TraceCheckUtils]: 42: Hoare triple {12076#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12076#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:00,406 INFO L273 TraceCheckUtils]: 43: Hoare triple {12076#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12077#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:00,406 INFO L273 TraceCheckUtils]: 44: Hoare triple {12077#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12077#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:00,407 INFO L273 TraceCheckUtils]: 45: Hoare triple {12077#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12078#(<= main_~a~0 20)} is VALID [2018-11-23 12:01:00,407 INFO L273 TraceCheckUtils]: 46: Hoare triple {12078#(<= main_~a~0 20)} assume !(~a~0 < 100000); {12057#false} is VALID [2018-11-23 12:01:00,408 INFO L273 TraceCheckUtils]: 47: Hoare triple {12057#false} havoc ~i~0;~i~0 := 0; {12057#false} is VALID [2018-11-23 12:01:00,408 INFO L273 TraceCheckUtils]: 48: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,408 INFO L273 TraceCheckUtils]: 49: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,408 INFO L273 TraceCheckUtils]: 50: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,409 INFO L273 TraceCheckUtils]: 51: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,409 INFO L273 TraceCheckUtils]: 52: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,409 INFO L273 TraceCheckUtils]: 53: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,409 INFO L273 TraceCheckUtils]: 54: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,409 INFO L273 TraceCheckUtils]: 55: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,409 INFO L273 TraceCheckUtils]: 56: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,410 INFO L273 TraceCheckUtils]: 57: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,410 INFO L273 TraceCheckUtils]: 58: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,410 INFO L273 TraceCheckUtils]: 59: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,410 INFO L273 TraceCheckUtils]: 60: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,410 INFO L273 TraceCheckUtils]: 61: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,411 INFO L273 TraceCheckUtils]: 62: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,411 INFO L273 TraceCheckUtils]: 63: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,411 INFO L273 TraceCheckUtils]: 64: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,411 INFO L273 TraceCheckUtils]: 65: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,411 INFO L273 TraceCheckUtils]: 66: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,411 INFO L273 TraceCheckUtils]: 67: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,411 INFO L273 TraceCheckUtils]: 68: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,411 INFO L273 TraceCheckUtils]: 69: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,411 INFO L273 TraceCheckUtils]: 70: Hoare triple {12057#false} assume !(~i~0 < 100000); {12057#false} is VALID [2018-11-23 12:01:00,412 INFO L273 TraceCheckUtils]: 71: Hoare triple {12057#false} ~i~0 := 0; {12057#false} is VALID [2018-11-23 12:01:00,412 INFO L273 TraceCheckUtils]: 72: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,412 INFO L273 TraceCheckUtils]: 73: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,412 INFO L273 TraceCheckUtils]: 74: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,412 INFO L273 TraceCheckUtils]: 75: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,412 INFO L273 TraceCheckUtils]: 76: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,412 INFO L273 TraceCheckUtils]: 77: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,412 INFO L273 TraceCheckUtils]: 78: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,412 INFO L273 TraceCheckUtils]: 79: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,413 INFO L273 TraceCheckUtils]: 80: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,413 INFO L273 TraceCheckUtils]: 81: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,413 INFO L273 TraceCheckUtils]: 82: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,413 INFO L273 TraceCheckUtils]: 83: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,413 INFO L273 TraceCheckUtils]: 84: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,413 INFO L273 TraceCheckUtils]: 85: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,413 INFO L273 TraceCheckUtils]: 86: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,413 INFO L273 TraceCheckUtils]: 87: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,414 INFO L273 TraceCheckUtils]: 88: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,414 INFO L273 TraceCheckUtils]: 89: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,414 INFO L273 TraceCheckUtils]: 90: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,414 INFO L273 TraceCheckUtils]: 91: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,414 INFO L273 TraceCheckUtils]: 92: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,414 INFO L273 TraceCheckUtils]: 93: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,414 INFO L273 TraceCheckUtils]: 94: Hoare triple {12057#false} assume !(~i~0 < 100000); {12057#false} is VALID [2018-11-23 12:01:00,414 INFO L273 TraceCheckUtils]: 95: Hoare triple {12057#false} havoc ~x~0;~x~0 := 0; {12057#false} is VALID [2018-11-23 12:01:00,414 INFO L273 TraceCheckUtils]: 96: Hoare triple {12057#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {12057#false} is VALID [2018-11-23 12:01:00,415 INFO L256 TraceCheckUtils]: 97: Hoare triple {12057#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {12057#false} is VALID [2018-11-23 12:01:00,415 INFO L273 TraceCheckUtils]: 98: Hoare triple {12057#false} ~cond := #in~cond; {12057#false} is VALID [2018-11-23 12:01:00,415 INFO L273 TraceCheckUtils]: 99: Hoare triple {12057#false} assume 0 == ~cond; {12057#false} is VALID [2018-11-23 12:01:00,415 INFO L273 TraceCheckUtils]: 100: Hoare triple {12057#false} assume !false; {12057#false} is VALID [2018-11-23 12:01:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 12:01:00,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:00,420 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:01:00,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:01:00,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:01:00,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:00,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:00,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {12056#true} call ULTIMATE.init(); {12056#true} is VALID [2018-11-23 12:01:00,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {12056#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12056#true} is VALID [2018-11-23 12:01:00,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {12056#true} assume true; {12056#true} is VALID [2018-11-23 12:01:00,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12056#true} {12056#true} #77#return; {12056#true} is VALID [2018-11-23 12:01:00,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {12056#true} call #t~ret9 := main(); {12056#true} is VALID [2018-11-23 12:01:00,927 INFO L273 TraceCheckUtils]: 5: Hoare triple {12056#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12097#(<= main_~a~0 0)} is VALID [2018-11-23 12:01:00,927 INFO L273 TraceCheckUtils]: 6: Hoare triple {12097#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12097#(<= main_~a~0 0)} is VALID [2018-11-23 12:01:00,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {12097#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12059#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:00,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {12059#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12059#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:00,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {12059#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12060#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:00,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {12060#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12060#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:00,934 INFO L273 TraceCheckUtils]: 11: Hoare triple {12060#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12061#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:00,934 INFO L273 TraceCheckUtils]: 12: Hoare triple {12061#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12061#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:00,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {12061#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12062#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:00,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {12062#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12062#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:00,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {12062#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12063#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:00,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {12063#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12063#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:00,941 INFO L273 TraceCheckUtils]: 17: Hoare triple {12063#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12064#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:00,941 INFO L273 TraceCheckUtils]: 18: Hoare triple {12064#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12064#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:00,942 INFO L273 TraceCheckUtils]: 19: Hoare triple {12064#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12065#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:00,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {12065#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12065#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:00,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {12065#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12066#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:00,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {12066#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12066#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:00,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {12066#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12067#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:00,944 INFO L273 TraceCheckUtils]: 24: Hoare triple {12067#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12067#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:00,944 INFO L273 TraceCheckUtils]: 25: Hoare triple {12067#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12068#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:00,945 INFO L273 TraceCheckUtils]: 26: Hoare triple {12068#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12068#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:00,946 INFO L273 TraceCheckUtils]: 27: Hoare triple {12068#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12069#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:00,946 INFO L273 TraceCheckUtils]: 28: Hoare triple {12069#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12069#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:00,947 INFO L273 TraceCheckUtils]: 29: Hoare triple {12069#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12070#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:00,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {12070#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12070#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:00,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {12070#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12071#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:00,949 INFO L273 TraceCheckUtils]: 32: Hoare triple {12071#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12071#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:00,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {12071#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12072#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:00,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {12072#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12072#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:00,951 INFO L273 TraceCheckUtils]: 35: Hoare triple {12072#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12073#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:00,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {12073#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12073#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:00,952 INFO L273 TraceCheckUtils]: 37: Hoare triple {12073#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12074#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:00,952 INFO L273 TraceCheckUtils]: 38: Hoare triple {12074#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12074#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:00,953 INFO L273 TraceCheckUtils]: 39: Hoare triple {12074#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12075#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:00,954 INFO L273 TraceCheckUtils]: 40: Hoare triple {12075#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12075#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:00,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {12075#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12076#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:00,955 INFO L273 TraceCheckUtils]: 42: Hoare triple {12076#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12076#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:00,956 INFO L273 TraceCheckUtils]: 43: Hoare triple {12076#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12077#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:00,956 INFO L273 TraceCheckUtils]: 44: Hoare triple {12077#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12077#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:00,957 INFO L273 TraceCheckUtils]: 45: Hoare triple {12077#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12078#(<= main_~a~0 20)} is VALID [2018-11-23 12:01:00,958 INFO L273 TraceCheckUtils]: 46: Hoare triple {12078#(<= main_~a~0 20)} assume !(~a~0 < 100000); {12057#false} is VALID [2018-11-23 12:01:00,958 INFO L273 TraceCheckUtils]: 47: Hoare triple {12057#false} havoc ~i~0;~i~0 := 0; {12057#false} is VALID [2018-11-23 12:01:00,958 INFO L273 TraceCheckUtils]: 48: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,958 INFO L273 TraceCheckUtils]: 49: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,959 INFO L273 TraceCheckUtils]: 50: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,959 INFO L273 TraceCheckUtils]: 51: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,959 INFO L273 TraceCheckUtils]: 52: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,959 INFO L273 TraceCheckUtils]: 53: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,959 INFO L273 TraceCheckUtils]: 54: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,960 INFO L273 TraceCheckUtils]: 55: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,960 INFO L273 TraceCheckUtils]: 56: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,960 INFO L273 TraceCheckUtils]: 57: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,960 INFO L273 TraceCheckUtils]: 58: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,960 INFO L273 TraceCheckUtils]: 59: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,961 INFO L273 TraceCheckUtils]: 60: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,961 INFO L273 TraceCheckUtils]: 61: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,961 INFO L273 TraceCheckUtils]: 62: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,961 INFO L273 TraceCheckUtils]: 63: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,961 INFO L273 TraceCheckUtils]: 64: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,961 INFO L273 TraceCheckUtils]: 65: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,961 INFO L273 TraceCheckUtils]: 66: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,961 INFO L273 TraceCheckUtils]: 67: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,961 INFO L273 TraceCheckUtils]: 68: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12057#false} is VALID [2018-11-23 12:01:00,962 INFO L273 TraceCheckUtils]: 69: Hoare triple {12057#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12057#false} is VALID [2018-11-23 12:01:00,962 INFO L273 TraceCheckUtils]: 70: Hoare triple {12057#false} assume !(~i~0 < 100000); {12057#false} is VALID [2018-11-23 12:01:00,962 INFO L273 TraceCheckUtils]: 71: Hoare triple {12057#false} ~i~0 := 0; {12057#false} is VALID [2018-11-23 12:01:00,962 INFO L273 TraceCheckUtils]: 72: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,962 INFO L273 TraceCheckUtils]: 73: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,962 INFO L273 TraceCheckUtils]: 74: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,962 INFO L273 TraceCheckUtils]: 75: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,962 INFO L273 TraceCheckUtils]: 76: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,962 INFO L273 TraceCheckUtils]: 77: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,963 INFO L273 TraceCheckUtils]: 78: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,963 INFO L273 TraceCheckUtils]: 79: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,963 INFO L273 TraceCheckUtils]: 80: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,963 INFO L273 TraceCheckUtils]: 81: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,963 INFO L273 TraceCheckUtils]: 82: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,963 INFO L273 TraceCheckUtils]: 83: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,963 INFO L273 TraceCheckUtils]: 84: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,963 INFO L273 TraceCheckUtils]: 85: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,963 INFO L273 TraceCheckUtils]: 86: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,964 INFO L273 TraceCheckUtils]: 87: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,964 INFO L273 TraceCheckUtils]: 88: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,964 INFO L273 TraceCheckUtils]: 89: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,964 INFO L273 TraceCheckUtils]: 90: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,964 INFO L273 TraceCheckUtils]: 91: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,964 INFO L273 TraceCheckUtils]: 92: Hoare triple {12057#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {12057#false} is VALID [2018-11-23 12:01:00,964 INFO L273 TraceCheckUtils]: 93: Hoare triple {12057#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12057#false} is VALID [2018-11-23 12:01:00,964 INFO L273 TraceCheckUtils]: 94: Hoare triple {12057#false} assume !(~i~0 < 100000); {12057#false} is VALID [2018-11-23 12:01:00,964 INFO L273 TraceCheckUtils]: 95: Hoare triple {12057#false} havoc ~x~0;~x~0 := 0; {12057#false} is VALID [2018-11-23 12:01:00,965 INFO L273 TraceCheckUtils]: 96: Hoare triple {12057#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {12057#false} is VALID [2018-11-23 12:01:00,965 INFO L256 TraceCheckUtils]: 97: Hoare triple {12057#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {12057#false} is VALID [2018-11-23 12:01:00,965 INFO L273 TraceCheckUtils]: 98: Hoare triple {12057#false} ~cond := #in~cond; {12057#false} is VALID [2018-11-23 12:01:00,965 INFO L273 TraceCheckUtils]: 99: Hoare triple {12057#false} assume 0 == ~cond; {12057#false} is VALID [2018-11-23 12:01:00,965 INFO L273 TraceCheckUtils]: 100: Hoare triple {12057#false} assume !false; {12057#false} is VALID [2018-11-23 12:01:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 12:01:00,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:00,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:01:00,991 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 101 [2018-11-23 12:01:00,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:00,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:01:01,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:01,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:01:01,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:01:01,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:01:01,074 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand 24 states. [2018-11-23 12:01:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:01,499 INFO L93 Difference]: Finished difference Result 168 states and 174 transitions. [2018-11-23 12:01:01,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:01:01,500 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 101 [2018-11-23 12:01:01,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:01:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 90 transitions. [2018-11-23 12:01:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:01:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 90 transitions. [2018-11-23 12:01:01,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 90 transitions. [2018-11-23 12:01:01,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:01,590 INFO L225 Difference]: With dead ends: 168 [2018-11-23 12:01:01,590 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 12:01:01,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:01:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 12:01:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-11-23 12:01:01,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:01,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 108 states. [2018-11-23 12:01:01,687 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 108 states. [2018-11-23 12:01:01,687 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 108 states. [2018-11-23 12:01:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:01,689 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-11-23 12:01:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2018-11-23 12:01:01,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:01,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:01,690 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 109 states. [2018-11-23 12:01:01,690 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 109 states. [2018-11-23 12:01:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:01,692 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-11-23 12:01:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2018-11-23 12:01:01,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:01,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:01,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:01,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 12:01:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-11-23 12:01:01,695 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 101 [2018-11-23 12:01:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:01,695 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-11-23 12:01:01,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:01:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-11-23 12:01:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 12:01:01,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:01,696 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:01,697 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:01,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:01,697 INFO L82 PathProgramCache]: Analyzing trace with hash 172203876, now seen corresponding path program 21 times [2018-11-23 12:01:01,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:01,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:01,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:01,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:01,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:02,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {13009#true} call ULTIMATE.init(); {13009#true} is VALID [2018-11-23 12:01:02,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {13009#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13009#true} is VALID [2018-11-23 12:01:02,183 INFO L273 TraceCheckUtils]: 2: Hoare triple {13009#true} assume true; {13009#true} is VALID [2018-11-23 12:01:02,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13009#true} {13009#true} #77#return; {13009#true} is VALID [2018-11-23 12:01:02,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {13009#true} call #t~ret9 := main(); {13009#true} is VALID [2018-11-23 12:01:02,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {13009#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13011#(= main_~a~0 0)} is VALID [2018-11-23 12:01:02,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {13011#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13011#(= main_~a~0 0)} is VALID [2018-11-23 12:01:02,184 INFO L273 TraceCheckUtils]: 7: Hoare triple {13011#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13012#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:02,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {13012#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13012#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:02,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {13012#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13013#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:02,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {13013#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13013#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:02,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {13013#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13014#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:02,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {13014#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13014#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:02,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {13014#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13015#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:02,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {13015#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13015#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:02,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {13015#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13016#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:02,188 INFO L273 TraceCheckUtils]: 16: Hoare triple {13016#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13016#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:02,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {13016#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13017#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:02,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {13017#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13017#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:02,190 INFO L273 TraceCheckUtils]: 19: Hoare triple {13017#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13018#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:02,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {13018#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13018#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:02,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {13018#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13019#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:02,192 INFO L273 TraceCheckUtils]: 22: Hoare triple {13019#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13019#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:02,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {13019#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:02,193 INFO L273 TraceCheckUtils]: 24: Hoare triple {13020#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13020#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:02,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {13020#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13021#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:02,195 INFO L273 TraceCheckUtils]: 26: Hoare triple {13021#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13021#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:02,195 INFO L273 TraceCheckUtils]: 27: Hoare triple {13021#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13022#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:02,196 INFO L273 TraceCheckUtils]: 28: Hoare triple {13022#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13022#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:02,197 INFO L273 TraceCheckUtils]: 29: Hoare triple {13022#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13023#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:02,197 INFO L273 TraceCheckUtils]: 30: Hoare triple {13023#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13023#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:02,198 INFO L273 TraceCheckUtils]: 31: Hoare triple {13023#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13024#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:02,199 INFO L273 TraceCheckUtils]: 32: Hoare triple {13024#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13024#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:02,199 INFO L273 TraceCheckUtils]: 33: Hoare triple {13024#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13025#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:02,200 INFO L273 TraceCheckUtils]: 34: Hoare triple {13025#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13025#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:02,201 INFO L273 TraceCheckUtils]: 35: Hoare triple {13025#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13026#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:02,201 INFO L273 TraceCheckUtils]: 36: Hoare triple {13026#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13026#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:02,202 INFO L273 TraceCheckUtils]: 37: Hoare triple {13026#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:02,202 INFO L273 TraceCheckUtils]: 38: Hoare triple {13027#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13027#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:02,203 INFO L273 TraceCheckUtils]: 39: Hoare triple {13027#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13028#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:02,204 INFO L273 TraceCheckUtils]: 40: Hoare triple {13028#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13028#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:02,204 INFO L273 TraceCheckUtils]: 41: Hoare triple {13028#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13029#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:02,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {13029#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13029#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:02,206 INFO L273 TraceCheckUtils]: 43: Hoare triple {13029#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13030#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:02,206 INFO L273 TraceCheckUtils]: 44: Hoare triple {13030#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13030#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:02,207 INFO L273 TraceCheckUtils]: 45: Hoare triple {13030#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13031#(<= main_~a~0 20)} is VALID [2018-11-23 12:01:02,208 INFO L273 TraceCheckUtils]: 46: Hoare triple {13031#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13031#(<= main_~a~0 20)} is VALID [2018-11-23 12:01:02,208 INFO L273 TraceCheckUtils]: 47: Hoare triple {13031#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13032#(<= main_~a~0 21)} is VALID [2018-11-23 12:01:02,209 INFO L273 TraceCheckUtils]: 48: Hoare triple {13032#(<= main_~a~0 21)} assume !(~a~0 < 100000); {13010#false} is VALID [2018-11-23 12:01:02,209 INFO L273 TraceCheckUtils]: 49: Hoare triple {13010#false} havoc ~i~0;~i~0 := 0; {13010#false} is VALID [2018-11-23 12:01:02,209 INFO L273 TraceCheckUtils]: 50: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13010#false} is VALID [2018-11-23 12:01:02,210 INFO L273 TraceCheckUtils]: 51: Hoare triple {13010#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13010#false} is VALID [2018-11-23 12:01:02,210 INFO L273 TraceCheckUtils]: 52: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13010#false} is VALID [2018-11-23 12:01:02,210 INFO L273 TraceCheckUtils]: 53: Hoare triple {13010#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13010#false} is VALID [2018-11-23 12:01:02,210 INFO L273 TraceCheckUtils]: 54: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13010#false} is VALID [2018-11-23 12:01:02,210 INFO L273 TraceCheckUtils]: 55: Hoare triple {13010#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13010#false} is VALID [2018-11-23 12:01:02,211 INFO L273 TraceCheckUtils]: 56: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13010#false} is VALID [2018-11-23 12:01:02,211 INFO L273 TraceCheckUtils]: 57: Hoare triple {13010#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13010#false} is VALID [2018-11-23 12:01:02,211 INFO L273 TraceCheckUtils]: 58: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13010#false} is VALID [2018-11-23 12:01:02,211 INFO L273 TraceCheckUtils]: 59: Hoare triple {13010#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13010#false} is VALID [2018-11-23 12:01:02,211 INFO L273 TraceCheckUtils]: 60: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13010#false} is VALID [2018-11-23 12:01:02,212 INFO L273 TraceCheckUtils]: 61: Hoare triple {13010#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13010#false} is VALID [2018-11-23 12:01:02,212 INFO L273 TraceCheckUtils]: 62: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13010#false} is VALID [2018-11-23 12:01:02,212 INFO L273 TraceCheckUtils]: 63: Hoare triple {13010#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13010#false} is VALID [2018-11-23 12:01:02,212 INFO L273 TraceCheckUtils]: 64: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13010#false} is VALID [2018-11-23 12:01:02,212 INFO L273 TraceCheckUtils]: 65: Hoare triple {13010#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13010#false} is VALID [2018-11-23 12:01:02,213 INFO L273 TraceCheckUtils]: 66: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13010#false} is VALID [2018-11-23 12:01:02,213 INFO L273 TraceCheckUtils]: 67: Hoare triple {13010#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13010#false} is VALID [2018-11-23 12:01:02,213 INFO L273 TraceCheckUtils]: 68: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13010#false} is VALID [2018-11-23 12:01:02,213 INFO L273 TraceCheckUtils]: 69: Hoare triple {13010#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13010#false} is VALID [2018-11-23 12:01:02,213 INFO L273 TraceCheckUtils]: 70: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13010#false} is VALID [2018-11-23 12:01:02,213 INFO L273 TraceCheckUtils]: 71: Hoare triple {13010#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13010#false} is VALID [2018-11-23 12:01:02,213 INFO L273 TraceCheckUtils]: 72: Hoare triple {13010#false} assume !(~i~0 < 100000); {13010#false} is VALID [2018-11-23 12:01:02,214 INFO L273 TraceCheckUtils]: 73: Hoare triple {13010#false} ~i~0 := 0; {13010#false} is VALID [2018-11-23 12:01:02,214 INFO L273 TraceCheckUtils]: 74: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13010#false} is VALID [2018-11-23 12:01:02,214 INFO L273 TraceCheckUtils]: 75: Hoare triple {13010#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13010#false} is VALID [2018-11-23 12:01:02,214 INFO L273 TraceCheckUtils]: 76: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13010#false} is VALID [2018-11-23 12:01:02,214 INFO L273 TraceCheckUtils]: 77: Hoare triple {13010#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13010#false} is VALID [2018-11-23 12:01:02,215 INFO L273 TraceCheckUtils]: 78: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13010#false} is VALID [2018-11-23 12:01:02,215 INFO L273 TraceCheckUtils]: 79: Hoare triple {13010#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13010#false} is VALID [2018-11-23 12:01:02,215 INFO L273 TraceCheckUtils]: 80: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13010#false} is VALID [2018-11-23 12:01:02,215 INFO L273 TraceCheckUtils]: 81: Hoare triple {13010#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13010#false} is VALID [2018-11-23 12:01:02,215 INFO L273 TraceCheckUtils]: 82: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13010#false} is VALID [2018-11-23 12:01:02,215 INFO L273 TraceCheckUtils]: 83: Hoare triple {13010#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13010#false} is VALID [2018-11-23 12:01:02,215 INFO L273 TraceCheckUtils]: 84: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13010#false} is VALID [2018-11-23 12:01:02,216 INFO L273 TraceCheckUtils]: 85: Hoare triple {13010#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13010#false} is VALID [2018-11-23 12:01:02,216 INFO L273 TraceCheckUtils]: 86: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13010#false} is VALID [2018-11-23 12:01:02,216 INFO L273 TraceCheckUtils]: 87: Hoare triple {13010#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13010#false} is VALID [2018-11-23 12:01:02,216 INFO L273 TraceCheckUtils]: 88: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13010#false} is VALID [2018-11-23 12:01:02,216 INFO L273 TraceCheckUtils]: 89: Hoare triple {13010#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13010#false} is VALID [2018-11-23 12:01:02,216 INFO L273 TraceCheckUtils]: 90: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13010#false} is VALID [2018-11-23 12:01:02,217 INFO L273 TraceCheckUtils]: 91: Hoare triple {13010#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13010#false} is VALID [2018-11-23 12:01:02,217 INFO L273 TraceCheckUtils]: 92: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13010#false} is VALID [2018-11-23 12:01:02,217 INFO L273 TraceCheckUtils]: 93: Hoare triple {13010#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13010#false} is VALID [2018-11-23 12:01:02,217 INFO L273 TraceCheckUtils]: 94: Hoare triple {13010#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13010#false} is VALID [2018-11-23 12:01:02,217 INFO L273 TraceCheckUtils]: 95: Hoare triple {13010#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13010#false} is VALID [2018-11-23 12:01:02,217 INFO L273 TraceCheckUtils]: 96: Hoare triple {13010#false} assume !(~i~0 < 100000); {13010#false} is VALID [2018-11-23 12:01:02,218 INFO L273 TraceCheckUtils]: 97: Hoare triple {13010#false} havoc ~x~0;~x~0 := 0; {13010#false} is VALID [2018-11-23 12:01:02,218 INFO L273 TraceCheckUtils]: 98: Hoare triple {13010#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {13010#false} is VALID [2018-11-23 12:01:02,218 INFO L256 TraceCheckUtils]: 99: Hoare triple {13010#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {13010#false} is VALID [2018-11-23 12:01:02,218 INFO L273 TraceCheckUtils]: 100: Hoare triple {13010#false} ~cond := #in~cond; {13010#false} is VALID [2018-11-23 12:01:02,218 INFO L273 TraceCheckUtils]: 101: Hoare triple {13010#false} assume 0 == ~cond; {13010#false} is VALID [2018-11-23 12:01:02,218 INFO L273 TraceCheckUtils]: 102: Hoare triple {13010#false} assume !false; {13010#false} is VALID [2018-11-23 12:01:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 12:01:02,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:02,226 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:01:02,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:01:08,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:01:08,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:08,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:09,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {13009#true} call ULTIMATE.init(); {13009#true} is VALID [2018-11-23 12:01:09,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {13009#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13009#true} is VALID [2018-11-23 12:01:09,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {13009#true} assume true; {13009#true} is VALID [2018-11-23 12:01:09,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13009#true} {13009#true} #77#return; {13009#true} is VALID [2018-11-23 12:01:09,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {13009#true} call #t~ret9 := main(); {13009#true} is VALID [2018-11-23 12:01:09,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {13009#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13009#true} is VALID [2018-11-23 12:01:09,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,157 INFO L273 TraceCheckUtils]: 13: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,158 INFO L273 TraceCheckUtils]: 14: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,158 INFO L273 TraceCheckUtils]: 16: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,159 INFO L273 TraceCheckUtils]: 25: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,159 INFO L273 TraceCheckUtils]: 27: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,159 INFO L273 TraceCheckUtils]: 28: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,159 INFO L273 TraceCheckUtils]: 29: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,160 INFO L273 TraceCheckUtils]: 30: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,160 INFO L273 TraceCheckUtils]: 31: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,160 INFO L273 TraceCheckUtils]: 32: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,160 INFO L273 TraceCheckUtils]: 33: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,160 INFO L273 TraceCheckUtils]: 34: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,160 INFO L273 TraceCheckUtils]: 35: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,160 INFO L273 TraceCheckUtils]: 36: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,160 INFO L273 TraceCheckUtils]: 37: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,160 INFO L273 TraceCheckUtils]: 38: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,161 INFO L273 TraceCheckUtils]: 39: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,161 INFO L273 TraceCheckUtils]: 40: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,161 INFO L273 TraceCheckUtils]: 41: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,161 INFO L273 TraceCheckUtils]: 42: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,161 INFO L273 TraceCheckUtils]: 43: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,161 INFO L273 TraceCheckUtils]: 44: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,161 INFO L273 TraceCheckUtils]: 45: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,161 INFO L273 TraceCheckUtils]: 46: Hoare triple {13009#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13009#true} is VALID [2018-11-23 12:01:09,161 INFO L273 TraceCheckUtils]: 47: Hoare triple {13009#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13009#true} is VALID [2018-11-23 12:01:09,162 INFO L273 TraceCheckUtils]: 48: Hoare triple {13009#true} assume !(~a~0 < 100000); {13009#true} is VALID [2018-11-23 12:01:09,162 INFO L273 TraceCheckUtils]: 49: Hoare triple {13009#true} havoc ~i~0;~i~0 := 0; {13009#true} is VALID [2018-11-23 12:01:09,162 INFO L273 TraceCheckUtils]: 50: Hoare triple {13009#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13009#true} is VALID [2018-11-23 12:01:09,162 INFO L273 TraceCheckUtils]: 51: Hoare triple {13009#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13009#true} is VALID [2018-11-23 12:01:09,162 INFO L273 TraceCheckUtils]: 52: Hoare triple {13009#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13009#true} is VALID [2018-11-23 12:01:09,162 INFO L273 TraceCheckUtils]: 53: Hoare triple {13009#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13009#true} is VALID [2018-11-23 12:01:09,162 INFO L273 TraceCheckUtils]: 54: Hoare triple {13009#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13009#true} is VALID [2018-11-23 12:01:09,162 INFO L273 TraceCheckUtils]: 55: Hoare triple {13009#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13009#true} is VALID [2018-11-23 12:01:09,163 INFO L273 TraceCheckUtils]: 56: Hoare triple {13009#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13009#true} is VALID [2018-11-23 12:01:09,163 INFO L273 TraceCheckUtils]: 57: Hoare triple {13009#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13009#true} is VALID [2018-11-23 12:01:09,163 INFO L273 TraceCheckUtils]: 58: Hoare triple {13009#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13009#true} is VALID [2018-11-23 12:01:09,163 INFO L273 TraceCheckUtils]: 59: Hoare triple {13009#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13009#true} is VALID [2018-11-23 12:01:09,163 INFO L273 TraceCheckUtils]: 60: Hoare triple {13009#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13009#true} is VALID [2018-11-23 12:01:09,163 INFO L273 TraceCheckUtils]: 61: Hoare triple {13009#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13009#true} is VALID [2018-11-23 12:01:09,163 INFO L273 TraceCheckUtils]: 62: Hoare triple {13009#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13009#true} is VALID [2018-11-23 12:01:09,163 INFO L273 TraceCheckUtils]: 63: Hoare triple {13009#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13009#true} is VALID [2018-11-23 12:01:09,163 INFO L273 TraceCheckUtils]: 64: Hoare triple {13009#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13009#true} is VALID [2018-11-23 12:01:09,164 INFO L273 TraceCheckUtils]: 65: Hoare triple {13009#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13009#true} is VALID [2018-11-23 12:01:09,164 INFO L273 TraceCheckUtils]: 66: Hoare triple {13009#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13009#true} is VALID [2018-11-23 12:01:09,164 INFO L273 TraceCheckUtils]: 67: Hoare triple {13009#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13009#true} is VALID [2018-11-23 12:01:09,164 INFO L273 TraceCheckUtils]: 68: Hoare triple {13009#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13009#true} is VALID [2018-11-23 12:01:09,164 INFO L273 TraceCheckUtils]: 69: Hoare triple {13009#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13009#true} is VALID [2018-11-23 12:01:09,164 INFO L273 TraceCheckUtils]: 70: Hoare triple {13009#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13009#true} is VALID [2018-11-23 12:01:09,164 INFO L273 TraceCheckUtils]: 71: Hoare triple {13009#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13009#true} is VALID [2018-11-23 12:01:09,164 INFO L273 TraceCheckUtils]: 72: Hoare triple {13009#true} assume !(~i~0 < 100000); {13009#true} is VALID [2018-11-23 12:01:09,165 INFO L273 TraceCheckUtils]: 73: Hoare triple {13009#true} ~i~0 := 0; {13255#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:09,165 INFO L273 TraceCheckUtils]: 74: Hoare triple {13255#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13255#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:09,166 INFO L273 TraceCheckUtils]: 75: Hoare triple {13255#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13262#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:09,166 INFO L273 TraceCheckUtils]: 76: Hoare triple {13262#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13262#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:09,166 INFO L273 TraceCheckUtils]: 77: Hoare triple {13262#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13269#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:09,167 INFO L273 TraceCheckUtils]: 78: Hoare triple {13269#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13269#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:09,167 INFO L273 TraceCheckUtils]: 79: Hoare triple {13269#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13276#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:09,168 INFO L273 TraceCheckUtils]: 80: Hoare triple {13276#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13276#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:09,168 INFO L273 TraceCheckUtils]: 81: Hoare triple {13276#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13283#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:09,169 INFO L273 TraceCheckUtils]: 82: Hoare triple {13283#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13283#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:09,169 INFO L273 TraceCheckUtils]: 83: Hoare triple {13283#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13290#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:09,172 INFO L273 TraceCheckUtils]: 84: Hoare triple {13290#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13290#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:09,173 INFO L273 TraceCheckUtils]: 85: Hoare triple {13290#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13297#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:09,175 INFO L273 TraceCheckUtils]: 86: Hoare triple {13297#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13297#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:09,175 INFO L273 TraceCheckUtils]: 87: Hoare triple {13297#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13304#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:09,175 INFO L273 TraceCheckUtils]: 88: Hoare triple {13304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13304#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:09,176 INFO L273 TraceCheckUtils]: 89: Hoare triple {13304#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13311#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:09,176 INFO L273 TraceCheckUtils]: 90: Hoare triple {13311#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13311#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:09,178 INFO L273 TraceCheckUtils]: 91: Hoare triple {13311#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13318#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:09,179 INFO L273 TraceCheckUtils]: 92: Hoare triple {13318#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13318#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:09,180 INFO L273 TraceCheckUtils]: 93: Hoare triple {13318#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13325#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:09,180 INFO L273 TraceCheckUtils]: 94: Hoare triple {13325#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13325#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:09,181 INFO L273 TraceCheckUtils]: 95: Hoare triple {13325#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13332#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:09,181 INFO L273 TraceCheckUtils]: 96: Hoare triple {13332#(<= main_~i~0 11)} assume !(~i~0 < 100000); {13010#false} is VALID [2018-11-23 12:01:09,182 INFO L273 TraceCheckUtils]: 97: Hoare triple {13010#false} havoc ~x~0;~x~0 := 0; {13010#false} is VALID [2018-11-23 12:01:09,182 INFO L273 TraceCheckUtils]: 98: Hoare triple {13010#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {13010#false} is VALID [2018-11-23 12:01:09,182 INFO L256 TraceCheckUtils]: 99: Hoare triple {13010#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {13010#false} is VALID [2018-11-23 12:01:09,182 INFO L273 TraceCheckUtils]: 100: Hoare triple {13010#false} ~cond := #in~cond; {13010#false} is VALID [2018-11-23 12:01:09,182 INFO L273 TraceCheckUtils]: 101: Hoare triple {13010#false} assume 0 == ~cond; {13010#false} is VALID [2018-11-23 12:01:09,182 INFO L273 TraceCheckUtils]: 102: Hoare triple {13010#false} assume !false; {13010#false} is VALID [2018-11-23 12:01:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-11-23 12:01:09,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:09,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14] total 36 [2018-11-23 12:01:09,214 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2018-11-23 12:01:09,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:09,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:01:09,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:09,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:01:09,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:01:09,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=894, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:01:09,331 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 36 states. [2018-11-23 12:01:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:10,588 INFO L93 Difference]: Finished difference Result 176 states and 184 transitions. [2018-11-23 12:01:10,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:01:10,588 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2018-11-23 12:01:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:01:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 142 transitions. [2018-11-23 12:01:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:01:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 142 transitions. [2018-11-23 12:01:10,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 142 transitions. [2018-11-23 12:01:10,740 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:01:10,743 INFO L225 Difference]: With dead ends: 176 [2018-11-23 12:01:10,743 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:01:10,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=366, Invalid=894, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:01:10,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:01:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2018-11-23 12:01:10,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:10,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 114 states. [2018-11-23 12:01:10,887 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 114 states. [2018-11-23 12:01:10,887 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 114 states. [2018-11-23 12:01:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:10,889 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-11-23 12:01:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2018-11-23 12:01:10,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:10,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:10,890 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 117 states. [2018-11-23 12:01:10,890 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 117 states. [2018-11-23 12:01:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:10,892 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-11-23 12:01:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2018-11-23 12:01:10,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:10,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:10,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:10,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 12:01:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-11-23 12:01:10,894 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 103 [2018-11-23 12:01:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:10,894 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-11-23 12:01:10,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:01:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-23 12:01:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 12:01:10,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:10,895 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:10,895 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:10,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:10,895 INFO L82 PathProgramCache]: Analyzing trace with hash -544161282, now seen corresponding path program 22 times [2018-11-23 12:01:10,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:10,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:10,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:10,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:10,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:11,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {14016#true} call ULTIMATE.init(); {14016#true} is VALID [2018-11-23 12:01:11,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {14016#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14016#true} is VALID [2018-11-23 12:01:11,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {14016#true} assume true; {14016#true} is VALID [2018-11-23 12:01:11,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14016#true} {14016#true} #77#return; {14016#true} is VALID [2018-11-23 12:01:11,592 INFO L256 TraceCheckUtils]: 4: Hoare triple {14016#true} call #t~ret9 := main(); {14016#true} is VALID [2018-11-23 12:01:11,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {14016#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14018#(= main_~a~0 0)} is VALID [2018-11-23 12:01:11,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {14018#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14018#(= main_~a~0 0)} is VALID [2018-11-23 12:01:11,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {14018#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14019#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:11,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {14019#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14019#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:11,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {14019#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14020#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:11,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {14020#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14020#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:11,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {14020#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14021#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:11,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {14021#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14021#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:11,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {14021#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14022#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:11,600 INFO L273 TraceCheckUtils]: 14: Hoare triple {14022#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14022#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:11,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {14022#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14023#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:11,601 INFO L273 TraceCheckUtils]: 16: Hoare triple {14023#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14023#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:11,601 INFO L273 TraceCheckUtils]: 17: Hoare triple {14023#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14024#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:11,602 INFO L273 TraceCheckUtils]: 18: Hoare triple {14024#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14024#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:11,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {14024#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14025#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:11,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {14025#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14025#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:11,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {14025#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14026#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:11,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {14026#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14026#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:11,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {14026#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14027#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:11,606 INFO L273 TraceCheckUtils]: 24: Hoare triple {14027#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14027#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:11,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {14027#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14028#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:11,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {14028#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14028#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:11,608 INFO L273 TraceCheckUtils]: 27: Hoare triple {14028#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14029#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:11,608 INFO L273 TraceCheckUtils]: 28: Hoare triple {14029#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14029#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:11,609 INFO L273 TraceCheckUtils]: 29: Hoare triple {14029#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14030#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:11,609 INFO L273 TraceCheckUtils]: 30: Hoare triple {14030#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14030#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:11,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {14030#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14031#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:11,611 INFO L273 TraceCheckUtils]: 32: Hoare triple {14031#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14031#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:11,611 INFO L273 TraceCheckUtils]: 33: Hoare triple {14031#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14032#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:11,612 INFO L273 TraceCheckUtils]: 34: Hoare triple {14032#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14032#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:11,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {14032#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14033#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:11,613 INFO L273 TraceCheckUtils]: 36: Hoare triple {14033#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14033#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:11,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {14033#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14034#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:11,615 INFO L273 TraceCheckUtils]: 38: Hoare triple {14034#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14034#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:11,615 INFO L273 TraceCheckUtils]: 39: Hoare triple {14034#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14035#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:11,616 INFO L273 TraceCheckUtils]: 40: Hoare triple {14035#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14035#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:11,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {14035#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14036#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:11,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {14036#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14036#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:11,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {14036#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14037#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:11,618 INFO L273 TraceCheckUtils]: 44: Hoare triple {14037#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14037#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:11,619 INFO L273 TraceCheckUtils]: 45: Hoare triple {14037#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14038#(<= main_~a~0 20)} is VALID [2018-11-23 12:01:11,620 INFO L273 TraceCheckUtils]: 46: Hoare triple {14038#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14038#(<= main_~a~0 20)} is VALID [2018-11-23 12:01:11,620 INFO L273 TraceCheckUtils]: 47: Hoare triple {14038#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14039#(<= main_~a~0 21)} is VALID [2018-11-23 12:01:11,621 INFO L273 TraceCheckUtils]: 48: Hoare triple {14039#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14039#(<= main_~a~0 21)} is VALID [2018-11-23 12:01:11,622 INFO L273 TraceCheckUtils]: 49: Hoare triple {14039#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14040#(<= main_~a~0 22)} is VALID [2018-11-23 12:01:11,622 INFO L273 TraceCheckUtils]: 50: Hoare triple {14040#(<= main_~a~0 22)} assume !(~a~0 < 100000); {14017#false} is VALID [2018-11-23 12:01:11,623 INFO L273 TraceCheckUtils]: 51: Hoare triple {14017#false} havoc ~i~0;~i~0 := 0; {14017#false} is VALID [2018-11-23 12:01:11,623 INFO L273 TraceCheckUtils]: 52: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,623 INFO L273 TraceCheckUtils]: 53: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,623 INFO L273 TraceCheckUtils]: 54: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,623 INFO L273 TraceCheckUtils]: 55: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,624 INFO L273 TraceCheckUtils]: 56: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,624 INFO L273 TraceCheckUtils]: 57: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,624 INFO L273 TraceCheckUtils]: 58: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,624 INFO L273 TraceCheckUtils]: 59: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,624 INFO L273 TraceCheckUtils]: 60: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,625 INFO L273 TraceCheckUtils]: 61: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,625 INFO L273 TraceCheckUtils]: 62: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,625 INFO L273 TraceCheckUtils]: 63: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,625 INFO L273 TraceCheckUtils]: 64: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,625 INFO L273 TraceCheckUtils]: 65: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,625 INFO L273 TraceCheckUtils]: 66: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,625 INFO L273 TraceCheckUtils]: 67: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,625 INFO L273 TraceCheckUtils]: 68: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,625 INFO L273 TraceCheckUtils]: 69: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,626 INFO L273 TraceCheckUtils]: 70: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,626 INFO L273 TraceCheckUtils]: 71: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,626 INFO L273 TraceCheckUtils]: 72: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,626 INFO L273 TraceCheckUtils]: 73: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,626 INFO L273 TraceCheckUtils]: 74: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,626 INFO L273 TraceCheckUtils]: 75: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,626 INFO L273 TraceCheckUtils]: 76: Hoare triple {14017#false} assume !(~i~0 < 100000); {14017#false} is VALID [2018-11-23 12:01:11,626 INFO L273 TraceCheckUtils]: 77: Hoare triple {14017#false} ~i~0 := 0; {14017#false} is VALID [2018-11-23 12:01:11,626 INFO L273 TraceCheckUtils]: 78: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,627 INFO L273 TraceCheckUtils]: 79: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,627 INFO L273 TraceCheckUtils]: 80: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,627 INFO L273 TraceCheckUtils]: 81: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,627 INFO L273 TraceCheckUtils]: 82: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,627 INFO L273 TraceCheckUtils]: 83: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,627 INFO L273 TraceCheckUtils]: 84: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,627 INFO L273 TraceCheckUtils]: 85: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,627 INFO L273 TraceCheckUtils]: 86: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,628 INFO L273 TraceCheckUtils]: 87: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,628 INFO L273 TraceCheckUtils]: 88: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,628 INFO L273 TraceCheckUtils]: 89: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,628 INFO L273 TraceCheckUtils]: 90: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,628 INFO L273 TraceCheckUtils]: 91: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,628 INFO L273 TraceCheckUtils]: 92: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,628 INFO L273 TraceCheckUtils]: 93: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,628 INFO L273 TraceCheckUtils]: 94: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,628 INFO L273 TraceCheckUtils]: 95: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,629 INFO L273 TraceCheckUtils]: 96: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,629 INFO L273 TraceCheckUtils]: 97: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,629 INFO L273 TraceCheckUtils]: 98: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,629 INFO L273 TraceCheckUtils]: 99: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,629 INFO L273 TraceCheckUtils]: 100: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,629 INFO L273 TraceCheckUtils]: 101: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,629 INFO L273 TraceCheckUtils]: 102: Hoare triple {14017#false} assume !(~i~0 < 100000); {14017#false} is VALID [2018-11-23 12:01:11,629 INFO L273 TraceCheckUtils]: 103: Hoare triple {14017#false} havoc ~x~0;~x~0 := 0; {14017#false} is VALID [2018-11-23 12:01:11,629 INFO L273 TraceCheckUtils]: 104: Hoare triple {14017#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {14017#false} is VALID [2018-11-23 12:01:11,630 INFO L256 TraceCheckUtils]: 105: Hoare triple {14017#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {14017#false} is VALID [2018-11-23 12:01:11,630 INFO L273 TraceCheckUtils]: 106: Hoare triple {14017#false} ~cond := #in~cond; {14017#false} is VALID [2018-11-23 12:01:11,630 INFO L273 TraceCheckUtils]: 107: Hoare triple {14017#false} assume 0 == ~cond; {14017#false} is VALID [2018-11-23 12:01:11,630 INFO L273 TraceCheckUtils]: 108: Hoare triple {14017#false} assume !false; {14017#false} is VALID [2018-11-23 12:01:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-23 12:01:11,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:11,636 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:01:11,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:01:11,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:01:11,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:11,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:11,921 INFO L256 TraceCheckUtils]: 0: Hoare triple {14016#true} call ULTIMATE.init(); {14016#true} is VALID [2018-11-23 12:01:11,921 INFO L273 TraceCheckUtils]: 1: Hoare triple {14016#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14016#true} is VALID [2018-11-23 12:01:11,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {14016#true} assume true; {14016#true} is VALID [2018-11-23 12:01:11,922 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14016#true} {14016#true} #77#return; {14016#true} is VALID [2018-11-23 12:01:11,922 INFO L256 TraceCheckUtils]: 4: Hoare triple {14016#true} call #t~ret9 := main(); {14016#true} is VALID [2018-11-23 12:01:11,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {14016#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14059#(<= main_~a~0 0)} is VALID [2018-11-23 12:01:11,924 INFO L273 TraceCheckUtils]: 6: Hoare triple {14059#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14059#(<= main_~a~0 0)} is VALID [2018-11-23 12:01:11,924 INFO L273 TraceCheckUtils]: 7: Hoare triple {14059#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14019#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:11,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {14019#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14019#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:11,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {14019#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14020#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:11,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {14020#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14020#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:11,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {14020#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14021#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:11,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {14021#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14021#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:11,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {14021#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14022#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:11,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {14022#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14022#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:11,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {14022#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14023#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:11,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {14023#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14023#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:11,929 INFO L273 TraceCheckUtils]: 17: Hoare triple {14023#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14024#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:11,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {14024#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14024#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:11,931 INFO L273 TraceCheckUtils]: 19: Hoare triple {14024#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14025#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:11,931 INFO L273 TraceCheckUtils]: 20: Hoare triple {14025#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14025#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:11,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {14025#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14026#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:11,933 INFO L273 TraceCheckUtils]: 22: Hoare triple {14026#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14026#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:11,933 INFO L273 TraceCheckUtils]: 23: Hoare triple {14026#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14027#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:11,934 INFO L273 TraceCheckUtils]: 24: Hoare triple {14027#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14027#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:11,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {14027#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14028#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:11,935 INFO L273 TraceCheckUtils]: 26: Hoare triple {14028#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14028#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:11,936 INFO L273 TraceCheckUtils]: 27: Hoare triple {14028#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14029#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:11,936 INFO L273 TraceCheckUtils]: 28: Hoare triple {14029#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14029#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:11,937 INFO L273 TraceCheckUtils]: 29: Hoare triple {14029#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14030#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:11,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {14030#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14030#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:11,938 INFO L273 TraceCheckUtils]: 31: Hoare triple {14030#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14031#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:11,939 INFO L273 TraceCheckUtils]: 32: Hoare triple {14031#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14031#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:11,940 INFO L273 TraceCheckUtils]: 33: Hoare triple {14031#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14032#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:11,940 INFO L273 TraceCheckUtils]: 34: Hoare triple {14032#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14032#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:11,941 INFO L273 TraceCheckUtils]: 35: Hoare triple {14032#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14033#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:11,941 INFO L273 TraceCheckUtils]: 36: Hoare triple {14033#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14033#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:11,942 INFO L273 TraceCheckUtils]: 37: Hoare triple {14033#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14034#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:11,943 INFO L273 TraceCheckUtils]: 38: Hoare triple {14034#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14034#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:11,943 INFO L273 TraceCheckUtils]: 39: Hoare triple {14034#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14035#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:11,944 INFO L273 TraceCheckUtils]: 40: Hoare triple {14035#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14035#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:11,945 INFO L273 TraceCheckUtils]: 41: Hoare triple {14035#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14036#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:11,945 INFO L273 TraceCheckUtils]: 42: Hoare triple {14036#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14036#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:11,946 INFO L273 TraceCheckUtils]: 43: Hoare triple {14036#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14037#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:11,947 INFO L273 TraceCheckUtils]: 44: Hoare triple {14037#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14037#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:11,947 INFO L273 TraceCheckUtils]: 45: Hoare triple {14037#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14038#(<= main_~a~0 20)} is VALID [2018-11-23 12:01:11,948 INFO L273 TraceCheckUtils]: 46: Hoare triple {14038#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14038#(<= main_~a~0 20)} is VALID [2018-11-23 12:01:11,949 INFO L273 TraceCheckUtils]: 47: Hoare triple {14038#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14039#(<= main_~a~0 21)} is VALID [2018-11-23 12:01:11,949 INFO L273 TraceCheckUtils]: 48: Hoare triple {14039#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14039#(<= main_~a~0 21)} is VALID [2018-11-23 12:01:11,950 INFO L273 TraceCheckUtils]: 49: Hoare triple {14039#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14040#(<= main_~a~0 22)} is VALID [2018-11-23 12:01:11,951 INFO L273 TraceCheckUtils]: 50: Hoare triple {14040#(<= main_~a~0 22)} assume !(~a~0 < 100000); {14017#false} is VALID [2018-11-23 12:01:11,951 INFO L273 TraceCheckUtils]: 51: Hoare triple {14017#false} havoc ~i~0;~i~0 := 0; {14017#false} is VALID [2018-11-23 12:01:11,951 INFO L273 TraceCheckUtils]: 52: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,951 INFO L273 TraceCheckUtils]: 53: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,951 INFO L273 TraceCheckUtils]: 54: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,952 INFO L273 TraceCheckUtils]: 55: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,952 INFO L273 TraceCheckUtils]: 56: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,952 INFO L273 TraceCheckUtils]: 57: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,952 INFO L273 TraceCheckUtils]: 58: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,952 INFO L273 TraceCheckUtils]: 59: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,953 INFO L273 TraceCheckUtils]: 60: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,953 INFO L273 TraceCheckUtils]: 61: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,953 INFO L273 TraceCheckUtils]: 62: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,953 INFO L273 TraceCheckUtils]: 63: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,953 INFO L273 TraceCheckUtils]: 64: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,953 INFO L273 TraceCheckUtils]: 65: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,953 INFO L273 TraceCheckUtils]: 66: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,954 INFO L273 TraceCheckUtils]: 67: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,954 INFO L273 TraceCheckUtils]: 68: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,954 INFO L273 TraceCheckUtils]: 69: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,954 INFO L273 TraceCheckUtils]: 70: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,954 INFO L273 TraceCheckUtils]: 71: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,954 INFO L273 TraceCheckUtils]: 72: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,954 INFO L273 TraceCheckUtils]: 73: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,954 INFO L273 TraceCheckUtils]: 74: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14017#false} is VALID [2018-11-23 12:01:11,954 INFO L273 TraceCheckUtils]: 75: Hoare triple {14017#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14017#false} is VALID [2018-11-23 12:01:11,955 INFO L273 TraceCheckUtils]: 76: Hoare triple {14017#false} assume !(~i~0 < 100000); {14017#false} is VALID [2018-11-23 12:01:11,955 INFO L273 TraceCheckUtils]: 77: Hoare triple {14017#false} ~i~0 := 0; {14017#false} is VALID [2018-11-23 12:01:11,955 INFO L273 TraceCheckUtils]: 78: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,955 INFO L273 TraceCheckUtils]: 79: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,955 INFO L273 TraceCheckUtils]: 80: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,955 INFO L273 TraceCheckUtils]: 81: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,955 INFO L273 TraceCheckUtils]: 82: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,955 INFO L273 TraceCheckUtils]: 83: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,955 INFO L273 TraceCheckUtils]: 84: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,956 INFO L273 TraceCheckUtils]: 85: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,956 INFO L273 TraceCheckUtils]: 86: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,956 INFO L273 TraceCheckUtils]: 87: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,956 INFO L273 TraceCheckUtils]: 88: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,956 INFO L273 TraceCheckUtils]: 89: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,956 INFO L273 TraceCheckUtils]: 90: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,956 INFO L273 TraceCheckUtils]: 91: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,956 INFO L273 TraceCheckUtils]: 92: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,956 INFO L273 TraceCheckUtils]: 93: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,957 INFO L273 TraceCheckUtils]: 94: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,957 INFO L273 TraceCheckUtils]: 95: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,957 INFO L273 TraceCheckUtils]: 96: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,957 INFO L273 TraceCheckUtils]: 97: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,957 INFO L273 TraceCheckUtils]: 98: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,957 INFO L273 TraceCheckUtils]: 99: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,957 INFO L273 TraceCheckUtils]: 100: Hoare triple {14017#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {14017#false} is VALID [2018-11-23 12:01:11,957 INFO L273 TraceCheckUtils]: 101: Hoare triple {14017#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14017#false} is VALID [2018-11-23 12:01:11,958 INFO L273 TraceCheckUtils]: 102: Hoare triple {14017#false} assume !(~i~0 < 100000); {14017#false} is VALID [2018-11-23 12:01:11,958 INFO L273 TraceCheckUtils]: 103: Hoare triple {14017#false} havoc ~x~0;~x~0 := 0; {14017#false} is VALID [2018-11-23 12:01:11,958 INFO L273 TraceCheckUtils]: 104: Hoare triple {14017#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {14017#false} is VALID [2018-11-23 12:01:11,958 INFO L256 TraceCheckUtils]: 105: Hoare triple {14017#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {14017#false} is VALID [2018-11-23 12:01:11,958 INFO L273 TraceCheckUtils]: 106: Hoare triple {14017#false} ~cond := #in~cond; {14017#false} is VALID [2018-11-23 12:01:11,958 INFO L273 TraceCheckUtils]: 107: Hoare triple {14017#false} assume 0 == ~cond; {14017#false} is VALID [2018-11-23 12:01:11,958 INFO L273 TraceCheckUtils]: 108: Hoare triple {14017#false} assume !false; {14017#false} is VALID [2018-11-23 12:01:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-23 12:01:11,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:11,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:01:11,985 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-11-23 12:01:11,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:11,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:01:12,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:12,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:01:12,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:01:12,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:01:12,054 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 26 states. [2018-11-23 12:01:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:12,785 INFO L93 Difference]: Finished difference Result 180 states and 186 transitions. [2018-11-23 12:01:12,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:01:12,786 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-11-23 12:01:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:01:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 94 transitions. [2018-11-23 12:01:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:01:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 94 transitions. [2018-11-23 12:01:12,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 94 transitions. [2018-11-23 12:01:13,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:13,132 INFO L225 Difference]: With dead ends: 180 [2018-11-23 12:01:13,132 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:01:13,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:01:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:01:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-11-23 12:01:14,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:14,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 116 states. [2018-11-23 12:01:14,368 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 116 states. [2018-11-23 12:01:14,368 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 116 states. [2018-11-23 12:01:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:14,373 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-11-23 12:01:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2018-11-23 12:01:14,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:14,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:14,374 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 117 states. [2018-11-23 12:01:14,374 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 117 states. [2018-11-23 12:01:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:14,376 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-11-23 12:01:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2018-11-23 12:01:14,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:14,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:14,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:14,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 12:01:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-11-23 12:01:14,379 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 109 [2018-11-23 12:01:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:14,380 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-11-23 12:01:14,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:01:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-11-23 12:01:14,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-23 12:01:14,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:14,381 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:14,381 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:14,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:14,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1170090980, now seen corresponding path program 23 times [2018-11-23 12:01:14,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:14,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:14,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:14,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:14,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:15,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {15041#true} call ULTIMATE.init(); {15041#true} is VALID [2018-11-23 12:01:15,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {15041#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15041#true} is VALID [2018-11-23 12:01:15,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {15041#true} assume true; {15041#true} is VALID [2018-11-23 12:01:15,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15041#true} {15041#true} #77#return; {15041#true} is VALID [2018-11-23 12:01:15,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {15041#true} call #t~ret9 := main(); {15041#true} is VALID [2018-11-23 12:01:15,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {15041#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15043#(= main_~a~0 0)} is VALID [2018-11-23 12:01:15,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {15043#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15043#(= main_~a~0 0)} is VALID [2018-11-23 12:01:15,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {15043#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15044#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:15,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {15044#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15044#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:15,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {15044#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15045#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:15,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {15045#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15045#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:15,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {15045#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15046#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:15,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {15046#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15046#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:15,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {15046#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15047#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:15,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {15047#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15047#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:15,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {15047#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15048#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:15,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {15048#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15048#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:15,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {15048#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15049#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:15,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {15049#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15049#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:15,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {15049#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15050#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:15,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {15050#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15050#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:15,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {15050#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15051#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:15,180 INFO L273 TraceCheckUtils]: 22: Hoare triple {15051#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15051#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:15,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {15051#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15052#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:15,181 INFO L273 TraceCheckUtils]: 24: Hoare triple {15052#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15052#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:15,182 INFO L273 TraceCheckUtils]: 25: Hoare triple {15052#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15053#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:15,182 INFO L273 TraceCheckUtils]: 26: Hoare triple {15053#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15053#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:15,183 INFO L273 TraceCheckUtils]: 27: Hoare triple {15053#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15054#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:15,183 INFO L273 TraceCheckUtils]: 28: Hoare triple {15054#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15054#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:15,184 INFO L273 TraceCheckUtils]: 29: Hoare triple {15054#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15055#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:15,185 INFO L273 TraceCheckUtils]: 30: Hoare triple {15055#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15055#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:15,185 INFO L273 TraceCheckUtils]: 31: Hoare triple {15055#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15056#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:15,186 INFO L273 TraceCheckUtils]: 32: Hoare triple {15056#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15056#(<= main_~a~0 13)} is VALID [2018-11-23 12:01:15,187 INFO L273 TraceCheckUtils]: 33: Hoare triple {15056#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15057#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:15,187 INFO L273 TraceCheckUtils]: 34: Hoare triple {15057#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15057#(<= main_~a~0 14)} is VALID [2018-11-23 12:01:15,188 INFO L273 TraceCheckUtils]: 35: Hoare triple {15057#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15058#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:15,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {15058#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15058#(<= main_~a~0 15)} is VALID [2018-11-23 12:01:15,189 INFO L273 TraceCheckUtils]: 37: Hoare triple {15058#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15059#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:15,190 INFO L273 TraceCheckUtils]: 38: Hoare triple {15059#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15059#(<= main_~a~0 16)} is VALID [2018-11-23 12:01:15,191 INFO L273 TraceCheckUtils]: 39: Hoare triple {15059#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15060#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:15,191 INFO L273 TraceCheckUtils]: 40: Hoare triple {15060#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15060#(<= main_~a~0 17)} is VALID [2018-11-23 12:01:15,192 INFO L273 TraceCheckUtils]: 41: Hoare triple {15060#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15061#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:15,192 INFO L273 TraceCheckUtils]: 42: Hoare triple {15061#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15061#(<= main_~a~0 18)} is VALID [2018-11-23 12:01:15,193 INFO L273 TraceCheckUtils]: 43: Hoare triple {15061#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15062#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:15,194 INFO L273 TraceCheckUtils]: 44: Hoare triple {15062#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15062#(<= main_~a~0 19)} is VALID [2018-11-23 12:01:15,194 INFO L273 TraceCheckUtils]: 45: Hoare triple {15062#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15063#(<= main_~a~0 20)} is VALID [2018-11-23 12:01:15,195 INFO L273 TraceCheckUtils]: 46: Hoare triple {15063#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15063#(<= main_~a~0 20)} is VALID [2018-11-23 12:01:15,196 INFO L273 TraceCheckUtils]: 47: Hoare triple {15063#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15064#(<= main_~a~0 21)} is VALID [2018-11-23 12:01:15,196 INFO L273 TraceCheckUtils]: 48: Hoare triple {15064#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15064#(<= main_~a~0 21)} is VALID [2018-11-23 12:01:15,197 INFO L273 TraceCheckUtils]: 49: Hoare triple {15064#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15065#(<= main_~a~0 22)} is VALID [2018-11-23 12:01:15,197 INFO L273 TraceCheckUtils]: 50: Hoare triple {15065#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15065#(<= main_~a~0 22)} is VALID [2018-11-23 12:01:15,198 INFO L273 TraceCheckUtils]: 51: Hoare triple {15065#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15066#(<= main_~a~0 23)} is VALID [2018-11-23 12:01:15,199 INFO L273 TraceCheckUtils]: 52: Hoare triple {15066#(<= main_~a~0 23)} assume !(~a~0 < 100000); {15042#false} is VALID [2018-11-23 12:01:15,199 INFO L273 TraceCheckUtils]: 53: Hoare triple {15042#false} havoc ~i~0;~i~0 := 0; {15042#false} is VALID [2018-11-23 12:01:15,199 INFO L273 TraceCheckUtils]: 54: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15042#false} is VALID [2018-11-23 12:01:15,200 INFO L273 TraceCheckUtils]: 55: Hoare triple {15042#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15042#false} is VALID [2018-11-23 12:01:15,200 INFO L273 TraceCheckUtils]: 56: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15042#false} is VALID [2018-11-23 12:01:15,200 INFO L273 TraceCheckUtils]: 57: Hoare triple {15042#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15042#false} is VALID [2018-11-23 12:01:15,200 INFO L273 TraceCheckUtils]: 58: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15042#false} is VALID [2018-11-23 12:01:15,200 INFO L273 TraceCheckUtils]: 59: Hoare triple {15042#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15042#false} is VALID [2018-11-23 12:01:15,200 INFO L273 TraceCheckUtils]: 60: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15042#false} is VALID [2018-11-23 12:01:15,201 INFO L273 TraceCheckUtils]: 61: Hoare triple {15042#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15042#false} is VALID [2018-11-23 12:01:15,201 INFO L273 TraceCheckUtils]: 62: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15042#false} is VALID [2018-11-23 12:01:15,201 INFO L273 TraceCheckUtils]: 63: Hoare triple {15042#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15042#false} is VALID [2018-11-23 12:01:15,201 INFO L273 TraceCheckUtils]: 64: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15042#false} is VALID [2018-11-23 12:01:15,201 INFO L273 TraceCheckUtils]: 65: Hoare triple {15042#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15042#false} is VALID [2018-11-23 12:01:15,202 INFO L273 TraceCheckUtils]: 66: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15042#false} is VALID [2018-11-23 12:01:15,202 INFO L273 TraceCheckUtils]: 67: Hoare triple {15042#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15042#false} is VALID [2018-11-23 12:01:15,202 INFO L273 TraceCheckUtils]: 68: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15042#false} is VALID [2018-11-23 12:01:15,202 INFO L273 TraceCheckUtils]: 69: Hoare triple {15042#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15042#false} is VALID [2018-11-23 12:01:15,202 INFO L273 TraceCheckUtils]: 70: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15042#false} is VALID [2018-11-23 12:01:15,202 INFO L273 TraceCheckUtils]: 71: Hoare triple {15042#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15042#false} is VALID [2018-11-23 12:01:15,202 INFO L273 TraceCheckUtils]: 72: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15042#false} is VALID [2018-11-23 12:01:15,202 INFO L273 TraceCheckUtils]: 73: Hoare triple {15042#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15042#false} is VALID [2018-11-23 12:01:15,202 INFO L273 TraceCheckUtils]: 74: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15042#false} is VALID [2018-11-23 12:01:15,203 INFO L273 TraceCheckUtils]: 75: Hoare triple {15042#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15042#false} is VALID [2018-11-23 12:01:15,203 INFO L273 TraceCheckUtils]: 76: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15042#false} is VALID [2018-11-23 12:01:15,203 INFO L273 TraceCheckUtils]: 77: Hoare triple {15042#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15042#false} is VALID [2018-11-23 12:01:15,203 INFO L273 TraceCheckUtils]: 78: Hoare triple {15042#false} assume !(~i~0 < 100000); {15042#false} is VALID [2018-11-23 12:01:15,203 INFO L273 TraceCheckUtils]: 79: Hoare triple {15042#false} ~i~0 := 0; {15042#false} is VALID [2018-11-23 12:01:15,203 INFO L273 TraceCheckUtils]: 80: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15042#false} is VALID [2018-11-23 12:01:15,203 INFO L273 TraceCheckUtils]: 81: Hoare triple {15042#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15042#false} is VALID [2018-11-23 12:01:15,203 INFO L273 TraceCheckUtils]: 82: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15042#false} is VALID [2018-11-23 12:01:15,203 INFO L273 TraceCheckUtils]: 83: Hoare triple {15042#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15042#false} is VALID [2018-11-23 12:01:15,204 INFO L273 TraceCheckUtils]: 84: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15042#false} is VALID [2018-11-23 12:01:15,204 INFO L273 TraceCheckUtils]: 85: Hoare triple {15042#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15042#false} is VALID [2018-11-23 12:01:15,204 INFO L273 TraceCheckUtils]: 86: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15042#false} is VALID [2018-11-23 12:01:15,204 INFO L273 TraceCheckUtils]: 87: Hoare triple {15042#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15042#false} is VALID [2018-11-23 12:01:15,204 INFO L273 TraceCheckUtils]: 88: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15042#false} is VALID [2018-11-23 12:01:15,204 INFO L273 TraceCheckUtils]: 89: Hoare triple {15042#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15042#false} is VALID [2018-11-23 12:01:15,204 INFO L273 TraceCheckUtils]: 90: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15042#false} is VALID [2018-11-23 12:01:15,204 INFO L273 TraceCheckUtils]: 91: Hoare triple {15042#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15042#false} is VALID [2018-11-23 12:01:15,204 INFO L273 TraceCheckUtils]: 92: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15042#false} is VALID [2018-11-23 12:01:15,205 INFO L273 TraceCheckUtils]: 93: Hoare triple {15042#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15042#false} is VALID [2018-11-23 12:01:15,205 INFO L273 TraceCheckUtils]: 94: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15042#false} is VALID [2018-11-23 12:01:15,205 INFO L273 TraceCheckUtils]: 95: Hoare triple {15042#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15042#false} is VALID [2018-11-23 12:01:15,205 INFO L273 TraceCheckUtils]: 96: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15042#false} is VALID [2018-11-23 12:01:15,205 INFO L273 TraceCheckUtils]: 97: Hoare triple {15042#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15042#false} is VALID [2018-11-23 12:01:15,205 INFO L273 TraceCheckUtils]: 98: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15042#false} is VALID [2018-11-23 12:01:15,205 INFO L273 TraceCheckUtils]: 99: Hoare triple {15042#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15042#false} is VALID [2018-11-23 12:01:15,205 INFO L273 TraceCheckUtils]: 100: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15042#false} is VALID [2018-11-23 12:01:15,205 INFO L273 TraceCheckUtils]: 101: Hoare triple {15042#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15042#false} is VALID [2018-11-23 12:01:15,206 INFO L273 TraceCheckUtils]: 102: Hoare triple {15042#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15042#false} is VALID [2018-11-23 12:01:15,206 INFO L273 TraceCheckUtils]: 103: Hoare triple {15042#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15042#false} is VALID [2018-11-23 12:01:15,206 INFO L273 TraceCheckUtils]: 104: Hoare triple {15042#false} assume !(~i~0 < 100000); {15042#false} is VALID [2018-11-23 12:01:15,206 INFO L273 TraceCheckUtils]: 105: Hoare triple {15042#false} havoc ~x~0;~x~0 := 0; {15042#false} is VALID [2018-11-23 12:01:15,206 INFO L273 TraceCheckUtils]: 106: Hoare triple {15042#false} assume !!(~x~0 < 100000);call #t~mem7 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {15042#false} is VALID [2018-11-23 12:01:15,206 INFO L256 TraceCheckUtils]: 107: Hoare triple {15042#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); {15042#false} is VALID [2018-11-23 12:01:15,206 INFO L273 TraceCheckUtils]: 108: Hoare triple {15042#false} ~cond := #in~cond; {15042#false} is VALID [2018-11-23 12:01:15,206 INFO L273 TraceCheckUtils]: 109: Hoare triple {15042#false} assume 0 == ~cond; {15042#false} is VALID [2018-11-23 12:01:15,207 INFO L273 TraceCheckUtils]: 110: Hoare triple {15042#false} assume !false; {15042#false} is VALID [2018-11-23 12:01:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-23 12:01:15,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:15,213 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:01:15,222 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1