java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init1_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:55:30,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:55:30,060 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:55:30,072 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:55:30,073 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:55:30,075 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:55:30,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:55:30,079 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:55:30,082 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:55:30,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:55:30,086 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:55:30,086 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:55:30,087 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:55:30,088 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:55:30,089 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:55:30,098 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:55:30,099 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:55:30,101 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:55:30,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:55:30,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:55:30,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:55:30,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:55:30,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:55:30,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:55:30,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:55:30,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:55:30,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:55:30,117 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:55:30,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:55:30,119 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:55:30,119 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:55:30,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:55:30,122 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:55:30,122 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:55:30,123 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:55:30,124 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:55:30,124 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 16:55:30,142 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:55:30,142 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:55:30,143 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:55:30,143 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:55:30,144 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:55:30,144 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:55:30,144 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:55:30,145 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:55:30,145 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:55:30,145 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:55:30,145 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:55:30,145 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:55:30,146 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:55:30,146 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:55:30,146 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:55:30,146 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:55:30,146 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:55:30,147 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:55:30,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:55:30,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:55:30,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:55:30,148 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:55:30,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:55:30,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:55:30,148 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:55:30,148 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:55:30,149 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:55:30,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:55:30,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:55:30,149 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:55:30,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:55:30,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:55:30,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:55:30,226 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:55:30,226 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:55:30,227 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init1_true-unreach-call_ground.i [2018-11-14 16:55:30,314 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8746d4102/af818fbde44a479981c62349c9db74c6/FLAGf5a8a5797 [2018-11-14 16:55:30,809 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:55:30,810 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init1_true-unreach-call_ground.i [2018-11-14 16:55:30,817 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8746d4102/af818fbde44a479981c62349c9db74c6/FLAGf5a8a5797 [2018-11-14 16:55:30,833 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8746d4102/af818fbde44a479981c62349c9db74c6 [2018-11-14 16:55:30,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:55:30,846 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:55:30,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:55:30,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:55:30,852 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:55:30,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:55:30" (1/1) ... [2018-11-14 16:55:30,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a287475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:30, skipping insertion in model container [2018-11-14 16:55:30,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:55:30" (1/1) ... [2018-11-14 16:55:30,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:55:30,888 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:55:31,096 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:55:31,102 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:55:31,128 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:55:31,160 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:55:31,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:31 WrapperNode [2018-11-14 16:55:31,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:55:31,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:55:31,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:55:31,162 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:55:31,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:31" (1/1) ... [2018-11-14 16:55:31,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:31" (1/1) ... [2018-11-14 16:55:31,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:31" (1/1) ... [2018-11-14 16:55:31,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:31" (1/1) ... [2018-11-14 16:55:31,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:31" (1/1) ... [2018-11-14 16:55:31,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:31" (1/1) ... [2018-11-14 16:55:31,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:31" (1/1) ... [2018-11-14 16:55:31,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:55:31,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:55:31,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:55:31,209 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:55:31,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:55:31,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:55:31,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:55:31,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:55:31,336 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:55:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:55:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:55:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:55:31,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:55:31,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:55:31,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:55:31,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:55:31,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:55:31,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:55:31,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:55:31,874 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:55:31,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:55:31 BoogieIcfgContainer [2018-11-14 16:55:31,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:55:31,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:55:31,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:55:31,879 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:55:31,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:55:30" (1/3) ... [2018-11-14 16:55:31,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6291bbae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:55:31, skipping insertion in model container [2018-11-14 16:55:31,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:31" (2/3) ... [2018-11-14 16:55:31,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6291bbae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:55:31, skipping insertion in model container [2018-11-14 16:55:31,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:55:31" (3/3) ... [2018-11-14 16:55:31,883 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init1_true-unreach-call_ground.i [2018-11-14 16:55:31,894 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:55:31,902 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:55:31,917 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:55:31,948 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:55:31,949 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:55:31,949 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:55:31,949 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:55:31,949 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:55:31,949 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:55:31,950 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:55:31,950 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:55:31,950 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:55:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-14 16:55:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 16:55:31,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:31,976 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:31,979 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:31,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:31,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1032870253, now seen corresponding path program 1 times [2018-11-14 16:55:31,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:31,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:32,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:32,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:32,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:32,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-14 16:55:32,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-14 16:55:32,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-14 16:55:32,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #50#return; {28#true} is VALID [2018-11-14 16:55:32,146 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret2 := main(); {28#true} is VALID [2018-11-14 16:55:32,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {28#true} is VALID [2018-11-14 16:55:32,160 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-14 16:55:32,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} havoc ~x~0;~x~0 := 0; {29#false} is VALID [2018-11-14 16:55:32,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume true; {29#false} is VALID [2018-11-14 16:55:32,161 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {29#false} is VALID [2018-11-14 16:55:32,162 INFO L256 TraceCheckUtils]: 10: Hoare triple {29#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {29#false} is VALID [2018-11-14 16:55:32,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-14 16:55:32,163 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume ~cond == 0; {29#false} is VALID [2018-11-14 16:55:32,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-14 16:55:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:32,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:55:32,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:55:32,176 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 16:55:32,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:32,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:55:32,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:32,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:55:32,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:55:32,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:55:32,256 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-14 16:55:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:32,406 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-14 16:55:32,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:55:32,407 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 16:55:32,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:55:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-14 16:55:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:55:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-14 16:55:32,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-14 16:55:32,762 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-14 16:55:32,773 INFO L225 Difference]: With dead ends: 42 [2018-11-14 16:55:32,773 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 16:55:32,777 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:55:32,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 16:55:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 16:55:32,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:32,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 16:55:32,821 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 16:55:32,821 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 16:55:32,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:32,825 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 16:55:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 16:55:32,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:32,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:32,827 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 16:55:32,827 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 16:55:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:32,830 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 16:55:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 16:55:32,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:32,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:32,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:32,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:55:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-14 16:55:32,835 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-14 16:55:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:32,836 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-14 16:55:32,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:55:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 16:55:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:55:32,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:32,837 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:32,838 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:32,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:32,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2053791372, now seen corresponding path program 1 times [2018-11-14 16:55:32,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:32,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:32,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:32,950 INFO L256 TraceCheckUtils]: 0: Hoare triple {153#true} call ULTIMATE.init(); {153#true} is VALID [2018-11-14 16:55:32,950 INFO L273 TraceCheckUtils]: 1: Hoare triple {153#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {153#true} is VALID [2018-11-14 16:55:32,951 INFO L273 TraceCheckUtils]: 2: Hoare triple {153#true} assume true; {153#true} is VALID [2018-11-14 16:55:32,951 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {153#true} {153#true} #50#return; {153#true} is VALID [2018-11-14 16:55:32,951 INFO L256 TraceCheckUtils]: 4: Hoare triple {153#true} call #t~ret2 := main(); {153#true} is VALID [2018-11-14 16:55:32,952 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {155#(= main_~i~0 0)} is VALID [2018-11-14 16:55:32,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {155#(= main_~i~0 0)} assume true; {155#(= main_~i~0 0)} is VALID [2018-11-14 16:55:32,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {155#(= main_~i~0 0)} assume !(~i~0 < 100000); {154#false} is VALID [2018-11-14 16:55:32,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {154#false} havoc ~x~0;~x~0 := 0; {154#false} is VALID [2018-11-14 16:55:32,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {154#false} assume true; {154#false} is VALID [2018-11-14 16:55:32,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {154#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {154#false} is VALID [2018-11-14 16:55:32,970 INFO L256 TraceCheckUtils]: 11: Hoare triple {154#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {154#false} is VALID [2018-11-14 16:55:32,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {154#false} ~cond := #in~cond; {154#false} is VALID [2018-11-14 16:55:32,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {154#false} assume ~cond == 0; {154#false} is VALID [2018-11-14 16:55:32,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {154#false} assume !false; {154#false} is VALID [2018-11-14 16:55:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:32,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:55:32,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:55:32,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:55:32,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:32,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:55:33,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:33,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:55:33,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:55:33,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:55:33,025 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-14 16:55:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:33,216 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-14 16:55:33,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:55:33,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:55:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:55:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-14 16:55:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:55:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-14 16:55:33,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-14 16:55:33,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:33,327 INFO L225 Difference]: With dead ends: 34 [2018-11-14 16:55:33,328 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 16:55:33,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:55:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 16:55:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 16:55:33,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:33,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 16:55:33,371 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:55:33,371 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:55:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:33,374 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 16:55:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 16:55:33,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:33,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:33,375 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:55:33,375 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:55:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:33,377 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 16:55:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 16:55:33,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:33,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:33,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:33,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 16:55:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-14 16:55:33,381 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2018-11-14 16:55:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:33,382 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-14 16:55:33,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:55:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 16:55:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:55:33,383 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:33,383 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:33,383 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:33,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1979507662, now seen corresponding path program 1 times [2018-11-14 16:55:33,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:33,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:33,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:33,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:33,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:33,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-14 16:55:33,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-14 16:55:33,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-14 16:55:33,548 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #50#return; {279#true} is VALID [2018-11-14 16:55:33,548 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret2 := main(); {279#true} is VALID [2018-11-14 16:55:33,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {281#(= main_~i~0 0)} is VALID [2018-11-14 16:55:33,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(= main_~i~0 0)} assume true; {281#(= main_~i~0 0)} is VALID [2018-11-14 16:55:33,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {281#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {282#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:33,553 INFO L273 TraceCheckUtils]: 8: Hoare triple {282#(<= main_~i~0 1)} assume true; {282#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:33,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 1)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-14 16:55:33,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-14 16:55:33,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume true; {280#false} is VALID [2018-11-14 16:55:33,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {280#false} is VALID [2018-11-14 16:55:33,559 INFO L256 TraceCheckUtils]: 13: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {280#false} is VALID [2018-11-14 16:55:33,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-14 16:55:33,559 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume ~cond == 0; {280#false} is VALID [2018-11-14 16:55:33,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-14 16:55:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:33,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:33,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:33,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:33,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:34,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-14 16:55:34,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-14 16:55:34,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-14 16:55:34,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #50#return; {279#true} is VALID [2018-11-14 16:55:34,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret2 := main(); {279#true} is VALID [2018-11-14 16:55:34,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {301#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:34,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {301#(<= main_~i~0 0)} assume true; {301#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:34,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {301#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {282#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:34,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {282#(<= main_~i~0 1)} assume true; {282#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:34,285 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 1)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-14 16:55:34,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-14 16:55:34,286 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume true; {280#false} is VALID [2018-11-14 16:55:34,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {280#false} is VALID [2018-11-14 16:55:34,287 INFO L256 TraceCheckUtils]: 13: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {280#false} is VALID [2018-11-14 16:55:34,287 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-14 16:55:34,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume ~cond == 0; {280#false} is VALID [2018-11-14 16:55:34,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-14 16:55:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:34,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:34,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:55:34,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 16:55:34,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:34,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:55:34,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:34,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:55:34,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:55:34,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:55:34,345 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 5 states. [2018-11-14 16:55:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:34,603 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 16:55:34,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:55:34,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 16:55:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:55:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-14 16:55:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:55:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-14 16:55:34,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2018-11-14 16:55:34,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:34,707 INFO L225 Difference]: With dead ends: 36 [2018-11-14 16:55:34,709 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 16:55:34,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:55:34,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 16:55:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 16:55:34,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:34,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 16:55:34,741 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:55:34,741 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:55:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:34,744 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-14 16:55:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-14 16:55:34,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:34,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:34,745 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:55:34,745 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:55:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:34,747 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-14 16:55:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-14 16:55:34,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:34,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:34,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:34,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:55:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-14 16:55:34,750 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 17 [2018-11-14 16:55:34,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:34,750 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-14 16:55:34,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:55:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-14 16:55:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:55:34,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:34,752 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:34,752 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:34,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash -375588952, now seen corresponding path program 2 times [2018-11-14 16:55:34,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:34,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:34,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:34,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2018-11-14 16:55:34,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {465#true} is VALID [2018-11-14 16:55:34,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2018-11-14 16:55:34,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #50#return; {465#true} is VALID [2018-11-14 16:55:34,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret2 := main(); {465#true} is VALID [2018-11-14 16:55:34,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {465#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {467#(= main_~i~0 0)} is VALID [2018-11-14 16:55:34,896 INFO L273 TraceCheckUtils]: 6: Hoare triple {467#(= main_~i~0 0)} assume true; {467#(= main_~i~0 0)} is VALID [2018-11-14 16:55:34,897 INFO L273 TraceCheckUtils]: 7: Hoare triple {467#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {468#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:34,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {468#(<= main_~i~0 1)} assume true; {468#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:34,903 INFO L273 TraceCheckUtils]: 9: Hoare triple {468#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {469#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:34,903 INFO L273 TraceCheckUtils]: 10: Hoare triple {469#(<= main_~i~0 2)} assume true; {469#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:34,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {469#(<= main_~i~0 2)} assume !(~i~0 < 100000); {466#false} is VALID [2018-11-14 16:55:34,905 INFO L273 TraceCheckUtils]: 12: Hoare triple {466#false} havoc ~x~0;~x~0 := 0; {466#false} is VALID [2018-11-14 16:55:34,905 INFO L273 TraceCheckUtils]: 13: Hoare triple {466#false} assume true; {466#false} is VALID [2018-11-14 16:55:34,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {466#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {466#false} is VALID [2018-11-14 16:55:34,906 INFO L256 TraceCheckUtils]: 15: Hoare triple {466#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {466#false} is VALID [2018-11-14 16:55:34,907 INFO L273 TraceCheckUtils]: 16: Hoare triple {466#false} ~cond := #in~cond; {466#false} is VALID [2018-11-14 16:55:34,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {466#false} assume ~cond == 0; {466#false} is VALID [2018-11-14 16:55:34,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {466#false} assume !false; {466#false} is VALID [2018-11-14 16:55:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:34,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:34,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:34,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:55:34,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:55:34,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:34,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:35,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2018-11-14 16:55:35,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {465#true} is VALID [2018-11-14 16:55:35,065 INFO L273 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2018-11-14 16:55:35,065 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #50#return; {465#true} is VALID [2018-11-14 16:55:35,065 INFO L256 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret2 := main(); {465#true} is VALID [2018-11-14 16:55:35,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {465#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {488#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:35,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {488#(<= main_~i~0 0)} assume true; {488#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:35,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {468#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:35,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {468#(<= main_~i~0 1)} assume true; {468#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:35,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {468#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {469#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:35,088 INFO L273 TraceCheckUtils]: 10: Hoare triple {469#(<= main_~i~0 2)} assume true; {469#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:35,089 INFO L273 TraceCheckUtils]: 11: Hoare triple {469#(<= main_~i~0 2)} assume !(~i~0 < 100000); {466#false} is VALID [2018-11-14 16:55:35,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {466#false} havoc ~x~0;~x~0 := 0; {466#false} is VALID [2018-11-14 16:55:35,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {466#false} assume true; {466#false} is VALID [2018-11-14 16:55:35,090 INFO L273 TraceCheckUtils]: 14: Hoare triple {466#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {466#false} is VALID [2018-11-14 16:55:35,091 INFO L256 TraceCheckUtils]: 15: Hoare triple {466#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {466#false} is VALID [2018-11-14 16:55:35,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {466#false} ~cond := #in~cond; {466#false} is VALID [2018-11-14 16:55:35,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {466#false} assume ~cond == 0; {466#false} is VALID [2018-11-14 16:55:35,092 INFO L273 TraceCheckUtils]: 18: Hoare triple {466#false} assume !false; {466#false} is VALID [2018-11-14 16:55:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:35,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:35,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 16:55:35,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 16:55:35,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:35,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:55:35,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:35,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:55:35,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:55:35,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:55:35,149 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2018-11-14 16:55:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:35,470 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-14 16:55:35,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:55:35,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 16:55:35,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:55:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-14 16:55:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:55:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-14 16:55:35,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2018-11-14 16:55:35,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:35,533 INFO L225 Difference]: With dead ends: 38 [2018-11-14 16:55:35,534 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 16:55:35,534 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:55:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 16:55:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 16:55:35,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:35,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 16:55:35,550 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 16:55:35,550 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 16:55:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:35,553 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-14 16:55:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-14 16:55:35,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:35,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:35,554 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 16:55:35,554 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 16:55:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:35,557 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-14 16:55:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-14 16:55:35,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:35,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:35,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:35,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:55:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-14 16:55:35,565 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 19 [2018-11-14 16:55:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:35,566 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-14 16:55:35,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:55:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-14 16:55:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:55:35,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:35,567 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:35,568 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:35,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash -175670014, now seen corresponding path program 3 times [2018-11-14 16:55:35,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:35,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:35,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:35,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:35,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:35,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {668#true} call ULTIMATE.init(); {668#true} is VALID [2018-11-14 16:55:35,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {668#true} is VALID [2018-11-14 16:55:35,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID [2018-11-14 16:55:35,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {668#true} {668#true} #50#return; {668#true} is VALID [2018-11-14 16:55:35,682 INFO L256 TraceCheckUtils]: 4: Hoare triple {668#true} call #t~ret2 := main(); {668#true} is VALID [2018-11-14 16:55:35,686 INFO L273 TraceCheckUtils]: 5: Hoare triple {668#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {670#(= main_~i~0 0)} is VALID [2018-11-14 16:55:35,687 INFO L273 TraceCheckUtils]: 6: Hoare triple {670#(= main_~i~0 0)} assume true; {670#(= main_~i~0 0)} is VALID [2018-11-14 16:55:35,688 INFO L273 TraceCheckUtils]: 7: Hoare triple {670#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {671#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:35,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {671#(<= main_~i~0 1)} assume true; {671#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:35,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {671#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {672#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:35,691 INFO L273 TraceCheckUtils]: 10: Hoare triple {672#(<= main_~i~0 2)} assume true; {672#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:35,693 INFO L273 TraceCheckUtils]: 11: Hoare triple {672#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {673#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:35,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {673#(<= main_~i~0 3)} assume true; {673#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:35,695 INFO L273 TraceCheckUtils]: 13: Hoare triple {673#(<= main_~i~0 3)} assume !(~i~0 < 100000); {669#false} is VALID [2018-11-14 16:55:35,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {669#false} havoc ~x~0;~x~0 := 0; {669#false} is VALID [2018-11-14 16:55:35,695 INFO L273 TraceCheckUtils]: 15: Hoare triple {669#false} assume true; {669#false} is VALID [2018-11-14 16:55:35,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {669#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {669#false} is VALID [2018-11-14 16:55:35,696 INFO L256 TraceCheckUtils]: 17: Hoare triple {669#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {669#false} is VALID [2018-11-14 16:55:35,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {669#false} ~cond := #in~cond; {669#false} is VALID [2018-11-14 16:55:35,696 INFO L273 TraceCheckUtils]: 19: Hoare triple {669#false} assume ~cond == 0; {669#false} is VALID [2018-11-14 16:55:35,697 INFO L273 TraceCheckUtils]: 20: Hoare triple {669#false} assume !false; {669#false} is VALID [2018-11-14 16:55:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:35,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:35,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:35,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:55:35,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 16:55:35,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:35,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:35,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {668#true} call ULTIMATE.init(); {668#true} is VALID [2018-11-14 16:55:35,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {668#true} is VALID [2018-11-14 16:55:35,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID [2018-11-14 16:55:35,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {668#true} {668#true} #50#return; {668#true} is VALID [2018-11-14 16:55:35,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {668#true} call #t~ret2 := main(); {668#true} is VALID [2018-11-14 16:55:35,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {668#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {692#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:35,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {692#(<= main_~i~0 0)} assume true; {692#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:35,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {692#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {671#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:35,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {671#(<= main_~i~0 1)} assume true; {671#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:35,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {671#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {672#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:35,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {672#(<= main_~i~0 2)} assume true; {672#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:35,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {672#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {673#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:35,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {673#(<= main_~i~0 3)} assume true; {673#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:35,881 INFO L273 TraceCheckUtils]: 13: Hoare triple {673#(<= main_~i~0 3)} assume !(~i~0 < 100000); {669#false} is VALID [2018-11-14 16:55:35,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {669#false} havoc ~x~0;~x~0 := 0; {669#false} is VALID [2018-11-14 16:55:35,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {669#false} assume true; {669#false} is VALID [2018-11-14 16:55:35,882 INFO L273 TraceCheckUtils]: 16: Hoare triple {669#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {669#false} is VALID [2018-11-14 16:55:35,882 INFO L256 TraceCheckUtils]: 17: Hoare triple {669#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {669#false} is VALID [2018-11-14 16:55:35,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {669#false} ~cond := #in~cond; {669#false} is VALID [2018-11-14 16:55:35,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {669#false} assume ~cond == 0; {669#false} is VALID [2018-11-14 16:55:35,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {669#false} assume !false; {669#false} is VALID [2018-11-14 16:55:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:35,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:35,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 16:55:35,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-14 16:55:35,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:35,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:55:35,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:35,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:55:35,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:55:35,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:55:35,958 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 7 states. [2018-11-14 16:55:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:36,061 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-14 16:55:36,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:55:36,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-14 16:55:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:55:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-14 16:55:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:55:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-14 16:55:36,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2018-11-14 16:55:36,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:36,134 INFO L225 Difference]: With dead ends: 40 [2018-11-14 16:55:36,135 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 16:55:36,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:55:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 16:55:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 16:55:36,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:36,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 16:55:36,152 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:55:36,153 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:55:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:36,155 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-14 16:55:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-14 16:55:36,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:36,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:36,162 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:55:36,162 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:55:36,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:36,165 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-14 16:55:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-14 16:55:36,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:36,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:36,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:36,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:55:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-14 16:55:36,168 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2018-11-14 16:55:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:36,169 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-14 16:55:36,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:55:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-14 16:55:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:55:36,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:36,170 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:36,170 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:36,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:36,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1327098916, now seen corresponding path program 4 times [2018-11-14 16:55:36,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:36,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:36,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:36,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:36,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:36,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {888#true} call ULTIMATE.init(); {888#true} is VALID [2018-11-14 16:55:36,298 INFO L273 TraceCheckUtils]: 1: Hoare triple {888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {888#true} is VALID [2018-11-14 16:55:36,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {888#true} assume true; {888#true} is VALID [2018-11-14 16:55:36,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {888#true} {888#true} #50#return; {888#true} is VALID [2018-11-14 16:55:36,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {888#true} call #t~ret2 := main(); {888#true} is VALID [2018-11-14 16:55:36,300 INFO L273 TraceCheckUtils]: 5: Hoare triple {888#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {890#(= main_~i~0 0)} is VALID [2018-11-14 16:55:36,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {890#(= main_~i~0 0)} assume true; {890#(= main_~i~0 0)} is VALID [2018-11-14 16:55:36,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {890#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {891#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:36,308 INFO L273 TraceCheckUtils]: 8: Hoare triple {891#(<= main_~i~0 1)} assume true; {891#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:36,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {891#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {892#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:36,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {892#(<= main_~i~0 2)} assume true; {892#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:36,314 INFO L273 TraceCheckUtils]: 11: Hoare triple {892#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {893#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:36,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {893#(<= main_~i~0 3)} assume true; {893#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:36,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {893#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {894#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:36,316 INFO L273 TraceCheckUtils]: 14: Hoare triple {894#(<= main_~i~0 4)} assume true; {894#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:36,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {894#(<= main_~i~0 4)} assume !(~i~0 < 100000); {889#false} is VALID [2018-11-14 16:55:36,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {889#false} havoc ~x~0;~x~0 := 0; {889#false} is VALID [2018-11-14 16:55:36,322 INFO L273 TraceCheckUtils]: 17: Hoare triple {889#false} assume true; {889#false} is VALID [2018-11-14 16:55:36,323 INFO L273 TraceCheckUtils]: 18: Hoare triple {889#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {889#false} is VALID [2018-11-14 16:55:36,323 INFO L256 TraceCheckUtils]: 19: Hoare triple {889#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {889#false} is VALID [2018-11-14 16:55:36,323 INFO L273 TraceCheckUtils]: 20: Hoare triple {889#false} ~cond := #in~cond; {889#false} is VALID [2018-11-14 16:55:36,323 INFO L273 TraceCheckUtils]: 21: Hoare triple {889#false} assume ~cond == 0; {889#false} is VALID [2018-11-14 16:55:36,323 INFO L273 TraceCheckUtils]: 22: Hoare triple {889#false} assume !false; {889#false} is VALID [2018-11-14 16:55:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:36,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:36,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:36,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:55:36,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:55:36,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:36,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:36,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {888#true} call ULTIMATE.init(); {888#true} is VALID [2018-11-14 16:55:36,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {888#true} is VALID [2018-11-14 16:55:36,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {888#true} assume true; {888#true} is VALID [2018-11-14 16:55:36,540 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {888#true} {888#true} #50#return; {888#true} is VALID [2018-11-14 16:55:36,540 INFO L256 TraceCheckUtils]: 4: Hoare triple {888#true} call #t~ret2 := main(); {888#true} is VALID [2018-11-14 16:55:36,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {888#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {913#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:36,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {913#(<= main_~i~0 0)} assume true; {913#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:36,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {913#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {891#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:36,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {891#(<= main_~i~0 1)} assume true; {891#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:36,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {891#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {892#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:36,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {892#(<= main_~i~0 2)} assume true; {892#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:36,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {892#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {893#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:36,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {893#(<= main_~i~0 3)} assume true; {893#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:36,550 INFO L273 TraceCheckUtils]: 13: Hoare triple {893#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {894#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:36,550 INFO L273 TraceCheckUtils]: 14: Hoare triple {894#(<= main_~i~0 4)} assume true; {894#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:36,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {894#(<= main_~i~0 4)} assume !(~i~0 < 100000); {889#false} is VALID [2018-11-14 16:55:36,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {889#false} havoc ~x~0;~x~0 := 0; {889#false} is VALID [2018-11-14 16:55:36,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {889#false} assume true; {889#false} is VALID [2018-11-14 16:55:36,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {889#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {889#false} is VALID [2018-11-14 16:55:36,553 INFO L256 TraceCheckUtils]: 19: Hoare triple {889#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {889#false} is VALID [2018-11-14 16:55:36,553 INFO L273 TraceCheckUtils]: 20: Hoare triple {889#false} ~cond := #in~cond; {889#false} is VALID [2018-11-14 16:55:36,554 INFO L273 TraceCheckUtils]: 21: Hoare triple {889#false} assume ~cond == 0; {889#false} is VALID [2018-11-14 16:55:36,554 INFO L273 TraceCheckUtils]: 22: Hoare triple {889#false} assume !false; {889#false} is VALID [2018-11-14 16:55:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:36,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:36,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:55:36,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-14 16:55:36,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:36,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:55:36,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:36,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:55:36,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:55:36,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:55:36,615 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 8 states. [2018-11-14 16:55:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:36,860 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-14 16:55:36,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:55:36,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-14 16:55:36,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:55:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-11-14 16:55:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:55:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-11-14 16:55:36,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2018-11-14 16:55:36,981 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-14 16:55:36,983 INFO L225 Difference]: With dead ends: 42 [2018-11-14 16:55:36,983 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 16:55:36,984 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 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-14 16:55:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 16:55:36,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-14 16:55:36,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:36,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-14 16:55:36,998 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 16:55:36,998 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 16:55:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:37,000 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-14 16:55:37,000 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-14 16:55:37,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:37,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:37,000 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 16:55:37,001 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 16:55:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:37,003 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-14 16:55:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-14 16:55:37,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:37,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:37,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:37,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:55:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-14 16:55:37,006 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-11-14 16:55:37,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:37,006 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-14 16:55:37,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:55:37,007 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-14 16:55:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:55:37,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:37,007 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:37,008 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:37,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:37,008 INFO L82 PathProgramCache]: Analyzing trace with hash 251288630, now seen corresponding path program 5 times [2018-11-14 16:55:37,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:37,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:37,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:37,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:37,159 INFO L256 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2018-11-14 16:55:37,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {1125#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1125#true} is VALID [2018-11-14 16:55:37,160 INFO L273 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2018-11-14 16:55:37,160 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #50#return; {1125#true} is VALID [2018-11-14 16:55:37,160 INFO L256 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret2 := main(); {1125#true} is VALID [2018-11-14 16:55:37,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {1125#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1127#(= main_~i~0 0)} is VALID [2018-11-14 16:55:37,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {1127#(= main_~i~0 0)} assume true; {1127#(= main_~i~0 0)} is VALID [2018-11-14 16:55:37,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {1127#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1128#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:37,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {1128#(<= main_~i~0 1)} assume true; {1128#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:37,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {1128#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1129#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:37,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {1129#(<= main_~i~0 2)} assume true; {1129#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:37,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {1129#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1130#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:37,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {1130#(<= main_~i~0 3)} assume true; {1130#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:37,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {1130#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1131#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:37,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {1131#(<= main_~i~0 4)} assume true; {1131#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:37,184 INFO L273 TraceCheckUtils]: 15: Hoare triple {1131#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1132#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:37,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {1132#(<= main_~i~0 5)} assume true; {1132#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:37,190 INFO L273 TraceCheckUtils]: 17: Hoare triple {1132#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1126#false} is VALID [2018-11-14 16:55:37,191 INFO L273 TraceCheckUtils]: 18: Hoare triple {1126#false} havoc ~x~0;~x~0 := 0; {1126#false} is VALID [2018-11-14 16:55:37,191 INFO L273 TraceCheckUtils]: 19: Hoare triple {1126#false} assume true; {1126#false} is VALID [2018-11-14 16:55:37,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {1126#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1126#false} is VALID [2018-11-14 16:55:37,191 INFO L256 TraceCheckUtils]: 21: Hoare triple {1126#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1126#false} is VALID [2018-11-14 16:55:37,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {1126#false} ~cond := #in~cond; {1126#false} is VALID [2018-11-14 16:55:37,192 INFO L273 TraceCheckUtils]: 23: Hoare triple {1126#false} assume ~cond == 0; {1126#false} is VALID [2018-11-14 16:55:37,192 INFO L273 TraceCheckUtils]: 24: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2018-11-14 16:55:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:37,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:37,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:37,206 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:55:37,271 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 16:55:37,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:37,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:37,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2018-11-14 16:55:37,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {1125#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1125#true} is VALID [2018-11-14 16:55:37,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2018-11-14 16:55:37,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #50#return; {1125#true} is VALID [2018-11-14 16:55:37,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret2 := main(); {1125#true} is VALID [2018-11-14 16:55:37,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {1125#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1151#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:37,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {1151#(<= main_~i~0 0)} assume true; {1151#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:37,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {1151#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1128#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:37,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {1128#(<= main_~i~0 1)} assume true; {1128#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:37,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {1128#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1129#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:37,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {1129#(<= main_~i~0 2)} assume true; {1129#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:37,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {1129#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1130#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:37,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {1130#(<= main_~i~0 3)} assume true; {1130#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:37,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {1130#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1131#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:37,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {1131#(<= main_~i~0 4)} assume true; {1131#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:37,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {1131#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1132#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:37,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {1132#(<= main_~i~0 5)} assume true; {1132#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:37,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {1132#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1126#false} is VALID [2018-11-14 16:55:37,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {1126#false} havoc ~x~0;~x~0 := 0; {1126#false} is VALID [2018-11-14 16:55:37,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {1126#false} assume true; {1126#false} is VALID [2018-11-14 16:55:37,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {1126#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1126#false} is VALID [2018-11-14 16:55:37,413 INFO L256 TraceCheckUtils]: 21: Hoare triple {1126#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1126#false} is VALID [2018-11-14 16:55:37,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {1126#false} ~cond := #in~cond; {1126#false} is VALID [2018-11-14 16:55:37,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {1126#false} assume ~cond == 0; {1126#false} is VALID [2018-11-14 16:55:37,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2018-11-14 16:55:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:37,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:37,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 16:55:37,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-14 16:55:37,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:37,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:55:37,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:37,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:55:37,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:55:37,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:55:37,469 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 9 states. [2018-11-14 16:55:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:37,672 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-14 16:55:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:55:37,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-14 16:55:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:55:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-14 16:55:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:55:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-14 16:55:37,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2018-11-14 16:55:37,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:37,747 INFO L225 Difference]: With dead ends: 44 [2018-11-14 16:55:37,748 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 16:55:37,748 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:55:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 16:55:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 16:55:37,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:37,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 16:55:37,775 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 16:55:37,775 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 16:55:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:37,776 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-14 16:55:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-14 16:55:37,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:37,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:37,777 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 16:55:37,778 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 16:55:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:37,779 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-14 16:55:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-14 16:55:37,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:37,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:37,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:37,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:55:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-14 16:55:37,783 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2018-11-14 16:55:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:37,783 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-14 16:55:37,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:55:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-14 16:55:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:55:37,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:37,784 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:37,784 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:37,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash 958264848, now seen corresponding path program 6 times [2018-11-14 16:55:37,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:37,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:37,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:37,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:37,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:38,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2018-11-14 16:55:38,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1379#true} is VALID [2018-11-14 16:55:38,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2018-11-14 16:55:38,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #50#return; {1379#true} is VALID [2018-11-14 16:55:38,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret2 := main(); {1379#true} is VALID [2018-11-14 16:55:38,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {1379#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1381#(= main_~i~0 0)} is VALID [2018-11-14 16:55:38,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {1381#(= main_~i~0 0)} assume true; {1381#(= main_~i~0 0)} is VALID [2018-11-14 16:55:38,115 INFO L273 TraceCheckUtils]: 7: Hoare triple {1381#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1382#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:38,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {1382#(<= main_~i~0 1)} assume true; {1382#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:38,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {1382#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1383#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:38,124 INFO L273 TraceCheckUtils]: 10: Hoare triple {1383#(<= main_~i~0 2)} assume true; {1383#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:38,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {1383#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1384#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:38,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {1384#(<= main_~i~0 3)} assume true; {1384#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:38,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {1384#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1385#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:38,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {1385#(<= main_~i~0 4)} assume true; {1385#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:38,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {1385#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1386#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:38,138 INFO L273 TraceCheckUtils]: 16: Hoare triple {1386#(<= main_~i~0 5)} assume true; {1386#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:38,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {1386#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1387#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:38,141 INFO L273 TraceCheckUtils]: 18: Hoare triple {1387#(<= main_~i~0 6)} assume true; {1387#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:38,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {1387#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1380#false} is VALID [2018-11-14 16:55:38,143 INFO L273 TraceCheckUtils]: 20: Hoare triple {1380#false} havoc ~x~0;~x~0 := 0; {1380#false} is VALID [2018-11-14 16:55:38,143 INFO L273 TraceCheckUtils]: 21: Hoare triple {1380#false} assume true; {1380#false} is VALID [2018-11-14 16:55:38,144 INFO L273 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1380#false} is VALID [2018-11-14 16:55:38,144 INFO L256 TraceCheckUtils]: 23: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1380#false} is VALID [2018-11-14 16:55:38,145 INFO L273 TraceCheckUtils]: 24: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2018-11-14 16:55:38,145 INFO L273 TraceCheckUtils]: 25: Hoare triple {1380#false} assume ~cond == 0; {1380#false} is VALID [2018-11-14 16:55:38,145 INFO L273 TraceCheckUtils]: 26: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2018-11-14 16:55:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:38,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:38,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:38,156 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:55:38,188 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 16:55:38,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:38,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:38,477 INFO L256 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2018-11-14 16:55:38,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1379#true} is VALID [2018-11-14 16:55:38,478 INFO L273 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2018-11-14 16:55:38,478 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #50#return; {1379#true} is VALID [2018-11-14 16:55:38,478 INFO L256 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret2 := main(); {1379#true} is VALID [2018-11-14 16:55:38,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {1379#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1406#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:38,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {1406#(<= main_~i~0 0)} assume true; {1406#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:38,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {1406#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1382#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:38,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {1382#(<= main_~i~0 1)} assume true; {1382#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:38,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {1382#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1383#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:38,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {1383#(<= main_~i~0 2)} assume true; {1383#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:38,487 INFO L273 TraceCheckUtils]: 11: Hoare triple {1383#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1384#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:38,488 INFO L273 TraceCheckUtils]: 12: Hoare triple {1384#(<= main_~i~0 3)} assume true; {1384#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:38,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {1384#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1385#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:38,492 INFO L273 TraceCheckUtils]: 14: Hoare triple {1385#(<= main_~i~0 4)} assume true; {1385#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:38,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {1385#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1386#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:38,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {1386#(<= main_~i~0 5)} assume true; {1386#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:38,494 INFO L273 TraceCheckUtils]: 17: Hoare triple {1386#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1387#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:38,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {1387#(<= main_~i~0 6)} assume true; {1387#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:38,495 INFO L273 TraceCheckUtils]: 19: Hoare triple {1387#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1380#false} is VALID [2018-11-14 16:55:38,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {1380#false} havoc ~x~0;~x~0 := 0; {1380#false} is VALID [2018-11-14 16:55:38,496 INFO L273 TraceCheckUtils]: 21: Hoare triple {1380#false} assume true; {1380#false} is VALID [2018-11-14 16:55:38,496 INFO L273 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1380#false} is VALID [2018-11-14 16:55:38,497 INFO L256 TraceCheckUtils]: 23: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1380#false} is VALID [2018-11-14 16:55:38,497 INFO L273 TraceCheckUtils]: 24: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2018-11-14 16:55:38,497 INFO L273 TraceCheckUtils]: 25: Hoare triple {1380#false} assume ~cond == 0; {1380#false} is VALID [2018-11-14 16:55:38,498 INFO L273 TraceCheckUtils]: 26: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2018-11-14 16:55:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:38,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:38,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 16:55:38,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-14 16:55:38,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:38,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:55:38,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:38,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:55:38,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:55:38,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:55:38,566 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2018-11-14 16:55:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:38,721 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-14 16:55:38,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:55:38,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-14 16:55:38,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:55:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2018-11-14 16:55:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:55:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2018-11-14 16:55:38,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2018-11-14 16:55:38,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:38,804 INFO L225 Difference]: With dead ends: 46 [2018-11-14 16:55:38,805 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 16:55:38,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:55:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 16:55:38,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-14 16:55:38,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:38,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-14 16:55:38,822 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 16:55:38,822 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 16:55:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:38,824 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-14 16:55:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-14 16:55:38,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:38,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:38,825 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 16:55:38,825 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 16:55:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:38,827 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-14 16:55:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-14 16:55:38,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:38,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:38,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:38,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:38,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:55:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-11-14 16:55:38,830 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2018-11-14 16:55:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:38,830 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-11-14 16:55:38,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:55:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-14 16:55:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:55:38,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:38,832 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:38,832 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:38,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:38,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1757577578, now seen corresponding path program 7 times [2018-11-14 16:55:38,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:38,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:38,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:38,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:38,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:39,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {1650#true} call ULTIMATE.init(); {1650#true} is VALID [2018-11-14 16:55:39,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {1650#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1650#true} is VALID [2018-11-14 16:55:39,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {1650#true} assume true; {1650#true} is VALID [2018-11-14 16:55:39,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1650#true} {1650#true} #50#return; {1650#true} is VALID [2018-11-14 16:55:39,005 INFO L256 TraceCheckUtils]: 4: Hoare triple {1650#true} call #t~ret2 := main(); {1650#true} is VALID [2018-11-14 16:55:39,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {1650#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1652#(= main_~i~0 0)} is VALID [2018-11-14 16:55:39,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {1652#(= main_~i~0 0)} assume true; {1652#(= main_~i~0 0)} is VALID [2018-11-14 16:55:39,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {1652#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1653#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:39,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {1653#(<= main_~i~0 1)} assume true; {1653#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:39,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {1653#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1654#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:39,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {1654#(<= main_~i~0 2)} assume true; {1654#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:39,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {1654#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1655#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:39,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {1655#(<= main_~i~0 3)} assume true; {1655#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:39,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {1655#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1656#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:39,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {1656#(<= main_~i~0 4)} assume true; {1656#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:39,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {1656#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1657#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:39,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {1657#(<= main_~i~0 5)} assume true; {1657#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:39,019 INFO L273 TraceCheckUtils]: 17: Hoare triple {1657#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1658#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:39,020 INFO L273 TraceCheckUtils]: 18: Hoare triple {1658#(<= main_~i~0 6)} assume true; {1658#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:39,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {1658#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1659#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:39,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {1659#(<= main_~i~0 7)} assume true; {1659#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:39,024 INFO L273 TraceCheckUtils]: 21: Hoare triple {1659#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1651#false} is VALID [2018-11-14 16:55:39,024 INFO L273 TraceCheckUtils]: 22: Hoare triple {1651#false} havoc ~x~0;~x~0 := 0; {1651#false} is VALID [2018-11-14 16:55:39,025 INFO L273 TraceCheckUtils]: 23: Hoare triple {1651#false} assume true; {1651#false} is VALID [2018-11-14 16:55:39,025 INFO L273 TraceCheckUtils]: 24: Hoare triple {1651#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1651#false} is VALID [2018-11-14 16:55:39,025 INFO L256 TraceCheckUtils]: 25: Hoare triple {1651#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1651#false} is VALID [2018-11-14 16:55:39,026 INFO L273 TraceCheckUtils]: 26: Hoare triple {1651#false} ~cond := #in~cond; {1651#false} is VALID [2018-11-14 16:55:39,026 INFO L273 TraceCheckUtils]: 27: Hoare triple {1651#false} assume ~cond == 0; {1651#false} is VALID [2018-11-14 16:55:39,027 INFO L273 TraceCheckUtils]: 28: Hoare triple {1651#false} assume !false; {1651#false} is VALID [2018-11-14 16:55:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:39,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:39,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:39,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:39,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:39,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {1650#true} call ULTIMATE.init(); {1650#true} is VALID [2018-11-14 16:55:39,313 INFO L273 TraceCheckUtils]: 1: Hoare triple {1650#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1650#true} is VALID [2018-11-14 16:55:39,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {1650#true} assume true; {1650#true} is VALID [2018-11-14 16:55:39,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1650#true} {1650#true} #50#return; {1650#true} is VALID [2018-11-14 16:55:39,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {1650#true} call #t~ret2 := main(); {1650#true} is VALID [2018-11-14 16:55:39,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {1650#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1678#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:39,314 INFO L273 TraceCheckUtils]: 6: Hoare triple {1678#(<= main_~i~0 0)} assume true; {1678#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:39,315 INFO L273 TraceCheckUtils]: 7: Hoare triple {1678#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1653#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:39,315 INFO L273 TraceCheckUtils]: 8: Hoare triple {1653#(<= main_~i~0 1)} assume true; {1653#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:39,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {1653#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1654#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:39,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {1654#(<= main_~i~0 2)} assume true; {1654#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:39,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {1654#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1655#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:39,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {1655#(<= main_~i~0 3)} assume true; {1655#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:39,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {1655#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1656#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:39,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {1656#(<= main_~i~0 4)} assume true; {1656#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:39,321 INFO L273 TraceCheckUtils]: 15: Hoare triple {1656#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1657#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:39,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {1657#(<= main_~i~0 5)} assume true; {1657#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:39,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {1657#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1658#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:39,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {1658#(<= main_~i~0 6)} assume true; {1658#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:39,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {1658#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1659#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:39,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {1659#(<= main_~i~0 7)} assume true; {1659#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:39,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {1659#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1651#false} is VALID [2018-11-14 16:55:39,327 INFO L273 TraceCheckUtils]: 22: Hoare triple {1651#false} havoc ~x~0;~x~0 := 0; {1651#false} is VALID [2018-11-14 16:55:39,327 INFO L273 TraceCheckUtils]: 23: Hoare triple {1651#false} assume true; {1651#false} is VALID [2018-11-14 16:55:39,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {1651#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1651#false} is VALID [2018-11-14 16:55:39,328 INFO L256 TraceCheckUtils]: 25: Hoare triple {1651#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1651#false} is VALID [2018-11-14 16:55:39,328 INFO L273 TraceCheckUtils]: 26: Hoare triple {1651#false} ~cond := #in~cond; {1651#false} is VALID [2018-11-14 16:55:39,329 INFO L273 TraceCheckUtils]: 27: Hoare triple {1651#false} assume ~cond == 0; {1651#false} is VALID [2018-11-14 16:55:39,331 INFO L273 TraceCheckUtils]: 28: Hoare triple {1651#false} assume !false; {1651#false} is VALID [2018-11-14 16:55:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:39,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:39,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:55:39,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-14 16:55:39,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:39,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:55:39,403 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-14 16:55:39,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:55:39,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:55:39,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:55:39,404 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 11 states. [2018-11-14 16:55:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:39,741 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-14 16:55:39,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:55:39,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-14 16:55:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:55:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-14 16:55:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:55:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-14 16:55:39,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2018-11-14 16:55:39,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:39,828 INFO L225 Difference]: With dead ends: 48 [2018-11-14 16:55:39,829 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 16:55:39,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:55:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 16:55:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-14 16:55:39,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:39,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-14 16:55:39,860 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 16:55:39,861 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 16:55:39,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:39,862 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-14 16:55:39,863 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-14 16:55:39,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:39,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:39,863 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 16:55:39,863 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 16:55:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:39,865 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-14 16:55:39,865 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-14 16:55:39,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:39,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:39,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:39,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:55:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-14 16:55:39,867 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 29 [2018-11-14 16:55:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:39,868 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-14 16:55:39,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:55:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-14 16:55:39,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:55:39,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:39,869 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:39,869 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:39,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1097965124, now seen corresponding path program 8 times [2018-11-14 16:55:39,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:39,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:39,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:40,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID [2018-11-14 16:55:40,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {1938#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1938#true} is VALID [2018-11-14 16:55:40,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {1938#true} assume true; {1938#true} is VALID [2018-11-14 16:55:40,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1938#true} {1938#true} #50#return; {1938#true} is VALID [2018-11-14 16:55:40,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {1938#true} call #t~ret2 := main(); {1938#true} is VALID [2018-11-14 16:55:40,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {1938#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1940#(= main_~i~0 0)} is VALID [2018-11-14 16:55:40,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {1940#(= main_~i~0 0)} assume true; {1940#(= main_~i~0 0)} is VALID [2018-11-14 16:55:40,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {1940#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1941#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:40,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {1941#(<= main_~i~0 1)} assume true; {1941#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:40,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {1941#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1942#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:40,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {1942#(<= main_~i~0 2)} assume true; {1942#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:40,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {1942#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1943#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:40,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {1943#(<= main_~i~0 3)} assume true; {1943#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:40,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {1943#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1944#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:40,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {1944#(<= main_~i~0 4)} assume true; {1944#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:40,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {1944#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1945#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:40,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {1945#(<= main_~i~0 5)} assume true; {1945#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:40,096 INFO L273 TraceCheckUtils]: 17: Hoare triple {1945#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1946#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:40,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {1946#(<= main_~i~0 6)} assume true; {1946#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:40,097 INFO L273 TraceCheckUtils]: 19: Hoare triple {1946#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1947#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:40,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {1947#(<= main_~i~0 7)} assume true; {1947#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:40,099 INFO L273 TraceCheckUtils]: 21: Hoare triple {1947#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1948#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:40,099 INFO L273 TraceCheckUtils]: 22: Hoare triple {1948#(<= main_~i~0 8)} assume true; {1948#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:40,100 INFO L273 TraceCheckUtils]: 23: Hoare triple {1948#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1939#false} is VALID [2018-11-14 16:55:40,100 INFO L273 TraceCheckUtils]: 24: Hoare triple {1939#false} havoc ~x~0;~x~0 := 0; {1939#false} is VALID [2018-11-14 16:55:40,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {1939#false} assume true; {1939#false} is VALID [2018-11-14 16:55:40,101 INFO L273 TraceCheckUtils]: 26: Hoare triple {1939#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1939#false} is VALID [2018-11-14 16:55:40,101 INFO L256 TraceCheckUtils]: 27: Hoare triple {1939#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1939#false} is VALID [2018-11-14 16:55:40,101 INFO L273 TraceCheckUtils]: 28: Hoare triple {1939#false} ~cond := #in~cond; {1939#false} is VALID [2018-11-14 16:55:40,102 INFO L273 TraceCheckUtils]: 29: Hoare triple {1939#false} assume ~cond == 0; {1939#false} is VALID [2018-11-14 16:55:40,102 INFO L273 TraceCheckUtils]: 30: Hoare triple {1939#false} assume !false; {1939#false} is VALID [2018-11-14 16:55:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:40,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:40,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:40,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:55:40,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:55:40,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:40,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:40,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID [2018-11-14 16:55:40,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {1938#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1938#true} is VALID [2018-11-14 16:55:40,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {1938#true} assume true; {1938#true} is VALID [2018-11-14 16:55:40,973 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1938#true} {1938#true} #50#return; {1938#true} is VALID [2018-11-14 16:55:40,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {1938#true} call #t~ret2 := main(); {1938#true} is VALID [2018-11-14 16:55:40,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {1938#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1967#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:40,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {1967#(<= main_~i~0 0)} assume true; {1967#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:40,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {1967#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1941#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:40,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {1941#(<= main_~i~0 1)} assume true; {1941#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:40,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {1941#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1942#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:40,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {1942#(<= main_~i~0 2)} assume true; {1942#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:40,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {1942#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1943#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:40,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {1943#(<= main_~i~0 3)} assume true; {1943#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:40,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {1943#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1944#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:41,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {1944#(<= main_~i~0 4)} assume true; {1944#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:41,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {1944#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1945#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:41,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {1945#(<= main_~i~0 5)} assume true; {1945#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:41,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {1945#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1946#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:41,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {1946#(<= main_~i~0 6)} assume true; {1946#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:41,014 INFO L273 TraceCheckUtils]: 19: Hoare triple {1946#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1947#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:41,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {1947#(<= main_~i~0 7)} assume true; {1947#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:41,015 INFO L273 TraceCheckUtils]: 21: Hoare triple {1947#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1948#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:41,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {1948#(<= main_~i~0 8)} assume true; {1948#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:41,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {1948#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1939#false} is VALID [2018-11-14 16:55:41,016 INFO L273 TraceCheckUtils]: 24: Hoare triple {1939#false} havoc ~x~0;~x~0 := 0; {1939#false} is VALID [2018-11-14 16:55:41,017 INFO L273 TraceCheckUtils]: 25: Hoare triple {1939#false} assume true; {1939#false} is VALID [2018-11-14 16:55:41,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {1939#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1939#false} is VALID [2018-11-14 16:55:41,017 INFO L256 TraceCheckUtils]: 27: Hoare triple {1939#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1939#false} is VALID [2018-11-14 16:55:41,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {1939#false} ~cond := #in~cond; {1939#false} is VALID [2018-11-14 16:55:41,017 INFO L273 TraceCheckUtils]: 29: Hoare triple {1939#false} assume ~cond == 0; {1939#false} is VALID [2018-11-14 16:55:41,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {1939#false} assume !false; {1939#false} is VALID [2018-11-14 16:55:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:41,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:41,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:55:41,041 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 16:55:41,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:41,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:55:41,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:41,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:55:41,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:55:41,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:55:41,113 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2018-11-14 16:55:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:41,555 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-14 16:55:41,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:55:41,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 16:55:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:55:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2018-11-14 16:55:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:55:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2018-11-14 16:55:41,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2018-11-14 16:55:41,608 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-14 16:55:41,609 INFO L225 Difference]: With dead ends: 50 [2018-11-14 16:55:41,609 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 16:55:41,610 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:55:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 16:55:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-14 16:55:41,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:41,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-14 16:55:41,636 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 16:55:41,637 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 16:55:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:41,638 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-14 16:55:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-14 16:55:41,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:41,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:41,638 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 16:55:41,639 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 16:55:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:41,640 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-14 16:55:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-14 16:55:41,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:41,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:41,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:41,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:55:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-14 16:55:41,642 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 31 [2018-11-14 16:55:41,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:41,642 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-14 16:55:41,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:55:41,642 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-14 16:55:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 16:55:41,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:41,643 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:41,643 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:41,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:41,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1429410658, now seen corresponding path program 9 times [2018-11-14 16:55:41,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:41,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:41,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:41,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:41,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:41,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {2243#true} call ULTIMATE.init(); {2243#true} is VALID [2018-11-14 16:55:41,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {2243#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2243#true} is VALID [2018-11-14 16:55:41,863 INFO L273 TraceCheckUtils]: 2: Hoare triple {2243#true} assume true; {2243#true} is VALID [2018-11-14 16:55:41,863 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2243#true} {2243#true} #50#return; {2243#true} is VALID [2018-11-14 16:55:41,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {2243#true} call #t~ret2 := main(); {2243#true} is VALID [2018-11-14 16:55:41,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {2243#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2245#(= main_~i~0 0)} is VALID [2018-11-14 16:55:41,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {2245#(= main_~i~0 0)} assume true; {2245#(= main_~i~0 0)} is VALID [2018-11-14 16:55:41,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {2245#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2246#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:41,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {2246#(<= main_~i~0 1)} assume true; {2246#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:41,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {2246#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2247#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:41,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {2247#(<= main_~i~0 2)} assume true; {2247#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:41,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {2247#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2248#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:41,868 INFO L273 TraceCheckUtils]: 12: Hoare triple {2248#(<= main_~i~0 3)} assume true; {2248#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:41,869 INFO L273 TraceCheckUtils]: 13: Hoare triple {2248#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2249#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:41,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {2249#(<= main_~i~0 4)} assume true; {2249#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:41,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {2249#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2250#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:41,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {2250#(<= main_~i~0 5)} assume true; {2250#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:41,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {2250#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2251#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:41,873 INFO L273 TraceCheckUtils]: 18: Hoare triple {2251#(<= main_~i~0 6)} assume true; {2251#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:41,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {2251#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2252#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:41,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {2252#(<= main_~i~0 7)} assume true; {2252#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:41,875 INFO L273 TraceCheckUtils]: 21: Hoare triple {2252#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2253#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:41,876 INFO L273 TraceCheckUtils]: 22: Hoare triple {2253#(<= main_~i~0 8)} assume true; {2253#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:41,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {2253#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2254#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:41,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {2254#(<= main_~i~0 9)} assume true; {2254#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:41,878 INFO L273 TraceCheckUtils]: 25: Hoare triple {2254#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2244#false} is VALID [2018-11-14 16:55:41,878 INFO L273 TraceCheckUtils]: 26: Hoare triple {2244#false} havoc ~x~0;~x~0 := 0; {2244#false} is VALID [2018-11-14 16:55:41,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {2244#false} assume true; {2244#false} is VALID [2018-11-14 16:55:41,879 INFO L273 TraceCheckUtils]: 28: Hoare triple {2244#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2244#false} is VALID [2018-11-14 16:55:41,879 INFO L256 TraceCheckUtils]: 29: Hoare triple {2244#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2244#false} is VALID [2018-11-14 16:55:41,879 INFO L273 TraceCheckUtils]: 30: Hoare triple {2244#false} ~cond := #in~cond; {2244#false} is VALID [2018-11-14 16:55:41,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {2244#false} assume ~cond == 0; {2244#false} is VALID [2018-11-14 16:55:41,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {2244#false} assume !false; {2244#false} is VALID [2018-11-14 16:55:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:41,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:41,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:41,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:55:41,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 16:55:41,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:41,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:42,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {2243#true} call ULTIMATE.init(); {2243#true} is VALID [2018-11-14 16:55:42,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {2243#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2243#true} is VALID [2018-11-14 16:55:42,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {2243#true} assume true; {2243#true} is VALID [2018-11-14 16:55:42,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2243#true} {2243#true} #50#return; {2243#true} is VALID [2018-11-14 16:55:42,068 INFO L256 TraceCheckUtils]: 4: Hoare triple {2243#true} call #t~ret2 := main(); {2243#true} is VALID [2018-11-14 16:55:42,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {2243#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2273#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:42,074 INFO L273 TraceCheckUtils]: 6: Hoare triple {2273#(<= main_~i~0 0)} assume true; {2273#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:42,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {2273#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2246#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:42,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {2246#(<= main_~i~0 1)} assume true; {2246#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:42,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {2246#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2247#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:42,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {2247#(<= main_~i~0 2)} assume true; {2247#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:42,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {2247#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2248#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:42,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {2248#(<= main_~i~0 3)} assume true; {2248#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:42,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {2248#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2249#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:42,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {2249#(<= main_~i~0 4)} assume true; {2249#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:42,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {2249#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2250#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:42,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {2250#(<= main_~i~0 5)} assume true; {2250#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:42,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {2250#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2251#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:42,080 INFO L273 TraceCheckUtils]: 18: Hoare triple {2251#(<= main_~i~0 6)} assume true; {2251#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:42,081 INFO L273 TraceCheckUtils]: 19: Hoare triple {2251#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2252#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:42,082 INFO L273 TraceCheckUtils]: 20: Hoare triple {2252#(<= main_~i~0 7)} assume true; {2252#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:42,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {2252#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2253#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:42,083 INFO L273 TraceCheckUtils]: 22: Hoare triple {2253#(<= main_~i~0 8)} assume true; {2253#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:42,084 INFO L273 TraceCheckUtils]: 23: Hoare triple {2253#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2254#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:42,085 INFO L273 TraceCheckUtils]: 24: Hoare triple {2254#(<= main_~i~0 9)} assume true; {2254#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:42,085 INFO L273 TraceCheckUtils]: 25: Hoare triple {2254#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2244#false} is VALID [2018-11-14 16:55:42,086 INFO L273 TraceCheckUtils]: 26: Hoare triple {2244#false} havoc ~x~0;~x~0 := 0; {2244#false} is VALID [2018-11-14 16:55:42,086 INFO L273 TraceCheckUtils]: 27: Hoare triple {2244#false} assume true; {2244#false} is VALID [2018-11-14 16:55:42,086 INFO L273 TraceCheckUtils]: 28: Hoare triple {2244#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2244#false} is VALID [2018-11-14 16:55:42,086 INFO L256 TraceCheckUtils]: 29: Hoare triple {2244#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2244#false} is VALID [2018-11-14 16:55:42,086 INFO L273 TraceCheckUtils]: 30: Hoare triple {2244#false} ~cond := #in~cond; {2244#false} is VALID [2018-11-14 16:55:42,087 INFO L273 TraceCheckUtils]: 31: Hoare triple {2244#false} assume ~cond == 0; {2244#false} is VALID [2018-11-14 16:55:42,087 INFO L273 TraceCheckUtils]: 32: Hoare triple {2244#false} assume !false; {2244#false} is VALID [2018-11-14 16:55:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:42,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:42,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 16:55:42,110 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-14 16:55:42,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:42,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 16:55:42,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:42,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 16:55:42,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 16:55:42,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:55:42,142 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 13 states. [2018-11-14 16:55:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:42,461 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-14 16:55:42,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:55:42,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-14 16:55:42,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:55:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2018-11-14 16:55:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:55:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2018-11-14 16:55:42,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 54 transitions. [2018-11-14 16:55:42,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:42,526 INFO L225 Difference]: With dead ends: 52 [2018-11-14 16:55:42,526 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 16:55:42,527 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:55:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 16:55:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 16:55:42,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:42,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 16:55:42,550 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 16:55:42,550 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 16:55:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:42,551 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-14 16:55:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-14 16:55:42,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:42,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:42,552 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 16:55:42,553 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 16:55:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:42,554 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-14 16:55:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-14 16:55:42,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:42,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:42,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:42,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 16:55:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-14 16:55:42,555 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 33 [2018-11-14 16:55:42,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:42,556 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-14 16:55:42,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 16:55:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-14 16:55:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 16:55:42,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:42,557 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:42,557 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:42,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:42,557 INFO L82 PathProgramCache]: Analyzing trace with hash 713952376, now seen corresponding path program 10 times [2018-11-14 16:55:42,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:42,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:42,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:42,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:42,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:42,803 INFO L256 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2565#true} is VALID [2018-11-14 16:55:42,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {2565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2565#true} is VALID [2018-11-14 16:55:42,804 INFO L273 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2018-11-14 16:55:42,804 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #50#return; {2565#true} is VALID [2018-11-14 16:55:42,804 INFO L256 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret2 := main(); {2565#true} is VALID [2018-11-14 16:55:42,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {2565#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2567#(= main_~i~0 0)} is VALID [2018-11-14 16:55:42,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {2567#(= main_~i~0 0)} assume true; {2567#(= main_~i~0 0)} is VALID [2018-11-14 16:55:42,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {2567#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2568#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:42,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {2568#(<= main_~i~0 1)} assume true; {2568#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:42,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {2568#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2569#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:42,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {2569#(<= main_~i~0 2)} assume true; {2569#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:42,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {2569#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2570#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:42,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {2570#(<= main_~i~0 3)} assume true; {2570#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:42,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {2570#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2571#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:42,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {2571#(<= main_~i~0 4)} assume true; {2571#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:42,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {2571#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2572#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:42,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {2572#(<= main_~i~0 5)} assume true; {2572#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:42,812 INFO L273 TraceCheckUtils]: 17: Hoare triple {2572#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2573#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:42,813 INFO L273 TraceCheckUtils]: 18: Hoare triple {2573#(<= main_~i~0 6)} assume true; {2573#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:42,813 INFO L273 TraceCheckUtils]: 19: Hoare triple {2573#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2574#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:42,814 INFO L273 TraceCheckUtils]: 20: Hoare triple {2574#(<= main_~i~0 7)} assume true; {2574#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:42,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {2574#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2575#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:42,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {2575#(<= main_~i~0 8)} assume true; {2575#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:42,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {2575#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2576#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:42,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {2576#(<= main_~i~0 9)} assume true; {2576#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:42,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {2576#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2577#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:42,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {2577#(<= main_~i~0 10)} assume true; {2577#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:42,858 INFO L273 TraceCheckUtils]: 27: Hoare triple {2577#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2566#false} is VALID [2018-11-14 16:55:42,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {2566#false} havoc ~x~0;~x~0 := 0; {2566#false} is VALID [2018-11-14 16:55:42,858 INFO L273 TraceCheckUtils]: 29: Hoare triple {2566#false} assume true; {2566#false} is VALID [2018-11-14 16:55:42,858 INFO L273 TraceCheckUtils]: 30: Hoare triple {2566#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2566#false} is VALID [2018-11-14 16:55:42,858 INFO L256 TraceCheckUtils]: 31: Hoare triple {2566#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2566#false} is VALID [2018-11-14 16:55:42,858 INFO L273 TraceCheckUtils]: 32: Hoare triple {2566#false} ~cond := #in~cond; {2566#false} is VALID [2018-11-14 16:55:42,859 INFO L273 TraceCheckUtils]: 33: Hoare triple {2566#false} assume ~cond == 0; {2566#false} is VALID [2018-11-14 16:55:42,859 INFO L273 TraceCheckUtils]: 34: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2018-11-14 16:55:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:42,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:42,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:42,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:55:42,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:55:42,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:42,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:43,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2565#true} is VALID [2018-11-14 16:55:43,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {2565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2565#true} is VALID [2018-11-14 16:55:43,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2018-11-14 16:55:43,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #50#return; {2565#true} is VALID [2018-11-14 16:55:43,141 INFO L256 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret2 := main(); {2565#true} is VALID [2018-11-14 16:55:43,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {2565#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2596#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:43,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {2596#(<= main_~i~0 0)} assume true; {2596#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:43,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {2596#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2568#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:43,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {2568#(<= main_~i~0 1)} assume true; {2568#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:43,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {2568#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2569#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:43,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {2569#(<= main_~i~0 2)} assume true; {2569#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:43,149 INFO L273 TraceCheckUtils]: 11: Hoare triple {2569#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2570#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:43,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {2570#(<= main_~i~0 3)} assume true; {2570#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:43,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {2570#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2571#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:43,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {2571#(<= main_~i~0 4)} assume true; {2571#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:43,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {2571#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2572#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:43,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {2572#(<= main_~i~0 5)} assume true; {2572#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:43,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {2572#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2573#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:43,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {2573#(<= main_~i~0 6)} assume true; {2573#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:43,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {2573#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2574#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:43,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {2574#(<= main_~i~0 7)} assume true; {2574#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:43,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {2574#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2575#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:43,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {2575#(<= main_~i~0 8)} assume true; {2575#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:43,160 INFO L273 TraceCheckUtils]: 23: Hoare triple {2575#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2576#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:43,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {2576#(<= main_~i~0 9)} assume true; {2576#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:43,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {2576#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2577#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:43,163 INFO L273 TraceCheckUtils]: 26: Hoare triple {2577#(<= main_~i~0 10)} assume true; {2577#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:43,163 INFO L273 TraceCheckUtils]: 27: Hoare triple {2577#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2566#false} is VALID [2018-11-14 16:55:43,164 INFO L273 TraceCheckUtils]: 28: Hoare triple {2566#false} havoc ~x~0;~x~0 := 0; {2566#false} is VALID [2018-11-14 16:55:43,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {2566#false} assume true; {2566#false} is VALID [2018-11-14 16:55:43,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {2566#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2566#false} is VALID [2018-11-14 16:55:43,164 INFO L256 TraceCheckUtils]: 31: Hoare triple {2566#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2566#false} is VALID [2018-11-14 16:55:43,165 INFO L273 TraceCheckUtils]: 32: Hoare triple {2566#false} ~cond := #in~cond; {2566#false} is VALID [2018-11-14 16:55:43,165 INFO L273 TraceCheckUtils]: 33: Hoare triple {2566#false} assume ~cond == 0; {2566#false} is VALID [2018-11-14 16:55:43,165 INFO L273 TraceCheckUtils]: 34: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2018-11-14 16:55:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:43,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:43,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 16:55:43,189 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-14 16:55:43,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:43,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:55:43,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:43,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:55:43,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:55:43,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:55:43,245 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 14 states. [2018-11-14 16:55:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:43,363 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-14 16:55:43,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:55:43,363 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-14 16:55:43,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:55:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-14 16:55:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:55:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-14 16:55:43,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2018-11-14 16:55:43,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:43,430 INFO L225 Difference]: With dead ends: 54 [2018-11-14 16:55:43,430 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 16:55:43,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:55:43,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 16:55:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 16:55:43,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:43,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 16:55:43,445 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 16:55:43,445 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 16:55:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:43,446 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-14 16:55:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-14 16:55:43,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:43,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:43,447 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 16:55:43,447 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 16:55:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:43,448 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-14 16:55:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-14 16:55:43,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:43,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:43,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:43,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 16:55:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-14 16:55:43,450 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 35 [2018-11-14 16:55:43,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:43,450 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-14 16:55:43,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:55:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-14 16:55:43,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 16:55:43,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:43,451 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:43,451 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:43,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:43,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1098474030, now seen corresponding path program 11 times [2018-11-14 16:55:43,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:43,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:43,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:43,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:43,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:43,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {2904#true} call ULTIMATE.init(); {2904#true} is VALID [2018-11-14 16:55:43,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {2904#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2904#true} is VALID [2018-11-14 16:55:43,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {2904#true} assume true; {2904#true} is VALID [2018-11-14 16:55:43,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2904#true} {2904#true} #50#return; {2904#true} is VALID [2018-11-14 16:55:43,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {2904#true} call #t~ret2 := main(); {2904#true} is VALID [2018-11-14 16:55:43,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {2904#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2906#(= main_~i~0 0)} is VALID [2018-11-14 16:55:43,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {2906#(= main_~i~0 0)} assume true; {2906#(= main_~i~0 0)} is VALID [2018-11-14 16:55:43,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {2906#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2907#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:43,776 INFO L273 TraceCheckUtils]: 8: Hoare triple {2907#(<= main_~i~0 1)} assume true; {2907#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:43,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {2907#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2908#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:43,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {2908#(<= main_~i~0 2)} assume true; {2908#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:43,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {2908#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2909#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:43,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {2909#(<= main_~i~0 3)} assume true; {2909#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:43,779 INFO L273 TraceCheckUtils]: 13: Hoare triple {2909#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2910#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:43,780 INFO L273 TraceCheckUtils]: 14: Hoare triple {2910#(<= main_~i~0 4)} assume true; {2910#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:43,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {2910#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2911#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:43,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {2911#(<= main_~i~0 5)} assume true; {2911#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:43,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {2911#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2912#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:43,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {2912#(<= main_~i~0 6)} assume true; {2912#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:43,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {2912#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2913#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:43,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {2913#(<= main_~i~0 7)} assume true; {2913#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:43,785 INFO L273 TraceCheckUtils]: 21: Hoare triple {2913#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2914#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:43,786 INFO L273 TraceCheckUtils]: 22: Hoare triple {2914#(<= main_~i~0 8)} assume true; {2914#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:43,787 INFO L273 TraceCheckUtils]: 23: Hoare triple {2914#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2915#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:43,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {2915#(<= main_~i~0 9)} assume true; {2915#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:43,788 INFO L273 TraceCheckUtils]: 25: Hoare triple {2915#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2916#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:43,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {2916#(<= main_~i~0 10)} assume true; {2916#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:43,790 INFO L273 TraceCheckUtils]: 27: Hoare triple {2916#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2917#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:43,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {2917#(<= main_~i~0 11)} assume true; {2917#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:43,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {2917#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2905#false} is VALID [2018-11-14 16:55:43,791 INFO L273 TraceCheckUtils]: 30: Hoare triple {2905#false} havoc ~x~0;~x~0 := 0; {2905#false} is VALID [2018-11-14 16:55:43,791 INFO L273 TraceCheckUtils]: 31: Hoare triple {2905#false} assume true; {2905#false} is VALID [2018-11-14 16:55:43,792 INFO L273 TraceCheckUtils]: 32: Hoare triple {2905#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2905#false} is VALID [2018-11-14 16:55:43,792 INFO L256 TraceCheckUtils]: 33: Hoare triple {2905#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2905#false} is VALID [2018-11-14 16:55:43,792 INFO L273 TraceCheckUtils]: 34: Hoare triple {2905#false} ~cond := #in~cond; {2905#false} is VALID [2018-11-14 16:55:43,792 INFO L273 TraceCheckUtils]: 35: Hoare triple {2905#false} assume ~cond == 0; {2905#false} is VALID [2018-11-14 16:55:43,792 INFO L273 TraceCheckUtils]: 36: Hoare triple {2905#false} assume !false; {2905#false} is VALID [2018-11-14 16:55:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:43,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:43,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:43,802 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:55:43,966 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 16:55:43,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:43,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:44,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {2904#true} call ULTIMATE.init(); {2904#true} is VALID [2018-11-14 16:55:44,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {2904#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2904#true} is VALID [2018-11-14 16:55:44,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {2904#true} assume true; {2904#true} is VALID [2018-11-14 16:55:44,100 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2904#true} {2904#true} #50#return; {2904#true} is VALID [2018-11-14 16:55:44,101 INFO L256 TraceCheckUtils]: 4: Hoare triple {2904#true} call #t~ret2 := main(); {2904#true} is VALID [2018-11-14 16:55:44,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {2904#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2936#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:44,102 INFO L273 TraceCheckUtils]: 6: Hoare triple {2936#(<= main_~i~0 0)} assume true; {2936#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:44,103 INFO L273 TraceCheckUtils]: 7: Hoare triple {2936#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2907#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:44,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {2907#(<= main_~i~0 1)} assume true; {2907#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:44,104 INFO L273 TraceCheckUtils]: 9: Hoare triple {2907#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2908#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:44,104 INFO L273 TraceCheckUtils]: 10: Hoare triple {2908#(<= main_~i~0 2)} assume true; {2908#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:44,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {2908#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2909#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:44,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {2909#(<= main_~i~0 3)} assume true; {2909#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:44,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {2909#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2910#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:44,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {2910#(<= main_~i~0 4)} assume true; {2910#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:44,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {2910#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2911#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:44,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {2911#(<= main_~i~0 5)} assume true; {2911#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:44,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {2911#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2912#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:44,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {2912#(<= main_~i~0 6)} assume true; {2912#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:44,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {2912#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2913#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:44,113 INFO L273 TraceCheckUtils]: 20: Hoare triple {2913#(<= main_~i~0 7)} assume true; {2913#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:44,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {2913#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2914#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:44,114 INFO L273 TraceCheckUtils]: 22: Hoare triple {2914#(<= main_~i~0 8)} assume true; {2914#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:44,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {2914#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2915#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:44,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {2915#(<= main_~i~0 9)} assume true; {2915#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:44,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {2915#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2916#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:44,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {2916#(<= main_~i~0 10)} assume true; {2916#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:44,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {2916#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2917#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:44,119 INFO L273 TraceCheckUtils]: 28: Hoare triple {2917#(<= main_~i~0 11)} assume true; {2917#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:44,120 INFO L273 TraceCheckUtils]: 29: Hoare triple {2917#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2905#false} is VALID [2018-11-14 16:55:44,120 INFO L273 TraceCheckUtils]: 30: Hoare triple {2905#false} havoc ~x~0;~x~0 := 0; {2905#false} is VALID [2018-11-14 16:55:44,121 INFO L273 TraceCheckUtils]: 31: Hoare triple {2905#false} assume true; {2905#false} is VALID [2018-11-14 16:55:44,121 INFO L273 TraceCheckUtils]: 32: Hoare triple {2905#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2905#false} is VALID [2018-11-14 16:55:44,121 INFO L256 TraceCheckUtils]: 33: Hoare triple {2905#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2905#false} is VALID [2018-11-14 16:55:44,122 INFO L273 TraceCheckUtils]: 34: Hoare triple {2905#false} ~cond := #in~cond; {2905#false} is VALID [2018-11-14 16:55:44,122 INFO L273 TraceCheckUtils]: 35: Hoare triple {2905#false} assume ~cond == 0; {2905#false} is VALID [2018-11-14 16:55:44,122 INFO L273 TraceCheckUtils]: 36: Hoare triple {2905#false} assume !false; {2905#false} is VALID [2018-11-14 16:55:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:44,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:44,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 16:55:44,146 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-14 16:55:44,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:44,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:55:44,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:44,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:55:44,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:55:44,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:55:44,186 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 15 states. [2018-11-14 16:55:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:44,329 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-14 16:55:44,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:55:44,329 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-14 16:55:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:55:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2018-11-14 16:55:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:55:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2018-11-14 16:55:44,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 58 transitions. [2018-11-14 16:55:44,384 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-14 16:55:44,385 INFO L225 Difference]: With dead ends: 56 [2018-11-14 16:55:44,385 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 16:55:44,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:55:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 16:55:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 16:55:44,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:44,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 16:55:44,409 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 16:55:44,409 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 16:55:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:44,410 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-14 16:55:44,410 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-14 16:55:44,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:44,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:44,411 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 16:55:44,411 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 16:55:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:44,412 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-14 16:55:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-14 16:55:44,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:44,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:44,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:44,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:55:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-14 16:55:44,413 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 37 [2018-11-14 16:55:44,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:44,413 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-14 16:55:44,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:55:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-14 16:55:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 16:55:44,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:44,414 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:44,414 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:44,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash 916471980, now seen corresponding path program 12 times [2018-11-14 16:55:44,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:44,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:44,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:44,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {3260#true} call ULTIMATE.init(); {3260#true} is VALID [2018-11-14 16:55:44,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {3260#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3260#true} is VALID [2018-11-14 16:55:44,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {3260#true} assume true; {3260#true} is VALID [2018-11-14 16:55:44,656 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3260#true} {3260#true} #50#return; {3260#true} is VALID [2018-11-14 16:55:44,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {3260#true} call #t~ret2 := main(); {3260#true} is VALID [2018-11-14 16:55:44,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {3260#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3262#(= main_~i~0 0)} is VALID [2018-11-14 16:55:44,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {3262#(= main_~i~0 0)} assume true; {3262#(= main_~i~0 0)} is VALID [2018-11-14 16:55:44,658 INFO L273 TraceCheckUtils]: 7: Hoare triple {3262#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3263#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:44,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {3263#(<= main_~i~0 1)} assume true; {3263#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:44,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {3263#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3264#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:44,660 INFO L273 TraceCheckUtils]: 10: Hoare triple {3264#(<= main_~i~0 2)} assume true; {3264#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:44,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {3264#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3265#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:44,661 INFO L273 TraceCheckUtils]: 12: Hoare triple {3265#(<= main_~i~0 3)} assume true; {3265#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:44,662 INFO L273 TraceCheckUtils]: 13: Hoare triple {3265#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3266#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:44,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {3266#(<= main_~i~0 4)} assume true; {3266#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:44,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {3266#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3267#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:44,663 INFO L273 TraceCheckUtils]: 16: Hoare triple {3267#(<= main_~i~0 5)} assume true; {3267#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:44,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {3267#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3268#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:44,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {3268#(<= main_~i~0 6)} assume true; {3268#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:44,666 INFO L273 TraceCheckUtils]: 19: Hoare triple {3268#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3269#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:44,666 INFO L273 TraceCheckUtils]: 20: Hoare triple {3269#(<= main_~i~0 7)} assume true; {3269#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:44,667 INFO L273 TraceCheckUtils]: 21: Hoare triple {3269#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3270#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:44,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {3270#(<= main_~i~0 8)} assume true; {3270#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:44,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {3270#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3271#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:44,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {3271#(<= main_~i~0 9)} assume true; {3271#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:44,670 INFO L273 TraceCheckUtils]: 25: Hoare triple {3271#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3272#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:44,671 INFO L273 TraceCheckUtils]: 26: Hoare triple {3272#(<= main_~i~0 10)} assume true; {3272#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:44,672 INFO L273 TraceCheckUtils]: 27: Hoare triple {3272#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:44,672 INFO L273 TraceCheckUtils]: 28: Hoare triple {3273#(<= main_~i~0 11)} assume true; {3273#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:44,673 INFO L273 TraceCheckUtils]: 29: Hoare triple {3273#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:44,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {3274#(<= main_~i~0 12)} assume true; {3274#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:44,675 INFO L273 TraceCheckUtils]: 31: Hoare triple {3274#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3261#false} is VALID [2018-11-14 16:55:44,675 INFO L273 TraceCheckUtils]: 32: Hoare triple {3261#false} havoc ~x~0;~x~0 := 0; {3261#false} is VALID [2018-11-14 16:55:44,675 INFO L273 TraceCheckUtils]: 33: Hoare triple {3261#false} assume true; {3261#false} is VALID [2018-11-14 16:55:44,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {3261#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3261#false} is VALID [2018-11-14 16:55:44,676 INFO L256 TraceCheckUtils]: 35: Hoare triple {3261#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {3261#false} is VALID [2018-11-14 16:55:44,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {3261#false} ~cond := #in~cond; {3261#false} is VALID [2018-11-14 16:55:44,676 INFO L273 TraceCheckUtils]: 37: Hoare triple {3261#false} assume ~cond == 0; {3261#false} is VALID [2018-11-14 16:55:44,676 INFO L273 TraceCheckUtils]: 38: Hoare triple {3261#false} assume !false; {3261#false} is VALID [2018-11-14 16:55:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:44,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:44,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:44,696 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:55:44,789 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 16:55:44,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:44,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:44,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {3260#true} call ULTIMATE.init(); {3260#true} is VALID [2018-11-14 16:55:44,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {3260#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3260#true} is VALID [2018-11-14 16:55:44,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {3260#true} assume true; {3260#true} is VALID [2018-11-14 16:55:44,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3260#true} {3260#true} #50#return; {3260#true} is VALID [2018-11-14 16:55:44,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {3260#true} call #t~ret2 := main(); {3260#true} is VALID [2018-11-14 16:55:44,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {3260#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3293#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:44,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {3293#(<= main_~i~0 0)} assume true; {3293#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:44,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {3293#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3263#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:44,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {3263#(<= main_~i~0 1)} assume true; {3263#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:44,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {3263#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3264#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:44,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {3264#(<= main_~i~0 2)} assume true; {3264#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:44,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {3264#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3265#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:44,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {3265#(<= main_~i~0 3)} assume true; {3265#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:44,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {3265#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3266#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:44,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {3266#(<= main_~i~0 4)} assume true; {3266#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:44,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {3266#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3267#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:44,980 INFO L273 TraceCheckUtils]: 16: Hoare triple {3267#(<= main_~i~0 5)} assume true; {3267#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:44,981 INFO L273 TraceCheckUtils]: 17: Hoare triple {3267#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3268#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:44,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {3268#(<= main_~i~0 6)} assume true; {3268#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:44,982 INFO L273 TraceCheckUtils]: 19: Hoare triple {3268#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3269#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:44,982 INFO L273 TraceCheckUtils]: 20: Hoare triple {3269#(<= main_~i~0 7)} assume true; {3269#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:44,983 INFO L273 TraceCheckUtils]: 21: Hoare triple {3269#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3270#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:44,984 INFO L273 TraceCheckUtils]: 22: Hoare triple {3270#(<= main_~i~0 8)} assume true; {3270#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:44,985 INFO L273 TraceCheckUtils]: 23: Hoare triple {3270#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3271#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:44,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {3271#(<= main_~i~0 9)} assume true; {3271#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:44,986 INFO L273 TraceCheckUtils]: 25: Hoare triple {3271#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3272#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:44,987 INFO L273 TraceCheckUtils]: 26: Hoare triple {3272#(<= main_~i~0 10)} assume true; {3272#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:44,987 INFO L273 TraceCheckUtils]: 27: Hoare triple {3272#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:44,988 INFO L273 TraceCheckUtils]: 28: Hoare triple {3273#(<= main_~i~0 11)} assume true; {3273#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:44,989 INFO L273 TraceCheckUtils]: 29: Hoare triple {3273#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:44,989 INFO L273 TraceCheckUtils]: 30: Hoare triple {3274#(<= main_~i~0 12)} assume true; {3274#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:44,990 INFO L273 TraceCheckUtils]: 31: Hoare triple {3274#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3261#false} is VALID [2018-11-14 16:55:44,990 INFO L273 TraceCheckUtils]: 32: Hoare triple {3261#false} havoc ~x~0;~x~0 := 0; {3261#false} is VALID [2018-11-14 16:55:44,990 INFO L273 TraceCheckUtils]: 33: Hoare triple {3261#false} assume true; {3261#false} is VALID [2018-11-14 16:55:44,994 INFO L273 TraceCheckUtils]: 34: Hoare triple {3261#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3261#false} is VALID [2018-11-14 16:55:44,994 INFO L256 TraceCheckUtils]: 35: Hoare triple {3261#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {3261#false} is VALID [2018-11-14 16:55:44,994 INFO L273 TraceCheckUtils]: 36: Hoare triple {3261#false} ~cond := #in~cond; {3261#false} is VALID [2018-11-14 16:55:44,994 INFO L273 TraceCheckUtils]: 37: Hoare triple {3261#false} assume ~cond == 0; {3261#false} is VALID [2018-11-14 16:55:44,994 INFO L273 TraceCheckUtils]: 38: Hoare triple {3261#false} assume !false; {3261#false} is VALID [2018-11-14 16:55:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:45,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:45,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-14 16:55:45,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-14 16:55:45,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:45,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:55:45,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:45,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:55:45,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:55:45,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:55:45,058 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2018-11-14 16:55:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:45,263 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-14 16:55:45,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 16:55:45,263 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-14 16:55:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:55:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2018-11-14 16:55:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:55:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2018-11-14 16:55:45,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 60 transitions. [2018-11-14 16:55:45,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:45,355 INFO L225 Difference]: With dead ends: 58 [2018-11-14 16:55:45,355 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 16:55:45,356 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:55:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 16:55:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-14 16:55:45,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:45,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-14 16:55:45,383 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 16:55:45,383 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 16:55:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:45,385 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-14 16:55:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-14 16:55:45,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:45,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:45,386 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 16:55:45,386 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 16:55:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:45,387 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-14 16:55:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-14 16:55:45,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:45,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:45,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:45,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 16:55:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-14 16:55:45,390 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 39 [2018-11-14 16:55:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:45,390 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-14 16:55:45,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:55:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-14 16:55:45,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 16:55:45,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:45,391 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:45,391 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:45,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:45,392 INFO L82 PathProgramCache]: Analyzing trace with hash 249337094, now seen corresponding path program 13 times [2018-11-14 16:55:45,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:45,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:45,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:45,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:45,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:45,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {3633#true} call ULTIMATE.init(); {3633#true} is VALID [2018-11-14 16:55:45,688 INFO L273 TraceCheckUtils]: 1: Hoare triple {3633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3633#true} is VALID [2018-11-14 16:55:45,688 INFO L273 TraceCheckUtils]: 2: Hoare triple {3633#true} assume true; {3633#true} is VALID [2018-11-14 16:55:45,688 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3633#true} {3633#true} #50#return; {3633#true} is VALID [2018-11-14 16:55:45,689 INFO L256 TraceCheckUtils]: 4: Hoare triple {3633#true} call #t~ret2 := main(); {3633#true} is VALID [2018-11-14 16:55:45,689 INFO L273 TraceCheckUtils]: 5: Hoare triple {3633#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3635#(= main_~i~0 0)} is VALID [2018-11-14 16:55:45,690 INFO L273 TraceCheckUtils]: 6: Hoare triple {3635#(= main_~i~0 0)} assume true; {3635#(= main_~i~0 0)} is VALID [2018-11-14 16:55:45,691 INFO L273 TraceCheckUtils]: 7: Hoare triple {3635#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3636#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:45,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {3636#(<= main_~i~0 1)} assume true; {3636#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:45,692 INFO L273 TraceCheckUtils]: 9: Hoare triple {3636#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3637#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:45,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {3637#(<= main_~i~0 2)} assume true; {3637#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:45,694 INFO L273 TraceCheckUtils]: 11: Hoare triple {3637#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3638#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:45,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {3638#(<= main_~i~0 3)} assume true; {3638#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:45,695 INFO L273 TraceCheckUtils]: 13: Hoare triple {3638#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3639#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:45,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {3639#(<= main_~i~0 4)} assume true; {3639#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:45,697 INFO L273 TraceCheckUtils]: 15: Hoare triple {3639#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3640#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:45,697 INFO L273 TraceCheckUtils]: 16: Hoare triple {3640#(<= main_~i~0 5)} assume true; {3640#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:45,698 INFO L273 TraceCheckUtils]: 17: Hoare triple {3640#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3641#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:45,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {3641#(<= main_~i~0 6)} assume true; {3641#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:45,700 INFO L273 TraceCheckUtils]: 19: Hoare triple {3641#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3642#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:45,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {3642#(<= main_~i~0 7)} assume true; {3642#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:45,701 INFO L273 TraceCheckUtils]: 21: Hoare triple {3642#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3643#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:45,702 INFO L273 TraceCheckUtils]: 22: Hoare triple {3643#(<= main_~i~0 8)} assume true; {3643#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:45,702 INFO L273 TraceCheckUtils]: 23: Hoare triple {3643#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3644#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:45,703 INFO L273 TraceCheckUtils]: 24: Hoare triple {3644#(<= main_~i~0 9)} assume true; {3644#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:45,704 INFO L273 TraceCheckUtils]: 25: Hoare triple {3644#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3645#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:45,704 INFO L273 TraceCheckUtils]: 26: Hoare triple {3645#(<= main_~i~0 10)} assume true; {3645#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:45,705 INFO L273 TraceCheckUtils]: 27: Hoare triple {3645#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3646#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:45,706 INFO L273 TraceCheckUtils]: 28: Hoare triple {3646#(<= main_~i~0 11)} assume true; {3646#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:45,707 INFO L273 TraceCheckUtils]: 29: Hoare triple {3646#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3647#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:45,707 INFO L273 TraceCheckUtils]: 30: Hoare triple {3647#(<= main_~i~0 12)} assume true; {3647#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:45,708 INFO L273 TraceCheckUtils]: 31: Hoare triple {3647#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3648#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:45,709 INFO L273 TraceCheckUtils]: 32: Hoare triple {3648#(<= main_~i~0 13)} assume true; {3648#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:45,709 INFO L273 TraceCheckUtils]: 33: Hoare triple {3648#(<= main_~i~0 13)} assume !(~i~0 < 100000); {3634#false} is VALID [2018-11-14 16:55:45,710 INFO L273 TraceCheckUtils]: 34: Hoare triple {3634#false} havoc ~x~0;~x~0 := 0; {3634#false} is VALID [2018-11-14 16:55:45,710 INFO L273 TraceCheckUtils]: 35: Hoare triple {3634#false} assume true; {3634#false} is VALID [2018-11-14 16:55:45,710 INFO L273 TraceCheckUtils]: 36: Hoare triple {3634#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3634#false} is VALID [2018-11-14 16:55:45,710 INFO L256 TraceCheckUtils]: 37: Hoare triple {3634#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {3634#false} is VALID [2018-11-14 16:55:45,711 INFO L273 TraceCheckUtils]: 38: Hoare triple {3634#false} ~cond := #in~cond; {3634#false} is VALID [2018-11-14 16:55:45,711 INFO L273 TraceCheckUtils]: 39: Hoare triple {3634#false} assume ~cond == 0; {3634#false} is VALID [2018-11-14 16:55:45,711 INFO L273 TraceCheckUtils]: 40: Hoare triple {3634#false} assume !false; {3634#false} is VALID [2018-11-14 16:55:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:45,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:45,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:45,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:45,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:45,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {3633#true} call ULTIMATE.init(); {3633#true} is VALID [2018-11-14 16:55:45,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {3633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3633#true} is VALID [2018-11-14 16:55:45,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {3633#true} assume true; {3633#true} is VALID [2018-11-14 16:55:45,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3633#true} {3633#true} #50#return; {3633#true} is VALID [2018-11-14 16:55:45,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {3633#true} call #t~ret2 := main(); {3633#true} is VALID [2018-11-14 16:55:45,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {3633#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3667#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:45,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {3667#(<= main_~i~0 0)} assume true; {3667#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:45,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {3667#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3636#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:45,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {3636#(<= main_~i~0 1)} assume true; {3636#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:45,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {3636#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3637#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:45,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {3637#(<= main_~i~0 2)} assume true; {3637#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:45,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {3637#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3638#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:45,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {3638#(<= main_~i~0 3)} assume true; {3638#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:45,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {3638#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3639#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:45,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {3639#(<= main_~i~0 4)} assume true; {3639#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:45,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {3639#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3640#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:45,882 INFO L273 TraceCheckUtils]: 16: Hoare triple {3640#(<= main_~i~0 5)} assume true; {3640#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:45,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {3640#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3641#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:45,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {3641#(<= main_~i~0 6)} assume true; {3641#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:45,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {3641#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3642#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:45,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {3642#(<= main_~i~0 7)} assume true; {3642#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:45,886 INFO L273 TraceCheckUtils]: 21: Hoare triple {3642#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3643#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:45,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {3643#(<= main_~i~0 8)} assume true; {3643#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:45,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {3643#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3644#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:45,888 INFO L273 TraceCheckUtils]: 24: Hoare triple {3644#(<= main_~i~0 9)} assume true; {3644#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:45,889 INFO L273 TraceCheckUtils]: 25: Hoare triple {3644#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3645#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:45,890 INFO L273 TraceCheckUtils]: 26: Hoare triple {3645#(<= main_~i~0 10)} assume true; {3645#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:45,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {3645#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3646#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:45,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {3646#(<= main_~i~0 11)} assume true; {3646#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:45,892 INFO L273 TraceCheckUtils]: 29: Hoare triple {3646#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3647#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:45,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {3647#(<= main_~i~0 12)} assume true; {3647#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:45,894 INFO L273 TraceCheckUtils]: 31: Hoare triple {3647#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3648#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:45,894 INFO L273 TraceCheckUtils]: 32: Hoare triple {3648#(<= main_~i~0 13)} assume true; {3648#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:45,895 INFO L273 TraceCheckUtils]: 33: Hoare triple {3648#(<= main_~i~0 13)} assume !(~i~0 < 100000); {3634#false} is VALID [2018-11-14 16:55:45,896 INFO L273 TraceCheckUtils]: 34: Hoare triple {3634#false} havoc ~x~0;~x~0 := 0; {3634#false} is VALID [2018-11-14 16:55:45,896 INFO L273 TraceCheckUtils]: 35: Hoare triple {3634#false} assume true; {3634#false} is VALID [2018-11-14 16:55:45,896 INFO L273 TraceCheckUtils]: 36: Hoare triple {3634#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3634#false} is VALID [2018-11-14 16:55:45,897 INFO L256 TraceCheckUtils]: 37: Hoare triple {3634#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {3634#false} is VALID [2018-11-14 16:55:45,897 INFO L273 TraceCheckUtils]: 38: Hoare triple {3634#false} ~cond := #in~cond; {3634#false} is VALID [2018-11-14 16:55:45,897 INFO L273 TraceCheckUtils]: 39: Hoare triple {3634#false} assume ~cond == 0; {3634#false} is VALID [2018-11-14 16:55:45,897 INFO L273 TraceCheckUtils]: 40: Hoare triple {3634#false} assume !false; {3634#false} is VALID [2018-11-14 16:55:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:45,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:45,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 16:55:45,930 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-14 16:55:45,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:45,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:55:46,052 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-14 16:55:46,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:55:46,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:55:46,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:55:46,053 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 17 states. [2018-11-14 16:55:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:46,166 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-14 16:55:46,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:55:46,167 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-14 16:55:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:55:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 62 transitions. [2018-11-14 16:55:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:55:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 62 transitions. [2018-11-14 16:55:46,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 62 transitions. [2018-11-14 16:55:46,629 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-14 16:55:46,630 INFO L225 Difference]: With dead ends: 60 [2018-11-14 16:55:46,630 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 16:55:46,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:55:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 16:55:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-14 16:55:46,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:46,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-14 16:55:46,653 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 16:55:46,653 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 16:55:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:46,654 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-14 16:55:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-14 16:55:46,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:46,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:46,655 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 16:55:46,655 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 16:55:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:46,656 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-14 16:55:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-14 16:55:46,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:46,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:46,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:46,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 16:55:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-14 16:55:46,658 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 41 [2018-11-14 16:55:46,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:46,658 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-14 16:55:46,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:55:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-14 16:55:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 16:55:46,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:46,659 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:46,660 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:46,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:46,660 INFO L82 PathProgramCache]: Analyzing trace with hash -917161248, now seen corresponding path program 14 times [2018-11-14 16:55:46,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:46,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:46,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:46,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:46,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:47,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {4023#true} call ULTIMATE.init(); {4023#true} is VALID [2018-11-14 16:55:47,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {4023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4023#true} is VALID [2018-11-14 16:55:47,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {4023#true} assume true; {4023#true} is VALID [2018-11-14 16:55:47,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4023#true} {4023#true} #50#return; {4023#true} is VALID [2018-11-14 16:55:47,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {4023#true} call #t~ret2 := main(); {4023#true} is VALID [2018-11-14 16:55:47,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {4023#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4025#(= main_~i~0 0)} is VALID [2018-11-14 16:55:47,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {4025#(= main_~i~0 0)} assume true; {4025#(= main_~i~0 0)} is VALID [2018-11-14 16:55:47,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {4025#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4026#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:47,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {4026#(<= main_~i~0 1)} assume true; {4026#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:47,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {4026#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4027#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:47,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {4027#(<= main_~i~0 2)} assume true; {4027#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:47,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {4027#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4028#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:47,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {4028#(<= main_~i~0 3)} assume true; {4028#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:47,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {4028#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4029#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:47,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {4029#(<= main_~i~0 4)} assume true; {4029#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:47,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {4029#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4030#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:47,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {4030#(<= main_~i~0 5)} assume true; {4030#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:47,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {4030#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4031#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:47,563 INFO L273 TraceCheckUtils]: 18: Hoare triple {4031#(<= main_~i~0 6)} assume true; {4031#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:47,564 INFO L273 TraceCheckUtils]: 19: Hoare triple {4031#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4032#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:47,564 INFO L273 TraceCheckUtils]: 20: Hoare triple {4032#(<= main_~i~0 7)} assume true; {4032#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:47,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {4032#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4033#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:47,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {4033#(<= main_~i~0 8)} assume true; {4033#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:47,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {4033#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4034#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:47,568 INFO L273 TraceCheckUtils]: 24: Hoare triple {4034#(<= main_~i~0 9)} assume true; {4034#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:47,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {4034#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4035#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:47,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {4035#(<= main_~i~0 10)} assume true; {4035#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:47,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {4035#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4036#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:47,571 INFO L273 TraceCheckUtils]: 28: Hoare triple {4036#(<= main_~i~0 11)} assume true; {4036#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:47,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {4036#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4037#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:47,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {4037#(<= main_~i~0 12)} assume true; {4037#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:47,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {4037#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4038#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:47,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {4038#(<= main_~i~0 13)} assume true; {4038#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:47,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {4038#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4039#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:47,576 INFO L273 TraceCheckUtils]: 34: Hoare triple {4039#(<= main_~i~0 14)} assume true; {4039#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:47,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {4039#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4024#false} is VALID [2018-11-14 16:55:47,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {4024#false} havoc ~x~0;~x~0 := 0; {4024#false} is VALID [2018-11-14 16:55:47,577 INFO L273 TraceCheckUtils]: 37: Hoare triple {4024#false} assume true; {4024#false} is VALID [2018-11-14 16:55:47,577 INFO L273 TraceCheckUtils]: 38: Hoare triple {4024#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4024#false} is VALID [2018-11-14 16:55:47,578 INFO L256 TraceCheckUtils]: 39: Hoare triple {4024#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4024#false} is VALID [2018-11-14 16:55:47,578 INFO L273 TraceCheckUtils]: 40: Hoare triple {4024#false} ~cond := #in~cond; {4024#false} is VALID [2018-11-14 16:55:47,578 INFO L273 TraceCheckUtils]: 41: Hoare triple {4024#false} assume ~cond == 0; {4024#false} is VALID [2018-11-14 16:55:47,578 INFO L273 TraceCheckUtils]: 42: Hoare triple {4024#false} assume !false; {4024#false} is VALID [2018-11-14 16:55:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:47,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:47,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:47,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:55:47,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:55:47,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:47,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:47,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {4023#true} call ULTIMATE.init(); {4023#true} is VALID [2018-11-14 16:55:47,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {4023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4023#true} is VALID [2018-11-14 16:55:47,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {4023#true} assume true; {4023#true} is VALID [2018-11-14 16:55:47,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4023#true} {4023#true} #50#return; {4023#true} is VALID [2018-11-14 16:55:47,774 INFO L256 TraceCheckUtils]: 4: Hoare triple {4023#true} call #t~ret2 := main(); {4023#true} is VALID [2018-11-14 16:55:47,775 INFO L273 TraceCheckUtils]: 5: Hoare triple {4023#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4058#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:47,776 INFO L273 TraceCheckUtils]: 6: Hoare triple {4058#(<= main_~i~0 0)} assume true; {4058#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:47,776 INFO L273 TraceCheckUtils]: 7: Hoare triple {4058#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4026#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:47,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {4026#(<= main_~i~0 1)} assume true; {4026#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:47,777 INFO L273 TraceCheckUtils]: 9: Hoare triple {4026#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4027#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:47,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {4027#(<= main_~i~0 2)} assume true; {4027#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:47,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {4027#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4028#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:47,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {4028#(<= main_~i~0 3)} assume true; {4028#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:47,780 INFO L273 TraceCheckUtils]: 13: Hoare triple {4028#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4029#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:47,780 INFO L273 TraceCheckUtils]: 14: Hoare triple {4029#(<= main_~i~0 4)} assume true; {4029#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:47,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {4029#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4030#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:47,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {4030#(<= main_~i~0 5)} assume true; {4030#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:47,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {4030#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4031#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:47,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {4031#(<= main_~i~0 6)} assume true; {4031#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:47,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {4031#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4032#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:47,785 INFO L273 TraceCheckUtils]: 20: Hoare triple {4032#(<= main_~i~0 7)} assume true; {4032#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:47,786 INFO L273 TraceCheckUtils]: 21: Hoare triple {4032#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4033#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:47,786 INFO L273 TraceCheckUtils]: 22: Hoare triple {4033#(<= main_~i~0 8)} assume true; {4033#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:47,787 INFO L273 TraceCheckUtils]: 23: Hoare triple {4033#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4034#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:47,788 INFO L273 TraceCheckUtils]: 24: Hoare triple {4034#(<= main_~i~0 9)} assume true; {4034#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:47,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {4034#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4035#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:47,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {4035#(<= main_~i~0 10)} assume true; {4035#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:47,790 INFO L273 TraceCheckUtils]: 27: Hoare triple {4035#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4036#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:47,791 INFO L273 TraceCheckUtils]: 28: Hoare triple {4036#(<= main_~i~0 11)} assume true; {4036#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:47,792 INFO L273 TraceCheckUtils]: 29: Hoare triple {4036#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4037#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:47,792 INFO L273 TraceCheckUtils]: 30: Hoare triple {4037#(<= main_~i~0 12)} assume true; {4037#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:47,793 INFO L273 TraceCheckUtils]: 31: Hoare triple {4037#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4038#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:47,793 INFO L273 TraceCheckUtils]: 32: Hoare triple {4038#(<= main_~i~0 13)} assume true; {4038#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:47,794 INFO L273 TraceCheckUtils]: 33: Hoare triple {4038#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4039#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:47,795 INFO L273 TraceCheckUtils]: 34: Hoare triple {4039#(<= main_~i~0 14)} assume true; {4039#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:47,796 INFO L273 TraceCheckUtils]: 35: Hoare triple {4039#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4024#false} is VALID [2018-11-14 16:55:47,796 INFO L273 TraceCheckUtils]: 36: Hoare triple {4024#false} havoc ~x~0;~x~0 := 0; {4024#false} is VALID [2018-11-14 16:55:47,796 INFO L273 TraceCheckUtils]: 37: Hoare triple {4024#false} assume true; {4024#false} is VALID [2018-11-14 16:55:47,796 INFO L273 TraceCheckUtils]: 38: Hoare triple {4024#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4024#false} is VALID [2018-11-14 16:55:47,796 INFO L256 TraceCheckUtils]: 39: Hoare triple {4024#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4024#false} is VALID [2018-11-14 16:55:47,797 INFO L273 TraceCheckUtils]: 40: Hoare triple {4024#false} ~cond := #in~cond; {4024#false} is VALID [2018-11-14 16:55:47,797 INFO L273 TraceCheckUtils]: 41: Hoare triple {4024#false} assume ~cond == 0; {4024#false} is VALID [2018-11-14 16:55:47,797 INFO L273 TraceCheckUtils]: 42: Hoare triple {4024#false} assume !false; {4024#false} is VALID [2018-11-14 16:55:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:47,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:47,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 16:55:47,819 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-14 16:55:47,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:47,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 16:55:47,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:47,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 16:55:47,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 16:55:47,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:55:47,861 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 18 states. [2018-11-14 16:55:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:48,028 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-14 16:55:48,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:55:48,029 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-14 16:55:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:55:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2018-11-14 16:55:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:55:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2018-11-14 16:55:48,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 64 transitions. [2018-11-14 16:55:48,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:48,149 INFO L225 Difference]: With dead ends: 62 [2018-11-14 16:55:48,149 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 16:55:48,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:55:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 16:55:48,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 16:55:48,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:48,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 16:55:48,215 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 16:55:48,215 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 16:55:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:48,216 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-14 16:55:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-14 16:55:48,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:48,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:48,217 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 16:55:48,217 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 16:55:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:48,218 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-14 16:55:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-14 16:55:48,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:48,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:48,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:48,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 16:55:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-14 16:55:48,220 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 43 [2018-11-14 16:55:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:48,220 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-14 16:55:48,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 16:55:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-14 16:55:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 16:55:48,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:48,221 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:48,222 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:48,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:48,222 INFO L82 PathProgramCache]: Analyzing trace with hash -935603654, now seen corresponding path program 15 times [2018-11-14 16:55:48,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:48,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:48,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:48,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:48,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:48,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {4430#true} call ULTIMATE.init(); {4430#true} is VALID [2018-11-14 16:55:48,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {4430#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4430#true} is VALID [2018-11-14 16:55:48,772 INFO L273 TraceCheckUtils]: 2: Hoare triple {4430#true} assume true; {4430#true} is VALID [2018-11-14 16:55:48,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4430#true} {4430#true} #50#return; {4430#true} is VALID [2018-11-14 16:55:48,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {4430#true} call #t~ret2 := main(); {4430#true} is VALID [2018-11-14 16:55:48,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {4430#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4432#(= main_~i~0 0)} is VALID [2018-11-14 16:55:48,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {4432#(= main_~i~0 0)} assume true; {4432#(= main_~i~0 0)} is VALID [2018-11-14 16:55:48,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {4432#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4433#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:48,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {4433#(<= main_~i~0 1)} assume true; {4433#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:48,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {4433#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4434#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:48,776 INFO L273 TraceCheckUtils]: 10: Hoare triple {4434#(<= main_~i~0 2)} assume true; {4434#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:48,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {4434#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4435#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:48,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {4435#(<= main_~i~0 3)} assume true; {4435#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:48,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {4435#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4436#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:48,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {4436#(<= main_~i~0 4)} assume true; {4436#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:48,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {4436#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4437#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:48,780 INFO L273 TraceCheckUtils]: 16: Hoare triple {4437#(<= main_~i~0 5)} assume true; {4437#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:48,781 INFO L273 TraceCheckUtils]: 17: Hoare triple {4437#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4438#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:48,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {4438#(<= main_~i~0 6)} assume true; {4438#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:48,783 INFO L273 TraceCheckUtils]: 19: Hoare triple {4438#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4439#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:48,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {4439#(<= main_~i~0 7)} assume true; {4439#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:48,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {4439#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4440#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:48,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {4440#(<= main_~i~0 8)} assume true; {4440#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:48,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {4440#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4441#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:48,786 INFO L273 TraceCheckUtils]: 24: Hoare triple {4441#(<= main_~i~0 9)} assume true; {4441#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:48,787 INFO L273 TraceCheckUtils]: 25: Hoare triple {4441#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4442#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:48,788 INFO L273 TraceCheckUtils]: 26: Hoare triple {4442#(<= main_~i~0 10)} assume true; {4442#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:48,789 INFO L273 TraceCheckUtils]: 27: Hoare triple {4442#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4443#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:48,789 INFO L273 TraceCheckUtils]: 28: Hoare triple {4443#(<= main_~i~0 11)} assume true; {4443#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:48,790 INFO L273 TraceCheckUtils]: 29: Hoare triple {4443#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4444#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:48,791 INFO L273 TraceCheckUtils]: 30: Hoare triple {4444#(<= main_~i~0 12)} assume true; {4444#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:48,792 INFO L273 TraceCheckUtils]: 31: Hoare triple {4444#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4445#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:48,792 INFO L273 TraceCheckUtils]: 32: Hoare triple {4445#(<= main_~i~0 13)} assume true; {4445#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:48,793 INFO L273 TraceCheckUtils]: 33: Hoare triple {4445#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4446#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:48,794 INFO L273 TraceCheckUtils]: 34: Hoare triple {4446#(<= main_~i~0 14)} assume true; {4446#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:48,795 INFO L273 TraceCheckUtils]: 35: Hoare triple {4446#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4447#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:48,795 INFO L273 TraceCheckUtils]: 36: Hoare triple {4447#(<= main_~i~0 15)} assume true; {4447#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:48,796 INFO L273 TraceCheckUtils]: 37: Hoare triple {4447#(<= main_~i~0 15)} assume !(~i~0 < 100000); {4431#false} is VALID [2018-11-14 16:55:48,796 INFO L273 TraceCheckUtils]: 38: Hoare triple {4431#false} havoc ~x~0;~x~0 := 0; {4431#false} is VALID [2018-11-14 16:55:48,796 INFO L273 TraceCheckUtils]: 39: Hoare triple {4431#false} assume true; {4431#false} is VALID [2018-11-14 16:55:48,796 INFO L273 TraceCheckUtils]: 40: Hoare triple {4431#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4431#false} is VALID [2018-11-14 16:55:48,797 INFO L256 TraceCheckUtils]: 41: Hoare triple {4431#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4431#false} is VALID [2018-11-14 16:55:48,797 INFO L273 TraceCheckUtils]: 42: Hoare triple {4431#false} ~cond := #in~cond; {4431#false} is VALID [2018-11-14 16:55:48,797 INFO L273 TraceCheckUtils]: 43: Hoare triple {4431#false} assume ~cond == 0; {4431#false} is VALID [2018-11-14 16:55:48,798 INFO L273 TraceCheckUtils]: 44: Hoare triple {4431#false} assume !false; {4431#false} is VALID [2018-11-14 16:55:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:48,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:48,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:48,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:55:48,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-14 16:55:48,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:48,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:49,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {4430#true} call ULTIMATE.init(); {4430#true} is VALID [2018-11-14 16:55:49,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {4430#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4430#true} is VALID [2018-11-14 16:55:49,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {4430#true} assume true; {4430#true} is VALID [2018-11-14 16:55:49,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4430#true} {4430#true} #50#return; {4430#true} is VALID [2018-11-14 16:55:49,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {4430#true} call #t~ret2 := main(); {4430#true} is VALID [2018-11-14 16:55:49,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {4430#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4466#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:49,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {4466#(<= main_~i~0 0)} assume true; {4466#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:49,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {4466#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4433#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:49,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {4433#(<= main_~i~0 1)} assume true; {4433#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:49,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {4433#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4434#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:49,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {4434#(<= main_~i~0 2)} assume true; {4434#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:49,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {4434#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4435#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:49,118 INFO L273 TraceCheckUtils]: 12: Hoare triple {4435#(<= main_~i~0 3)} assume true; {4435#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:49,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {4435#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4436#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:49,119 INFO L273 TraceCheckUtils]: 14: Hoare triple {4436#(<= main_~i~0 4)} assume true; {4436#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:49,120 INFO L273 TraceCheckUtils]: 15: Hoare triple {4436#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4437#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:49,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {4437#(<= main_~i~0 5)} assume true; {4437#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:49,121 INFO L273 TraceCheckUtils]: 17: Hoare triple {4437#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4438#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:49,122 INFO L273 TraceCheckUtils]: 18: Hoare triple {4438#(<= main_~i~0 6)} assume true; {4438#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:49,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {4438#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4439#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:49,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {4439#(<= main_~i~0 7)} assume true; {4439#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:49,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {4439#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4440#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:49,126 INFO L273 TraceCheckUtils]: 22: Hoare triple {4440#(<= main_~i~0 8)} assume true; {4440#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:49,127 INFO L273 TraceCheckUtils]: 23: Hoare triple {4440#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4441#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:49,127 INFO L273 TraceCheckUtils]: 24: Hoare triple {4441#(<= main_~i~0 9)} assume true; {4441#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:49,128 INFO L273 TraceCheckUtils]: 25: Hoare triple {4441#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4442#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:49,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {4442#(<= main_~i~0 10)} assume true; {4442#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:49,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {4442#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4443#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:49,130 INFO L273 TraceCheckUtils]: 28: Hoare triple {4443#(<= main_~i~0 11)} assume true; {4443#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:49,131 INFO L273 TraceCheckUtils]: 29: Hoare triple {4443#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4444#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:49,131 INFO L273 TraceCheckUtils]: 30: Hoare triple {4444#(<= main_~i~0 12)} assume true; {4444#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:49,132 INFO L273 TraceCheckUtils]: 31: Hoare triple {4444#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4445#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:49,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {4445#(<= main_~i~0 13)} assume true; {4445#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:49,134 INFO L273 TraceCheckUtils]: 33: Hoare triple {4445#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4446#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:49,134 INFO L273 TraceCheckUtils]: 34: Hoare triple {4446#(<= main_~i~0 14)} assume true; {4446#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:49,135 INFO L273 TraceCheckUtils]: 35: Hoare triple {4446#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4447#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:49,136 INFO L273 TraceCheckUtils]: 36: Hoare triple {4447#(<= main_~i~0 15)} assume true; {4447#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:49,136 INFO L273 TraceCheckUtils]: 37: Hoare triple {4447#(<= main_~i~0 15)} assume !(~i~0 < 100000); {4431#false} is VALID [2018-11-14 16:55:49,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {4431#false} havoc ~x~0;~x~0 := 0; {4431#false} is VALID [2018-11-14 16:55:49,137 INFO L273 TraceCheckUtils]: 39: Hoare triple {4431#false} assume true; {4431#false} is VALID [2018-11-14 16:55:49,137 INFO L273 TraceCheckUtils]: 40: Hoare triple {4431#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4431#false} is VALID [2018-11-14 16:55:49,137 INFO L256 TraceCheckUtils]: 41: Hoare triple {4431#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4431#false} is VALID [2018-11-14 16:55:49,137 INFO L273 TraceCheckUtils]: 42: Hoare triple {4431#false} ~cond := #in~cond; {4431#false} is VALID [2018-11-14 16:55:49,137 INFO L273 TraceCheckUtils]: 43: Hoare triple {4431#false} assume ~cond == 0; {4431#false} is VALID [2018-11-14 16:55:49,138 INFO L273 TraceCheckUtils]: 44: Hoare triple {4431#false} assume !false; {4431#false} is VALID [2018-11-14 16:55:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:49,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:49,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 16:55:49,161 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-14 16:55:49,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:49,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 16:55:49,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:49,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 16:55:49,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 16:55:49,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:55:49,271 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 19 states. [2018-11-14 16:55:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:49,630 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-14 16:55:49,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 16:55:49,630 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-14 16:55:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:55:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2018-11-14 16:55:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:55:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2018-11-14 16:55:49,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 66 transitions. [2018-11-14 16:55:50,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:50,035 INFO L225 Difference]: With dead ends: 64 [2018-11-14 16:55:50,035 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 16:55:50,036 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:55:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 16:55:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-14 16:55:50,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:50,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-14 16:55:50,052 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-14 16:55:50,052 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-14 16:55:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:50,054 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-14 16:55:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-14 16:55:50,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:50,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:50,054 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-14 16:55:50,055 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-14 16:55:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:50,056 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-14 16:55:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-14 16:55:50,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:50,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:50,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:50,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 16:55:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-14 16:55:50,058 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 45 [2018-11-14 16:55:50,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:50,058 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-14 16:55:50,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 16:55:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-14 16:55:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 16:55:50,059 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:50,059 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:50,060 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:50,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:50,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1478886636, now seen corresponding path program 16 times [2018-11-14 16:55:50,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:50,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:50,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:50,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:50,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:51,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {4854#true} call ULTIMATE.init(); {4854#true} is VALID [2018-11-14 16:55:51,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {4854#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4854#true} is VALID [2018-11-14 16:55:51,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {4854#true} assume true; {4854#true} is VALID [2018-11-14 16:55:51,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4854#true} {4854#true} #50#return; {4854#true} is VALID [2018-11-14 16:55:51,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {4854#true} call #t~ret2 := main(); {4854#true} is VALID [2018-11-14 16:55:51,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {4854#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4856#(= main_~i~0 0)} is VALID [2018-11-14 16:55:51,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {4856#(= main_~i~0 0)} assume true; {4856#(= main_~i~0 0)} is VALID [2018-11-14 16:55:51,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {4856#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4857#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:51,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {4857#(<= main_~i~0 1)} assume true; {4857#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:51,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {4857#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4858#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:51,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {4858#(<= main_~i~0 2)} assume true; {4858#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:51,119 INFO L273 TraceCheckUtils]: 11: Hoare triple {4858#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4859#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:51,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {4859#(<= main_~i~0 3)} assume true; {4859#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:51,120 INFO L273 TraceCheckUtils]: 13: Hoare triple {4859#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4860#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:51,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {4860#(<= main_~i~0 4)} assume true; {4860#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:51,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {4860#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4861#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:51,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {4861#(<= main_~i~0 5)} assume true; {4861#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:51,123 INFO L273 TraceCheckUtils]: 17: Hoare triple {4861#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4862#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:51,124 INFO L273 TraceCheckUtils]: 18: Hoare triple {4862#(<= main_~i~0 6)} assume true; {4862#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:51,125 INFO L273 TraceCheckUtils]: 19: Hoare triple {4862#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4863#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:51,125 INFO L273 TraceCheckUtils]: 20: Hoare triple {4863#(<= main_~i~0 7)} assume true; {4863#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:51,126 INFO L273 TraceCheckUtils]: 21: Hoare triple {4863#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4864#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:51,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {4864#(<= main_~i~0 8)} assume true; {4864#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:51,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {4864#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4865#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:51,128 INFO L273 TraceCheckUtils]: 24: Hoare triple {4865#(<= main_~i~0 9)} assume true; {4865#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:51,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {4865#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4866#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:51,130 INFO L273 TraceCheckUtils]: 26: Hoare triple {4866#(<= main_~i~0 10)} assume true; {4866#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:51,131 INFO L273 TraceCheckUtils]: 27: Hoare triple {4866#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4867#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:51,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {4867#(<= main_~i~0 11)} assume true; {4867#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:51,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {4867#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4868#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:51,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {4868#(<= main_~i~0 12)} assume true; {4868#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:51,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {4868#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4869#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:51,134 INFO L273 TraceCheckUtils]: 32: Hoare triple {4869#(<= main_~i~0 13)} assume true; {4869#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:51,135 INFO L273 TraceCheckUtils]: 33: Hoare triple {4869#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4870#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:51,135 INFO L273 TraceCheckUtils]: 34: Hoare triple {4870#(<= main_~i~0 14)} assume true; {4870#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:51,136 INFO L273 TraceCheckUtils]: 35: Hoare triple {4870#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4871#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:51,136 INFO L273 TraceCheckUtils]: 36: Hoare triple {4871#(<= main_~i~0 15)} assume true; {4871#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:51,137 INFO L273 TraceCheckUtils]: 37: Hoare triple {4871#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4872#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:51,138 INFO L273 TraceCheckUtils]: 38: Hoare triple {4872#(<= main_~i~0 16)} assume true; {4872#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:51,138 INFO L273 TraceCheckUtils]: 39: Hoare triple {4872#(<= main_~i~0 16)} assume !(~i~0 < 100000); {4855#false} is VALID [2018-11-14 16:55:51,139 INFO L273 TraceCheckUtils]: 40: Hoare triple {4855#false} havoc ~x~0;~x~0 := 0; {4855#false} is VALID [2018-11-14 16:55:51,139 INFO L273 TraceCheckUtils]: 41: Hoare triple {4855#false} assume true; {4855#false} is VALID [2018-11-14 16:55:51,139 INFO L273 TraceCheckUtils]: 42: Hoare triple {4855#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4855#false} is VALID [2018-11-14 16:55:51,139 INFO L256 TraceCheckUtils]: 43: Hoare triple {4855#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4855#false} is VALID [2018-11-14 16:55:51,139 INFO L273 TraceCheckUtils]: 44: Hoare triple {4855#false} ~cond := #in~cond; {4855#false} is VALID [2018-11-14 16:55:51,140 INFO L273 TraceCheckUtils]: 45: Hoare triple {4855#false} assume ~cond == 0; {4855#false} is VALID [2018-11-14 16:55:51,140 INFO L273 TraceCheckUtils]: 46: Hoare triple {4855#false} assume !false; {4855#false} is VALID [2018-11-14 16:55:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:51,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:51,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:51,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:55:51,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:55:51,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:51,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:51,299 INFO L256 TraceCheckUtils]: 0: Hoare triple {4854#true} call ULTIMATE.init(); {4854#true} is VALID [2018-11-14 16:55:51,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {4854#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4854#true} is VALID [2018-11-14 16:55:51,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {4854#true} assume true; {4854#true} is VALID [2018-11-14 16:55:51,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4854#true} {4854#true} #50#return; {4854#true} is VALID [2018-11-14 16:55:51,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {4854#true} call #t~ret2 := main(); {4854#true} is VALID [2018-11-14 16:55:51,300 INFO L273 TraceCheckUtils]: 5: Hoare triple {4854#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4891#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:51,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {4891#(<= main_~i~0 0)} assume true; {4891#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:51,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {4891#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4857#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:51,301 INFO L273 TraceCheckUtils]: 8: Hoare triple {4857#(<= main_~i~0 1)} assume true; {4857#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:51,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {4857#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4858#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:51,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {4858#(<= main_~i~0 2)} assume true; {4858#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:51,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {4858#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4859#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:51,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {4859#(<= main_~i~0 3)} assume true; {4859#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:51,304 INFO L273 TraceCheckUtils]: 13: Hoare triple {4859#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4860#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:51,305 INFO L273 TraceCheckUtils]: 14: Hoare triple {4860#(<= main_~i~0 4)} assume true; {4860#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:51,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {4860#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4861#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:51,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {4861#(<= main_~i~0 5)} assume true; {4861#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:51,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {4861#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4862#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:51,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {4862#(<= main_~i~0 6)} assume true; {4862#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:51,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {4862#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4863#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:51,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {4863#(<= main_~i~0 7)} assume true; {4863#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:51,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {4863#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4864#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:51,311 INFO L273 TraceCheckUtils]: 22: Hoare triple {4864#(<= main_~i~0 8)} assume true; {4864#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:51,312 INFO L273 TraceCheckUtils]: 23: Hoare triple {4864#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4865#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:51,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {4865#(<= main_~i~0 9)} assume true; {4865#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:51,313 INFO L273 TraceCheckUtils]: 25: Hoare triple {4865#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4866#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:51,314 INFO L273 TraceCheckUtils]: 26: Hoare triple {4866#(<= main_~i~0 10)} assume true; {4866#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:51,315 INFO L273 TraceCheckUtils]: 27: Hoare triple {4866#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4867#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:51,316 INFO L273 TraceCheckUtils]: 28: Hoare triple {4867#(<= main_~i~0 11)} assume true; {4867#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:51,317 INFO L273 TraceCheckUtils]: 29: Hoare triple {4867#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4868#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:51,317 INFO L273 TraceCheckUtils]: 30: Hoare triple {4868#(<= main_~i~0 12)} assume true; {4868#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:51,318 INFO L273 TraceCheckUtils]: 31: Hoare triple {4868#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4869#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:51,319 INFO L273 TraceCheckUtils]: 32: Hoare triple {4869#(<= main_~i~0 13)} assume true; {4869#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:51,320 INFO L273 TraceCheckUtils]: 33: Hoare triple {4869#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4870#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:51,320 INFO L273 TraceCheckUtils]: 34: Hoare triple {4870#(<= main_~i~0 14)} assume true; {4870#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:51,321 INFO L273 TraceCheckUtils]: 35: Hoare triple {4870#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4871#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:51,322 INFO L273 TraceCheckUtils]: 36: Hoare triple {4871#(<= main_~i~0 15)} assume true; {4871#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:51,323 INFO L273 TraceCheckUtils]: 37: Hoare triple {4871#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4872#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:51,323 INFO L273 TraceCheckUtils]: 38: Hoare triple {4872#(<= main_~i~0 16)} assume true; {4872#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:51,324 INFO L273 TraceCheckUtils]: 39: Hoare triple {4872#(<= main_~i~0 16)} assume !(~i~0 < 100000); {4855#false} is VALID [2018-11-14 16:55:51,324 INFO L273 TraceCheckUtils]: 40: Hoare triple {4855#false} havoc ~x~0;~x~0 := 0; {4855#false} is VALID [2018-11-14 16:55:51,324 INFO L273 TraceCheckUtils]: 41: Hoare triple {4855#false} assume true; {4855#false} is VALID [2018-11-14 16:55:51,325 INFO L273 TraceCheckUtils]: 42: Hoare triple {4855#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4855#false} is VALID [2018-11-14 16:55:51,325 INFO L256 TraceCheckUtils]: 43: Hoare triple {4855#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4855#false} is VALID [2018-11-14 16:55:51,325 INFO L273 TraceCheckUtils]: 44: Hoare triple {4855#false} ~cond := #in~cond; {4855#false} is VALID [2018-11-14 16:55:51,325 INFO L273 TraceCheckUtils]: 45: Hoare triple {4855#false} assume ~cond == 0; {4855#false} is VALID [2018-11-14 16:55:51,326 INFO L273 TraceCheckUtils]: 46: Hoare triple {4855#false} assume !false; {4855#false} is VALID [2018-11-14 16:55:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:51,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:51,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 16:55:51,348 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-14 16:55:51,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:51,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 16:55:51,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:51,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 16:55:51,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 16:55:51,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:55:51,396 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 20 states. [2018-11-14 16:55:51,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:51,581 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-14 16:55:51,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 16:55:51,581 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-14 16:55:51,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:55:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 68 transitions. [2018-11-14 16:55:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:55:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 68 transitions. [2018-11-14 16:55:51,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 68 transitions. [2018-11-14 16:55:51,646 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-14 16:55:51,647 INFO L225 Difference]: With dead ends: 66 [2018-11-14 16:55:51,647 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 16:55:51,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:55:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 16:55:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-14 16:55:51,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:51,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-14 16:55:51,674 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-14 16:55:51,674 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-14 16:55:51,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:51,675 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-14 16:55:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-14 16:55:51,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:51,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:51,676 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-14 16:55:51,676 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-14 16:55:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:51,677 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-14 16:55:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-14 16:55:51,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:51,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:51,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:51,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 16:55:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-14 16:55:51,679 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 47 [2018-11-14 16:55:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:51,680 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-14 16:55:51,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 16:55:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-14 16:55:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 16:55:51,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:51,681 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:51,681 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:51,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:51,681 INFO L82 PathProgramCache]: Analyzing trace with hash 412177774, now seen corresponding path program 17 times [2018-11-14 16:55:51,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:51,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:51,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:52,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {5295#true} call ULTIMATE.init(); {5295#true} is VALID [2018-11-14 16:55:52,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {5295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5295#true} is VALID [2018-11-14 16:55:52,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {5295#true} assume true; {5295#true} is VALID [2018-11-14 16:55:52,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5295#true} {5295#true} #50#return; {5295#true} is VALID [2018-11-14 16:55:52,347 INFO L256 TraceCheckUtils]: 4: Hoare triple {5295#true} call #t~ret2 := main(); {5295#true} is VALID [2018-11-14 16:55:52,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {5295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5297#(= main_~i~0 0)} is VALID [2018-11-14 16:55:52,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {5297#(= main_~i~0 0)} assume true; {5297#(= main_~i~0 0)} is VALID [2018-11-14 16:55:52,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {5297#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5298#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:52,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {5298#(<= main_~i~0 1)} assume true; {5298#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:52,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {5298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5299#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:52,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {5299#(<= main_~i~0 2)} assume true; {5299#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:52,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {5299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:52,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {5300#(<= main_~i~0 3)} assume true; {5300#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:52,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {5300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5301#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:52,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {5301#(<= main_~i~0 4)} assume true; {5301#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:52,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {5301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5302#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:52,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {5302#(<= main_~i~0 5)} assume true; {5302#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:52,355 INFO L273 TraceCheckUtils]: 17: Hoare triple {5302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5303#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:52,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {5303#(<= main_~i~0 6)} assume true; {5303#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:52,356 INFO L273 TraceCheckUtils]: 19: Hoare triple {5303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5304#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:52,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {5304#(<= main_~i~0 7)} assume true; {5304#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:52,358 INFO L273 TraceCheckUtils]: 21: Hoare triple {5304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5305#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:52,358 INFO L273 TraceCheckUtils]: 22: Hoare triple {5305#(<= main_~i~0 8)} assume true; {5305#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:52,359 INFO L273 TraceCheckUtils]: 23: Hoare triple {5305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5306#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:52,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {5306#(<= main_~i~0 9)} assume true; {5306#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:52,360 INFO L273 TraceCheckUtils]: 25: Hoare triple {5306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5307#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:52,361 INFO L273 TraceCheckUtils]: 26: Hoare triple {5307#(<= main_~i~0 10)} assume true; {5307#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:52,362 INFO L273 TraceCheckUtils]: 27: Hoare triple {5307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5308#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:52,362 INFO L273 TraceCheckUtils]: 28: Hoare triple {5308#(<= main_~i~0 11)} assume true; {5308#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:52,363 INFO L273 TraceCheckUtils]: 29: Hoare triple {5308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5309#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:52,363 INFO L273 TraceCheckUtils]: 30: Hoare triple {5309#(<= main_~i~0 12)} assume true; {5309#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:52,364 INFO L273 TraceCheckUtils]: 31: Hoare triple {5309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5310#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:52,365 INFO L273 TraceCheckUtils]: 32: Hoare triple {5310#(<= main_~i~0 13)} assume true; {5310#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:52,366 INFO L273 TraceCheckUtils]: 33: Hoare triple {5310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5311#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:52,366 INFO L273 TraceCheckUtils]: 34: Hoare triple {5311#(<= main_~i~0 14)} assume true; {5311#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:52,367 INFO L273 TraceCheckUtils]: 35: Hoare triple {5311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5312#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:52,368 INFO L273 TraceCheckUtils]: 36: Hoare triple {5312#(<= main_~i~0 15)} assume true; {5312#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:52,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {5312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5313#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:52,369 INFO L273 TraceCheckUtils]: 38: Hoare triple {5313#(<= main_~i~0 16)} assume true; {5313#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:52,370 INFO L273 TraceCheckUtils]: 39: Hoare triple {5313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5314#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:52,370 INFO L273 TraceCheckUtils]: 40: Hoare triple {5314#(<= main_~i~0 17)} assume true; {5314#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:52,371 INFO L273 TraceCheckUtils]: 41: Hoare triple {5314#(<= main_~i~0 17)} assume !(~i~0 < 100000); {5296#false} is VALID [2018-11-14 16:55:52,371 INFO L273 TraceCheckUtils]: 42: Hoare triple {5296#false} havoc ~x~0;~x~0 := 0; {5296#false} is VALID [2018-11-14 16:55:52,372 INFO L273 TraceCheckUtils]: 43: Hoare triple {5296#false} assume true; {5296#false} is VALID [2018-11-14 16:55:52,372 INFO L273 TraceCheckUtils]: 44: Hoare triple {5296#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5296#false} is VALID [2018-11-14 16:55:52,372 INFO L256 TraceCheckUtils]: 45: Hoare triple {5296#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {5296#false} is VALID [2018-11-14 16:55:52,372 INFO L273 TraceCheckUtils]: 46: Hoare triple {5296#false} ~cond := #in~cond; {5296#false} is VALID [2018-11-14 16:55:52,372 INFO L273 TraceCheckUtils]: 47: Hoare triple {5296#false} assume ~cond == 0; {5296#false} is VALID [2018-11-14 16:55:52,372 INFO L273 TraceCheckUtils]: 48: Hoare triple {5296#false} assume !false; {5296#false} is VALID [2018-11-14 16:55:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:52,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:52,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:52,385 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:55:52,501 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-14 16:55:52,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:52,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:52,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {5295#true} call ULTIMATE.init(); {5295#true} is VALID [2018-11-14 16:55:52,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {5295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5295#true} is VALID [2018-11-14 16:55:52,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {5295#true} assume true; {5295#true} is VALID [2018-11-14 16:55:52,760 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5295#true} {5295#true} #50#return; {5295#true} is VALID [2018-11-14 16:55:52,760 INFO L256 TraceCheckUtils]: 4: Hoare triple {5295#true} call #t~ret2 := main(); {5295#true} is VALID [2018-11-14 16:55:52,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {5295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5333#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:52,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {5333#(<= main_~i~0 0)} assume true; {5333#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:52,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {5333#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5298#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:52,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {5298#(<= main_~i~0 1)} assume true; {5298#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:52,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {5298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5299#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:52,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {5299#(<= main_~i~0 2)} assume true; {5299#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:52,763 INFO L273 TraceCheckUtils]: 11: Hoare triple {5299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:52,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {5300#(<= main_~i~0 3)} assume true; {5300#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:52,764 INFO L273 TraceCheckUtils]: 13: Hoare triple {5300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5301#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:52,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {5301#(<= main_~i~0 4)} assume true; {5301#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:52,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {5301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5302#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:52,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {5302#(<= main_~i~0 5)} assume true; {5302#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:52,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {5302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5303#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:52,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {5303#(<= main_~i~0 6)} assume true; {5303#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:52,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {5303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5304#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:52,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {5304#(<= main_~i~0 7)} assume true; {5304#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:52,770 INFO L273 TraceCheckUtils]: 21: Hoare triple {5304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5305#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:52,770 INFO L273 TraceCheckUtils]: 22: Hoare triple {5305#(<= main_~i~0 8)} assume true; {5305#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:52,771 INFO L273 TraceCheckUtils]: 23: Hoare triple {5305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5306#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:52,772 INFO L273 TraceCheckUtils]: 24: Hoare triple {5306#(<= main_~i~0 9)} assume true; {5306#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:52,772 INFO L273 TraceCheckUtils]: 25: Hoare triple {5306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5307#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:52,773 INFO L273 TraceCheckUtils]: 26: Hoare triple {5307#(<= main_~i~0 10)} assume true; {5307#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:52,774 INFO L273 TraceCheckUtils]: 27: Hoare triple {5307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5308#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:52,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {5308#(<= main_~i~0 11)} assume true; {5308#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:52,775 INFO L273 TraceCheckUtils]: 29: Hoare triple {5308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5309#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:52,776 INFO L273 TraceCheckUtils]: 30: Hoare triple {5309#(<= main_~i~0 12)} assume true; {5309#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:52,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {5309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5310#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:52,777 INFO L273 TraceCheckUtils]: 32: Hoare triple {5310#(<= main_~i~0 13)} assume true; {5310#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:52,778 INFO L273 TraceCheckUtils]: 33: Hoare triple {5310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5311#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:52,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {5311#(<= main_~i~0 14)} assume true; {5311#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:52,779 INFO L273 TraceCheckUtils]: 35: Hoare triple {5311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5312#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:52,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {5312#(<= main_~i~0 15)} assume true; {5312#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:52,781 INFO L273 TraceCheckUtils]: 37: Hoare triple {5312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5313#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:52,781 INFO L273 TraceCheckUtils]: 38: Hoare triple {5313#(<= main_~i~0 16)} assume true; {5313#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:52,782 INFO L273 TraceCheckUtils]: 39: Hoare triple {5313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5314#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:52,782 INFO L273 TraceCheckUtils]: 40: Hoare triple {5314#(<= main_~i~0 17)} assume true; {5314#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:52,783 INFO L273 TraceCheckUtils]: 41: Hoare triple {5314#(<= main_~i~0 17)} assume !(~i~0 < 100000); {5296#false} is VALID [2018-11-14 16:55:52,783 INFO L273 TraceCheckUtils]: 42: Hoare triple {5296#false} havoc ~x~0;~x~0 := 0; {5296#false} is VALID [2018-11-14 16:55:52,783 INFO L273 TraceCheckUtils]: 43: Hoare triple {5296#false} assume true; {5296#false} is VALID [2018-11-14 16:55:52,784 INFO L273 TraceCheckUtils]: 44: Hoare triple {5296#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5296#false} is VALID [2018-11-14 16:55:52,784 INFO L256 TraceCheckUtils]: 45: Hoare triple {5296#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {5296#false} is VALID [2018-11-14 16:55:52,784 INFO L273 TraceCheckUtils]: 46: Hoare triple {5296#false} ~cond := #in~cond; {5296#false} is VALID [2018-11-14 16:55:52,784 INFO L273 TraceCheckUtils]: 47: Hoare triple {5296#false} assume ~cond == 0; {5296#false} is VALID [2018-11-14 16:55:52,784 INFO L273 TraceCheckUtils]: 48: Hoare triple {5296#false} assume !false; {5296#false} is VALID [2018-11-14 16:55:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:52,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:52,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 16:55:52,809 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-14 16:55:52,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:52,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 16:55:52,856 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-14 16:55:52,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 16:55:52,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 16:55:52,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:55:52,858 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 21 states. [2018-11-14 16:55:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:53,184 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-14 16:55:53,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 16:55:53,184 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-14 16:55:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:55:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2018-11-14 16:55:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:55:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2018-11-14 16:55:53,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 70 transitions. [2018-11-14 16:55:53,688 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-14 16:55:53,689 INFO L225 Difference]: With dead ends: 68 [2018-11-14 16:55:53,690 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 16:55:53,690 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:55:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 16:55:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-14 16:55:53,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:53,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-14 16:55:53,710 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-14 16:55:53,710 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-14 16:55:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:53,711 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-14 16:55:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-14 16:55:53,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:53,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:53,712 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-14 16:55:53,712 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-14 16:55:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:53,713 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-14 16:55:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-14 16:55:53,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:53,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:53,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:53,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 16:55:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-14 16:55:53,716 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 49 [2018-11-14 16:55:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:53,716 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-14 16:55:53,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 16:55:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-14 16:55:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 16:55:53,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:53,717 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:53,717 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:53,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:53,718 INFO L82 PathProgramCache]: Analyzing trace with hash 953909576, now seen corresponding path program 18 times [2018-11-14 16:55:53,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:53,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:53,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:53,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:53,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:54,416 INFO L256 TraceCheckUtils]: 0: Hoare triple {5753#true} call ULTIMATE.init(); {5753#true} is VALID [2018-11-14 16:55:54,416 INFO L273 TraceCheckUtils]: 1: Hoare triple {5753#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5753#true} is VALID [2018-11-14 16:55:54,416 INFO L273 TraceCheckUtils]: 2: Hoare triple {5753#true} assume true; {5753#true} is VALID [2018-11-14 16:55:54,417 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5753#true} {5753#true} #50#return; {5753#true} is VALID [2018-11-14 16:55:54,417 INFO L256 TraceCheckUtils]: 4: Hoare triple {5753#true} call #t~ret2 := main(); {5753#true} is VALID [2018-11-14 16:55:54,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {5753#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5755#(= main_~i~0 0)} is VALID [2018-11-14 16:55:54,448 INFO L273 TraceCheckUtils]: 6: Hoare triple {5755#(= main_~i~0 0)} assume true; {5755#(= main_~i~0 0)} is VALID [2018-11-14 16:55:54,456 INFO L273 TraceCheckUtils]: 7: Hoare triple {5755#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5756#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:54,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {5756#(<= main_~i~0 1)} assume true; {5756#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:54,457 INFO L273 TraceCheckUtils]: 9: Hoare triple {5756#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5757#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:54,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {5757#(<= main_~i~0 2)} assume true; {5757#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:54,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {5757#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5758#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:54,458 INFO L273 TraceCheckUtils]: 12: Hoare triple {5758#(<= main_~i~0 3)} assume true; {5758#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:54,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {5758#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5759#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:54,459 INFO L273 TraceCheckUtils]: 14: Hoare triple {5759#(<= main_~i~0 4)} assume true; {5759#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:54,460 INFO L273 TraceCheckUtils]: 15: Hoare triple {5759#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5760#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:54,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {5760#(<= main_~i~0 5)} assume true; {5760#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:54,461 INFO L273 TraceCheckUtils]: 17: Hoare triple {5760#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5761#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:54,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {5761#(<= main_~i~0 6)} assume true; {5761#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:54,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {5761#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5762#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:54,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {5762#(<= main_~i~0 7)} assume true; {5762#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:54,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {5762#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5763#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:54,464 INFO L273 TraceCheckUtils]: 22: Hoare triple {5763#(<= main_~i~0 8)} assume true; {5763#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:54,465 INFO L273 TraceCheckUtils]: 23: Hoare triple {5763#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5764#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:54,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {5764#(<= main_~i~0 9)} assume true; {5764#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:54,466 INFO L273 TraceCheckUtils]: 25: Hoare triple {5764#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5765#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:54,467 INFO L273 TraceCheckUtils]: 26: Hoare triple {5765#(<= main_~i~0 10)} assume true; {5765#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:54,468 INFO L273 TraceCheckUtils]: 27: Hoare triple {5765#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5766#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:54,468 INFO L273 TraceCheckUtils]: 28: Hoare triple {5766#(<= main_~i~0 11)} assume true; {5766#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:54,469 INFO L273 TraceCheckUtils]: 29: Hoare triple {5766#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5767#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:54,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {5767#(<= main_~i~0 12)} assume true; {5767#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:54,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {5767#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5768#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:54,471 INFO L273 TraceCheckUtils]: 32: Hoare triple {5768#(<= main_~i~0 13)} assume true; {5768#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:54,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {5768#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5769#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:54,473 INFO L273 TraceCheckUtils]: 34: Hoare triple {5769#(<= main_~i~0 14)} assume true; {5769#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:54,474 INFO L273 TraceCheckUtils]: 35: Hoare triple {5769#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5770#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:54,474 INFO L273 TraceCheckUtils]: 36: Hoare triple {5770#(<= main_~i~0 15)} assume true; {5770#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:54,475 INFO L273 TraceCheckUtils]: 37: Hoare triple {5770#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5771#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:54,476 INFO L273 TraceCheckUtils]: 38: Hoare triple {5771#(<= main_~i~0 16)} assume true; {5771#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:54,477 INFO L273 TraceCheckUtils]: 39: Hoare triple {5771#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5772#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:54,477 INFO L273 TraceCheckUtils]: 40: Hoare triple {5772#(<= main_~i~0 17)} assume true; {5772#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:54,478 INFO L273 TraceCheckUtils]: 41: Hoare triple {5772#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5773#(<= main_~i~0 18)} is VALID [2018-11-14 16:55:54,479 INFO L273 TraceCheckUtils]: 42: Hoare triple {5773#(<= main_~i~0 18)} assume true; {5773#(<= main_~i~0 18)} is VALID [2018-11-14 16:55:54,479 INFO L273 TraceCheckUtils]: 43: Hoare triple {5773#(<= main_~i~0 18)} assume !(~i~0 < 100000); {5754#false} is VALID [2018-11-14 16:55:54,479 INFO L273 TraceCheckUtils]: 44: Hoare triple {5754#false} havoc ~x~0;~x~0 := 0; {5754#false} is VALID [2018-11-14 16:55:54,480 INFO L273 TraceCheckUtils]: 45: Hoare triple {5754#false} assume true; {5754#false} is VALID [2018-11-14 16:55:54,480 INFO L273 TraceCheckUtils]: 46: Hoare triple {5754#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5754#false} is VALID [2018-11-14 16:55:54,480 INFO L256 TraceCheckUtils]: 47: Hoare triple {5754#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {5754#false} is VALID [2018-11-14 16:55:54,480 INFO L273 TraceCheckUtils]: 48: Hoare triple {5754#false} ~cond := #in~cond; {5754#false} is VALID [2018-11-14 16:55:54,481 INFO L273 TraceCheckUtils]: 49: Hoare triple {5754#false} assume ~cond == 0; {5754#false} is VALID [2018-11-14 16:55:54,481 INFO L273 TraceCheckUtils]: 50: Hoare triple {5754#false} assume !false; {5754#false} is VALID [2018-11-14 16:55:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:54,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:54,484 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-14 16:55:54,493 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:55:54,975 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-14 16:55:54,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:54,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:55,191 INFO L256 TraceCheckUtils]: 0: Hoare triple {5753#true} call ULTIMATE.init(); {5753#true} is VALID [2018-11-14 16:55:55,192 INFO L273 TraceCheckUtils]: 1: Hoare triple {5753#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5753#true} is VALID [2018-11-14 16:55:55,192 INFO L273 TraceCheckUtils]: 2: Hoare triple {5753#true} assume true; {5753#true} is VALID [2018-11-14 16:55:55,192 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5753#true} {5753#true} #50#return; {5753#true} is VALID [2018-11-14 16:55:55,192 INFO L256 TraceCheckUtils]: 4: Hoare triple {5753#true} call #t~ret2 := main(); {5753#true} is VALID [2018-11-14 16:55:55,193 INFO L273 TraceCheckUtils]: 5: Hoare triple {5753#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5792#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:55,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {5792#(<= main_~i~0 0)} assume true; {5792#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:55,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {5792#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5756#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:55,195 INFO L273 TraceCheckUtils]: 8: Hoare triple {5756#(<= main_~i~0 1)} assume true; {5756#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:55,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {5756#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5757#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:55,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {5757#(<= main_~i~0 2)} assume true; {5757#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:55,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {5757#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5758#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:55,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {5758#(<= main_~i~0 3)} assume true; {5758#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:55,199 INFO L273 TraceCheckUtils]: 13: Hoare triple {5758#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5759#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:55,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {5759#(<= main_~i~0 4)} assume true; {5759#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:55,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {5759#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5760#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:55,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {5760#(<= main_~i~0 5)} assume true; {5760#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:55,204 INFO L273 TraceCheckUtils]: 17: Hoare triple {5760#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5761#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:55,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {5761#(<= main_~i~0 6)} assume true; {5761#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:55,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {5761#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5762#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:55,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {5762#(<= main_~i~0 7)} assume true; {5762#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:55,206 INFO L273 TraceCheckUtils]: 21: Hoare triple {5762#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5763#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:55,206 INFO L273 TraceCheckUtils]: 22: Hoare triple {5763#(<= main_~i~0 8)} assume true; {5763#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:55,207 INFO L273 TraceCheckUtils]: 23: Hoare triple {5763#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5764#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:55,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {5764#(<= main_~i~0 9)} assume true; {5764#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:55,208 INFO L273 TraceCheckUtils]: 25: Hoare triple {5764#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5765#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:55,208 INFO L273 TraceCheckUtils]: 26: Hoare triple {5765#(<= main_~i~0 10)} assume true; {5765#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:55,209 INFO L273 TraceCheckUtils]: 27: Hoare triple {5765#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5766#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:55,209 INFO L273 TraceCheckUtils]: 28: Hoare triple {5766#(<= main_~i~0 11)} assume true; {5766#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:55,210 INFO L273 TraceCheckUtils]: 29: Hoare triple {5766#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5767#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:55,211 INFO L273 TraceCheckUtils]: 30: Hoare triple {5767#(<= main_~i~0 12)} assume true; {5767#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:55,211 INFO L273 TraceCheckUtils]: 31: Hoare triple {5767#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5768#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:55,212 INFO L273 TraceCheckUtils]: 32: Hoare triple {5768#(<= main_~i~0 13)} assume true; {5768#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:55,213 INFO L273 TraceCheckUtils]: 33: Hoare triple {5768#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5769#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:55,213 INFO L273 TraceCheckUtils]: 34: Hoare triple {5769#(<= main_~i~0 14)} assume true; {5769#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:55,214 INFO L273 TraceCheckUtils]: 35: Hoare triple {5769#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5770#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:55,215 INFO L273 TraceCheckUtils]: 36: Hoare triple {5770#(<= main_~i~0 15)} assume true; {5770#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:55,216 INFO L273 TraceCheckUtils]: 37: Hoare triple {5770#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5771#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:55,216 INFO L273 TraceCheckUtils]: 38: Hoare triple {5771#(<= main_~i~0 16)} assume true; {5771#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:55,217 INFO L273 TraceCheckUtils]: 39: Hoare triple {5771#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5772#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:55,218 INFO L273 TraceCheckUtils]: 40: Hoare triple {5772#(<= main_~i~0 17)} assume true; {5772#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:55,219 INFO L273 TraceCheckUtils]: 41: Hoare triple {5772#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5773#(<= main_~i~0 18)} is VALID [2018-11-14 16:55:55,219 INFO L273 TraceCheckUtils]: 42: Hoare triple {5773#(<= main_~i~0 18)} assume true; {5773#(<= main_~i~0 18)} is VALID [2018-11-14 16:55:55,220 INFO L273 TraceCheckUtils]: 43: Hoare triple {5773#(<= main_~i~0 18)} assume !(~i~0 < 100000); {5754#false} is VALID [2018-11-14 16:55:55,220 INFO L273 TraceCheckUtils]: 44: Hoare triple {5754#false} havoc ~x~0;~x~0 := 0; {5754#false} is VALID [2018-11-14 16:55:55,220 INFO L273 TraceCheckUtils]: 45: Hoare triple {5754#false} assume true; {5754#false} is VALID [2018-11-14 16:55:55,221 INFO L273 TraceCheckUtils]: 46: Hoare triple {5754#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5754#false} is VALID [2018-11-14 16:55:55,221 INFO L256 TraceCheckUtils]: 47: Hoare triple {5754#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {5754#false} is VALID [2018-11-14 16:55:55,221 INFO L273 TraceCheckUtils]: 48: Hoare triple {5754#false} ~cond := #in~cond; {5754#false} is VALID [2018-11-14 16:55:55,221 INFO L273 TraceCheckUtils]: 49: Hoare triple {5754#false} assume ~cond == 0; {5754#false} is VALID [2018-11-14 16:55:55,221 INFO L273 TraceCheckUtils]: 50: Hoare triple {5754#false} assume !false; {5754#false} is VALID [2018-11-14 16:55:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:55,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:55,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-14 16:55:55,246 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-14 16:55:55,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:55,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 16:55:55,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:55,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 16:55:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 16:55:55,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 16:55:55,297 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 22 states. [2018-11-14 16:55:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:55,539 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-14 16:55:55,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 16:55:55,540 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-14 16:55:55,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 16:55:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 72 transitions. [2018-11-14 16:55:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 16:55:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 72 transitions. [2018-11-14 16:55:55,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 72 transitions. [2018-11-14 16:55:55,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:55,947 INFO L225 Difference]: With dead ends: 70 [2018-11-14 16:55:55,948 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 16:55:55,948 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 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-14 16:55:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 16:55:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-14 16:55:55,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:55,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-14 16:55:55,968 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 16:55:55,968 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 16:55:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:55,969 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-14 16:55:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-14 16:55:55,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:55,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:55,970 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 16:55:55,970 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 16:55:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:55,971 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-14 16:55:55,971 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-14 16:55:55,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:55,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:55,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:55,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 16:55:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-14 16:55:55,973 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 51 [2018-11-14 16:55:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:55,973 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-14 16:55:55,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 16:55:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-14 16:55:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 16:55:55,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:55,974 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:55,974 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:55,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1867128482, now seen corresponding path program 19 times [2018-11-14 16:55:55,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:55,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:55,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:55,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:55,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:56,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {6228#true} call ULTIMATE.init(); {6228#true} is VALID [2018-11-14 16:55:56,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {6228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6228#true} is VALID [2018-11-14 16:55:56,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {6228#true} assume true; {6228#true} is VALID [2018-11-14 16:55:56,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6228#true} {6228#true} #50#return; {6228#true} is VALID [2018-11-14 16:55:56,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {6228#true} call #t~ret2 := main(); {6228#true} is VALID [2018-11-14 16:55:56,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {6228#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6230#(= main_~i~0 0)} is VALID [2018-11-14 16:55:56,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {6230#(= main_~i~0 0)} assume true; {6230#(= main_~i~0 0)} is VALID [2018-11-14 16:55:56,682 INFO L273 TraceCheckUtils]: 7: Hoare triple {6230#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6231#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:56,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {6231#(<= main_~i~0 1)} assume true; {6231#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:56,683 INFO L273 TraceCheckUtils]: 9: Hoare triple {6231#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6232#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:56,683 INFO L273 TraceCheckUtils]: 10: Hoare triple {6232#(<= main_~i~0 2)} assume true; {6232#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:56,684 INFO L273 TraceCheckUtils]: 11: Hoare triple {6232#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6233#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:56,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {6233#(<= main_~i~0 3)} assume true; {6233#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:56,686 INFO L273 TraceCheckUtils]: 13: Hoare triple {6233#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6234#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:56,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {6234#(<= main_~i~0 4)} assume true; {6234#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:56,687 INFO L273 TraceCheckUtils]: 15: Hoare triple {6234#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6235#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:56,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {6235#(<= main_~i~0 5)} assume true; {6235#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:56,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {6235#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6236#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:56,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {6236#(<= main_~i~0 6)} assume true; {6236#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:56,691 INFO L273 TraceCheckUtils]: 19: Hoare triple {6236#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6237#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:56,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {6237#(<= main_~i~0 7)} assume true; {6237#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:56,692 INFO L273 TraceCheckUtils]: 21: Hoare triple {6237#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6238#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:56,693 INFO L273 TraceCheckUtils]: 22: Hoare triple {6238#(<= main_~i~0 8)} assume true; {6238#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:56,694 INFO L273 TraceCheckUtils]: 23: Hoare triple {6238#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6239#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:56,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {6239#(<= main_~i~0 9)} assume true; {6239#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:56,696 INFO L273 TraceCheckUtils]: 25: Hoare triple {6239#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6240#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:56,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {6240#(<= main_~i~0 10)} assume true; {6240#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:56,697 INFO L273 TraceCheckUtils]: 27: Hoare triple {6240#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6241#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:56,698 INFO L273 TraceCheckUtils]: 28: Hoare triple {6241#(<= main_~i~0 11)} assume true; {6241#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:56,699 INFO L273 TraceCheckUtils]: 29: Hoare triple {6241#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6242#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:56,700 INFO L273 TraceCheckUtils]: 30: Hoare triple {6242#(<= main_~i~0 12)} assume true; {6242#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:56,701 INFO L273 TraceCheckUtils]: 31: Hoare triple {6242#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6243#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:56,701 INFO L273 TraceCheckUtils]: 32: Hoare triple {6243#(<= main_~i~0 13)} assume true; {6243#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:56,702 INFO L273 TraceCheckUtils]: 33: Hoare triple {6243#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6244#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:56,703 INFO L273 TraceCheckUtils]: 34: Hoare triple {6244#(<= main_~i~0 14)} assume true; {6244#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:56,704 INFO L273 TraceCheckUtils]: 35: Hoare triple {6244#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6245#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:56,705 INFO L273 TraceCheckUtils]: 36: Hoare triple {6245#(<= main_~i~0 15)} assume true; {6245#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:56,706 INFO L273 TraceCheckUtils]: 37: Hoare triple {6245#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6246#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:56,706 INFO L273 TraceCheckUtils]: 38: Hoare triple {6246#(<= main_~i~0 16)} assume true; {6246#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:56,708 INFO L273 TraceCheckUtils]: 39: Hoare triple {6246#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6247#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:56,708 INFO L273 TraceCheckUtils]: 40: Hoare triple {6247#(<= main_~i~0 17)} assume true; {6247#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:56,709 INFO L273 TraceCheckUtils]: 41: Hoare triple {6247#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6248#(<= main_~i~0 18)} is VALID [2018-11-14 16:55:56,710 INFO L273 TraceCheckUtils]: 42: Hoare triple {6248#(<= main_~i~0 18)} assume true; {6248#(<= main_~i~0 18)} is VALID [2018-11-14 16:55:56,711 INFO L273 TraceCheckUtils]: 43: Hoare triple {6248#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6249#(<= main_~i~0 19)} is VALID [2018-11-14 16:55:56,711 INFO L273 TraceCheckUtils]: 44: Hoare triple {6249#(<= main_~i~0 19)} assume true; {6249#(<= main_~i~0 19)} is VALID [2018-11-14 16:55:56,712 INFO L273 TraceCheckUtils]: 45: Hoare triple {6249#(<= main_~i~0 19)} assume !(~i~0 < 100000); {6229#false} is VALID [2018-11-14 16:55:56,713 INFO L273 TraceCheckUtils]: 46: Hoare triple {6229#false} havoc ~x~0;~x~0 := 0; {6229#false} is VALID [2018-11-14 16:55:56,713 INFO L273 TraceCheckUtils]: 47: Hoare triple {6229#false} assume true; {6229#false} is VALID [2018-11-14 16:55:56,713 INFO L273 TraceCheckUtils]: 48: Hoare triple {6229#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6229#false} is VALID [2018-11-14 16:55:56,713 INFO L256 TraceCheckUtils]: 49: Hoare triple {6229#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {6229#false} is VALID [2018-11-14 16:55:56,714 INFO L273 TraceCheckUtils]: 50: Hoare triple {6229#false} ~cond := #in~cond; {6229#false} is VALID [2018-11-14 16:55:56,714 INFO L273 TraceCheckUtils]: 51: Hoare triple {6229#false} assume ~cond == 0; {6229#false} is VALID [2018-11-14 16:55:56,714 INFO L273 TraceCheckUtils]: 52: Hoare triple {6229#false} assume !false; {6229#false} is VALID [2018-11-14 16:55:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:56,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:56,718 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-14 16:55:56,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:56,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:56,975 INFO L256 TraceCheckUtils]: 0: Hoare triple {6228#true} call ULTIMATE.init(); {6228#true} is VALID [2018-11-14 16:55:56,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {6228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6228#true} is VALID [2018-11-14 16:55:56,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {6228#true} assume true; {6228#true} is VALID [2018-11-14 16:55:56,976 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6228#true} {6228#true} #50#return; {6228#true} is VALID [2018-11-14 16:55:56,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {6228#true} call #t~ret2 := main(); {6228#true} is VALID [2018-11-14 16:55:56,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {6228#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6268#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:56,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {6268#(<= main_~i~0 0)} assume true; {6268#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:56,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {6268#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6231#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:56,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {6231#(<= main_~i~0 1)} assume true; {6231#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:56,979 INFO L273 TraceCheckUtils]: 9: Hoare triple {6231#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6232#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:56,979 INFO L273 TraceCheckUtils]: 10: Hoare triple {6232#(<= main_~i~0 2)} assume true; {6232#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:56,981 INFO L273 TraceCheckUtils]: 11: Hoare triple {6232#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6233#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:56,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {6233#(<= main_~i~0 3)} assume true; {6233#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:56,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {6233#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6234#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:56,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {6234#(<= main_~i~0 4)} assume true; {6234#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:56,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {6234#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6235#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:56,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {6235#(<= main_~i~0 5)} assume true; {6235#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:56,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {6235#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6236#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:56,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {6236#(<= main_~i~0 6)} assume true; {6236#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:56,987 INFO L273 TraceCheckUtils]: 19: Hoare triple {6236#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6237#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:56,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {6237#(<= main_~i~0 7)} assume true; {6237#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:56,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {6237#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6238#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:56,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {6238#(<= main_~i~0 8)} assume true; {6238#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:56,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {6238#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6239#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:56,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {6239#(<= main_~i~0 9)} assume true; {6239#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:56,992 INFO L273 TraceCheckUtils]: 25: Hoare triple {6239#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6240#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:56,993 INFO L273 TraceCheckUtils]: 26: Hoare triple {6240#(<= main_~i~0 10)} assume true; {6240#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:56,994 INFO L273 TraceCheckUtils]: 27: Hoare triple {6240#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6241#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:56,995 INFO L273 TraceCheckUtils]: 28: Hoare triple {6241#(<= main_~i~0 11)} assume true; {6241#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:56,996 INFO L273 TraceCheckUtils]: 29: Hoare triple {6241#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6242#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:56,996 INFO L273 TraceCheckUtils]: 30: Hoare triple {6242#(<= main_~i~0 12)} assume true; {6242#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:56,997 INFO L273 TraceCheckUtils]: 31: Hoare triple {6242#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6243#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:56,998 INFO L273 TraceCheckUtils]: 32: Hoare triple {6243#(<= main_~i~0 13)} assume true; {6243#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:56,999 INFO L273 TraceCheckUtils]: 33: Hoare triple {6243#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6244#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:57,000 INFO L273 TraceCheckUtils]: 34: Hoare triple {6244#(<= main_~i~0 14)} assume true; {6244#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:57,001 INFO L273 TraceCheckUtils]: 35: Hoare triple {6244#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6245#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:57,020 INFO L273 TraceCheckUtils]: 36: Hoare triple {6245#(<= main_~i~0 15)} assume true; {6245#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:57,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {6245#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6246#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:57,021 INFO L273 TraceCheckUtils]: 38: Hoare triple {6246#(<= main_~i~0 16)} assume true; {6246#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:57,022 INFO L273 TraceCheckUtils]: 39: Hoare triple {6246#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6247#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:57,022 INFO L273 TraceCheckUtils]: 40: Hoare triple {6247#(<= main_~i~0 17)} assume true; {6247#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:57,023 INFO L273 TraceCheckUtils]: 41: Hoare triple {6247#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6248#(<= main_~i~0 18)} is VALID [2018-11-14 16:55:57,024 INFO L273 TraceCheckUtils]: 42: Hoare triple {6248#(<= main_~i~0 18)} assume true; {6248#(<= main_~i~0 18)} is VALID [2018-11-14 16:55:57,025 INFO L273 TraceCheckUtils]: 43: Hoare triple {6248#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6249#(<= main_~i~0 19)} is VALID [2018-11-14 16:55:57,026 INFO L273 TraceCheckUtils]: 44: Hoare triple {6249#(<= main_~i~0 19)} assume true; {6249#(<= main_~i~0 19)} is VALID [2018-11-14 16:55:57,026 INFO L273 TraceCheckUtils]: 45: Hoare triple {6249#(<= main_~i~0 19)} assume !(~i~0 < 100000); {6229#false} is VALID [2018-11-14 16:55:57,027 INFO L273 TraceCheckUtils]: 46: Hoare triple {6229#false} havoc ~x~0;~x~0 := 0; {6229#false} is VALID [2018-11-14 16:55:57,027 INFO L273 TraceCheckUtils]: 47: Hoare triple {6229#false} assume true; {6229#false} is VALID [2018-11-14 16:55:57,027 INFO L273 TraceCheckUtils]: 48: Hoare triple {6229#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6229#false} is VALID [2018-11-14 16:55:57,027 INFO L256 TraceCheckUtils]: 49: Hoare triple {6229#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {6229#false} is VALID [2018-11-14 16:55:57,028 INFO L273 TraceCheckUtils]: 50: Hoare triple {6229#false} ~cond := #in~cond; {6229#false} is VALID [2018-11-14 16:55:57,028 INFO L273 TraceCheckUtils]: 51: Hoare triple {6229#false} assume ~cond == 0; {6229#false} is VALID [2018-11-14 16:55:57,028 INFO L273 TraceCheckUtils]: 52: Hoare triple {6229#false} assume !false; {6229#false} is VALID [2018-11-14 16:55:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:57,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:57,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 16:55:57,055 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-11-14 16:55:57,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:57,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 16:55:57,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:57,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 16:55:57,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 16:55:57,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:55:57,118 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 23 states. [2018-11-14 16:55:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:57,859 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-14 16:55:57,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 16:55:57,859 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-11-14 16:55:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:55:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 74 transitions. [2018-11-14 16:55:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:55:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 74 transitions. [2018-11-14 16:55:57,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 74 transitions. [2018-11-14 16:55:58,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:58,288 INFO L225 Difference]: With dead ends: 72 [2018-11-14 16:55:58,288 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 16:55:58,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:55:58,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 16:55:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-14 16:55:58,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:58,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-14 16:55:58,367 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 16:55:58,367 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 16:55:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:58,368 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-14 16:55:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-14 16:55:58,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:58,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:58,369 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 16:55:58,369 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 16:55:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:58,370 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-14 16:55:58,370 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-14 16:55:58,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:58,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:58,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:58,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 16:55:58,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-14 16:55:58,372 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 53 [2018-11-14 16:55:58,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:58,372 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-14 16:55:58,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 16:55:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-14 16:55:58,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 16:55:58,373 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:58,373 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:58,373 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:58,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:58,374 INFO L82 PathProgramCache]: Analyzing trace with hash -997798532, now seen corresponding path program 20 times [2018-11-14 16:55:58,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:58,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:58,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:59,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {6720#true} call ULTIMATE.init(); {6720#true} is VALID [2018-11-14 16:55:59,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {6720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6720#true} is VALID [2018-11-14 16:55:59,181 INFO L273 TraceCheckUtils]: 2: Hoare triple {6720#true} assume true; {6720#true} is VALID [2018-11-14 16:55:59,181 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6720#true} {6720#true} #50#return; {6720#true} is VALID [2018-11-14 16:55:59,182 INFO L256 TraceCheckUtils]: 4: Hoare triple {6720#true} call #t~ret2 := main(); {6720#true} is VALID [2018-11-14 16:55:59,182 INFO L273 TraceCheckUtils]: 5: Hoare triple {6720#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6722#(= main_~i~0 0)} is VALID [2018-11-14 16:55:59,183 INFO L273 TraceCheckUtils]: 6: Hoare triple {6722#(= main_~i~0 0)} assume true; {6722#(= main_~i~0 0)} is VALID [2018-11-14 16:55:59,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {6722#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6723#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:59,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {6723#(<= main_~i~0 1)} assume true; {6723#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:59,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {6723#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6724#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:59,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {6724#(<= main_~i~0 2)} assume true; {6724#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:59,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {6724#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6725#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:59,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {6725#(<= main_~i~0 3)} assume true; {6725#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:59,186 INFO L273 TraceCheckUtils]: 13: Hoare triple {6725#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6726#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:59,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {6726#(<= main_~i~0 4)} assume true; {6726#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:59,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {6726#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6727#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:59,188 INFO L273 TraceCheckUtils]: 16: Hoare triple {6727#(<= main_~i~0 5)} assume true; {6727#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:59,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {6727#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6728#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:59,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {6728#(<= main_~i~0 6)} assume true; {6728#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:59,191 INFO L273 TraceCheckUtils]: 19: Hoare triple {6728#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6729#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:59,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {6729#(<= main_~i~0 7)} assume true; {6729#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:59,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {6729#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6730#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:59,193 INFO L273 TraceCheckUtils]: 22: Hoare triple {6730#(<= main_~i~0 8)} assume true; {6730#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:59,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {6730#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6731#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:59,194 INFO L273 TraceCheckUtils]: 24: Hoare triple {6731#(<= main_~i~0 9)} assume true; {6731#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:59,195 INFO L273 TraceCheckUtils]: 25: Hoare triple {6731#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6732#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:59,195 INFO L273 TraceCheckUtils]: 26: Hoare triple {6732#(<= main_~i~0 10)} assume true; {6732#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:59,196 INFO L273 TraceCheckUtils]: 27: Hoare triple {6732#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6733#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:59,197 INFO L273 TraceCheckUtils]: 28: Hoare triple {6733#(<= main_~i~0 11)} assume true; {6733#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:59,198 INFO L273 TraceCheckUtils]: 29: Hoare triple {6733#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6734#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:59,198 INFO L273 TraceCheckUtils]: 30: Hoare triple {6734#(<= main_~i~0 12)} assume true; {6734#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:59,199 INFO L273 TraceCheckUtils]: 31: Hoare triple {6734#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6735#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:59,200 INFO L273 TraceCheckUtils]: 32: Hoare triple {6735#(<= main_~i~0 13)} assume true; {6735#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:59,201 INFO L273 TraceCheckUtils]: 33: Hoare triple {6735#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6736#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:59,201 INFO L273 TraceCheckUtils]: 34: Hoare triple {6736#(<= main_~i~0 14)} assume true; {6736#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:59,202 INFO L273 TraceCheckUtils]: 35: Hoare triple {6736#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6737#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:59,203 INFO L273 TraceCheckUtils]: 36: Hoare triple {6737#(<= main_~i~0 15)} assume true; {6737#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:59,204 INFO L273 TraceCheckUtils]: 37: Hoare triple {6737#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6738#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:59,204 INFO L273 TraceCheckUtils]: 38: Hoare triple {6738#(<= main_~i~0 16)} assume true; {6738#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:59,205 INFO L273 TraceCheckUtils]: 39: Hoare triple {6738#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6739#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:59,206 INFO L273 TraceCheckUtils]: 40: Hoare triple {6739#(<= main_~i~0 17)} assume true; {6739#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:59,206 INFO L273 TraceCheckUtils]: 41: Hoare triple {6739#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6740#(<= main_~i~0 18)} is VALID [2018-11-14 16:55:59,207 INFO L273 TraceCheckUtils]: 42: Hoare triple {6740#(<= main_~i~0 18)} assume true; {6740#(<= main_~i~0 18)} is VALID [2018-11-14 16:55:59,208 INFO L273 TraceCheckUtils]: 43: Hoare triple {6740#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6741#(<= main_~i~0 19)} is VALID [2018-11-14 16:55:59,208 INFO L273 TraceCheckUtils]: 44: Hoare triple {6741#(<= main_~i~0 19)} assume true; {6741#(<= main_~i~0 19)} is VALID [2018-11-14 16:55:59,209 INFO L273 TraceCheckUtils]: 45: Hoare triple {6741#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6742#(<= main_~i~0 20)} is VALID [2018-11-14 16:55:59,210 INFO L273 TraceCheckUtils]: 46: Hoare triple {6742#(<= main_~i~0 20)} assume true; {6742#(<= main_~i~0 20)} is VALID [2018-11-14 16:55:59,211 INFO L273 TraceCheckUtils]: 47: Hoare triple {6742#(<= main_~i~0 20)} assume !(~i~0 < 100000); {6721#false} is VALID [2018-11-14 16:55:59,211 INFO L273 TraceCheckUtils]: 48: Hoare triple {6721#false} havoc ~x~0;~x~0 := 0; {6721#false} is VALID [2018-11-14 16:55:59,211 INFO L273 TraceCheckUtils]: 49: Hoare triple {6721#false} assume true; {6721#false} is VALID [2018-11-14 16:55:59,211 INFO L273 TraceCheckUtils]: 50: Hoare triple {6721#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6721#false} is VALID [2018-11-14 16:55:59,212 INFO L256 TraceCheckUtils]: 51: Hoare triple {6721#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {6721#false} is VALID [2018-11-14 16:55:59,212 INFO L273 TraceCheckUtils]: 52: Hoare triple {6721#false} ~cond := #in~cond; {6721#false} is VALID [2018-11-14 16:55:59,212 INFO L273 TraceCheckUtils]: 53: Hoare triple {6721#false} assume ~cond == 0; {6721#false} is VALID [2018-11-14 16:55:59,212 INFO L273 TraceCheckUtils]: 54: Hoare triple {6721#false} assume !false; {6721#false} is VALID [2018-11-14 16:55:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:59,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:59,215 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-14 16:55:59,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:55:59,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:55:59,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:59,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:59,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {6720#true} call ULTIMATE.init(); {6720#true} is VALID [2018-11-14 16:55:59,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {6720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6720#true} is VALID [2018-11-14 16:55:59,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {6720#true} assume true; {6720#true} is VALID [2018-11-14 16:55:59,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6720#true} {6720#true} #50#return; {6720#true} is VALID [2018-11-14 16:55:59,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {6720#true} call #t~ret2 := main(); {6720#true} is VALID [2018-11-14 16:55:59,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {6720#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6761#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:59,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {6761#(<= main_~i~0 0)} assume true; {6761#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:59,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {6761#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6723#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:59,416 INFO L273 TraceCheckUtils]: 8: Hoare triple {6723#(<= main_~i~0 1)} assume true; {6723#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:59,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {6723#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6724#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:59,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {6724#(<= main_~i~0 2)} assume true; {6724#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:59,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {6724#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6725#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:59,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {6725#(<= main_~i~0 3)} assume true; {6725#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:59,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {6725#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6726#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:59,420 INFO L273 TraceCheckUtils]: 14: Hoare triple {6726#(<= main_~i~0 4)} assume true; {6726#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:59,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {6726#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6727#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:59,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {6727#(<= main_~i~0 5)} assume true; {6727#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:59,422 INFO L273 TraceCheckUtils]: 17: Hoare triple {6727#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6728#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:59,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {6728#(<= main_~i~0 6)} assume true; {6728#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:59,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {6728#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6729#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:59,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {6729#(<= main_~i~0 7)} assume true; {6729#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:59,425 INFO L273 TraceCheckUtils]: 21: Hoare triple {6729#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6730#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:59,426 INFO L273 TraceCheckUtils]: 22: Hoare triple {6730#(<= main_~i~0 8)} assume true; {6730#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:59,426 INFO L273 TraceCheckUtils]: 23: Hoare triple {6730#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6731#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:59,427 INFO L273 TraceCheckUtils]: 24: Hoare triple {6731#(<= main_~i~0 9)} assume true; {6731#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:59,428 INFO L273 TraceCheckUtils]: 25: Hoare triple {6731#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6732#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:59,428 INFO L273 TraceCheckUtils]: 26: Hoare triple {6732#(<= main_~i~0 10)} assume true; {6732#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:59,429 INFO L273 TraceCheckUtils]: 27: Hoare triple {6732#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6733#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:59,430 INFO L273 TraceCheckUtils]: 28: Hoare triple {6733#(<= main_~i~0 11)} assume true; {6733#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:59,431 INFO L273 TraceCheckUtils]: 29: Hoare triple {6733#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6734#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:59,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {6734#(<= main_~i~0 12)} assume true; {6734#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:59,432 INFO L273 TraceCheckUtils]: 31: Hoare triple {6734#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6735#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:59,433 INFO L273 TraceCheckUtils]: 32: Hoare triple {6735#(<= main_~i~0 13)} assume true; {6735#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:59,434 INFO L273 TraceCheckUtils]: 33: Hoare triple {6735#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6736#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:59,434 INFO L273 TraceCheckUtils]: 34: Hoare triple {6736#(<= main_~i~0 14)} assume true; {6736#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:59,435 INFO L273 TraceCheckUtils]: 35: Hoare triple {6736#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6737#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:59,436 INFO L273 TraceCheckUtils]: 36: Hoare triple {6737#(<= main_~i~0 15)} assume true; {6737#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:59,437 INFO L273 TraceCheckUtils]: 37: Hoare triple {6737#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6738#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:59,437 INFO L273 TraceCheckUtils]: 38: Hoare triple {6738#(<= main_~i~0 16)} assume true; {6738#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:59,438 INFO L273 TraceCheckUtils]: 39: Hoare triple {6738#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6739#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:59,439 INFO L273 TraceCheckUtils]: 40: Hoare triple {6739#(<= main_~i~0 17)} assume true; {6739#(<= main_~i~0 17)} is VALID [2018-11-14 16:55:59,439 INFO L273 TraceCheckUtils]: 41: Hoare triple {6739#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6740#(<= main_~i~0 18)} is VALID [2018-11-14 16:55:59,440 INFO L273 TraceCheckUtils]: 42: Hoare triple {6740#(<= main_~i~0 18)} assume true; {6740#(<= main_~i~0 18)} is VALID [2018-11-14 16:55:59,441 INFO L273 TraceCheckUtils]: 43: Hoare triple {6740#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6741#(<= main_~i~0 19)} is VALID [2018-11-14 16:55:59,441 INFO L273 TraceCheckUtils]: 44: Hoare triple {6741#(<= main_~i~0 19)} assume true; {6741#(<= main_~i~0 19)} is VALID [2018-11-14 16:55:59,442 INFO L273 TraceCheckUtils]: 45: Hoare triple {6741#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6742#(<= main_~i~0 20)} is VALID [2018-11-14 16:55:59,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {6742#(<= main_~i~0 20)} assume true; {6742#(<= main_~i~0 20)} is VALID [2018-11-14 16:55:59,444 INFO L273 TraceCheckUtils]: 47: Hoare triple {6742#(<= main_~i~0 20)} assume !(~i~0 < 100000); {6721#false} is VALID [2018-11-14 16:55:59,444 INFO L273 TraceCheckUtils]: 48: Hoare triple {6721#false} havoc ~x~0;~x~0 := 0; {6721#false} is VALID [2018-11-14 16:55:59,444 INFO L273 TraceCheckUtils]: 49: Hoare triple {6721#false} assume true; {6721#false} is VALID [2018-11-14 16:55:59,444 INFO L273 TraceCheckUtils]: 50: Hoare triple {6721#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6721#false} is VALID [2018-11-14 16:55:59,444 INFO L256 TraceCheckUtils]: 51: Hoare triple {6721#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {6721#false} is VALID [2018-11-14 16:55:59,445 INFO L273 TraceCheckUtils]: 52: Hoare triple {6721#false} ~cond := #in~cond; {6721#false} is VALID [2018-11-14 16:55:59,445 INFO L273 TraceCheckUtils]: 53: Hoare triple {6721#false} assume ~cond == 0; {6721#false} is VALID [2018-11-14 16:55:59,445 INFO L273 TraceCheckUtils]: 54: Hoare triple {6721#false} assume !false; {6721#false} is VALID [2018-11-14 16:55:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:59,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:59,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 16:55:59,469 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-11-14 16:55:59,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:59,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 16:55:59,522 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-14 16:55:59,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 16:55:59,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 16:55:59,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:55:59,524 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 24 states. [2018-11-14 16:55:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:59,872 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-14 16:55:59,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 16:55:59,872 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-11-14 16:55:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:55:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 76 transitions. [2018-11-14 16:55:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:55:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 76 transitions. [2018-11-14 16:55:59,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 76 transitions. [2018-11-14 16:55:59,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:59,963 INFO L225 Difference]: With dead ends: 74 [2018-11-14 16:55:59,963 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 16:55:59,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:55:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 16:56:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-14 16:56:00,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:00,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-14 16:56:00,040 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 16:56:00,040 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 16:56:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:00,041 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-14 16:56:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-14 16:56:00,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:00,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:00,042 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 16:56:00,042 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 16:56:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:00,044 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-14 16:56:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-14 16:56:00,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:00,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:00,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:00,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 16:56:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-14 16:56:00,046 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 55 [2018-11-14 16:56:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:00,046 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-14 16:56:00,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 16:56:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-14 16:56:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 16:56:00,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:00,047 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:00,047 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:00,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:00,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1118622250, now seen corresponding path program 21 times [2018-11-14 16:56:00,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:00,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:00,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:00,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:00,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:00,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {7229#true} call ULTIMATE.init(); {7229#true} is VALID [2018-11-14 16:56:00,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {7229#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7229#true} is VALID [2018-11-14 16:56:00,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {7229#true} assume true; {7229#true} is VALID [2018-11-14 16:56:00,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7229#true} {7229#true} #50#return; {7229#true} is VALID [2018-11-14 16:56:00,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {7229#true} call #t~ret2 := main(); {7229#true} is VALID [2018-11-14 16:56:00,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {7229#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7231#(= main_~i~0 0)} is VALID [2018-11-14 16:56:00,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {7231#(= main_~i~0 0)} assume true; {7231#(= main_~i~0 0)} is VALID [2018-11-14 16:56:00,401 INFO L273 TraceCheckUtils]: 7: Hoare triple {7231#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7232#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:00,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {7232#(<= main_~i~0 1)} assume true; {7232#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:00,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {7232#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7233#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:00,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {7233#(<= main_~i~0 2)} assume true; {7233#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:00,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {7233#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7234#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:00,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {7234#(<= main_~i~0 3)} assume true; {7234#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:00,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {7234#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7235#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:00,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {7235#(<= main_~i~0 4)} assume true; {7235#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:00,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {7235#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7236#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:00,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {7236#(<= main_~i~0 5)} assume true; {7236#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:00,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {7236#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7237#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:00,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {7237#(<= main_~i~0 6)} assume true; {7237#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:00,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {7237#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7238#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:00,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {7238#(<= main_~i~0 7)} assume true; {7238#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:00,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {7238#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7239#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:00,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {7239#(<= main_~i~0 8)} assume true; {7239#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:00,412 INFO L273 TraceCheckUtils]: 23: Hoare triple {7239#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7240#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:00,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {7240#(<= main_~i~0 9)} assume true; {7240#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:00,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {7240#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7241#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:00,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {7241#(<= main_~i~0 10)} assume true; {7241#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:00,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {7241#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7242#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:00,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {7242#(<= main_~i~0 11)} assume true; {7242#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:00,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {7242#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7243#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:00,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {7243#(<= main_~i~0 12)} assume true; {7243#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:00,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {7243#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7244#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:00,419 INFO L273 TraceCheckUtils]: 32: Hoare triple {7244#(<= main_~i~0 13)} assume true; {7244#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:00,420 INFO L273 TraceCheckUtils]: 33: Hoare triple {7244#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7245#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:00,420 INFO L273 TraceCheckUtils]: 34: Hoare triple {7245#(<= main_~i~0 14)} assume true; {7245#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:00,421 INFO L273 TraceCheckUtils]: 35: Hoare triple {7245#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7246#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:00,422 INFO L273 TraceCheckUtils]: 36: Hoare triple {7246#(<= main_~i~0 15)} assume true; {7246#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:00,423 INFO L273 TraceCheckUtils]: 37: Hoare triple {7246#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7247#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:00,423 INFO L273 TraceCheckUtils]: 38: Hoare triple {7247#(<= main_~i~0 16)} assume true; {7247#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:00,424 INFO L273 TraceCheckUtils]: 39: Hoare triple {7247#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7248#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:00,425 INFO L273 TraceCheckUtils]: 40: Hoare triple {7248#(<= main_~i~0 17)} assume true; {7248#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:00,426 INFO L273 TraceCheckUtils]: 41: Hoare triple {7248#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7249#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:00,426 INFO L273 TraceCheckUtils]: 42: Hoare triple {7249#(<= main_~i~0 18)} assume true; {7249#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:00,427 INFO L273 TraceCheckUtils]: 43: Hoare triple {7249#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7250#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:00,428 INFO L273 TraceCheckUtils]: 44: Hoare triple {7250#(<= main_~i~0 19)} assume true; {7250#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:00,428 INFO L273 TraceCheckUtils]: 45: Hoare triple {7250#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7251#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:00,429 INFO L273 TraceCheckUtils]: 46: Hoare triple {7251#(<= main_~i~0 20)} assume true; {7251#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:00,430 INFO L273 TraceCheckUtils]: 47: Hoare triple {7251#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7252#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:00,430 INFO L273 TraceCheckUtils]: 48: Hoare triple {7252#(<= main_~i~0 21)} assume true; {7252#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:00,431 INFO L273 TraceCheckUtils]: 49: Hoare triple {7252#(<= main_~i~0 21)} assume !(~i~0 < 100000); {7230#false} is VALID [2018-11-14 16:56:00,431 INFO L273 TraceCheckUtils]: 50: Hoare triple {7230#false} havoc ~x~0;~x~0 := 0; {7230#false} is VALID [2018-11-14 16:56:00,432 INFO L273 TraceCheckUtils]: 51: Hoare triple {7230#false} assume true; {7230#false} is VALID [2018-11-14 16:56:00,432 INFO L273 TraceCheckUtils]: 52: Hoare triple {7230#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7230#false} is VALID [2018-11-14 16:56:00,432 INFO L256 TraceCheckUtils]: 53: Hoare triple {7230#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {7230#false} is VALID [2018-11-14 16:56:00,432 INFO L273 TraceCheckUtils]: 54: Hoare triple {7230#false} ~cond := #in~cond; {7230#false} is VALID [2018-11-14 16:56:00,432 INFO L273 TraceCheckUtils]: 55: Hoare triple {7230#false} assume ~cond == 0; {7230#false} is VALID [2018-11-14 16:56:00,433 INFO L273 TraceCheckUtils]: 56: Hoare triple {7230#false} assume !false; {7230#false} is VALID [2018-11-14 16:56:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:00,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:00,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 16:56:00,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:56:01,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-14 16:56:01,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:01,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:01,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {7229#true} call ULTIMATE.init(); {7229#true} is VALID [2018-11-14 16:56:01,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {7229#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7229#true} is VALID [2018-11-14 16:56:01,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {7229#true} assume true; {7229#true} is VALID [2018-11-14 16:56:01,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7229#true} {7229#true} #50#return; {7229#true} is VALID [2018-11-14 16:56:01,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {7229#true} call #t~ret2 := main(); {7229#true} is VALID [2018-11-14 16:56:01,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {7229#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7271#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:01,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {7271#(<= main_~i~0 0)} assume true; {7271#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:01,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {7271#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7232#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:01,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {7232#(<= main_~i~0 1)} assume true; {7232#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:01,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {7232#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7233#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:01,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {7233#(<= main_~i~0 2)} assume true; {7233#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:01,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {7233#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7234#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:01,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {7234#(<= main_~i~0 3)} assume true; {7234#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:01,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {7234#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7235#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:01,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {7235#(<= main_~i~0 4)} assume true; {7235#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:01,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {7235#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7236#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:01,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {7236#(<= main_~i~0 5)} assume true; {7236#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:01,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {7236#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7237#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:01,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {7237#(<= main_~i~0 6)} assume true; {7237#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:01,623 INFO L273 TraceCheckUtils]: 19: Hoare triple {7237#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7238#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:01,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {7238#(<= main_~i~0 7)} assume true; {7238#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:01,625 INFO L273 TraceCheckUtils]: 21: Hoare triple {7238#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7239#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:01,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {7239#(<= main_~i~0 8)} assume true; {7239#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:01,626 INFO L273 TraceCheckUtils]: 23: Hoare triple {7239#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7240#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:01,627 INFO L273 TraceCheckUtils]: 24: Hoare triple {7240#(<= main_~i~0 9)} assume true; {7240#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:01,628 INFO L273 TraceCheckUtils]: 25: Hoare triple {7240#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7241#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:01,628 INFO L273 TraceCheckUtils]: 26: Hoare triple {7241#(<= main_~i~0 10)} assume true; {7241#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:01,629 INFO L273 TraceCheckUtils]: 27: Hoare triple {7241#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7242#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:01,630 INFO L273 TraceCheckUtils]: 28: Hoare triple {7242#(<= main_~i~0 11)} assume true; {7242#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:01,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {7242#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7243#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:01,631 INFO L273 TraceCheckUtils]: 30: Hoare triple {7243#(<= main_~i~0 12)} assume true; {7243#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:01,632 INFO L273 TraceCheckUtils]: 31: Hoare triple {7243#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7244#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:01,633 INFO L273 TraceCheckUtils]: 32: Hoare triple {7244#(<= main_~i~0 13)} assume true; {7244#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:01,634 INFO L273 TraceCheckUtils]: 33: Hoare triple {7244#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7245#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:01,634 INFO L273 TraceCheckUtils]: 34: Hoare triple {7245#(<= main_~i~0 14)} assume true; {7245#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:01,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {7245#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7246#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:01,636 INFO L273 TraceCheckUtils]: 36: Hoare triple {7246#(<= main_~i~0 15)} assume true; {7246#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:01,636 INFO L273 TraceCheckUtils]: 37: Hoare triple {7246#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7247#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:01,637 INFO L273 TraceCheckUtils]: 38: Hoare triple {7247#(<= main_~i~0 16)} assume true; {7247#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:01,638 INFO L273 TraceCheckUtils]: 39: Hoare triple {7247#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7248#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:01,638 INFO L273 TraceCheckUtils]: 40: Hoare triple {7248#(<= main_~i~0 17)} assume true; {7248#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:01,639 INFO L273 TraceCheckUtils]: 41: Hoare triple {7248#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7249#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:01,640 INFO L273 TraceCheckUtils]: 42: Hoare triple {7249#(<= main_~i~0 18)} assume true; {7249#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:01,641 INFO L273 TraceCheckUtils]: 43: Hoare triple {7249#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7250#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:01,641 INFO L273 TraceCheckUtils]: 44: Hoare triple {7250#(<= main_~i~0 19)} assume true; {7250#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:01,642 INFO L273 TraceCheckUtils]: 45: Hoare triple {7250#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7251#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:01,643 INFO L273 TraceCheckUtils]: 46: Hoare triple {7251#(<= main_~i~0 20)} assume true; {7251#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:01,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {7251#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7252#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:01,644 INFO L273 TraceCheckUtils]: 48: Hoare triple {7252#(<= main_~i~0 21)} assume true; {7252#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:01,645 INFO L273 TraceCheckUtils]: 49: Hoare triple {7252#(<= main_~i~0 21)} assume !(~i~0 < 100000); {7230#false} is VALID [2018-11-14 16:56:01,645 INFO L273 TraceCheckUtils]: 50: Hoare triple {7230#false} havoc ~x~0;~x~0 := 0; {7230#false} is VALID [2018-11-14 16:56:01,645 INFO L273 TraceCheckUtils]: 51: Hoare triple {7230#false} assume true; {7230#false} is VALID [2018-11-14 16:56:01,646 INFO L273 TraceCheckUtils]: 52: Hoare triple {7230#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7230#false} is VALID [2018-11-14 16:56:01,646 INFO L256 TraceCheckUtils]: 53: Hoare triple {7230#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {7230#false} is VALID [2018-11-14 16:56:01,646 INFO L273 TraceCheckUtils]: 54: Hoare triple {7230#false} ~cond := #in~cond; {7230#false} is VALID [2018-11-14 16:56:01,646 INFO L273 TraceCheckUtils]: 55: Hoare triple {7230#false} assume ~cond == 0; {7230#false} is VALID [2018-11-14 16:56:01,646 INFO L273 TraceCheckUtils]: 56: Hoare triple {7230#false} assume !false; {7230#false} is VALID [2018-11-14 16:56:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:01,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:01,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-14 16:56:01,671 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-11-14 16:56:01,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:01,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 16:56:01,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:01,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 16:56:01,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 16:56:01,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 16:56:01,729 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 25 states. [2018-11-14 16:56:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:02,091 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-14 16:56:02,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 16:56:02,091 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-11-14 16:56:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 16:56:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 78 transitions. [2018-11-14 16:56:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 16:56:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 78 transitions. [2018-11-14 16:56:02,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 78 transitions. [2018-11-14 16:56:02,350 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-14 16:56:02,351 INFO L225 Difference]: With dead ends: 76 [2018-11-14 16:56:02,351 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 16:56:02,352 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 16:56:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 16:56:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-14 16:56:02,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:02,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-14 16:56:02,371 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-14 16:56:02,371 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-14 16:56:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:02,372 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-14 16:56:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-14 16:56:02,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:02,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:02,373 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-14 16:56:02,373 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-14 16:56:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:02,374 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-14 16:56:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-14 16:56:02,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:02,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:02,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:02,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 16:56:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-14 16:56:02,376 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 57 [2018-11-14 16:56:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:02,376 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-14 16:56:02,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 16:56:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-14 16:56:02,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-14 16:56:02,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:02,377 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:02,377 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:02,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:02,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1266098256, now seen corresponding path program 22 times [2018-11-14 16:56:02,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:02,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:02,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:02,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:02,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {7755#true} call ULTIMATE.init(); {7755#true} is VALID [2018-11-14 16:56:02,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {7755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7755#true} is VALID [2018-11-14 16:56:02,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {7755#true} assume true; {7755#true} is VALID [2018-11-14 16:56:02,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7755#true} {7755#true} #50#return; {7755#true} is VALID [2018-11-14 16:56:02,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {7755#true} call #t~ret2 := main(); {7755#true} is VALID [2018-11-14 16:56:02,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {7755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7757#(= main_~i~0 0)} is VALID [2018-11-14 16:56:02,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {7757#(= main_~i~0 0)} assume true; {7757#(= main_~i~0 0)} is VALID [2018-11-14 16:56:02,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {7757#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7758#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:02,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {7758#(<= main_~i~0 1)} assume true; {7758#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:02,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {7758#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7759#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:02,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {7759#(<= main_~i~0 2)} assume true; {7759#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:02,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {7759#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7760#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:02,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {7760#(<= main_~i~0 3)} assume true; {7760#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:02,854 INFO L273 TraceCheckUtils]: 13: Hoare triple {7760#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7761#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:02,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {7761#(<= main_~i~0 4)} assume true; {7761#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:02,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {7761#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7762#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:02,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {7762#(<= main_~i~0 5)} assume true; {7762#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:02,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {7762#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7763#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:02,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {7763#(<= main_~i~0 6)} assume true; {7763#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:02,859 INFO L273 TraceCheckUtils]: 19: Hoare triple {7763#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7764#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:02,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {7764#(<= main_~i~0 7)} assume true; {7764#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:02,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {7764#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7765#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:02,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {7765#(<= main_~i~0 8)} assume true; {7765#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:02,862 INFO L273 TraceCheckUtils]: 23: Hoare triple {7765#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7766#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:02,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {7766#(<= main_~i~0 9)} assume true; {7766#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:02,863 INFO L273 TraceCheckUtils]: 25: Hoare triple {7766#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7767#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:02,864 INFO L273 TraceCheckUtils]: 26: Hoare triple {7767#(<= main_~i~0 10)} assume true; {7767#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:02,865 INFO L273 TraceCheckUtils]: 27: Hoare triple {7767#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7768#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:02,865 INFO L273 TraceCheckUtils]: 28: Hoare triple {7768#(<= main_~i~0 11)} assume true; {7768#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:02,866 INFO L273 TraceCheckUtils]: 29: Hoare triple {7768#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7769#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:02,867 INFO L273 TraceCheckUtils]: 30: Hoare triple {7769#(<= main_~i~0 12)} assume true; {7769#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:02,867 INFO L273 TraceCheckUtils]: 31: Hoare triple {7769#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7770#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:02,868 INFO L273 TraceCheckUtils]: 32: Hoare triple {7770#(<= main_~i~0 13)} assume true; {7770#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:02,869 INFO L273 TraceCheckUtils]: 33: Hoare triple {7770#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7771#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:02,869 INFO L273 TraceCheckUtils]: 34: Hoare triple {7771#(<= main_~i~0 14)} assume true; {7771#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:02,870 INFO L273 TraceCheckUtils]: 35: Hoare triple {7771#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7772#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:02,871 INFO L273 TraceCheckUtils]: 36: Hoare triple {7772#(<= main_~i~0 15)} assume true; {7772#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:02,872 INFO L273 TraceCheckUtils]: 37: Hoare triple {7772#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7773#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:02,872 INFO L273 TraceCheckUtils]: 38: Hoare triple {7773#(<= main_~i~0 16)} assume true; {7773#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:02,873 INFO L273 TraceCheckUtils]: 39: Hoare triple {7773#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7774#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:02,874 INFO L273 TraceCheckUtils]: 40: Hoare triple {7774#(<= main_~i~0 17)} assume true; {7774#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:02,875 INFO L273 TraceCheckUtils]: 41: Hoare triple {7774#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7775#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:02,875 INFO L273 TraceCheckUtils]: 42: Hoare triple {7775#(<= main_~i~0 18)} assume true; {7775#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:02,876 INFO L273 TraceCheckUtils]: 43: Hoare triple {7775#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7776#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:02,877 INFO L273 TraceCheckUtils]: 44: Hoare triple {7776#(<= main_~i~0 19)} assume true; {7776#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:02,878 INFO L273 TraceCheckUtils]: 45: Hoare triple {7776#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7777#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:02,878 INFO L273 TraceCheckUtils]: 46: Hoare triple {7777#(<= main_~i~0 20)} assume true; {7777#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:02,879 INFO L273 TraceCheckUtils]: 47: Hoare triple {7777#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7778#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:02,880 INFO L273 TraceCheckUtils]: 48: Hoare triple {7778#(<= main_~i~0 21)} assume true; {7778#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:02,881 INFO L273 TraceCheckUtils]: 49: Hoare triple {7778#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7779#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:02,881 INFO L273 TraceCheckUtils]: 50: Hoare triple {7779#(<= main_~i~0 22)} assume true; {7779#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:02,882 INFO L273 TraceCheckUtils]: 51: Hoare triple {7779#(<= main_~i~0 22)} assume !(~i~0 < 100000); {7756#false} is VALID [2018-11-14 16:56:02,882 INFO L273 TraceCheckUtils]: 52: Hoare triple {7756#false} havoc ~x~0;~x~0 := 0; {7756#false} is VALID [2018-11-14 16:56:02,882 INFO L273 TraceCheckUtils]: 53: Hoare triple {7756#false} assume true; {7756#false} is VALID [2018-11-14 16:56:02,882 INFO L273 TraceCheckUtils]: 54: Hoare triple {7756#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7756#false} is VALID [2018-11-14 16:56:02,883 INFO L256 TraceCheckUtils]: 55: Hoare triple {7756#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {7756#false} is VALID [2018-11-14 16:56:02,883 INFO L273 TraceCheckUtils]: 56: Hoare triple {7756#false} ~cond := #in~cond; {7756#false} is VALID [2018-11-14 16:56:02,883 INFO L273 TraceCheckUtils]: 57: Hoare triple {7756#false} assume ~cond == 0; {7756#false} is VALID [2018-11-14 16:56:02,883 INFO L273 TraceCheckUtils]: 58: Hoare triple {7756#false} assume !false; {7756#false} is VALID [2018-11-14 16:56:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:02,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:02,888 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-14 16:56:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:56:02,936 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:56:02,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:02,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:03,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {7755#true} call ULTIMATE.init(); {7755#true} is VALID [2018-11-14 16:56:03,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {7755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7755#true} is VALID [2018-11-14 16:56:03,146 INFO L273 TraceCheckUtils]: 2: Hoare triple {7755#true} assume true; {7755#true} is VALID [2018-11-14 16:56:03,146 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7755#true} {7755#true} #50#return; {7755#true} is VALID [2018-11-14 16:56:03,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {7755#true} call #t~ret2 := main(); {7755#true} is VALID [2018-11-14 16:56:03,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {7755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7798#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:03,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {7798#(<= main_~i~0 0)} assume true; {7798#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:03,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {7798#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7758#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:03,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {7758#(<= main_~i~0 1)} assume true; {7758#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:03,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {7758#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7759#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:03,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {7759#(<= main_~i~0 2)} assume true; {7759#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:03,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {7759#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7760#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:03,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {7760#(<= main_~i~0 3)} assume true; {7760#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:03,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {7760#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7761#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:03,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {7761#(<= main_~i~0 4)} assume true; {7761#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:03,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {7761#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7762#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:03,165 INFO L273 TraceCheckUtils]: 16: Hoare triple {7762#(<= main_~i~0 5)} assume true; {7762#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:03,166 INFO L273 TraceCheckUtils]: 17: Hoare triple {7762#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7763#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:03,166 INFO L273 TraceCheckUtils]: 18: Hoare triple {7763#(<= main_~i~0 6)} assume true; {7763#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:03,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {7763#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7764#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:03,167 INFO L273 TraceCheckUtils]: 20: Hoare triple {7764#(<= main_~i~0 7)} assume true; {7764#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:03,168 INFO L273 TraceCheckUtils]: 21: Hoare triple {7764#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7765#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:03,168 INFO L273 TraceCheckUtils]: 22: Hoare triple {7765#(<= main_~i~0 8)} assume true; {7765#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:03,169 INFO L273 TraceCheckUtils]: 23: Hoare triple {7765#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7766#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:03,170 INFO L273 TraceCheckUtils]: 24: Hoare triple {7766#(<= main_~i~0 9)} assume true; {7766#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:03,171 INFO L273 TraceCheckUtils]: 25: Hoare triple {7766#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7767#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:03,171 INFO L273 TraceCheckUtils]: 26: Hoare triple {7767#(<= main_~i~0 10)} assume true; {7767#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:03,172 INFO L273 TraceCheckUtils]: 27: Hoare triple {7767#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7768#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:03,173 INFO L273 TraceCheckUtils]: 28: Hoare triple {7768#(<= main_~i~0 11)} assume true; {7768#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:03,174 INFO L273 TraceCheckUtils]: 29: Hoare triple {7768#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7769#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:03,174 INFO L273 TraceCheckUtils]: 30: Hoare triple {7769#(<= main_~i~0 12)} assume true; {7769#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:03,175 INFO L273 TraceCheckUtils]: 31: Hoare triple {7769#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7770#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:03,176 INFO L273 TraceCheckUtils]: 32: Hoare triple {7770#(<= main_~i~0 13)} assume true; {7770#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:03,176 INFO L273 TraceCheckUtils]: 33: Hoare triple {7770#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7771#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:03,177 INFO L273 TraceCheckUtils]: 34: Hoare triple {7771#(<= main_~i~0 14)} assume true; {7771#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:03,178 INFO L273 TraceCheckUtils]: 35: Hoare triple {7771#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7772#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:03,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {7772#(<= main_~i~0 15)} assume true; {7772#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:03,179 INFO L273 TraceCheckUtils]: 37: Hoare triple {7772#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7773#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:03,180 INFO L273 TraceCheckUtils]: 38: Hoare triple {7773#(<= main_~i~0 16)} assume true; {7773#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:03,181 INFO L273 TraceCheckUtils]: 39: Hoare triple {7773#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7774#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:03,181 INFO L273 TraceCheckUtils]: 40: Hoare triple {7774#(<= main_~i~0 17)} assume true; {7774#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:03,182 INFO L273 TraceCheckUtils]: 41: Hoare triple {7774#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7775#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:03,183 INFO L273 TraceCheckUtils]: 42: Hoare triple {7775#(<= main_~i~0 18)} assume true; {7775#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:03,184 INFO L273 TraceCheckUtils]: 43: Hoare triple {7775#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7776#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:03,184 INFO L273 TraceCheckUtils]: 44: Hoare triple {7776#(<= main_~i~0 19)} assume true; {7776#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:03,185 INFO L273 TraceCheckUtils]: 45: Hoare triple {7776#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7777#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:03,186 INFO L273 TraceCheckUtils]: 46: Hoare triple {7777#(<= main_~i~0 20)} assume true; {7777#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:03,187 INFO L273 TraceCheckUtils]: 47: Hoare triple {7777#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7778#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:03,187 INFO L273 TraceCheckUtils]: 48: Hoare triple {7778#(<= main_~i~0 21)} assume true; {7778#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:03,188 INFO L273 TraceCheckUtils]: 49: Hoare triple {7778#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7779#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:03,189 INFO L273 TraceCheckUtils]: 50: Hoare triple {7779#(<= main_~i~0 22)} assume true; {7779#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:03,189 INFO L273 TraceCheckUtils]: 51: Hoare triple {7779#(<= main_~i~0 22)} assume !(~i~0 < 100000); {7756#false} is VALID [2018-11-14 16:56:03,190 INFO L273 TraceCheckUtils]: 52: Hoare triple {7756#false} havoc ~x~0;~x~0 := 0; {7756#false} is VALID [2018-11-14 16:56:03,190 INFO L273 TraceCheckUtils]: 53: Hoare triple {7756#false} assume true; {7756#false} is VALID [2018-11-14 16:56:03,190 INFO L273 TraceCheckUtils]: 54: Hoare triple {7756#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7756#false} is VALID [2018-11-14 16:56:03,190 INFO L256 TraceCheckUtils]: 55: Hoare triple {7756#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {7756#false} is VALID [2018-11-14 16:56:03,190 INFO L273 TraceCheckUtils]: 56: Hoare triple {7756#false} ~cond := #in~cond; {7756#false} is VALID [2018-11-14 16:56:03,191 INFO L273 TraceCheckUtils]: 57: Hoare triple {7756#false} assume ~cond == 0; {7756#false} is VALID [2018-11-14 16:56:03,191 INFO L273 TraceCheckUtils]: 58: Hoare triple {7756#false} assume !false; {7756#false} is VALID [2018-11-14 16:56:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:03,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:03,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-14 16:56:03,214 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-14 16:56:03,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:03,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 16:56:03,272 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-14 16:56:03,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 16:56:03,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 16:56:03,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:56:03,273 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 26 states. [2018-11-14 16:56:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:03,467 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-14 16:56:03,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 16:56:03,467 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-14 16:56:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:56:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2018-11-14 16:56:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:56:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2018-11-14 16:56:03,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 80 transitions. [2018-11-14 16:56:03,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:03,563 INFO L225 Difference]: With dead ends: 78 [2018-11-14 16:56:03,563 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 16:56:03,564 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:56:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 16:56:03,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-14 16:56:03,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:03,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-14 16:56:03,620 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-14 16:56:03,620 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-14 16:56:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:03,621 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-11-14 16:56:03,621 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-14 16:56:03,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:03,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:03,621 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-14 16:56:03,621 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-14 16:56:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:03,622 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-11-14 16:56:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-14 16:56:03,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:03,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:03,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:03,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 16:56:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-11-14 16:56:03,624 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 59 [2018-11-14 16:56:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:03,624 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-11-14 16:56:03,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 16:56:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-14 16:56:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 16:56:03,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:03,625 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:03,625 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:03,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1256619254, now seen corresponding path program 23 times [2018-11-14 16:56:03,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:03,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:03,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:03,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:03,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:04,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {8298#true} call ULTIMATE.init(); {8298#true} is VALID [2018-11-14 16:56:04,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {8298#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8298#true} is VALID [2018-11-14 16:56:04,143 INFO L273 TraceCheckUtils]: 2: Hoare triple {8298#true} assume true; {8298#true} is VALID [2018-11-14 16:56:04,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8298#true} {8298#true} #50#return; {8298#true} is VALID [2018-11-14 16:56:04,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {8298#true} call #t~ret2 := main(); {8298#true} is VALID [2018-11-14 16:56:04,144 INFO L273 TraceCheckUtils]: 5: Hoare triple {8298#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8300#(= main_~i~0 0)} is VALID [2018-11-14 16:56:04,145 INFO L273 TraceCheckUtils]: 6: Hoare triple {8300#(= main_~i~0 0)} assume true; {8300#(= main_~i~0 0)} is VALID [2018-11-14 16:56:04,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {8300#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8301#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:04,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {8301#(<= main_~i~0 1)} assume true; {8301#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:04,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {8301#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8302#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:04,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {8302#(<= main_~i~0 2)} assume true; {8302#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:04,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {8302#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8303#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:04,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {8303#(<= main_~i~0 3)} assume true; {8303#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:04,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {8303#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8304#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:04,149 INFO L273 TraceCheckUtils]: 14: Hoare triple {8304#(<= main_~i~0 4)} assume true; {8304#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:04,150 INFO L273 TraceCheckUtils]: 15: Hoare triple {8304#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8305#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:04,150 INFO L273 TraceCheckUtils]: 16: Hoare triple {8305#(<= main_~i~0 5)} assume true; {8305#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:04,151 INFO L273 TraceCheckUtils]: 17: Hoare triple {8305#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8306#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:04,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {8306#(<= main_~i~0 6)} assume true; {8306#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:04,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {8306#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8307#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:04,153 INFO L273 TraceCheckUtils]: 20: Hoare triple {8307#(<= main_~i~0 7)} assume true; {8307#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:04,154 INFO L273 TraceCheckUtils]: 21: Hoare triple {8307#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8308#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:04,154 INFO L273 TraceCheckUtils]: 22: Hoare triple {8308#(<= main_~i~0 8)} assume true; {8308#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:04,155 INFO L273 TraceCheckUtils]: 23: Hoare triple {8308#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8309#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:04,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {8309#(<= main_~i~0 9)} assume true; {8309#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:04,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {8309#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8310#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:04,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {8310#(<= main_~i~0 10)} assume true; {8310#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:04,158 INFO L273 TraceCheckUtils]: 27: Hoare triple {8310#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8311#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:04,159 INFO L273 TraceCheckUtils]: 28: Hoare triple {8311#(<= main_~i~0 11)} assume true; {8311#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:04,160 INFO L273 TraceCheckUtils]: 29: Hoare triple {8311#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8312#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:04,160 INFO L273 TraceCheckUtils]: 30: Hoare triple {8312#(<= main_~i~0 12)} assume true; {8312#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:04,161 INFO L273 TraceCheckUtils]: 31: Hoare triple {8312#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8313#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:04,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {8313#(<= main_~i~0 13)} assume true; {8313#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:04,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {8313#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8314#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:04,163 INFO L273 TraceCheckUtils]: 34: Hoare triple {8314#(<= main_~i~0 14)} assume true; {8314#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:04,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {8314#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8315#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:04,165 INFO L273 TraceCheckUtils]: 36: Hoare triple {8315#(<= main_~i~0 15)} assume true; {8315#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:04,166 INFO L273 TraceCheckUtils]: 37: Hoare triple {8315#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8316#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:04,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {8316#(<= main_~i~0 16)} assume true; {8316#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:04,167 INFO L273 TraceCheckUtils]: 39: Hoare triple {8316#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8317#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:04,167 INFO L273 TraceCheckUtils]: 40: Hoare triple {8317#(<= main_~i~0 17)} assume true; {8317#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:04,168 INFO L273 TraceCheckUtils]: 41: Hoare triple {8317#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8318#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:04,169 INFO L273 TraceCheckUtils]: 42: Hoare triple {8318#(<= main_~i~0 18)} assume true; {8318#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:04,170 INFO L273 TraceCheckUtils]: 43: Hoare triple {8318#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8319#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:04,170 INFO L273 TraceCheckUtils]: 44: Hoare triple {8319#(<= main_~i~0 19)} assume true; {8319#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:04,171 INFO L273 TraceCheckUtils]: 45: Hoare triple {8319#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8320#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:04,172 INFO L273 TraceCheckUtils]: 46: Hoare triple {8320#(<= main_~i~0 20)} assume true; {8320#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:04,173 INFO L273 TraceCheckUtils]: 47: Hoare triple {8320#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8321#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:04,173 INFO L273 TraceCheckUtils]: 48: Hoare triple {8321#(<= main_~i~0 21)} assume true; {8321#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:04,174 INFO L273 TraceCheckUtils]: 49: Hoare triple {8321#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8322#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:04,175 INFO L273 TraceCheckUtils]: 50: Hoare triple {8322#(<= main_~i~0 22)} assume true; {8322#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:04,176 INFO L273 TraceCheckUtils]: 51: Hoare triple {8322#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8323#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:04,176 INFO L273 TraceCheckUtils]: 52: Hoare triple {8323#(<= main_~i~0 23)} assume true; {8323#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:04,177 INFO L273 TraceCheckUtils]: 53: Hoare triple {8323#(<= main_~i~0 23)} assume !(~i~0 < 100000); {8299#false} is VALID [2018-11-14 16:56:04,177 INFO L273 TraceCheckUtils]: 54: Hoare triple {8299#false} havoc ~x~0;~x~0 := 0; {8299#false} is VALID [2018-11-14 16:56:04,177 INFO L273 TraceCheckUtils]: 55: Hoare triple {8299#false} assume true; {8299#false} is VALID [2018-11-14 16:56:04,178 INFO L273 TraceCheckUtils]: 56: Hoare triple {8299#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8299#false} is VALID [2018-11-14 16:56:04,178 INFO L256 TraceCheckUtils]: 57: Hoare triple {8299#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {8299#false} is VALID [2018-11-14 16:56:04,178 INFO L273 TraceCheckUtils]: 58: Hoare triple {8299#false} ~cond := #in~cond; {8299#false} is VALID [2018-11-14 16:56:04,178 INFO L273 TraceCheckUtils]: 59: Hoare triple {8299#false} assume ~cond == 0; {8299#false} is VALID [2018-11-14 16:56:04,178 INFO L273 TraceCheckUtils]: 60: Hoare triple {8299#false} assume !false; {8299#false} is VALID [2018-11-14 16:56:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:04,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:04,182 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-14 16:56:04,190 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:56:04,445 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-14 16:56:04,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:04,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:04,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {8298#true} call ULTIMATE.init(); {8298#true} is VALID [2018-11-14 16:56:04,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {8298#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8298#true} is VALID [2018-11-14 16:56:04,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {8298#true} assume true; {8298#true} is VALID [2018-11-14 16:56:04,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8298#true} {8298#true} #50#return; {8298#true} is VALID [2018-11-14 16:56:04,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {8298#true} call #t~ret2 := main(); {8298#true} is VALID [2018-11-14 16:56:04,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {8298#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8342#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:04,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {8342#(<= main_~i~0 0)} assume true; {8342#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:04,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {8342#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8301#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:04,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {8301#(<= main_~i~0 1)} assume true; {8301#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:04,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {8301#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8302#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:04,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {8302#(<= main_~i~0 2)} assume true; {8302#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:04,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {8302#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8303#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:04,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {8303#(<= main_~i~0 3)} assume true; {8303#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:04,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {8303#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8304#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:04,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {8304#(<= main_~i~0 4)} assume true; {8304#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:04,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {8304#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8305#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:04,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {8305#(<= main_~i~0 5)} assume true; {8305#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:04,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {8305#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8306#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:04,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {8306#(<= main_~i~0 6)} assume true; {8306#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:04,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {8306#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8307#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:04,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {8307#(<= main_~i~0 7)} assume true; {8307#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:04,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {8307#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8308#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:04,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {8308#(<= main_~i~0 8)} assume true; {8308#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:04,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {8308#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8309#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:04,690 INFO L273 TraceCheckUtils]: 24: Hoare triple {8309#(<= main_~i~0 9)} assume true; {8309#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:04,691 INFO L273 TraceCheckUtils]: 25: Hoare triple {8309#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8310#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:04,691 INFO L273 TraceCheckUtils]: 26: Hoare triple {8310#(<= main_~i~0 10)} assume true; {8310#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:04,692 INFO L273 TraceCheckUtils]: 27: Hoare triple {8310#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8311#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:04,693 INFO L273 TraceCheckUtils]: 28: Hoare triple {8311#(<= main_~i~0 11)} assume true; {8311#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:04,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {8311#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8312#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:04,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {8312#(<= main_~i~0 12)} assume true; {8312#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:04,695 INFO L273 TraceCheckUtils]: 31: Hoare triple {8312#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8313#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:04,696 INFO L273 TraceCheckUtils]: 32: Hoare triple {8313#(<= main_~i~0 13)} assume true; {8313#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:04,697 INFO L273 TraceCheckUtils]: 33: Hoare triple {8313#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8314#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:04,697 INFO L273 TraceCheckUtils]: 34: Hoare triple {8314#(<= main_~i~0 14)} assume true; {8314#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:04,698 INFO L273 TraceCheckUtils]: 35: Hoare triple {8314#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8315#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:04,699 INFO L273 TraceCheckUtils]: 36: Hoare triple {8315#(<= main_~i~0 15)} assume true; {8315#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:04,700 INFO L273 TraceCheckUtils]: 37: Hoare triple {8315#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8316#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:04,700 INFO L273 TraceCheckUtils]: 38: Hoare triple {8316#(<= main_~i~0 16)} assume true; {8316#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:04,701 INFO L273 TraceCheckUtils]: 39: Hoare triple {8316#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8317#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:04,701 INFO L273 TraceCheckUtils]: 40: Hoare triple {8317#(<= main_~i~0 17)} assume true; {8317#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:04,702 INFO L273 TraceCheckUtils]: 41: Hoare triple {8317#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8318#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:04,703 INFO L273 TraceCheckUtils]: 42: Hoare triple {8318#(<= main_~i~0 18)} assume true; {8318#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:04,704 INFO L273 TraceCheckUtils]: 43: Hoare triple {8318#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8319#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:04,704 INFO L273 TraceCheckUtils]: 44: Hoare triple {8319#(<= main_~i~0 19)} assume true; {8319#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:04,705 INFO L273 TraceCheckUtils]: 45: Hoare triple {8319#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8320#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:04,706 INFO L273 TraceCheckUtils]: 46: Hoare triple {8320#(<= main_~i~0 20)} assume true; {8320#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:04,707 INFO L273 TraceCheckUtils]: 47: Hoare triple {8320#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8321#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:04,707 INFO L273 TraceCheckUtils]: 48: Hoare triple {8321#(<= main_~i~0 21)} assume true; {8321#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:04,708 INFO L273 TraceCheckUtils]: 49: Hoare triple {8321#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8322#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:04,709 INFO L273 TraceCheckUtils]: 50: Hoare triple {8322#(<= main_~i~0 22)} assume true; {8322#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:04,710 INFO L273 TraceCheckUtils]: 51: Hoare triple {8322#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8323#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:04,710 INFO L273 TraceCheckUtils]: 52: Hoare triple {8323#(<= main_~i~0 23)} assume true; {8323#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:04,711 INFO L273 TraceCheckUtils]: 53: Hoare triple {8323#(<= main_~i~0 23)} assume !(~i~0 < 100000); {8299#false} is VALID [2018-11-14 16:56:04,711 INFO L273 TraceCheckUtils]: 54: Hoare triple {8299#false} havoc ~x~0;~x~0 := 0; {8299#false} is VALID [2018-11-14 16:56:04,711 INFO L273 TraceCheckUtils]: 55: Hoare triple {8299#false} assume true; {8299#false} is VALID [2018-11-14 16:56:04,711 INFO L273 TraceCheckUtils]: 56: Hoare triple {8299#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8299#false} is VALID [2018-11-14 16:56:04,712 INFO L256 TraceCheckUtils]: 57: Hoare triple {8299#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {8299#false} is VALID [2018-11-14 16:56:04,712 INFO L273 TraceCheckUtils]: 58: Hoare triple {8299#false} ~cond := #in~cond; {8299#false} is VALID [2018-11-14 16:56:04,712 INFO L273 TraceCheckUtils]: 59: Hoare triple {8299#false} assume ~cond == 0; {8299#false} is VALID [2018-11-14 16:56:04,712 INFO L273 TraceCheckUtils]: 60: Hoare triple {8299#false} assume !false; {8299#false} is VALID [2018-11-14 16:56:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:04,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:04,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-14 16:56:04,739 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-11-14 16:56:04,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:04,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 16:56:04,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:04,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 16:56:04,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 16:56:04,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 16:56:04,800 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 27 states. [2018-11-14 16:56:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:05,036 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-11-14 16:56:05,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 16:56:05,036 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-11-14 16:56:05,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:56:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 82 transitions. [2018-11-14 16:56:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:56:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 82 transitions. [2018-11-14 16:56:05,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 82 transitions. [2018-11-14 16:56:05,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:05,134 INFO L225 Difference]: With dead ends: 80 [2018-11-14 16:56:05,134 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 16:56:05,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 16:56:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 16:56:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-14 16:56:05,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:05,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-14 16:56:05,158 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-14 16:56:05,158 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-14 16:56:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:05,160 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-11-14 16:56:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-11-14 16:56:05,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:05,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:05,161 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-14 16:56:05,161 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-14 16:56:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:05,162 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-11-14 16:56:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-11-14 16:56:05,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:05,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:05,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:05,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 16:56:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-11-14 16:56:05,165 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 61 [2018-11-14 16:56:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:05,165 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-11-14 16:56:05,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 16:56:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-11-14 16:56:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-14 16:56:05,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:05,166 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:05,166 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:05,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash -737232924, now seen corresponding path program 24 times [2018-11-14 16:56:05,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:05,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:05,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:05,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {8858#true} call ULTIMATE.init(); {8858#true} is VALID [2018-11-14 16:56:05,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {8858#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8858#true} is VALID [2018-11-14 16:56:05,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {8858#true} assume true; {8858#true} is VALID [2018-11-14 16:56:05,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8858#true} {8858#true} #50#return; {8858#true} is VALID [2018-11-14 16:56:05,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {8858#true} call #t~ret2 := main(); {8858#true} is VALID [2018-11-14 16:56:05,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {8858#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8860#(= main_~i~0 0)} is VALID [2018-11-14 16:56:05,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {8860#(= main_~i~0 0)} assume true; {8860#(= main_~i~0 0)} is VALID [2018-11-14 16:56:05,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {8860#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8861#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:05,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {8861#(<= main_~i~0 1)} assume true; {8861#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:05,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {8861#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8862#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:05,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {8862#(<= main_~i~0 2)} assume true; {8862#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:05,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {8862#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8863#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:05,953 INFO L273 TraceCheckUtils]: 12: Hoare triple {8863#(<= main_~i~0 3)} assume true; {8863#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:05,954 INFO L273 TraceCheckUtils]: 13: Hoare triple {8863#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8864#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:05,955 INFO L273 TraceCheckUtils]: 14: Hoare triple {8864#(<= main_~i~0 4)} assume true; {8864#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:05,956 INFO L273 TraceCheckUtils]: 15: Hoare triple {8864#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8865#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:05,956 INFO L273 TraceCheckUtils]: 16: Hoare triple {8865#(<= main_~i~0 5)} assume true; {8865#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:05,957 INFO L273 TraceCheckUtils]: 17: Hoare triple {8865#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8866#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:05,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {8866#(<= main_~i~0 6)} assume true; {8866#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:05,959 INFO L273 TraceCheckUtils]: 19: Hoare triple {8866#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8867#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:05,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {8867#(<= main_~i~0 7)} assume true; {8867#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:05,960 INFO L273 TraceCheckUtils]: 21: Hoare triple {8867#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8868#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:05,961 INFO L273 TraceCheckUtils]: 22: Hoare triple {8868#(<= main_~i~0 8)} assume true; {8868#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:05,961 INFO L273 TraceCheckUtils]: 23: Hoare triple {8868#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8869#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:05,962 INFO L273 TraceCheckUtils]: 24: Hoare triple {8869#(<= main_~i~0 9)} assume true; {8869#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:05,963 INFO L273 TraceCheckUtils]: 25: Hoare triple {8869#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8870#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:05,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {8870#(<= main_~i~0 10)} assume true; {8870#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:05,964 INFO L273 TraceCheckUtils]: 27: Hoare triple {8870#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8871#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:05,965 INFO L273 TraceCheckUtils]: 28: Hoare triple {8871#(<= main_~i~0 11)} assume true; {8871#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:05,966 INFO L273 TraceCheckUtils]: 29: Hoare triple {8871#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8872#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:05,966 INFO L273 TraceCheckUtils]: 30: Hoare triple {8872#(<= main_~i~0 12)} assume true; {8872#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:05,967 INFO L273 TraceCheckUtils]: 31: Hoare triple {8872#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8873#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:05,968 INFO L273 TraceCheckUtils]: 32: Hoare triple {8873#(<= main_~i~0 13)} assume true; {8873#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:05,969 INFO L273 TraceCheckUtils]: 33: Hoare triple {8873#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8874#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:05,969 INFO L273 TraceCheckUtils]: 34: Hoare triple {8874#(<= main_~i~0 14)} assume true; {8874#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:05,970 INFO L273 TraceCheckUtils]: 35: Hoare triple {8874#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8875#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:05,971 INFO L273 TraceCheckUtils]: 36: Hoare triple {8875#(<= main_~i~0 15)} assume true; {8875#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:05,972 INFO L273 TraceCheckUtils]: 37: Hoare triple {8875#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8876#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:05,972 INFO L273 TraceCheckUtils]: 38: Hoare triple {8876#(<= main_~i~0 16)} assume true; {8876#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:05,973 INFO L273 TraceCheckUtils]: 39: Hoare triple {8876#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8877#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:05,974 INFO L273 TraceCheckUtils]: 40: Hoare triple {8877#(<= main_~i~0 17)} assume true; {8877#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:05,974 INFO L273 TraceCheckUtils]: 41: Hoare triple {8877#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8878#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:05,975 INFO L273 TraceCheckUtils]: 42: Hoare triple {8878#(<= main_~i~0 18)} assume true; {8878#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:05,976 INFO L273 TraceCheckUtils]: 43: Hoare triple {8878#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8879#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:05,976 INFO L273 TraceCheckUtils]: 44: Hoare triple {8879#(<= main_~i~0 19)} assume true; {8879#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:05,977 INFO L273 TraceCheckUtils]: 45: Hoare triple {8879#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8880#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:05,978 INFO L273 TraceCheckUtils]: 46: Hoare triple {8880#(<= main_~i~0 20)} assume true; {8880#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:05,979 INFO L273 TraceCheckUtils]: 47: Hoare triple {8880#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8881#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:05,979 INFO L273 TraceCheckUtils]: 48: Hoare triple {8881#(<= main_~i~0 21)} assume true; {8881#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:05,980 INFO L273 TraceCheckUtils]: 49: Hoare triple {8881#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8882#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:05,981 INFO L273 TraceCheckUtils]: 50: Hoare triple {8882#(<= main_~i~0 22)} assume true; {8882#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:05,982 INFO L273 TraceCheckUtils]: 51: Hoare triple {8882#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8883#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:05,982 INFO L273 TraceCheckUtils]: 52: Hoare triple {8883#(<= main_~i~0 23)} assume true; {8883#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:05,983 INFO L273 TraceCheckUtils]: 53: Hoare triple {8883#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8884#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:05,984 INFO L273 TraceCheckUtils]: 54: Hoare triple {8884#(<= main_~i~0 24)} assume true; {8884#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:05,984 INFO L273 TraceCheckUtils]: 55: Hoare triple {8884#(<= main_~i~0 24)} assume !(~i~0 < 100000); {8859#false} is VALID [2018-11-14 16:56:05,985 INFO L273 TraceCheckUtils]: 56: Hoare triple {8859#false} havoc ~x~0;~x~0 := 0; {8859#false} is VALID [2018-11-14 16:56:05,985 INFO L273 TraceCheckUtils]: 57: Hoare triple {8859#false} assume true; {8859#false} is VALID [2018-11-14 16:56:05,985 INFO L273 TraceCheckUtils]: 58: Hoare triple {8859#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8859#false} is VALID [2018-11-14 16:56:05,985 INFO L256 TraceCheckUtils]: 59: Hoare triple {8859#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {8859#false} is VALID [2018-11-14 16:56:05,985 INFO L273 TraceCheckUtils]: 60: Hoare triple {8859#false} ~cond := #in~cond; {8859#false} is VALID [2018-11-14 16:56:05,986 INFO L273 TraceCheckUtils]: 61: Hoare triple {8859#false} assume ~cond == 0; {8859#false} is VALID [2018-11-14 16:56:05,986 INFO L273 TraceCheckUtils]: 62: Hoare triple {8859#false} assume !false; {8859#false} is VALID [2018-11-14 16:56:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:05,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:05,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:05,999 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:56:10,606 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-14 16:56:10,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:10,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:10,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {8858#true} call ULTIMATE.init(); {8858#true} is VALID [2018-11-14 16:56:10,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {8858#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8858#true} is VALID [2018-11-14 16:56:10,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {8858#true} assume true; {8858#true} is VALID [2018-11-14 16:56:10,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8858#true} {8858#true} #50#return; {8858#true} is VALID [2018-11-14 16:56:10,795 INFO L256 TraceCheckUtils]: 4: Hoare triple {8858#true} call #t~ret2 := main(); {8858#true} is VALID [2018-11-14 16:56:10,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {8858#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8903#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:10,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {8903#(<= main_~i~0 0)} assume true; {8903#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:10,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {8903#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8861#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:10,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {8861#(<= main_~i~0 1)} assume true; {8861#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:10,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {8861#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8862#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:10,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {8862#(<= main_~i~0 2)} assume true; {8862#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:10,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {8862#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8863#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:10,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {8863#(<= main_~i~0 3)} assume true; {8863#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:10,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {8863#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8864#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:10,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {8864#(<= main_~i~0 4)} assume true; {8864#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:10,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {8864#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8865#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:10,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {8865#(<= main_~i~0 5)} assume true; {8865#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:10,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {8865#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8866#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:10,804 INFO L273 TraceCheckUtils]: 18: Hoare triple {8866#(<= main_~i~0 6)} assume true; {8866#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:10,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {8866#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8867#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:10,805 INFO L273 TraceCheckUtils]: 20: Hoare triple {8867#(<= main_~i~0 7)} assume true; {8867#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:10,806 INFO L273 TraceCheckUtils]: 21: Hoare triple {8867#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8868#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:10,807 INFO L273 TraceCheckUtils]: 22: Hoare triple {8868#(<= main_~i~0 8)} assume true; {8868#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:10,807 INFO L273 TraceCheckUtils]: 23: Hoare triple {8868#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8869#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:10,808 INFO L273 TraceCheckUtils]: 24: Hoare triple {8869#(<= main_~i~0 9)} assume true; {8869#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:10,809 INFO L273 TraceCheckUtils]: 25: Hoare triple {8869#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8870#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:10,809 INFO L273 TraceCheckUtils]: 26: Hoare triple {8870#(<= main_~i~0 10)} assume true; {8870#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:10,810 INFO L273 TraceCheckUtils]: 27: Hoare triple {8870#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8871#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:10,811 INFO L273 TraceCheckUtils]: 28: Hoare triple {8871#(<= main_~i~0 11)} assume true; {8871#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:10,812 INFO L273 TraceCheckUtils]: 29: Hoare triple {8871#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8872#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:10,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {8872#(<= main_~i~0 12)} assume true; {8872#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:10,813 INFO L273 TraceCheckUtils]: 31: Hoare triple {8872#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8873#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:10,814 INFO L273 TraceCheckUtils]: 32: Hoare triple {8873#(<= main_~i~0 13)} assume true; {8873#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:10,815 INFO L273 TraceCheckUtils]: 33: Hoare triple {8873#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8874#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:10,815 INFO L273 TraceCheckUtils]: 34: Hoare triple {8874#(<= main_~i~0 14)} assume true; {8874#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:10,816 INFO L273 TraceCheckUtils]: 35: Hoare triple {8874#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8875#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:10,817 INFO L273 TraceCheckUtils]: 36: Hoare triple {8875#(<= main_~i~0 15)} assume true; {8875#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:10,818 INFO L273 TraceCheckUtils]: 37: Hoare triple {8875#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8876#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:10,818 INFO L273 TraceCheckUtils]: 38: Hoare triple {8876#(<= main_~i~0 16)} assume true; {8876#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:10,819 INFO L273 TraceCheckUtils]: 39: Hoare triple {8876#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8877#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:10,820 INFO L273 TraceCheckUtils]: 40: Hoare triple {8877#(<= main_~i~0 17)} assume true; {8877#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:10,821 INFO L273 TraceCheckUtils]: 41: Hoare triple {8877#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8878#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:10,821 INFO L273 TraceCheckUtils]: 42: Hoare triple {8878#(<= main_~i~0 18)} assume true; {8878#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:10,822 INFO L273 TraceCheckUtils]: 43: Hoare triple {8878#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8879#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:10,823 INFO L273 TraceCheckUtils]: 44: Hoare triple {8879#(<= main_~i~0 19)} assume true; {8879#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:10,824 INFO L273 TraceCheckUtils]: 45: Hoare triple {8879#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8880#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:10,824 INFO L273 TraceCheckUtils]: 46: Hoare triple {8880#(<= main_~i~0 20)} assume true; {8880#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:10,825 INFO L273 TraceCheckUtils]: 47: Hoare triple {8880#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8881#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:10,825 INFO L273 TraceCheckUtils]: 48: Hoare triple {8881#(<= main_~i~0 21)} assume true; {8881#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:10,826 INFO L273 TraceCheckUtils]: 49: Hoare triple {8881#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8882#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:10,827 INFO L273 TraceCheckUtils]: 50: Hoare triple {8882#(<= main_~i~0 22)} assume true; {8882#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:10,828 INFO L273 TraceCheckUtils]: 51: Hoare triple {8882#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8883#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:10,828 INFO L273 TraceCheckUtils]: 52: Hoare triple {8883#(<= main_~i~0 23)} assume true; {8883#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:10,829 INFO L273 TraceCheckUtils]: 53: Hoare triple {8883#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8884#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:10,830 INFO L273 TraceCheckUtils]: 54: Hoare triple {8884#(<= main_~i~0 24)} assume true; {8884#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:10,830 INFO L273 TraceCheckUtils]: 55: Hoare triple {8884#(<= main_~i~0 24)} assume !(~i~0 < 100000); {8859#false} is VALID [2018-11-14 16:56:10,831 INFO L273 TraceCheckUtils]: 56: Hoare triple {8859#false} havoc ~x~0;~x~0 := 0; {8859#false} is VALID [2018-11-14 16:56:10,831 INFO L273 TraceCheckUtils]: 57: Hoare triple {8859#false} assume true; {8859#false} is VALID [2018-11-14 16:56:10,831 INFO L273 TraceCheckUtils]: 58: Hoare triple {8859#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8859#false} is VALID [2018-11-14 16:56:10,831 INFO L256 TraceCheckUtils]: 59: Hoare triple {8859#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {8859#false} is VALID [2018-11-14 16:56:10,831 INFO L273 TraceCheckUtils]: 60: Hoare triple {8859#false} ~cond := #in~cond; {8859#false} is VALID [2018-11-14 16:56:10,832 INFO L273 TraceCheckUtils]: 61: Hoare triple {8859#false} assume ~cond == 0; {8859#false} is VALID [2018-11-14 16:56:10,832 INFO L273 TraceCheckUtils]: 62: Hoare triple {8859#false} assume !false; {8859#false} is VALID [2018-11-14 16:56:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:10,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:10,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-14 16:56:10,859 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-11-14 16:56:10,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:10,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 16:56:10,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:10,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 16:56:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 16:56:10,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 16:56:10,924 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 28 states. [2018-11-14 16:56:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:11,323 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-14 16:56:11,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 16:56:11,323 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-11-14 16:56:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:56:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 84 transitions. [2018-11-14 16:56:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:56:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 84 transitions. [2018-11-14 16:56:11,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 84 transitions. [2018-11-14 16:56:11,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:11,448 INFO L225 Difference]: With dead ends: 82 [2018-11-14 16:56:11,448 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 16:56:11,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 16:56:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 16:56:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-14 16:56:11,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:11,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-14 16:56:11,473 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-14 16:56:11,473 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-14 16:56:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:11,475 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-14 16:56:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-14 16:56:11,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:11,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:11,476 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-14 16:56:11,476 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-14 16:56:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:11,477 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-14 16:56:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-14 16:56:11,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:11,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:11,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:11,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 16:56:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-11-14 16:56:11,480 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 63 [2018-11-14 16:56:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:11,480 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-14 16:56:11,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 16:56:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-14 16:56:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-14 16:56:11,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:11,481 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:11,481 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:11,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash 176823870, now seen corresponding path program 25 times [2018-11-14 16:56:11,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:11,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:11,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:11,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:11,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:12,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {9435#true} call ULTIMATE.init(); {9435#true} is VALID [2018-11-14 16:56:12,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {9435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9435#true} is VALID [2018-11-14 16:56:12,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {9435#true} assume true; {9435#true} is VALID [2018-11-14 16:56:12,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9435#true} {9435#true} #50#return; {9435#true} is VALID [2018-11-14 16:56:12,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {9435#true} call #t~ret2 := main(); {9435#true} is VALID [2018-11-14 16:56:12,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {9435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9437#(= main_~i~0 0)} is VALID [2018-11-14 16:56:12,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {9437#(= main_~i~0 0)} assume true; {9437#(= main_~i~0 0)} is VALID [2018-11-14 16:56:12,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {9437#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9438#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:12,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {9438#(<= main_~i~0 1)} assume true; {9438#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:12,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {9438#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9439#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:12,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {9439#(<= main_~i~0 2)} assume true; {9439#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:12,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {9439#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9440#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:12,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {9440#(<= main_~i~0 3)} assume true; {9440#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:12,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {9440#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9441#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:12,347 INFO L273 TraceCheckUtils]: 14: Hoare triple {9441#(<= main_~i~0 4)} assume true; {9441#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:12,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {9441#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9442#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:12,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {9442#(<= main_~i~0 5)} assume true; {9442#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:12,349 INFO L273 TraceCheckUtils]: 17: Hoare triple {9442#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9443#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:12,350 INFO L273 TraceCheckUtils]: 18: Hoare triple {9443#(<= main_~i~0 6)} assume true; {9443#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:12,350 INFO L273 TraceCheckUtils]: 19: Hoare triple {9443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9444#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:12,351 INFO L273 TraceCheckUtils]: 20: Hoare triple {9444#(<= main_~i~0 7)} assume true; {9444#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:12,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {9444#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9445#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:12,352 INFO L273 TraceCheckUtils]: 22: Hoare triple {9445#(<= main_~i~0 8)} assume true; {9445#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:12,353 INFO L273 TraceCheckUtils]: 23: Hoare triple {9445#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9446#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:12,354 INFO L273 TraceCheckUtils]: 24: Hoare triple {9446#(<= main_~i~0 9)} assume true; {9446#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:12,355 INFO L273 TraceCheckUtils]: 25: Hoare triple {9446#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9447#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:12,355 INFO L273 TraceCheckUtils]: 26: Hoare triple {9447#(<= main_~i~0 10)} assume true; {9447#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:12,356 INFO L273 TraceCheckUtils]: 27: Hoare triple {9447#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9448#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:12,357 INFO L273 TraceCheckUtils]: 28: Hoare triple {9448#(<= main_~i~0 11)} assume true; {9448#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:12,358 INFO L273 TraceCheckUtils]: 29: Hoare triple {9448#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9449#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:12,358 INFO L273 TraceCheckUtils]: 30: Hoare triple {9449#(<= main_~i~0 12)} assume true; {9449#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:12,359 INFO L273 TraceCheckUtils]: 31: Hoare triple {9449#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9450#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:12,360 INFO L273 TraceCheckUtils]: 32: Hoare triple {9450#(<= main_~i~0 13)} assume true; {9450#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:12,360 INFO L273 TraceCheckUtils]: 33: Hoare triple {9450#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9451#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:12,361 INFO L273 TraceCheckUtils]: 34: Hoare triple {9451#(<= main_~i~0 14)} assume true; {9451#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:12,362 INFO L273 TraceCheckUtils]: 35: Hoare triple {9451#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9452#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:12,363 INFO L273 TraceCheckUtils]: 36: Hoare triple {9452#(<= main_~i~0 15)} assume true; {9452#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:12,363 INFO L273 TraceCheckUtils]: 37: Hoare triple {9452#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9453#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:12,364 INFO L273 TraceCheckUtils]: 38: Hoare triple {9453#(<= main_~i~0 16)} assume true; {9453#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:12,365 INFO L273 TraceCheckUtils]: 39: Hoare triple {9453#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9454#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:12,365 INFO L273 TraceCheckUtils]: 40: Hoare triple {9454#(<= main_~i~0 17)} assume true; {9454#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:12,366 INFO L273 TraceCheckUtils]: 41: Hoare triple {9454#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9455#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:12,367 INFO L273 TraceCheckUtils]: 42: Hoare triple {9455#(<= main_~i~0 18)} assume true; {9455#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:12,368 INFO L273 TraceCheckUtils]: 43: Hoare triple {9455#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9456#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:12,368 INFO L273 TraceCheckUtils]: 44: Hoare triple {9456#(<= main_~i~0 19)} assume true; {9456#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:12,369 INFO L273 TraceCheckUtils]: 45: Hoare triple {9456#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9457#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:12,370 INFO L273 TraceCheckUtils]: 46: Hoare triple {9457#(<= main_~i~0 20)} assume true; {9457#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:12,371 INFO L273 TraceCheckUtils]: 47: Hoare triple {9457#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9458#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:12,371 INFO L273 TraceCheckUtils]: 48: Hoare triple {9458#(<= main_~i~0 21)} assume true; {9458#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:12,372 INFO L273 TraceCheckUtils]: 49: Hoare triple {9458#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9459#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:12,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {9459#(<= main_~i~0 22)} assume true; {9459#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:12,373 INFO L273 TraceCheckUtils]: 51: Hoare triple {9459#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9460#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:12,374 INFO L273 TraceCheckUtils]: 52: Hoare triple {9460#(<= main_~i~0 23)} assume true; {9460#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:12,375 INFO L273 TraceCheckUtils]: 53: Hoare triple {9460#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9461#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:12,375 INFO L273 TraceCheckUtils]: 54: Hoare triple {9461#(<= main_~i~0 24)} assume true; {9461#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:12,376 INFO L273 TraceCheckUtils]: 55: Hoare triple {9461#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9462#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:12,377 INFO L273 TraceCheckUtils]: 56: Hoare triple {9462#(<= main_~i~0 25)} assume true; {9462#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:12,378 INFO L273 TraceCheckUtils]: 57: Hoare triple {9462#(<= main_~i~0 25)} assume !(~i~0 < 100000); {9436#false} is VALID [2018-11-14 16:56:12,378 INFO L273 TraceCheckUtils]: 58: Hoare triple {9436#false} havoc ~x~0;~x~0 := 0; {9436#false} is VALID [2018-11-14 16:56:12,378 INFO L273 TraceCheckUtils]: 59: Hoare triple {9436#false} assume true; {9436#false} is VALID [2018-11-14 16:56:12,378 INFO L273 TraceCheckUtils]: 60: Hoare triple {9436#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {9436#false} is VALID [2018-11-14 16:56:12,378 INFO L256 TraceCheckUtils]: 61: Hoare triple {9436#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {9436#false} is VALID [2018-11-14 16:56:12,379 INFO L273 TraceCheckUtils]: 62: Hoare triple {9436#false} ~cond := #in~cond; {9436#false} is VALID [2018-11-14 16:56:12,379 INFO L273 TraceCheckUtils]: 63: Hoare triple {9436#false} assume ~cond == 0; {9436#false} is VALID [2018-11-14 16:56:12,379 INFO L273 TraceCheckUtils]: 64: Hoare triple {9436#false} assume !false; {9436#false} is VALID [2018-11-14 16:56:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:12,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:12,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:12,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:56:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:12,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:12,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {9435#true} call ULTIMATE.init(); {9435#true} is VALID [2018-11-14 16:56:12,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {9435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9435#true} is VALID [2018-11-14 16:56:12,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {9435#true} assume true; {9435#true} is VALID [2018-11-14 16:56:12,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9435#true} {9435#true} #50#return; {9435#true} is VALID [2018-11-14 16:56:12,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {9435#true} call #t~ret2 := main(); {9435#true} is VALID [2018-11-14 16:56:12,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {9435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9481#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:12,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {9481#(<= main_~i~0 0)} assume true; {9481#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:12,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {9481#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9438#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:12,620 INFO L273 TraceCheckUtils]: 8: Hoare triple {9438#(<= main_~i~0 1)} assume true; {9438#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:12,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {9438#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9439#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:12,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {9439#(<= main_~i~0 2)} assume true; {9439#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:12,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {9439#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9440#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:12,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {9440#(<= main_~i~0 3)} assume true; {9440#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:12,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {9440#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9441#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:12,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {9441#(<= main_~i~0 4)} assume true; {9441#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:12,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {9441#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9442#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:12,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {9442#(<= main_~i~0 5)} assume true; {9442#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:12,626 INFO L273 TraceCheckUtils]: 17: Hoare triple {9442#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9443#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:12,627 INFO L273 TraceCheckUtils]: 18: Hoare triple {9443#(<= main_~i~0 6)} assume true; {9443#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:12,628 INFO L273 TraceCheckUtils]: 19: Hoare triple {9443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9444#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:12,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {9444#(<= main_~i~0 7)} assume true; {9444#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:12,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {9444#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9445#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:12,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {9445#(<= main_~i~0 8)} assume true; {9445#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:12,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {9445#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9446#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:12,631 INFO L273 TraceCheckUtils]: 24: Hoare triple {9446#(<= main_~i~0 9)} assume true; {9446#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:12,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {9446#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9447#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:12,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {9447#(<= main_~i~0 10)} assume true; {9447#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:12,633 INFO L273 TraceCheckUtils]: 27: Hoare triple {9447#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9448#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:12,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {9448#(<= main_~i~0 11)} assume true; {9448#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:12,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {9448#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9449#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:12,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {9449#(<= main_~i~0 12)} assume true; {9449#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:12,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {9449#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9450#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:12,637 INFO L273 TraceCheckUtils]: 32: Hoare triple {9450#(<= main_~i~0 13)} assume true; {9450#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:12,638 INFO L273 TraceCheckUtils]: 33: Hoare triple {9450#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9451#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:12,638 INFO L273 TraceCheckUtils]: 34: Hoare triple {9451#(<= main_~i~0 14)} assume true; {9451#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:12,639 INFO L273 TraceCheckUtils]: 35: Hoare triple {9451#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9452#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:12,640 INFO L273 TraceCheckUtils]: 36: Hoare triple {9452#(<= main_~i~0 15)} assume true; {9452#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:12,641 INFO L273 TraceCheckUtils]: 37: Hoare triple {9452#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9453#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:12,641 INFO L273 TraceCheckUtils]: 38: Hoare triple {9453#(<= main_~i~0 16)} assume true; {9453#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:12,642 INFO L273 TraceCheckUtils]: 39: Hoare triple {9453#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9454#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:12,643 INFO L273 TraceCheckUtils]: 40: Hoare triple {9454#(<= main_~i~0 17)} assume true; {9454#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:12,644 INFO L273 TraceCheckUtils]: 41: Hoare triple {9454#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9455#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:12,644 INFO L273 TraceCheckUtils]: 42: Hoare triple {9455#(<= main_~i~0 18)} assume true; {9455#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:12,645 INFO L273 TraceCheckUtils]: 43: Hoare triple {9455#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9456#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:12,646 INFO L273 TraceCheckUtils]: 44: Hoare triple {9456#(<= main_~i~0 19)} assume true; {9456#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:12,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {9456#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9457#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:12,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {9457#(<= main_~i~0 20)} assume true; {9457#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:12,648 INFO L273 TraceCheckUtils]: 47: Hoare triple {9457#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9458#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:12,648 INFO L273 TraceCheckUtils]: 48: Hoare triple {9458#(<= main_~i~0 21)} assume true; {9458#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:12,649 INFO L273 TraceCheckUtils]: 49: Hoare triple {9458#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9459#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:12,650 INFO L273 TraceCheckUtils]: 50: Hoare triple {9459#(<= main_~i~0 22)} assume true; {9459#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:12,651 INFO L273 TraceCheckUtils]: 51: Hoare triple {9459#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9460#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:12,651 INFO L273 TraceCheckUtils]: 52: Hoare triple {9460#(<= main_~i~0 23)} assume true; {9460#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:12,652 INFO L273 TraceCheckUtils]: 53: Hoare triple {9460#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9461#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:12,653 INFO L273 TraceCheckUtils]: 54: Hoare triple {9461#(<= main_~i~0 24)} assume true; {9461#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:12,654 INFO L273 TraceCheckUtils]: 55: Hoare triple {9461#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9462#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:12,654 INFO L273 TraceCheckUtils]: 56: Hoare triple {9462#(<= main_~i~0 25)} assume true; {9462#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:12,655 INFO L273 TraceCheckUtils]: 57: Hoare triple {9462#(<= main_~i~0 25)} assume !(~i~0 < 100000); {9436#false} is VALID [2018-11-14 16:56:12,655 INFO L273 TraceCheckUtils]: 58: Hoare triple {9436#false} havoc ~x~0;~x~0 := 0; {9436#false} is VALID [2018-11-14 16:56:12,655 INFO L273 TraceCheckUtils]: 59: Hoare triple {9436#false} assume true; {9436#false} is VALID [2018-11-14 16:56:12,656 INFO L273 TraceCheckUtils]: 60: Hoare triple {9436#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {9436#false} is VALID [2018-11-14 16:56:12,656 INFO L256 TraceCheckUtils]: 61: Hoare triple {9436#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {9436#false} is VALID [2018-11-14 16:56:12,656 INFO L273 TraceCheckUtils]: 62: Hoare triple {9436#false} ~cond := #in~cond; {9436#false} is VALID [2018-11-14 16:56:12,656 INFO L273 TraceCheckUtils]: 63: Hoare triple {9436#false} assume ~cond == 0; {9436#false} is VALID [2018-11-14 16:56:12,656 INFO L273 TraceCheckUtils]: 64: Hoare triple {9436#false} assume !false; {9436#false} is VALID [2018-11-14 16:56:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:12,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:12,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-14 16:56:12,682 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-11-14 16:56:12,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:12,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 16:56:12,744 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-14 16:56:12,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 16:56:12,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 16:56:12,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 16:56:12,745 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 29 states. [2018-11-14 16:56:13,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:13,198 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-11-14 16:56:13,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 16:56:13,198 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-11-14 16:56:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 16:56:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 86 transitions. [2018-11-14 16:56:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 16:56:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 86 transitions. [2018-11-14 16:56:13,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 86 transitions. [2018-11-14 16:56:13,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:13,279 INFO L225 Difference]: With dead ends: 84 [2018-11-14 16:56:13,279 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 16:56:13,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 16:56:13,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 16:56:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-14 16:56:13,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:13,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-14 16:56:13,303 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-14 16:56:13,303 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-14 16:56:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:13,304 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-11-14 16:56:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-14 16:56:13,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:13,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:13,305 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-14 16:56:13,305 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-14 16:56:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:13,306 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-11-14 16:56:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-14 16:56:13,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:13,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:13,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:13,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 16:56:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-14 16:56:13,307 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 65 [2018-11-14 16:56:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:13,307 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-14 16:56:13,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 16:56:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-14 16:56:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 16:56:13,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:13,308 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:13,308 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:13,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:13,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1882892776, now seen corresponding path program 26 times [2018-11-14 16:56:13,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:13,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:13,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:56:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:14,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {10029#true} call ULTIMATE.init(); {10029#true} is VALID [2018-11-14 16:56:14,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {10029#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10029#true} is VALID [2018-11-14 16:56:14,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {10029#true} assume true; {10029#true} is VALID [2018-11-14 16:56:14,232 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10029#true} {10029#true} #50#return; {10029#true} is VALID [2018-11-14 16:56:14,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {10029#true} call #t~ret2 := main(); {10029#true} is VALID [2018-11-14 16:56:14,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {10029#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10031#(= main_~i~0 0)} is VALID [2018-11-14 16:56:14,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {10031#(= main_~i~0 0)} assume true; {10031#(= main_~i~0 0)} is VALID [2018-11-14 16:56:14,234 INFO L273 TraceCheckUtils]: 7: Hoare triple {10031#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10032#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:14,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {10032#(<= main_~i~0 1)} assume true; {10032#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:14,236 INFO L273 TraceCheckUtils]: 9: Hoare triple {10032#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10033#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:14,236 INFO L273 TraceCheckUtils]: 10: Hoare triple {10033#(<= main_~i~0 2)} assume true; {10033#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:14,237 INFO L273 TraceCheckUtils]: 11: Hoare triple {10033#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10034#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:14,238 INFO L273 TraceCheckUtils]: 12: Hoare triple {10034#(<= main_~i~0 3)} assume true; {10034#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:14,238 INFO L273 TraceCheckUtils]: 13: Hoare triple {10034#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10035#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:14,239 INFO L273 TraceCheckUtils]: 14: Hoare triple {10035#(<= main_~i~0 4)} assume true; {10035#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:14,240 INFO L273 TraceCheckUtils]: 15: Hoare triple {10035#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10036#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:14,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {10036#(<= main_~i~0 5)} assume true; {10036#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:14,241 INFO L273 TraceCheckUtils]: 17: Hoare triple {10036#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10037#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:14,242 INFO L273 TraceCheckUtils]: 18: Hoare triple {10037#(<= main_~i~0 6)} assume true; {10037#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:14,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {10037#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10038#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:14,243 INFO L273 TraceCheckUtils]: 20: Hoare triple {10038#(<= main_~i~0 7)} assume true; {10038#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:14,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {10038#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10039#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:14,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {10039#(<= main_~i~0 8)} assume true; {10039#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:14,246 INFO L273 TraceCheckUtils]: 23: Hoare triple {10039#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10040#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:14,246 INFO L273 TraceCheckUtils]: 24: Hoare triple {10040#(<= main_~i~0 9)} assume true; {10040#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:14,247 INFO L273 TraceCheckUtils]: 25: Hoare triple {10040#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10041#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:14,248 INFO L273 TraceCheckUtils]: 26: Hoare triple {10041#(<= main_~i~0 10)} assume true; {10041#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:14,249 INFO L273 TraceCheckUtils]: 27: Hoare triple {10041#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10042#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:14,249 INFO L273 TraceCheckUtils]: 28: Hoare triple {10042#(<= main_~i~0 11)} assume true; {10042#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:14,250 INFO L273 TraceCheckUtils]: 29: Hoare triple {10042#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10043#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:14,250 INFO L273 TraceCheckUtils]: 30: Hoare triple {10043#(<= main_~i~0 12)} assume true; {10043#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:14,251 INFO L273 TraceCheckUtils]: 31: Hoare triple {10043#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10044#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:14,252 INFO L273 TraceCheckUtils]: 32: Hoare triple {10044#(<= main_~i~0 13)} assume true; {10044#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:14,253 INFO L273 TraceCheckUtils]: 33: Hoare triple {10044#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10045#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:14,253 INFO L273 TraceCheckUtils]: 34: Hoare triple {10045#(<= main_~i~0 14)} assume true; {10045#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:14,254 INFO L273 TraceCheckUtils]: 35: Hoare triple {10045#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10046#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:14,255 INFO L273 TraceCheckUtils]: 36: Hoare triple {10046#(<= main_~i~0 15)} assume true; {10046#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:14,255 INFO L273 TraceCheckUtils]: 37: Hoare triple {10046#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10047#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:14,256 INFO L273 TraceCheckUtils]: 38: Hoare triple {10047#(<= main_~i~0 16)} assume true; {10047#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:14,257 INFO L273 TraceCheckUtils]: 39: Hoare triple {10047#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10048#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:14,257 INFO L273 TraceCheckUtils]: 40: Hoare triple {10048#(<= main_~i~0 17)} assume true; {10048#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:14,258 INFO L273 TraceCheckUtils]: 41: Hoare triple {10048#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10049#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:14,259 INFO L273 TraceCheckUtils]: 42: Hoare triple {10049#(<= main_~i~0 18)} assume true; {10049#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:14,260 INFO L273 TraceCheckUtils]: 43: Hoare triple {10049#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10050#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:14,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {10050#(<= main_~i~0 19)} assume true; {10050#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:14,261 INFO L273 TraceCheckUtils]: 45: Hoare triple {10050#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10051#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:14,262 INFO L273 TraceCheckUtils]: 46: Hoare triple {10051#(<= main_~i~0 20)} assume true; {10051#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:14,263 INFO L273 TraceCheckUtils]: 47: Hoare triple {10051#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10052#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:14,263 INFO L273 TraceCheckUtils]: 48: Hoare triple {10052#(<= main_~i~0 21)} assume true; {10052#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:14,264 INFO L273 TraceCheckUtils]: 49: Hoare triple {10052#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10053#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:14,265 INFO L273 TraceCheckUtils]: 50: Hoare triple {10053#(<= main_~i~0 22)} assume true; {10053#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:14,266 INFO L273 TraceCheckUtils]: 51: Hoare triple {10053#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10054#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:14,266 INFO L273 TraceCheckUtils]: 52: Hoare triple {10054#(<= main_~i~0 23)} assume true; {10054#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:14,267 INFO L273 TraceCheckUtils]: 53: Hoare triple {10054#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10055#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:14,268 INFO L273 TraceCheckUtils]: 54: Hoare triple {10055#(<= main_~i~0 24)} assume true; {10055#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:14,269 INFO L273 TraceCheckUtils]: 55: Hoare triple {10055#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10056#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:14,269 INFO L273 TraceCheckUtils]: 56: Hoare triple {10056#(<= main_~i~0 25)} assume true; {10056#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:14,270 INFO L273 TraceCheckUtils]: 57: Hoare triple {10056#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10057#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:14,271 INFO L273 TraceCheckUtils]: 58: Hoare triple {10057#(<= main_~i~0 26)} assume true; {10057#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:14,271 INFO L273 TraceCheckUtils]: 59: Hoare triple {10057#(<= main_~i~0 26)} assume !(~i~0 < 100000); {10030#false} is VALID [2018-11-14 16:56:14,272 INFO L273 TraceCheckUtils]: 60: Hoare triple {10030#false} havoc ~x~0;~x~0 := 0; {10030#false} is VALID [2018-11-14 16:56:14,272 INFO L273 TraceCheckUtils]: 61: Hoare triple {10030#false} assume true; {10030#false} is VALID [2018-11-14 16:56:14,272 INFO L273 TraceCheckUtils]: 62: Hoare triple {10030#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10030#false} is VALID [2018-11-14 16:56:14,272 INFO L256 TraceCheckUtils]: 63: Hoare triple {10030#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {10030#false} is VALID [2018-11-14 16:56:14,272 INFO L273 TraceCheckUtils]: 64: Hoare triple {10030#false} ~cond := #in~cond; {10030#false} is VALID [2018-11-14 16:56:14,273 INFO L273 TraceCheckUtils]: 65: Hoare triple {10030#false} assume ~cond == 0; {10030#false} is VALID [2018-11-14 16:56:14,273 INFO L273 TraceCheckUtils]: 66: Hoare triple {10030#false} assume !false; {10030#false} is VALID [2018-11-14 16:56:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:14,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:14,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:14,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:56:14,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:56:14,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:14,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:14,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {10029#true} call ULTIMATE.init(); {10029#true} is VALID [2018-11-14 16:56:14,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {10029#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10029#true} is VALID [2018-11-14 16:56:14,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {10029#true} assume true; {10029#true} is VALID [2018-11-14 16:56:14,505 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10029#true} {10029#true} #50#return; {10029#true} is VALID [2018-11-14 16:56:14,505 INFO L256 TraceCheckUtils]: 4: Hoare triple {10029#true} call #t~ret2 := main(); {10029#true} is VALID [2018-11-14 16:56:14,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {10029#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10076#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:14,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {10076#(<= main_~i~0 0)} assume true; {10076#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:14,507 INFO L273 TraceCheckUtils]: 7: Hoare triple {10076#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10032#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:14,507 INFO L273 TraceCheckUtils]: 8: Hoare triple {10032#(<= main_~i~0 1)} assume true; {10032#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:14,508 INFO L273 TraceCheckUtils]: 9: Hoare triple {10032#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10033#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:14,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {10033#(<= main_~i~0 2)} assume true; {10033#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:14,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {10033#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10034#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:14,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {10034#(<= main_~i~0 3)} assume true; {10034#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:14,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {10034#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10035#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:14,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {10035#(<= main_~i~0 4)} assume true; {10035#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:14,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {10035#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10036#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:14,513 INFO L273 TraceCheckUtils]: 16: Hoare triple {10036#(<= main_~i~0 5)} assume true; {10036#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:14,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {10036#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10037#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:14,514 INFO L273 TraceCheckUtils]: 18: Hoare triple {10037#(<= main_~i~0 6)} assume true; {10037#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:14,515 INFO L273 TraceCheckUtils]: 19: Hoare triple {10037#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10038#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:14,515 INFO L273 TraceCheckUtils]: 20: Hoare triple {10038#(<= main_~i~0 7)} assume true; {10038#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:14,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {10038#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10039#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:14,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {10039#(<= main_~i~0 8)} assume true; {10039#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:14,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {10039#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10040#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:14,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {10040#(<= main_~i~0 9)} assume true; {10040#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:14,519 INFO L273 TraceCheckUtils]: 25: Hoare triple {10040#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10041#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:14,520 INFO L273 TraceCheckUtils]: 26: Hoare triple {10041#(<= main_~i~0 10)} assume true; {10041#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:14,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {10041#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10042#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:14,521 INFO L273 TraceCheckUtils]: 28: Hoare triple {10042#(<= main_~i~0 11)} assume true; {10042#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:14,522 INFO L273 TraceCheckUtils]: 29: Hoare triple {10042#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10043#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:14,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {10043#(<= main_~i~0 12)} assume true; {10043#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:14,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {10043#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10044#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:14,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {10044#(<= main_~i~0 13)} assume true; {10044#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:14,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {10044#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10045#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:14,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {10045#(<= main_~i~0 14)} assume true; {10045#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:14,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {10045#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10046#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:14,527 INFO L273 TraceCheckUtils]: 36: Hoare triple {10046#(<= main_~i~0 15)} assume true; {10046#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:14,528 INFO L273 TraceCheckUtils]: 37: Hoare triple {10046#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10047#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:14,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {10047#(<= main_~i~0 16)} assume true; {10047#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:14,529 INFO L273 TraceCheckUtils]: 39: Hoare triple {10047#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10048#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:14,530 INFO L273 TraceCheckUtils]: 40: Hoare triple {10048#(<= main_~i~0 17)} assume true; {10048#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:14,531 INFO L273 TraceCheckUtils]: 41: Hoare triple {10048#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10049#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:14,531 INFO L273 TraceCheckUtils]: 42: Hoare triple {10049#(<= main_~i~0 18)} assume true; {10049#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:14,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {10049#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10050#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:14,533 INFO L273 TraceCheckUtils]: 44: Hoare triple {10050#(<= main_~i~0 19)} assume true; {10050#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:14,534 INFO L273 TraceCheckUtils]: 45: Hoare triple {10050#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10051#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:14,534 INFO L273 TraceCheckUtils]: 46: Hoare triple {10051#(<= main_~i~0 20)} assume true; {10051#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:14,535 INFO L273 TraceCheckUtils]: 47: Hoare triple {10051#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10052#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:14,536 INFO L273 TraceCheckUtils]: 48: Hoare triple {10052#(<= main_~i~0 21)} assume true; {10052#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:14,537 INFO L273 TraceCheckUtils]: 49: Hoare triple {10052#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10053#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:14,537 INFO L273 TraceCheckUtils]: 50: Hoare triple {10053#(<= main_~i~0 22)} assume true; {10053#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:14,538 INFO L273 TraceCheckUtils]: 51: Hoare triple {10053#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10054#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:14,539 INFO L273 TraceCheckUtils]: 52: Hoare triple {10054#(<= main_~i~0 23)} assume true; {10054#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:14,539 INFO L273 TraceCheckUtils]: 53: Hoare triple {10054#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10055#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:14,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {10055#(<= main_~i~0 24)} assume true; {10055#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:14,541 INFO L273 TraceCheckUtils]: 55: Hoare triple {10055#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10056#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:14,541 INFO L273 TraceCheckUtils]: 56: Hoare triple {10056#(<= main_~i~0 25)} assume true; {10056#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:14,542 INFO L273 TraceCheckUtils]: 57: Hoare triple {10056#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10057#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:14,543 INFO L273 TraceCheckUtils]: 58: Hoare triple {10057#(<= main_~i~0 26)} assume true; {10057#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:14,543 INFO L273 TraceCheckUtils]: 59: Hoare triple {10057#(<= main_~i~0 26)} assume !(~i~0 < 100000); {10030#false} is VALID [2018-11-14 16:56:14,543 INFO L273 TraceCheckUtils]: 60: Hoare triple {10030#false} havoc ~x~0;~x~0 := 0; {10030#false} is VALID [2018-11-14 16:56:14,544 INFO L273 TraceCheckUtils]: 61: Hoare triple {10030#false} assume true; {10030#false} is VALID [2018-11-14 16:56:14,544 INFO L273 TraceCheckUtils]: 62: Hoare triple {10030#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10030#false} is VALID [2018-11-14 16:56:14,544 INFO L256 TraceCheckUtils]: 63: Hoare triple {10030#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {10030#false} is VALID [2018-11-14 16:56:14,544 INFO L273 TraceCheckUtils]: 64: Hoare triple {10030#false} ~cond := #in~cond; {10030#false} is VALID [2018-11-14 16:56:14,544 INFO L273 TraceCheckUtils]: 65: Hoare triple {10030#false} assume ~cond == 0; {10030#false} is VALID [2018-11-14 16:56:14,545 INFO L273 TraceCheckUtils]: 66: Hoare triple {10030#false} assume !false; {10030#false} is VALID [2018-11-14 16:56:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:14,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:14,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-14 16:56:14,570 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-11-14 16:56:14,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:14,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 16:56:14,631 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-14 16:56:14,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 16:56:14,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 16:56:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 16:56:14,633 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 30 states. [2018-11-14 16:56:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:14,870 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-14 16:56:14,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 16:56:14,870 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-11-14 16:56:14,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:56:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 88 transitions. [2018-11-14 16:56:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:56:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 88 transitions. [2018-11-14 16:56:14,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 88 transitions. [2018-11-14 16:56:14,953 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-14 16:56:14,955 INFO L225 Difference]: With dead ends: 86 [2018-11-14 16:56:14,955 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 16:56:14,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 16:56:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 16:56:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-14 16:56:14,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:14,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2018-11-14 16:56:14,981 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-14 16:56:14,981 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-14 16:56:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:14,982 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-11-14 16:56:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-14 16:56:14,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:14,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:14,983 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-14 16:56:14,983 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-14 16:56:14,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:14,984 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-11-14 16:56:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-14 16:56:14,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:14,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:14,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:14,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 16:56:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-11-14 16:56:14,986 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 67 [2018-11-14 16:56:14,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:14,986 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-11-14 16:56:14,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 16:56:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-14 16:56:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 16:56:14,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:14,987 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:14,987 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:14,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:14,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1290666126, now seen corresponding path program 27 times [2018-11-14 16:56:14,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:14,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:14,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:14,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:14,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:15,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {10640#true} call ULTIMATE.init(); {10640#true} is VALID [2018-11-14 16:56:15,576 INFO L273 TraceCheckUtils]: 1: Hoare triple {10640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10640#true} is VALID [2018-11-14 16:56:15,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {10640#true} assume true; {10640#true} is VALID [2018-11-14 16:56:15,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10640#true} {10640#true} #50#return; {10640#true} is VALID [2018-11-14 16:56:15,577 INFO L256 TraceCheckUtils]: 4: Hoare triple {10640#true} call #t~ret2 := main(); {10640#true} is VALID [2018-11-14 16:56:15,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {10640#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10642#(= main_~i~0 0)} is VALID [2018-11-14 16:56:15,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {10642#(= main_~i~0 0)} assume true; {10642#(= main_~i~0 0)} is VALID [2018-11-14 16:56:15,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {10642#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10643#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:15,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {10643#(<= main_~i~0 1)} assume true; {10643#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:15,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {10643#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10644#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:15,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {10644#(<= main_~i~0 2)} assume true; {10644#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:15,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {10644#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10645#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:15,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {10645#(<= main_~i~0 3)} assume true; {10645#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:15,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {10645#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10646#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:15,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {10646#(<= main_~i~0 4)} assume true; {10646#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:15,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {10646#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10647#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:15,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {10647#(<= main_~i~0 5)} assume true; {10647#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:15,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {10647#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10648#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:15,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {10648#(<= main_~i~0 6)} assume true; {10648#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:15,589 INFO L273 TraceCheckUtils]: 19: Hoare triple {10648#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10649#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:15,590 INFO L273 TraceCheckUtils]: 20: Hoare triple {10649#(<= main_~i~0 7)} assume true; {10649#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:15,591 INFO L273 TraceCheckUtils]: 21: Hoare triple {10649#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10650#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:15,591 INFO L273 TraceCheckUtils]: 22: Hoare triple {10650#(<= main_~i~0 8)} assume true; {10650#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:15,592 INFO L273 TraceCheckUtils]: 23: Hoare triple {10650#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10651#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:15,593 INFO L273 TraceCheckUtils]: 24: Hoare triple {10651#(<= main_~i~0 9)} assume true; {10651#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:15,594 INFO L273 TraceCheckUtils]: 25: Hoare triple {10651#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10652#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:15,594 INFO L273 TraceCheckUtils]: 26: Hoare triple {10652#(<= main_~i~0 10)} assume true; {10652#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:15,595 INFO L273 TraceCheckUtils]: 27: Hoare triple {10652#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10653#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:15,596 INFO L273 TraceCheckUtils]: 28: Hoare triple {10653#(<= main_~i~0 11)} assume true; {10653#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:15,597 INFO L273 TraceCheckUtils]: 29: Hoare triple {10653#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10654#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:15,598 INFO L273 TraceCheckUtils]: 30: Hoare triple {10654#(<= main_~i~0 12)} assume true; {10654#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:15,599 INFO L273 TraceCheckUtils]: 31: Hoare triple {10654#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10655#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:15,599 INFO L273 TraceCheckUtils]: 32: Hoare triple {10655#(<= main_~i~0 13)} assume true; {10655#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:15,600 INFO L273 TraceCheckUtils]: 33: Hoare triple {10655#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10656#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:15,601 INFO L273 TraceCheckUtils]: 34: Hoare triple {10656#(<= main_~i~0 14)} assume true; {10656#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:15,602 INFO L273 TraceCheckUtils]: 35: Hoare triple {10656#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10657#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:15,603 INFO L273 TraceCheckUtils]: 36: Hoare triple {10657#(<= main_~i~0 15)} assume true; {10657#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:15,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {10657#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10658#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:15,604 INFO L273 TraceCheckUtils]: 38: Hoare triple {10658#(<= main_~i~0 16)} assume true; {10658#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:15,605 INFO L273 TraceCheckUtils]: 39: Hoare triple {10658#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10659#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:15,606 INFO L273 TraceCheckUtils]: 40: Hoare triple {10659#(<= main_~i~0 17)} assume true; {10659#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:15,607 INFO L273 TraceCheckUtils]: 41: Hoare triple {10659#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10660#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:15,608 INFO L273 TraceCheckUtils]: 42: Hoare triple {10660#(<= main_~i~0 18)} assume true; {10660#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:15,609 INFO L273 TraceCheckUtils]: 43: Hoare triple {10660#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10661#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:15,609 INFO L273 TraceCheckUtils]: 44: Hoare triple {10661#(<= main_~i~0 19)} assume true; {10661#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:15,610 INFO L273 TraceCheckUtils]: 45: Hoare triple {10661#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10662#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:15,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {10662#(<= main_~i~0 20)} assume true; {10662#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:15,612 INFO L273 TraceCheckUtils]: 47: Hoare triple {10662#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10663#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:15,613 INFO L273 TraceCheckUtils]: 48: Hoare triple {10663#(<= main_~i~0 21)} assume true; {10663#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:15,614 INFO L273 TraceCheckUtils]: 49: Hoare triple {10663#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10664#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:15,614 INFO L273 TraceCheckUtils]: 50: Hoare triple {10664#(<= main_~i~0 22)} assume true; {10664#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:15,615 INFO L273 TraceCheckUtils]: 51: Hoare triple {10664#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10665#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:15,616 INFO L273 TraceCheckUtils]: 52: Hoare triple {10665#(<= main_~i~0 23)} assume true; {10665#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:15,617 INFO L273 TraceCheckUtils]: 53: Hoare triple {10665#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10666#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:15,618 INFO L273 TraceCheckUtils]: 54: Hoare triple {10666#(<= main_~i~0 24)} assume true; {10666#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:15,619 INFO L273 TraceCheckUtils]: 55: Hoare triple {10666#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10667#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:15,619 INFO L273 TraceCheckUtils]: 56: Hoare triple {10667#(<= main_~i~0 25)} assume true; {10667#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:15,620 INFO L273 TraceCheckUtils]: 57: Hoare triple {10667#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10668#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:15,621 INFO L273 TraceCheckUtils]: 58: Hoare triple {10668#(<= main_~i~0 26)} assume true; {10668#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:15,622 INFO L273 TraceCheckUtils]: 59: Hoare triple {10668#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10669#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:15,623 INFO L273 TraceCheckUtils]: 60: Hoare triple {10669#(<= main_~i~0 27)} assume true; {10669#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:15,623 INFO L273 TraceCheckUtils]: 61: Hoare triple {10669#(<= main_~i~0 27)} assume !(~i~0 < 100000); {10641#false} is VALID [2018-11-14 16:56:15,624 INFO L273 TraceCheckUtils]: 62: Hoare triple {10641#false} havoc ~x~0;~x~0 := 0; {10641#false} is VALID [2018-11-14 16:56:15,624 INFO L273 TraceCheckUtils]: 63: Hoare triple {10641#false} assume true; {10641#false} is VALID [2018-11-14 16:56:15,624 INFO L273 TraceCheckUtils]: 64: Hoare triple {10641#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10641#false} is VALID [2018-11-14 16:56:15,624 INFO L256 TraceCheckUtils]: 65: Hoare triple {10641#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {10641#false} is VALID [2018-11-14 16:56:15,625 INFO L273 TraceCheckUtils]: 66: Hoare triple {10641#false} ~cond := #in~cond; {10641#false} is VALID [2018-11-14 16:56:15,625 INFO L273 TraceCheckUtils]: 67: Hoare triple {10641#false} assume ~cond == 0; {10641#false} is VALID [2018-11-14 16:56:15,625 INFO L273 TraceCheckUtils]: 68: Hoare triple {10641#false} assume !false; {10641#false} is VALID [2018-11-14 16:56:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:15,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:15,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:15,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:56:19,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-14 16:56:19,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:19,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:20,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {10640#true} call ULTIMATE.init(); {10640#true} is VALID [2018-11-14 16:56:20,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {10640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10640#true} is VALID [2018-11-14 16:56:20,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {10640#true} assume true; {10640#true} is VALID [2018-11-14 16:56:20,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10640#true} {10640#true} #50#return; {10640#true} is VALID [2018-11-14 16:56:20,242 INFO L256 TraceCheckUtils]: 4: Hoare triple {10640#true} call #t~ret2 := main(); {10640#true} is VALID [2018-11-14 16:56:20,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {10640#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10688#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:20,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {10688#(<= main_~i~0 0)} assume true; {10688#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:20,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {10688#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10643#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:20,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {10643#(<= main_~i~0 1)} assume true; {10643#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:20,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {10643#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10644#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:20,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {10644#(<= main_~i~0 2)} assume true; {10644#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:20,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {10644#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10645#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:20,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {10645#(<= main_~i~0 3)} assume true; {10645#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:20,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {10645#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10646#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:20,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {10646#(<= main_~i~0 4)} assume true; {10646#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:20,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {10646#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10647#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:20,250 INFO L273 TraceCheckUtils]: 16: Hoare triple {10647#(<= main_~i~0 5)} assume true; {10647#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:20,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {10647#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10648#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:20,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {10648#(<= main_~i~0 6)} assume true; {10648#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:20,253 INFO L273 TraceCheckUtils]: 19: Hoare triple {10648#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10649#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:20,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {10649#(<= main_~i~0 7)} assume true; {10649#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:20,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {10649#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10650#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:20,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {10650#(<= main_~i~0 8)} assume true; {10650#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:20,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {10650#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10651#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:20,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {10651#(<= main_~i~0 9)} assume true; {10651#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:20,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {10651#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10652#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:20,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {10652#(<= main_~i~0 10)} assume true; {10652#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:20,260 INFO L273 TraceCheckUtils]: 27: Hoare triple {10652#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10653#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:20,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {10653#(<= main_~i~0 11)} assume true; {10653#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:20,261 INFO L273 TraceCheckUtils]: 29: Hoare triple {10653#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10654#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:20,262 INFO L273 TraceCheckUtils]: 30: Hoare triple {10654#(<= main_~i~0 12)} assume true; {10654#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:20,263 INFO L273 TraceCheckUtils]: 31: Hoare triple {10654#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10655#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:20,264 INFO L273 TraceCheckUtils]: 32: Hoare triple {10655#(<= main_~i~0 13)} assume true; {10655#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:20,265 INFO L273 TraceCheckUtils]: 33: Hoare triple {10655#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10656#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:20,287 INFO L273 TraceCheckUtils]: 34: Hoare triple {10656#(<= main_~i~0 14)} assume true; {10656#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:20,288 INFO L273 TraceCheckUtils]: 35: Hoare triple {10656#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10657#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:20,288 INFO L273 TraceCheckUtils]: 36: Hoare triple {10657#(<= main_~i~0 15)} assume true; {10657#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:20,289 INFO L273 TraceCheckUtils]: 37: Hoare triple {10657#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10658#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:20,289 INFO L273 TraceCheckUtils]: 38: Hoare triple {10658#(<= main_~i~0 16)} assume true; {10658#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:20,290 INFO L273 TraceCheckUtils]: 39: Hoare triple {10658#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10659#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:20,290 INFO L273 TraceCheckUtils]: 40: Hoare triple {10659#(<= main_~i~0 17)} assume true; {10659#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:20,291 INFO L273 TraceCheckUtils]: 41: Hoare triple {10659#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10660#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:20,291 INFO L273 TraceCheckUtils]: 42: Hoare triple {10660#(<= main_~i~0 18)} assume true; {10660#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:20,292 INFO L273 TraceCheckUtils]: 43: Hoare triple {10660#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10661#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:20,292 INFO L273 TraceCheckUtils]: 44: Hoare triple {10661#(<= main_~i~0 19)} assume true; {10661#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:20,293 INFO L273 TraceCheckUtils]: 45: Hoare triple {10661#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10662#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:20,294 INFO L273 TraceCheckUtils]: 46: Hoare triple {10662#(<= main_~i~0 20)} assume true; {10662#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:20,295 INFO L273 TraceCheckUtils]: 47: Hoare triple {10662#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10663#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:20,295 INFO L273 TraceCheckUtils]: 48: Hoare triple {10663#(<= main_~i~0 21)} assume true; {10663#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:20,296 INFO L273 TraceCheckUtils]: 49: Hoare triple {10663#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10664#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:20,297 INFO L273 TraceCheckUtils]: 50: Hoare triple {10664#(<= main_~i~0 22)} assume true; {10664#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:20,297 INFO L273 TraceCheckUtils]: 51: Hoare triple {10664#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10665#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:20,298 INFO L273 TraceCheckUtils]: 52: Hoare triple {10665#(<= main_~i~0 23)} assume true; {10665#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:20,299 INFO L273 TraceCheckUtils]: 53: Hoare triple {10665#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10666#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:20,299 INFO L273 TraceCheckUtils]: 54: Hoare triple {10666#(<= main_~i~0 24)} assume true; {10666#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:20,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {10666#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10667#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:20,301 INFO L273 TraceCheckUtils]: 56: Hoare triple {10667#(<= main_~i~0 25)} assume true; {10667#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:20,302 INFO L273 TraceCheckUtils]: 57: Hoare triple {10667#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10668#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:20,302 INFO L273 TraceCheckUtils]: 58: Hoare triple {10668#(<= main_~i~0 26)} assume true; {10668#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:20,303 INFO L273 TraceCheckUtils]: 59: Hoare triple {10668#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10669#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:20,304 INFO L273 TraceCheckUtils]: 60: Hoare triple {10669#(<= main_~i~0 27)} assume true; {10669#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:20,304 INFO L273 TraceCheckUtils]: 61: Hoare triple {10669#(<= main_~i~0 27)} assume !(~i~0 < 100000); {10641#false} is VALID [2018-11-14 16:56:20,305 INFO L273 TraceCheckUtils]: 62: Hoare triple {10641#false} havoc ~x~0;~x~0 := 0; {10641#false} is VALID [2018-11-14 16:56:20,305 INFO L273 TraceCheckUtils]: 63: Hoare triple {10641#false} assume true; {10641#false} is VALID [2018-11-14 16:56:20,305 INFO L273 TraceCheckUtils]: 64: Hoare triple {10641#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10641#false} is VALID [2018-11-14 16:56:20,305 INFO L256 TraceCheckUtils]: 65: Hoare triple {10641#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {10641#false} is VALID [2018-11-14 16:56:20,305 INFO L273 TraceCheckUtils]: 66: Hoare triple {10641#false} ~cond := #in~cond; {10641#false} is VALID [2018-11-14 16:56:20,306 INFO L273 TraceCheckUtils]: 67: Hoare triple {10641#false} assume ~cond == 0; {10641#false} is VALID [2018-11-14 16:56:20,306 INFO L273 TraceCheckUtils]: 68: Hoare triple {10641#false} assume !false; {10641#false} is VALID [2018-11-14 16:56:20,309 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:20,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:20,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-14 16:56:20,333 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2018-11-14 16:56:20,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:20,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 16:56:20,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:20,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 16:56:20,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 16:56:20,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 16:56:20,418 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 31 states. [2018-11-14 16:56:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:21,151 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2018-11-14 16:56:21,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 16:56:21,151 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2018-11-14 16:56:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:56:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 90 transitions. [2018-11-14 16:56:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:56:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 90 transitions. [2018-11-14 16:56:21,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 90 transitions. [2018-11-14 16:56:21,235 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-14 16:56:21,237 INFO L225 Difference]: With dead ends: 88 [2018-11-14 16:56:21,237 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 16:56:21,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 16:56:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 16:56:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-14 16:56:21,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:21,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-14 16:56:21,283 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-14 16:56:21,283 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-14 16:56:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:21,285 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-11-14 16:56:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-11-14 16:56:21,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:21,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:21,286 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-14 16:56:21,286 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-14 16:56:21,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:21,288 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-11-14 16:56:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-11-14 16:56:21,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:21,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:21,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:21,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 16:56:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-11-14 16:56:21,290 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 69 [2018-11-14 16:56:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:21,290 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-11-14 16:56:21,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 16:56:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-11-14 16:56:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-14 16:56:21,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:21,291 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:21,292 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:21,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash 903461452, now seen corresponding path program 28 times [2018-11-14 16:56:21,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:21,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:21,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:21,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:21,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:21,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {11268#true} call ULTIMATE.init(); {11268#true} is VALID [2018-11-14 16:56:21,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {11268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11268#true} is VALID [2018-11-14 16:56:21,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {11268#true} assume true; {11268#true} is VALID [2018-11-14 16:56:21,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11268#true} {11268#true} #50#return; {11268#true} is VALID [2018-11-14 16:56:21,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {11268#true} call #t~ret2 := main(); {11268#true} is VALID [2018-11-14 16:56:21,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {11268#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11270#(= main_~i~0 0)} is VALID [2018-11-14 16:56:21,897 INFO L273 TraceCheckUtils]: 6: Hoare triple {11270#(= main_~i~0 0)} assume true; {11270#(= main_~i~0 0)} is VALID [2018-11-14 16:56:21,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {11270#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11271#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:21,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {11271#(<= main_~i~0 1)} assume true; {11271#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:21,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {11271#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11272#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:21,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {11272#(<= main_~i~0 2)} assume true; {11272#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:21,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {11272#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11273#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:21,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {11273#(<= main_~i~0 3)} assume true; {11273#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:21,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {11273#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11274#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:21,901 INFO L273 TraceCheckUtils]: 14: Hoare triple {11274#(<= main_~i~0 4)} assume true; {11274#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:21,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {11274#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11275#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:21,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {11275#(<= main_~i~0 5)} assume true; {11275#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:21,903 INFO L273 TraceCheckUtils]: 17: Hoare triple {11275#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11276#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:21,904 INFO L273 TraceCheckUtils]: 18: Hoare triple {11276#(<= main_~i~0 6)} assume true; {11276#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:21,905 INFO L273 TraceCheckUtils]: 19: Hoare triple {11276#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11277#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:21,905 INFO L273 TraceCheckUtils]: 20: Hoare triple {11277#(<= main_~i~0 7)} assume true; {11277#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:21,906 INFO L273 TraceCheckUtils]: 21: Hoare triple {11277#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11278#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:21,907 INFO L273 TraceCheckUtils]: 22: Hoare triple {11278#(<= main_~i~0 8)} assume true; {11278#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:21,908 INFO L273 TraceCheckUtils]: 23: Hoare triple {11278#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11279#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:21,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {11279#(<= main_~i~0 9)} assume true; {11279#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:21,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {11279#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11280#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:21,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {11280#(<= main_~i~0 10)} assume true; {11280#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:21,911 INFO L273 TraceCheckUtils]: 27: Hoare triple {11280#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11281#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:21,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {11281#(<= main_~i~0 11)} assume true; {11281#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:21,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {11281#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11282#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:21,913 INFO L273 TraceCheckUtils]: 30: Hoare triple {11282#(<= main_~i~0 12)} assume true; {11282#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:21,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {11282#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11283#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:21,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {11283#(<= main_~i~0 13)} assume true; {11283#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:21,915 INFO L273 TraceCheckUtils]: 33: Hoare triple {11283#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11284#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:21,916 INFO L273 TraceCheckUtils]: 34: Hoare triple {11284#(<= main_~i~0 14)} assume true; {11284#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:21,916 INFO L273 TraceCheckUtils]: 35: Hoare triple {11284#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11285#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:21,917 INFO L273 TraceCheckUtils]: 36: Hoare triple {11285#(<= main_~i~0 15)} assume true; {11285#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:21,918 INFO L273 TraceCheckUtils]: 37: Hoare triple {11285#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11286#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:21,918 INFO L273 TraceCheckUtils]: 38: Hoare triple {11286#(<= main_~i~0 16)} assume true; {11286#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:21,919 INFO L273 TraceCheckUtils]: 39: Hoare triple {11286#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11287#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:21,920 INFO L273 TraceCheckUtils]: 40: Hoare triple {11287#(<= main_~i~0 17)} assume true; {11287#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:21,921 INFO L273 TraceCheckUtils]: 41: Hoare triple {11287#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11288#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:21,921 INFO L273 TraceCheckUtils]: 42: Hoare triple {11288#(<= main_~i~0 18)} assume true; {11288#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:21,922 INFO L273 TraceCheckUtils]: 43: Hoare triple {11288#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11289#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:21,923 INFO L273 TraceCheckUtils]: 44: Hoare triple {11289#(<= main_~i~0 19)} assume true; {11289#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:21,924 INFO L273 TraceCheckUtils]: 45: Hoare triple {11289#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11290#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:21,924 INFO L273 TraceCheckUtils]: 46: Hoare triple {11290#(<= main_~i~0 20)} assume true; {11290#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:21,925 INFO L273 TraceCheckUtils]: 47: Hoare triple {11290#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11291#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:21,926 INFO L273 TraceCheckUtils]: 48: Hoare triple {11291#(<= main_~i~0 21)} assume true; {11291#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:21,927 INFO L273 TraceCheckUtils]: 49: Hoare triple {11291#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11292#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:21,927 INFO L273 TraceCheckUtils]: 50: Hoare triple {11292#(<= main_~i~0 22)} assume true; {11292#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:21,928 INFO L273 TraceCheckUtils]: 51: Hoare triple {11292#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11293#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:21,928 INFO L273 TraceCheckUtils]: 52: Hoare triple {11293#(<= main_~i~0 23)} assume true; {11293#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:21,929 INFO L273 TraceCheckUtils]: 53: Hoare triple {11293#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11294#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:21,930 INFO L273 TraceCheckUtils]: 54: Hoare triple {11294#(<= main_~i~0 24)} assume true; {11294#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:21,931 INFO L273 TraceCheckUtils]: 55: Hoare triple {11294#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11295#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:21,931 INFO L273 TraceCheckUtils]: 56: Hoare triple {11295#(<= main_~i~0 25)} assume true; {11295#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:21,932 INFO L273 TraceCheckUtils]: 57: Hoare triple {11295#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11296#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:21,933 INFO L273 TraceCheckUtils]: 58: Hoare triple {11296#(<= main_~i~0 26)} assume true; {11296#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:21,934 INFO L273 TraceCheckUtils]: 59: Hoare triple {11296#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11297#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:21,934 INFO L273 TraceCheckUtils]: 60: Hoare triple {11297#(<= main_~i~0 27)} assume true; {11297#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:21,935 INFO L273 TraceCheckUtils]: 61: Hoare triple {11297#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11298#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:21,936 INFO L273 TraceCheckUtils]: 62: Hoare triple {11298#(<= main_~i~0 28)} assume true; {11298#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:21,936 INFO L273 TraceCheckUtils]: 63: Hoare triple {11298#(<= main_~i~0 28)} assume !(~i~0 < 100000); {11269#false} is VALID [2018-11-14 16:56:21,937 INFO L273 TraceCheckUtils]: 64: Hoare triple {11269#false} havoc ~x~0;~x~0 := 0; {11269#false} is VALID [2018-11-14 16:56:21,937 INFO L273 TraceCheckUtils]: 65: Hoare triple {11269#false} assume true; {11269#false} is VALID [2018-11-14 16:56:21,937 INFO L273 TraceCheckUtils]: 66: Hoare triple {11269#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11269#false} is VALID [2018-11-14 16:56:21,937 INFO L256 TraceCheckUtils]: 67: Hoare triple {11269#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {11269#false} is VALID [2018-11-14 16:56:21,937 INFO L273 TraceCheckUtils]: 68: Hoare triple {11269#false} ~cond := #in~cond; {11269#false} is VALID [2018-11-14 16:56:21,938 INFO L273 TraceCheckUtils]: 69: Hoare triple {11269#false} assume ~cond == 0; {11269#false} is VALID [2018-11-14 16:56:21,938 INFO L273 TraceCheckUtils]: 70: Hoare triple {11269#false} assume !false; {11269#false} is VALID [2018-11-14 16:56:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:21,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:21,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:21,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:56:21,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:56:21,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:22,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:22,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {11268#true} call ULTIMATE.init(); {11268#true} is VALID [2018-11-14 16:56:22,216 INFO L273 TraceCheckUtils]: 1: Hoare triple {11268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11268#true} is VALID [2018-11-14 16:56:22,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {11268#true} assume true; {11268#true} is VALID [2018-11-14 16:56:22,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11268#true} {11268#true} #50#return; {11268#true} is VALID [2018-11-14 16:56:22,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {11268#true} call #t~ret2 := main(); {11268#true} is VALID [2018-11-14 16:56:22,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {11268#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11317#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:22,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {11317#(<= main_~i~0 0)} assume true; {11317#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:22,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {11317#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11271#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:22,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {11271#(<= main_~i~0 1)} assume true; {11271#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:22,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {11271#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11272#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:22,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {11272#(<= main_~i~0 2)} assume true; {11272#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:22,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {11272#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11273#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:22,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {11273#(<= main_~i~0 3)} assume true; {11273#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:22,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {11273#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11274#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:22,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {11274#(<= main_~i~0 4)} assume true; {11274#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:22,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {11274#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11275#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:22,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {11275#(<= main_~i~0 5)} assume true; {11275#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:22,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {11275#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11276#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:22,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {11276#(<= main_~i~0 6)} assume true; {11276#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:22,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {11276#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11277#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:22,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {11277#(<= main_~i~0 7)} assume true; {11277#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:22,228 INFO L273 TraceCheckUtils]: 21: Hoare triple {11277#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11278#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:22,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {11278#(<= main_~i~0 8)} assume true; {11278#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:22,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {11278#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11279#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:22,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {11279#(<= main_~i~0 9)} assume true; {11279#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:22,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {11279#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11280#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:22,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {11280#(<= main_~i~0 10)} assume true; {11280#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:22,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {11280#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11281#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:22,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {11281#(<= main_~i~0 11)} assume true; {11281#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:22,234 INFO L273 TraceCheckUtils]: 29: Hoare triple {11281#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11282#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:22,234 INFO L273 TraceCheckUtils]: 30: Hoare triple {11282#(<= main_~i~0 12)} assume true; {11282#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:22,235 INFO L273 TraceCheckUtils]: 31: Hoare triple {11282#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11283#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:22,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {11283#(<= main_~i~0 13)} assume true; {11283#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:22,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {11283#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11284#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:22,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {11284#(<= main_~i~0 14)} assume true; {11284#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:22,238 INFO L273 TraceCheckUtils]: 35: Hoare triple {11284#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11285#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:22,239 INFO L273 TraceCheckUtils]: 36: Hoare triple {11285#(<= main_~i~0 15)} assume true; {11285#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:22,239 INFO L273 TraceCheckUtils]: 37: Hoare triple {11285#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11286#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:22,240 INFO L273 TraceCheckUtils]: 38: Hoare triple {11286#(<= main_~i~0 16)} assume true; {11286#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:22,241 INFO L273 TraceCheckUtils]: 39: Hoare triple {11286#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11287#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:22,241 INFO L273 TraceCheckUtils]: 40: Hoare triple {11287#(<= main_~i~0 17)} assume true; {11287#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:22,242 INFO L273 TraceCheckUtils]: 41: Hoare triple {11287#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11288#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:22,243 INFO L273 TraceCheckUtils]: 42: Hoare triple {11288#(<= main_~i~0 18)} assume true; {11288#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:22,244 INFO L273 TraceCheckUtils]: 43: Hoare triple {11288#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11289#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:22,244 INFO L273 TraceCheckUtils]: 44: Hoare triple {11289#(<= main_~i~0 19)} assume true; {11289#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:22,245 INFO L273 TraceCheckUtils]: 45: Hoare triple {11289#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11290#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:22,246 INFO L273 TraceCheckUtils]: 46: Hoare triple {11290#(<= main_~i~0 20)} assume true; {11290#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:22,247 INFO L273 TraceCheckUtils]: 47: Hoare triple {11290#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11291#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:22,247 INFO L273 TraceCheckUtils]: 48: Hoare triple {11291#(<= main_~i~0 21)} assume true; {11291#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:22,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {11291#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11292#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:22,249 INFO L273 TraceCheckUtils]: 50: Hoare triple {11292#(<= main_~i~0 22)} assume true; {11292#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:22,250 INFO L273 TraceCheckUtils]: 51: Hoare triple {11292#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11293#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:22,250 INFO L273 TraceCheckUtils]: 52: Hoare triple {11293#(<= main_~i~0 23)} assume true; {11293#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:22,251 INFO L273 TraceCheckUtils]: 53: Hoare triple {11293#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11294#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:22,251 INFO L273 TraceCheckUtils]: 54: Hoare triple {11294#(<= main_~i~0 24)} assume true; {11294#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:22,252 INFO L273 TraceCheckUtils]: 55: Hoare triple {11294#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11295#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:22,253 INFO L273 TraceCheckUtils]: 56: Hoare triple {11295#(<= main_~i~0 25)} assume true; {11295#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:22,254 INFO L273 TraceCheckUtils]: 57: Hoare triple {11295#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11296#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:22,254 INFO L273 TraceCheckUtils]: 58: Hoare triple {11296#(<= main_~i~0 26)} assume true; {11296#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:22,255 INFO L273 TraceCheckUtils]: 59: Hoare triple {11296#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11297#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:22,256 INFO L273 TraceCheckUtils]: 60: Hoare triple {11297#(<= main_~i~0 27)} assume true; {11297#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:22,257 INFO L273 TraceCheckUtils]: 61: Hoare triple {11297#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11298#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:22,257 INFO L273 TraceCheckUtils]: 62: Hoare triple {11298#(<= main_~i~0 28)} assume true; {11298#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:22,258 INFO L273 TraceCheckUtils]: 63: Hoare triple {11298#(<= main_~i~0 28)} assume !(~i~0 < 100000); {11269#false} is VALID [2018-11-14 16:56:22,258 INFO L273 TraceCheckUtils]: 64: Hoare triple {11269#false} havoc ~x~0;~x~0 := 0; {11269#false} is VALID [2018-11-14 16:56:22,258 INFO L273 TraceCheckUtils]: 65: Hoare triple {11269#false} assume true; {11269#false} is VALID [2018-11-14 16:56:22,259 INFO L273 TraceCheckUtils]: 66: Hoare triple {11269#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11269#false} is VALID [2018-11-14 16:56:22,259 INFO L256 TraceCheckUtils]: 67: Hoare triple {11269#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {11269#false} is VALID [2018-11-14 16:56:22,259 INFO L273 TraceCheckUtils]: 68: Hoare triple {11269#false} ~cond := #in~cond; {11269#false} is VALID [2018-11-14 16:56:22,259 INFO L273 TraceCheckUtils]: 69: Hoare triple {11269#false} assume ~cond == 0; {11269#false} is VALID [2018-11-14 16:56:22,259 INFO L273 TraceCheckUtils]: 70: Hoare triple {11269#false} assume !false; {11269#false} is VALID [2018-11-14 16:56:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:22,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:22,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-14 16:56:22,285 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-11-14 16:56:22,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:22,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 16:56:22,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:22,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 16:56:22,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 16:56:22,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 16:56:22,356 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 32 states. [2018-11-14 16:56:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:22,800 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-14 16:56:22,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 16:56:22,801 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-11-14 16:56:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:56:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 92 transitions. [2018-11-14 16:56:22,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:56:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 92 transitions. [2018-11-14 16:56:22,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 92 transitions. [2018-11-14 16:56:22,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:22,888 INFO L225 Difference]: With dead ends: 90 [2018-11-14 16:56:22,888 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 16:56:22,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 16:56:22,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 16:56:23,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-14 16:56:23,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:23,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2018-11-14 16:56:23,039 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-14 16:56:23,039 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-14 16:56:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:23,040 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-11-14 16:56:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-14 16:56:23,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:23,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:23,041 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-14 16:56:23,041 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-14 16:56:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:23,043 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-11-14 16:56:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-14 16:56:23,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:23,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:23,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:23,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-14 16:56:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-11-14 16:56:23,045 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 71 [2018-11-14 16:56:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:23,045 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-11-14 16:56:23,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 16:56:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-14 16:56:23,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-14 16:56:23,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:23,046 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:23,046 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:23,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:23,046 INFO L82 PathProgramCache]: Analyzing trace with hash 631121574, now seen corresponding path program 29 times [2018-11-14 16:56:23,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:23,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:23,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:23,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:23,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:23,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {11913#true} call ULTIMATE.init(); {11913#true} is VALID [2018-11-14 16:56:23,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {11913#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11913#true} is VALID [2018-11-14 16:56:23,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {11913#true} assume true; {11913#true} is VALID [2018-11-14 16:56:23,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11913#true} {11913#true} #50#return; {11913#true} is VALID [2018-11-14 16:56:23,635 INFO L256 TraceCheckUtils]: 4: Hoare triple {11913#true} call #t~ret2 := main(); {11913#true} is VALID [2018-11-14 16:56:23,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {11913#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11915#(= main_~i~0 0)} is VALID [2018-11-14 16:56:23,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {11915#(= main_~i~0 0)} assume true; {11915#(= main_~i~0 0)} is VALID [2018-11-14 16:56:23,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {11915#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11916#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:23,637 INFO L273 TraceCheckUtils]: 8: Hoare triple {11916#(<= main_~i~0 1)} assume true; {11916#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:23,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {11916#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11917#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:23,639 INFO L273 TraceCheckUtils]: 10: Hoare triple {11917#(<= main_~i~0 2)} assume true; {11917#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:23,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {11917#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11918#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:23,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {11918#(<= main_~i~0 3)} assume true; {11918#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:23,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {11918#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11919#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:23,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {11919#(<= main_~i~0 4)} assume true; {11919#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:23,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {11919#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11920#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:23,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {11920#(<= main_~i~0 5)} assume true; {11920#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:23,644 INFO L273 TraceCheckUtils]: 17: Hoare triple {11920#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11921#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:23,644 INFO L273 TraceCheckUtils]: 18: Hoare triple {11921#(<= main_~i~0 6)} assume true; {11921#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:23,645 INFO L273 TraceCheckUtils]: 19: Hoare triple {11921#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11922#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:23,646 INFO L273 TraceCheckUtils]: 20: Hoare triple {11922#(<= main_~i~0 7)} assume true; {11922#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:23,647 INFO L273 TraceCheckUtils]: 21: Hoare triple {11922#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11923#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:23,647 INFO L273 TraceCheckUtils]: 22: Hoare triple {11923#(<= main_~i~0 8)} assume true; {11923#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:23,648 INFO L273 TraceCheckUtils]: 23: Hoare triple {11923#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11924#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:23,649 INFO L273 TraceCheckUtils]: 24: Hoare triple {11924#(<= main_~i~0 9)} assume true; {11924#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:23,650 INFO L273 TraceCheckUtils]: 25: Hoare triple {11924#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11925#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:23,650 INFO L273 TraceCheckUtils]: 26: Hoare triple {11925#(<= main_~i~0 10)} assume true; {11925#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:23,651 INFO L273 TraceCheckUtils]: 27: Hoare triple {11925#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11926#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:23,652 INFO L273 TraceCheckUtils]: 28: Hoare triple {11926#(<= main_~i~0 11)} assume true; {11926#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:23,652 INFO L273 TraceCheckUtils]: 29: Hoare triple {11926#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11927#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:23,653 INFO L273 TraceCheckUtils]: 30: Hoare triple {11927#(<= main_~i~0 12)} assume true; {11927#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:23,654 INFO L273 TraceCheckUtils]: 31: Hoare triple {11927#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11928#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:23,654 INFO L273 TraceCheckUtils]: 32: Hoare triple {11928#(<= main_~i~0 13)} assume true; {11928#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:23,655 INFO L273 TraceCheckUtils]: 33: Hoare triple {11928#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11929#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:23,656 INFO L273 TraceCheckUtils]: 34: Hoare triple {11929#(<= main_~i~0 14)} assume true; {11929#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:23,657 INFO L273 TraceCheckUtils]: 35: Hoare triple {11929#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11930#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:23,657 INFO L273 TraceCheckUtils]: 36: Hoare triple {11930#(<= main_~i~0 15)} assume true; {11930#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:23,658 INFO L273 TraceCheckUtils]: 37: Hoare triple {11930#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11931#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:23,659 INFO L273 TraceCheckUtils]: 38: Hoare triple {11931#(<= main_~i~0 16)} assume true; {11931#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:23,660 INFO L273 TraceCheckUtils]: 39: Hoare triple {11931#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11932#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:23,660 INFO L273 TraceCheckUtils]: 40: Hoare triple {11932#(<= main_~i~0 17)} assume true; {11932#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:23,661 INFO L273 TraceCheckUtils]: 41: Hoare triple {11932#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11933#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:23,662 INFO L273 TraceCheckUtils]: 42: Hoare triple {11933#(<= main_~i~0 18)} assume true; {11933#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:23,663 INFO L273 TraceCheckUtils]: 43: Hoare triple {11933#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11934#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:23,663 INFO L273 TraceCheckUtils]: 44: Hoare triple {11934#(<= main_~i~0 19)} assume true; {11934#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:23,664 INFO L273 TraceCheckUtils]: 45: Hoare triple {11934#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11935#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:23,665 INFO L273 TraceCheckUtils]: 46: Hoare triple {11935#(<= main_~i~0 20)} assume true; {11935#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:23,665 INFO L273 TraceCheckUtils]: 47: Hoare triple {11935#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11936#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:23,666 INFO L273 TraceCheckUtils]: 48: Hoare triple {11936#(<= main_~i~0 21)} assume true; {11936#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:23,667 INFO L273 TraceCheckUtils]: 49: Hoare triple {11936#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11937#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:23,667 INFO L273 TraceCheckUtils]: 50: Hoare triple {11937#(<= main_~i~0 22)} assume true; {11937#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:23,668 INFO L273 TraceCheckUtils]: 51: Hoare triple {11937#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11938#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:23,669 INFO L273 TraceCheckUtils]: 52: Hoare triple {11938#(<= main_~i~0 23)} assume true; {11938#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:23,670 INFO L273 TraceCheckUtils]: 53: Hoare triple {11938#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11939#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:23,670 INFO L273 TraceCheckUtils]: 54: Hoare triple {11939#(<= main_~i~0 24)} assume true; {11939#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:23,671 INFO L273 TraceCheckUtils]: 55: Hoare triple {11939#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11940#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:23,672 INFO L273 TraceCheckUtils]: 56: Hoare triple {11940#(<= main_~i~0 25)} assume true; {11940#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:23,673 INFO L273 TraceCheckUtils]: 57: Hoare triple {11940#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11941#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:23,673 INFO L273 TraceCheckUtils]: 58: Hoare triple {11941#(<= main_~i~0 26)} assume true; {11941#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:23,674 INFO L273 TraceCheckUtils]: 59: Hoare triple {11941#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11942#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:23,675 INFO L273 TraceCheckUtils]: 60: Hoare triple {11942#(<= main_~i~0 27)} assume true; {11942#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:23,675 INFO L273 TraceCheckUtils]: 61: Hoare triple {11942#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11943#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:23,676 INFO L273 TraceCheckUtils]: 62: Hoare triple {11943#(<= main_~i~0 28)} assume true; {11943#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:23,677 INFO L273 TraceCheckUtils]: 63: Hoare triple {11943#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11944#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:23,677 INFO L273 TraceCheckUtils]: 64: Hoare triple {11944#(<= main_~i~0 29)} assume true; {11944#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:23,678 INFO L273 TraceCheckUtils]: 65: Hoare triple {11944#(<= main_~i~0 29)} assume !(~i~0 < 100000); {11914#false} is VALID [2018-11-14 16:56:23,678 INFO L273 TraceCheckUtils]: 66: Hoare triple {11914#false} havoc ~x~0;~x~0 := 0; {11914#false} is VALID [2018-11-14 16:56:23,679 INFO L273 TraceCheckUtils]: 67: Hoare triple {11914#false} assume true; {11914#false} is VALID [2018-11-14 16:56:23,679 INFO L273 TraceCheckUtils]: 68: Hoare triple {11914#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11914#false} is VALID [2018-11-14 16:56:23,679 INFO L256 TraceCheckUtils]: 69: Hoare triple {11914#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {11914#false} is VALID [2018-11-14 16:56:23,679 INFO L273 TraceCheckUtils]: 70: Hoare triple {11914#false} ~cond := #in~cond; {11914#false} is VALID [2018-11-14 16:56:23,679 INFO L273 TraceCheckUtils]: 71: Hoare triple {11914#false} assume ~cond == 0; {11914#false} is VALID [2018-11-14 16:56:23,680 INFO L273 TraceCheckUtils]: 72: Hoare triple {11914#false} assume !false; {11914#false} is VALID [2018-11-14 16:56:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:23,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:23,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:23,694 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:56:24,226 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-14 16:56:24,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:24,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:24,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {11913#true} call ULTIMATE.init(); {11913#true} is VALID [2018-11-14 16:56:24,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {11913#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11913#true} is VALID [2018-11-14 16:56:24,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {11913#true} assume true; {11913#true} is VALID [2018-11-14 16:56:24,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11913#true} {11913#true} #50#return; {11913#true} is VALID [2018-11-14 16:56:24,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {11913#true} call #t~ret2 := main(); {11913#true} is VALID [2018-11-14 16:56:24,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {11913#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11963#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:24,516 INFO L273 TraceCheckUtils]: 6: Hoare triple {11963#(<= main_~i~0 0)} assume true; {11963#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:24,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {11963#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11916#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:24,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {11916#(<= main_~i~0 1)} assume true; {11916#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:24,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {11916#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11917#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:24,518 INFO L273 TraceCheckUtils]: 10: Hoare triple {11917#(<= main_~i~0 2)} assume true; {11917#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:24,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {11917#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11918#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:24,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {11918#(<= main_~i~0 3)} assume true; {11918#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:24,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {11918#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11919#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:24,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {11919#(<= main_~i~0 4)} assume true; {11919#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:24,521 INFO L273 TraceCheckUtils]: 15: Hoare triple {11919#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11920#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:24,522 INFO L273 TraceCheckUtils]: 16: Hoare triple {11920#(<= main_~i~0 5)} assume true; {11920#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:24,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {11920#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11921#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:24,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {11921#(<= main_~i~0 6)} assume true; {11921#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:24,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {11921#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11922#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:24,525 INFO L273 TraceCheckUtils]: 20: Hoare triple {11922#(<= main_~i~0 7)} assume true; {11922#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:24,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {11922#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11923#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:24,526 INFO L273 TraceCheckUtils]: 22: Hoare triple {11923#(<= main_~i~0 8)} assume true; {11923#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:24,527 INFO L273 TraceCheckUtils]: 23: Hoare triple {11923#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11924#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:24,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {11924#(<= main_~i~0 9)} assume true; {11924#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:24,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {11924#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11925#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:24,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {11925#(<= main_~i~0 10)} assume true; {11925#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:24,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {11925#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11926#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:24,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {11926#(<= main_~i~0 11)} assume true; {11926#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:24,531 INFO L273 TraceCheckUtils]: 29: Hoare triple {11926#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11927#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:24,532 INFO L273 TraceCheckUtils]: 30: Hoare triple {11927#(<= main_~i~0 12)} assume true; {11927#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:24,533 INFO L273 TraceCheckUtils]: 31: Hoare triple {11927#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11928#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:24,533 INFO L273 TraceCheckUtils]: 32: Hoare triple {11928#(<= main_~i~0 13)} assume true; {11928#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:24,534 INFO L273 TraceCheckUtils]: 33: Hoare triple {11928#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11929#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:24,535 INFO L273 TraceCheckUtils]: 34: Hoare triple {11929#(<= main_~i~0 14)} assume true; {11929#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:24,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {11929#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11930#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:24,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {11930#(<= main_~i~0 15)} assume true; {11930#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:24,537 INFO L273 TraceCheckUtils]: 37: Hoare triple {11930#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11931#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:24,538 INFO L273 TraceCheckUtils]: 38: Hoare triple {11931#(<= main_~i~0 16)} assume true; {11931#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:24,539 INFO L273 TraceCheckUtils]: 39: Hoare triple {11931#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11932#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:24,539 INFO L273 TraceCheckUtils]: 40: Hoare triple {11932#(<= main_~i~0 17)} assume true; {11932#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:24,540 INFO L273 TraceCheckUtils]: 41: Hoare triple {11932#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11933#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:24,541 INFO L273 TraceCheckUtils]: 42: Hoare triple {11933#(<= main_~i~0 18)} assume true; {11933#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:24,542 INFO L273 TraceCheckUtils]: 43: Hoare triple {11933#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11934#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:24,542 INFO L273 TraceCheckUtils]: 44: Hoare triple {11934#(<= main_~i~0 19)} assume true; {11934#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:24,543 INFO L273 TraceCheckUtils]: 45: Hoare triple {11934#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11935#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:24,543 INFO L273 TraceCheckUtils]: 46: Hoare triple {11935#(<= main_~i~0 20)} assume true; {11935#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:24,544 INFO L273 TraceCheckUtils]: 47: Hoare triple {11935#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11936#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:24,545 INFO L273 TraceCheckUtils]: 48: Hoare triple {11936#(<= main_~i~0 21)} assume true; {11936#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:24,546 INFO L273 TraceCheckUtils]: 49: Hoare triple {11936#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11937#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:24,546 INFO L273 TraceCheckUtils]: 50: Hoare triple {11937#(<= main_~i~0 22)} assume true; {11937#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:24,547 INFO L273 TraceCheckUtils]: 51: Hoare triple {11937#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11938#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:24,548 INFO L273 TraceCheckUtils]: 52: Hoare triple {11938#(<= main_~i~0 23)} assume true; {11938#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:24,557 INFO L273 TraceCheckUtils]: 53: Hoare triple {11938#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11939#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:24,557 INFO L273 TraceCheckUtils]: 54: Hoare triple {11939#(<= main_~i~0 24)} assume true; {11939#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:24,558 INFO L273 TraceCheckUtils]: 55: Hoare triple {11939#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11940#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:24,558 INFO L273 TraceCheckUtils]: 56: Hoare triple {11940#(<= main_~i~0 25)} assume true; {11940#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:24,559 INFO L273 TraceCheckUtils]: 57: Hoare triple {11940#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11941#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:24,559 INFO L273 TraceCheckUtils]: 58: Hoare triple {11941#(<= main_~i~0 26)} assume true; {11941#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:24,560 INFO L273 TraceCheckUtils]: 59: Hoare triple {11941#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11942#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:24,560 INFO L273 TraceCheckUtils]: 60: Hoare triple {11942#(<= main_~i~0 27)} assume true; {11942#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:24,561 INFO L273 TraceCheckUtils]: 61: Hoare triple {11942#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11943#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:24,561 INFO L273 TraceCheckUtils]: 62: Hoare triple {11943#(<= main_~i~0 28)} assume true; {11943#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:24,562 INFO L273 TraceCheckUtils]: 63: Hoare triple {11943#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11944#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:24,562 INFO L273 TraceCheckUtils]: 64: Hoare triple {11944#(<= main_~i~0 29)} assume true; {11944#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:24,563 INFO L273 TraceCheckUtils]: 65: Hoare triple {11944#(<= main_~i~0 29)} assume !(~i~0 < 100000); {11914#false} is VALID [2018-11-14 16:56:24,563 INFO L273 TraceCheckUtils]: 66: Hoare triple {11914#false} havoc ~x~0;~x~0 := 0; {11914#false} is VALID [2018-11-14 16:56:24,563 INFO L273 TraceCheckUtils]: 67: Hoare triple {11914#false} assume true; {11914#false} is VALID [2018-11-14 16:56:24,563 INFO L273 TraceCheckUtils]: 68: Hoare triple {11914#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11914#false} is VALID [2018-11-14 16:56:24,564 INFO L256 TraceCheckUtils]: 69: Hoare triple {11914#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {11914#false} is VALID [2018-11-14 16:56:24,564 INFO L273 TraceCheckUtils]: 70: Hoare triple {11914#false} ~cond := #in~cond; {11914#false} is VALID [2018-11-14 16:56:24,564 INFO L273 TraceCheckUtils]: 71: Hoare triple {11914#false} assume ~cond == 0; {11914#false} is VALID [2018-11-14 16:56:24,564 INFO L273 TraceCheckUtils]: 72: Hoare triple {11914#false} assume !false; {11914#false} is VALID [2018-11-14 16:56:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:24,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:24,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-14 16:56:24,592 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 73 [2018-11-14 16:56:24,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:24,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 16:56:24,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:24,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 16:56:24,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 16:56:24,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 16:56:24,665 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 33 states. [2018-11-14 16:56:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:25,147 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-14 16:56:25,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 16:56:25,148 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 73 [2018-11-14 16:56:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 16:56:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 94 transitions. [2018-11-14 16:56:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 16:56:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 94 transitions. [2018-11-14 16:56:25,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 94 transitions. [2018-11-14 16:56:25,234 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-14 16:56:25,236 INFO L225 Difference]: With dead ends: 92 [2018-11-14 16:56:25,236 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 16:56:25,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 16:56:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 16:56:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-14 16:56:25,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:25,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2018-11-14 16:56:25,268 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-14 16:56:25,268 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-14 16:56:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:25,270 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-11-14 16:56:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-11-14 16:56:25,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:25,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:25,270 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-14 16:56:25,270 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-14 16:56:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:25,271 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-11-14 16:56:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-11-14 16:56:25,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:25,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:25,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:25,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 16:56:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-11-14 16:56:25,273 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 73 [2018-11-14 16:56:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:25,274 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-11-14 16:56:25,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 16:56:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-11-14 16:56:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-14 16:56:25,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:25,274 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:25,275 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:25,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:25,275 INFO L82 PathProgramCache]: Analyzing trace with hash 905503872, now seen corresponding path program 30 times [2018-11-14 16:56:25,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:25,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:25,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:25,823 INFO L256 TraceCheckUtils]: 0: Hoare triple {12575#true} call ULTIMATE.init(); {12575#true} is VALID [2018-11-14 16:56:25,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {12575#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12575#true} is VALID [2018-11-14 16:56:25,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {12575#true} assume true; {12575#true} is VALID [2018-11-14 16:56:25,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12575#true} {12575#true} #50#return; {12575#true} is VALID [2018-11-14 16:56:25,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {12575#true} call #t~ret2 := main(); {12575#true} is VALID [2018-11-14 16:56:25,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {12575#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12577#(= main_~i~0 0)} is VALID [2018-11-14 16:56:25,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {12577#(= main_~i~0 0)} assume true; {12577#(= main_~i~0 0)} is VALID [2018-11-14 16:56:25,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {12577#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12578#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:25,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {12578#(<= main_~i~0 1)} assume true; {12578#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:25,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {12578#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12579#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:25,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {12579#(<= main_~i~0 2)} assume true; {12579#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:25,827 INFO L273 TraceCheckUtils]: 11: Hoare triple {12579#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12580#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:25,828 INFO L273 TraceCheckUtils]: 12: Hoare triple {12580#(<= main_~i~0 3)} assume true; {12580#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:25,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {12580#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12581#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:25,829 INFO L273 TraceCheckUtils]: 14: Hoare triple {12581#(<= main_~i~0 4)} assume true; {12581#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:25,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {12581#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12582#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:25,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {12582#(<= main_~i~0 5)} assume true; {12582#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:25,832 INFO L273 TraceCheckUtils]: 17: Hoare triple {12582#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12583#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:25,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {12583#(<= main_~i~0 6)} assume true; {12583#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:25,854 INFO L273 TraceCheckUtils]: 19: Hoare triple {12583#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12584#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:25,858 INFO L273 TraceCheckUtils]: 20: Hoare triple {12584#(<= main_~i~0 7)} assume true; {12584#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:25,859 INFO L273 TraceCheckUtils]: 21: Hoare triple {12584#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12585#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:25,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {12585#(<= main_~i~0 8)} assume true; {12585#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:25,860 INFO L273 TraceCheckUtils]: 23: Hoare triple {12585#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12586#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:25,861 INFO L273 TraceCheckUtils]: 24: Hoare triple {12586#(<= main_~i~0 9)} assume true; {12586#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:25,861 INFO L273 TraceCheckUtils]: 25: Hoare triple {12586#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12587#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:25,861 INFO L273 TraceCheckUtils]: 26: Hoare triple {12587#(<= main_~i~0 10)} assume true; {12587#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:25,862 INFO L273 TraceCheckUtils]: 27: Hoare triple {12587#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12588#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:25,862 INFO L273 TraceCheckUtils]: 28: Hoare triple {12588#(<= main_~i~0 11)} assume true; {12588#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:25,863 INFO L273 TraceCheckUtils]: 29: Hoare triple {12588#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12589#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:25,863 INFO L273 TraceCheckUtils]: 30: Hoare triple {12589#(<= main_~i~0 12)} assume true; {12589#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:25,864 INFO L273 TraceCheckUtils]: 31: Hoare triple {12589#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12590#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:25,865 INFO L273 TraceCheckUtils]: 32: Hoare triple {12590#(<= main_~i~0 13)} assume true; {12590#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:25,866 INFO L273 TraceCheckUtils]: 33: Hoare triple {12590#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12591#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:25,866 INFO L273 TraceCheckUtils]: 34: Hoare triple {12591#(<= main_~i~0 14)} assume true; {12591#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:25,867 INFO L273 TraceCheckUtils]: 35: Hoare triple {12591#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12592#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:25,868 INFO L273 TraceCheckUtils]: 36: Hoare triple {12592#(<= main_~i~0 15)} assume true; {12592#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:25,869 INFO L273 TraceCheckUtils]: 37: Hoare triple {12592#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12593#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:25,869 INFO L273 TraceCheckUtils]: 38: Hoare triple {12593#(<= main_~i~0 16)} assume true; {12593#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:25,870 INFO L273 TraceCheckUtils]: 39: Hoare triple {12593#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12594#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:25,871 INFO L273 TraceCheckUtils]: 40: Hoare triple {12594#(<= main_~i~0 17)} assume true; {12594#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:25,872 INFO L273 TraceCheckUtils]: 41: Hoare triple {12594#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12595#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:25,872 INFO L273 TraceCheckUtils]: 42: Hoare triple {12595#(<= main_~i~0 18)} assume true; {12595#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:25,873 INFO L273 TraceCheckUtils]: 43: Hoare triple {12595#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12596#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:25,874 INFO L273 TraceCheckUtils]: 44: Hoare triple {12596#(<= main_~i~0 19)} assume true; {12596#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:25,874 INFO L273 TraceCheckUtils]: 45: Hoare triple {12596#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12597#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:25,875 INFO L273 TraceCheckUtils]: 46: Hoare triple {12597#(<= main_~i~0 20)} assume true; {12597#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:25,876 INFO L273 TraceCheckUtils]: 47: Hoare triple {12597#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12598#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:25,876 INFO L273 TraceCheckUtils]: 48: Hoare triple {12598#(<= main_~i~0 21)} assume true; {12598#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:25,879 INFO L273 TraceCheckUtils]: 49: Hoare triple {12598#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12599#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:25,880 INFO L273 TraceCheckUtils]: 50: Hoare triple {12599#(<= main_~i~0 22)} assume true; {12599#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:25,881 INFO L273 TraceCheckUtils]: 51: Hoare triple {12599#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12600#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:25,881 INFO L273 TraceCheckUtils]: 52: Hoare triple {12600#(<= main_~i~0 23)} assume true; {12600#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:25,882 INFO L273 TraceCheckUtils]: 53: Hoare triple {12600#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12601#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:25,882 INFO L273 TraceCheckUtils]: 54: Hoare triple {12601#(<= main_~i~0 24)} assume true; {12601#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:25,883 INFO L273 TraceCheckUtils]: 55: Hoare triple {12601#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12602#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:25,883 INFO L273 TraceCheckUtils]: 56: Hoare triple {12602#(<= main_~i~0 25)} assume true; {12602#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:25,884 INFO L273 TraceCheckUtils]: 57: Hoare triple {12602#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12603#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:25,885 INFO L273 TraceCheckUtils]: 58: Hoare triple {12603#(<= main_~i~0 26)} assume true; {12603#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:25,885 INFO L273 TraceCheckUtils]: 59: Hoare triple {12603#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12604#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:25,886 INFO L273 TraceCheckUtils]: 60: Hoare triple {12604#(<= main_~i~0 27)} assume true; {12604#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:25,887 INFO L273 TraceCheckUtils]: 61: Hoare triple {12604#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12605#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:25,887 INFO L273 TraceCheckUtils]: 62: Hoare triple {12605#(<= main_~i~0 28)} assume true; {12605#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:25,888 INFO L273 TraceCheckUtils]: 63: Hoare triple {12605#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12606#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:25,889 INFO L273 TraceCheckUtils]: 64: Hoare triple {12606#(<= main_~i~0 29)} assume true; {12606#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:25,890 INFO L273 TraceCheckUtils]: 65: Hoare triple {12606#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12607#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:25,890 INFO L273 TraceCheckUtils]: 66: Hoare triple {12607#(<= main_~i~0 30)} assume true; {12607#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:25,891 INFO L273 TraceCheckUtils]: 67: Hoare triple {12607#(<= main_~i~0 30)} assume !(~i~0 < 100000); {12576#false} is VALID [2018-11-14 16:56:25,891 INFO L273 TraceCheckUtils]: 68: Hoare triple {12576#false} havoc ~x~0;~x~0 := 0; {12576#false} is VALID [2018-11-14 16:56:25,891 INFO L273 TraceCheckUtils]: 69: Hoare triple {12576#false} assume true; {12576#false} is VALID [2018-11-14 16:56:25,892 INFO L273 TraceCheckUtils]: 70: Hoare triple {12576#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {12576#false} is VALID [2018-11-14 16:56:25,892 INFO L256 TraceCheckUtils]: 71: Hoare triple {12576#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {12576#false} is VALID [2018-11-14 16:56:25,892 INFO L273 TraceCheckUtils]: 72: Hoare triple {12576#false} ~cond := #in~cond; {12576#false} is VALID [2018-11-14 16:56:25,892 INFO L273 TraceCheckUtils]: 73: Hoare triple {12576#false} assume ~cond == 0; {12576#false} is VALID [2018-11-14 16:56:25,892 INFO L273 TraceCheckUtils]: 74: Hoare triple {12576#false} assume !false; {12576#false} is VALID [2018-11-14 16:56:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:25,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:25,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:25,906 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:56:38,058 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-14 16:56:38,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:38,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:38,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {12575#true} call ULTIMATE.init(); {12575#true} is VALID [2018-11-14 16:56:38,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {12575#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12575#true} is VALID [2018-11-14 16:56:38,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {12575#true} assume true; {12575#true} is VALID [2018-11-14 16:56:38,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12575#true} {12575#true} #50#return; {12575#true} is VALID [2018-11-14 16:56:38,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {12575#true} call #t~ret2 := main(); {12575#true} is VALID [2018-11-14 16:56:38,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {12575#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12626#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:38,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {12626#(<= main_~i~0 0)} assume true; {12626#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:38,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {12626#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12578#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:38,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {12578#(<= main_~i~0 1)} assume true; {12578#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:38,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {12578#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12579#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:38,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {12579#(<= main_~i~0 2)} assume true; {12579#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:38,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {12579#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12580#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:38,346 INFO L273 TraceCheckUtils]: 12: Hoare triple {12580#(<= main_~i~0 3)} assume true; {12580#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:38,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {12580#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12581#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:38,347 INFO L273 TraceCheckUtils]: 14: Hoare triple {12581#(<= main_~i~0 4)} assume true; {12581#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:38,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {12581#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12582#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:38,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {12582#(<= main_~i~0 5)} assume true; {12582#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:38,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {12582#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12583#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:38,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {12583#(<= main_~i~0 6)} assume true; {12583#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:38,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {12583#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12584#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:38,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {12584#(<= main_~i~0 7)} assume true; {12584#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:38,353 INFO L273 TraceCheckUtils]: 21: Hoare triple {12584#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12585#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:38,354 INFO L273 TraceCheckUtils]: 22: Hoare triple {12585#(<= main_~i~0 8)} assume true; {12585#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:38,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {12585#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12586#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:38,356 INFO L273 TraceCheckUtils]: 24: Hoare triple {12586#(<= main_~i~0 9)} assume true; {12586#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:38,357 INFO L273 TraceCheckUtils]: 25: Hoare triple {12586#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12587#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:38,357 INFO L273 TraceCheckUtils]: 26: Hoare triple {12587#(<= main_~i~0 10)} assume true; {12587#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:38,358 INFO L273 TraceCheckUtils]: 27: Hoare triple {12587#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12588#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:38,359 INFO L273 TraceCheckUtils]: 28: Hoare triple {12588#(<= main_~i~0 11)} assume true; {12588#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:38,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {12588#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12589#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:38,361 INFO L273 TraceCheckUtils]: 30: Hoare triple {12589#(<= main_~i~0 12)} assume true; {12589#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:38,362 INFO L273 TraceCheckUtils]: 31: Hoare triple {12589#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12590#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:38,362 INFO L273 TraceCheckUtils]: 32: Hoare triple {12590#(<= main_~i~0 13)} assume true; {12590#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:38,363 INFO L273 TraceCheckUtils]: 33: Hoare triple {12590#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12591#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:38,364 INFO L273 TraceCheckUtils]: 34: Hoare triple {12591#(<= main_~i~0 14)} assume true; {12591#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:38,365 INFO L273 TraceCheckUtils]: 35: Hoare triple {12591#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12592#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:38,366 INFO L273 TraceCheckUtils]: 36: Hoare triple {12592#(<= main_~i~0 15)} assume true; {12592#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:38,367 INFO L273 TraceCheckUtils]: 37: Hoare triple {12592#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12593#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:38,370 INFO L273 TraceCheckUtils]: 38: Hoare triple {12593#(<= main_~i~0 16)} assume true; {12593#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:38,371 INFO L273 TraceCheckUtils]: 39: Hoare triple {12593#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12594#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:38,371 INFO L273 TraceCheckUtils]: 40: Hoare triple {12594#(<= main_~i~0 17)} assume true; {12594#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:38,372 INFO L273 TraceCheckUtils]: 41: Hoare triple {12594#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12595#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:38,372 INFO L273 TraceCheckUtils]: 42: Hoare triple {12595#(<= main_~i~0 18)} assume true; {12595#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:38,373 INFO L273 TraceCheckUtils]: 43: Hoare triple {12595#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12596#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:38,373 INFO L273 TraceCheckUtils]: 44: Hoare triple {12596#(<= main_~i~0 19)} assume true; {12596#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:38,374 INFO L273 TraceCheckUtils]: 45: Hoare triple {12596#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12597#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:38,374 INFO L273 TraceCheckUtils]: 46: Hoare triple {12597#(<= main_~i~0 20)} assume true; {12597#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:38,375 INFO L273 TraceCheckUtils]: 47: Hoare triple {12597#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12598#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:38,376 INFO L273 TraceCheckUtils]: 48: Hoare triple {12598#(<= main_~i~0 21)} assume true; {12598#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:38,377 INFO L273 TraceCheckUtils]: 49: Hoare triple {12598#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12599#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:38,377 INFO L273 TraceCheckUtils]: 50: Hoare triple {12599#(<= main_~i~0 22)} assume true; {12599#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:38,378 INFO L273 TraceCheckUtils]: 51: Hoare triple {12599#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12600#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:38,379 INFO L273 TraceCheckUtils]: 52: Hoare triple {12600#(<= main_~i~0 23)} assume true; {12600#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:38,380 INFO L273 TraceCheckUtils]: 53: Hoare triple {12600#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12601#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:38,381 INFO L273 TraceCheckUtils]: 54: Hoare triple {12601#(<= main_~i~0 24)} assume true; {12601#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:38,382 INFO L273 TraceCheckUtils]: 55: Hoare triple {12601#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12602#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:38,382 INFO L273 TraceCheckUtils]: 56: Hoare triple {12602#(<= main_~i~0 25)} assume true; {12602#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:38,383 INFO L273 TraceCheckUtils]: 57: Hoare triple {12602#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12603#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:38,384 INFO L273 TraceCheckUtils]: 58: Hoare triple {12603#(<= main_~i~0 26)} assume true; {12603#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:38,385 INFO L273 TraceCheckUtils]: 59: Hoare triple {12603#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12604#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:38,386 INFO L273 TraceCheckUtils]: 60: Hoare triple {12604#(<= main_~i~0 27)} assume true; {12604#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:38,387 INFO L273 TraceCheckUtils]: 61: Hoare triple {12604#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12605#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:38,387 INFO L273 TraceCheckUtils]: 62: Hoare triple {12605#(<= main_~i~0 28)} assume true; {12605#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:38,388 INFO L273 TraceCheckUtils]: 63: Hoare triple {12605#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12606#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:38,389 INFO L273 TraceCheckUtils]: 64: Hoare triple {12606#(<= main_~i~0 29)} assume true; {12606#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:38,390 INFO L273 TraceCheckUtils]: 65: Hoare triple {12606#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12607#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:38,390 INFO L273 TraceCheckUtils]: 66: Hoare triple {12607#(<= main_~i~0 30)} assume true; {12607#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:38,391 INFO L273 TraceCheckUtils]: 67: Hoare triple {12607#(<= main_~i~0 30)} assume !(~i~0 < 100000); {12576#false} is VALID [2018-11-14 16:56:38,392 INFO L273 TraceCheckUtils]: 68: Hoare triple {12576#false} havoc ~x~0;~x~0 := 0; {12576#false} is VALID [2018-11-14 16:56:38,392 INFO L273 TraceCheckUtils]: 69: Hoare triple {12576#false} assume true; {12576#false} is VALID [2018-11-14 16:56:38,392 INFO L273 TraceCheckUtils]: 70: Hoare triple {12576#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {12576#false} is VALID [2018-11-14 16:56:38,392 INFO L256 TraceCheckUtils]: 71: Hoare triple {12576#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {12576#false} is VALID [2018-11-14 16:56:38,393 INFO L273 TraceCheckUtils]: 72: Hoare triple {12576#false} ~cond := #in~cond; {12576#false} is VALID [2018-11-14 16:56:38,393 INFO L273 TraceCheckUtils]: 73: Hoare triple {12576#false} assume ~cond == 0; {12576#false} is VALID [2018-11-14 16:56:38,393 INFO L273 TraceCheckUtils]: 74: Hoare triple {12576#false} assume !false; {12576#false} is VALID [2018-11-14 16:56:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:38,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:38,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-14 16:56:38,423 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-11-14 16:56:38,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:38,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 16:56:38,499 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-14 16:56:38,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 16:56:38,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 16:56:38,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 16:56:38,501 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 34 states. [2018-11-14 16:56:39,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:39,297 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-11-14 16:56:39,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 16:56:39,297 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-11-14 16:56:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:56:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 96 transitions. [2018-11-14 16:56:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:56:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 96 transitions. [2018-11-14 16:56:39,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 96 transitions. [2018-11-14 16:56:39,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:39,402 INFO L225 Difference]: With dead ends: 94 [2018-11-14 16:56:39,402 INFO L226 Difference]: Without dead ends: 82 [2018-11-14 16:56:39,403 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 16:56:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-14 16:56:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-14 16:56:39,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:39,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-14 16:56:39,435 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-14 16:56:39,435 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-14 16:56:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:39,436 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-11-14 16:56:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-14 16:56:39,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:39,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:39,436 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-14 16:56:39,437 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-14 16:56:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:39,437 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-11-14 16:56:39,438 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-14 16:56:39,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:39,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:39,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:39,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 16:56:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-11-14 16:56:39,439 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 75 [2018-11-14 16:56:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:39,439 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-11-14 16:56:39,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 16:56:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-14 16:56:39,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-14 16:56:39,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:39,440 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:39,440 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:39,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:39,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1701080102, now seen corresponding path program 31 times [2018-11-14 16:56:39,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:39,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:39,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:41,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {13254#true} call ULTIMATE.init(); {13254#true} is VALID [2018-11-14 16:56:41,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {13254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13254#true} is VALID [2018-11-14 16:56:41,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {13254#true} assume true; {13254#true} is VALID [2018-11-14 16:56:41,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13254#true} {13254#true} #50#return; {13254#true} is VALID [2018-11-14 16:56:41,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {13254#true} call #t~ret2 := main(); {13254#true} is VALID [2018-11-14 16:56:41,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {13254#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13256#(= main_~i~0 0)} is VALID [2018-11-14 16:56:41,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {13256#(= main_~i~0 0)} assume true; {13256#(= main_~i~0 0)} is VALID [2018-11-14 16:56:41,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {13256#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13257#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:41,024 INFO L273 TraceCheckUtils]: 8: Hoare triple {13257#(<= main_~i~0 1)} assume true; {13257#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:41,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {13257#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13258#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:41,026 INFO L273 TraceCheckUtils]: 10: Hoare triple {13258#(<= main_~i~0 2)} assume true; {13258#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:41,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {13258#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13259#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:41,027 INFO L273 TraceCheckUtils]: 12: Hoare triple {13259#(<= main_~i~0 3)} assume true; {13259#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:41,028 INFO L273 TraceCheckUtils]: 13: Hoare triple {13259#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13260#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:41,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {13260#(<= main_~i~0 4)} assume true; {13260#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:41,029 INFO L273 TraceCheckUtils]: 15: Hoare triple {13260#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13261#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:41,030 INFO L273 TraceCheckUtils]: 16: Hoare triple {13261#(<= main_~i~0 5)} assume true; {13261#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:41,030 INFO L273 TraceCheckUtils]: 17: Hoare triple {13261#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13262#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:41,031 INFO L273 TraceCheckUtils]: 18: Hoare triple {13262#(<= main_~i~0 6)} assume true; {13262#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:41,032 INFO L273 TraceCheckUtils]: 19: Hoare triple {13262#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13263#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:41,032 INFO L273 TraceCheckUtils]: 20: Hoare triple {13263#(<= main_~i~0 7)} assume true; {13263#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:41,033 INFO L273 TraceCheckUtils]: 21: Hoare triple {13263#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13264#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:41,034 INFO L273 TraceCheckUtils]: 22: Hoare triple {13264#(<= main_~i~0 8)} assume true; {13264#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:41,034 INFO L273 TraceCheckUtils]: 23: Hoare triple {13264#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13265#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:41,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {13265#(<= main_~i~0 9)} assume true; {13265#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:41,036 INFO L273 TraceCheckUtils]: 25: Hoare triple {13265#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13266#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:41,036 INFO L273 TraceCheckUtils]: 26: Hoare triple {13266#(<= main_~i~0 10)} assume true; {13266#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:41,037 INFO L273 TraceCheckUtils]: 27: Hoare triple {13266#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13267#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:41,038 INFO L273 TraceCheckUtils]: 28: Hoare triple {13267#(<= main_~i~0 11)} assume true; {13267#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:41,038 INFO L273 TraceCheckUtils]: 29: Hoare triple {13267#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13268#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:41,039 INFO L273 TraceCheckUtils]: 30: Hoare triple {13268#(<= main_~i~0 12)} assume true; {13268#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:41,040 INFO L273 TraceCheckUtils]: 31: Hoare triple {13268#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13269#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:41,040 INFO L273 TraceCheckUtils]: 32: Hoare triple {13269#(<= main_~i~0 13)} assume true; {13269#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:41,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {13269#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13270#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:41,042 INFO L273 TraceCheckUtils]: 34: Hoare triple {13270#(<= main_~i~0 14)} assume true; {13270#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:41,042 INFO L273 TraceCheckUtils]: 35: Hoare triple {13270#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13271#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:41,043 INFO L273 TraceCheckUtils]: 36: Hoare triple {13271#(<= main_~i~0 15)} assume true; {13271#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:41,044 INFO L273 TraceCheckUtils]: 37: Hoare triple {13271#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13272#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:41,044 INFO L273 TraceCheckUtils]: 38: Hoare triple {13272#(<= main_~i~0 16)} assume true; {13272#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:41,045 INFO L273 TraceCheckUtils]: 39: Hoare triple {13272#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13273#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:41,046 INFO L273 TraceCheckUtils]: 40: Hoare triple {13273#(<= main_~i~0 17)} assume true; {13273#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:41,046 INFO L273 TraceCheckUtils]: 41: Hoare triple {13273#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13274#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:41,047 INFO L273 TraceCheckUtils]: 42: Hoare triple {13274#(<= main_~i~0 18)} assume true; {13274#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:41,048 INFO L273 TraceCheckUtils]: 43: Hoare triple {13274#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13275#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:41,048 INFO L273 TraceCheckUtils]: 44: Hoare triple {13275#(<= main_~i~0 19)} assume true; {13275#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:41,049 INFO L273 TraceCheckUtils]: 45: Hoare triple {13275#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13276#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:41,050 INFO L273 TraceCheckUtils]: 46: Hoare triple {13276#(<= main_~i~0 20)} assume true; {13276#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:41,050 INFO L273 TraceCheckUtils]: 47: Hoare triple {13276#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13277#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:41,051 INFO L273 TraceCheckUtils]: 48: Hoare triple {13277#(<= main_~i~0 21)} assume true; {13277#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:41,052 INFO L273 TraceCheckUtils]: 49: Hoare triple {13277#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13278#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:41,052 INFO L273 TraceCheckUtils]: 50: Hoare triple {13278#(<= main_~i~0 22)} assume true; {13278#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:41,053 INFO L273 TraceCheckUtils]: 51: Hoare triple {13278#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13279#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:41,054 INFO L273 TraceCheckUtils]: 52: Hoare triple {13279#(<= main_~i~0 23)} assume true; {13279#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:41,054 INFO L273 TraceCheckUtils]: 53: Hoare triple {13279#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13280#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:41,055 INFO L273 TraceCheckUtils]: 54: Hoare triple {13280#(<= main_~i~0 24)} assume true; {13280#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:41,056 INFO L273 TraceCheckUtils]: 55: Hoare triple {13280#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13281#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:41,056 INFO L273 TraceCheckUtils]: 56: Hoare triple {13281#(<= main_~i~0 25)} assume true; {13281#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:41,057 INFO L273 TraceCheckUtils]: 57: Hoare triple {13281#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13282#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:41,058 INFO L273 TraceCheckUtils]: 58: Hoare triple {13282#(<= main_~i~0 26)} assume true; {13282#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:41,058 INFO L273 TraceCheckUtils]: 59: Hoare triple {13282#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13283#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:41,059 INFO L273 TraceCheckUtils]: 60: Hoare triple {13283#(<= main_~i~0 27)} assume true; {13283#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:41,060 INFO L273 TraceCheckUtils]: 61: Hoare triple {13283#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13284#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:41,060 INFO L273 TraceCheckUtils]: 62: Hoare triple {13284#(<= main_~i~0 28)} assume true; {13284#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:41,061 INFO L273 TraceCheckUtils]: 63: Hoare triple {13284#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13285#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:41,062 INFO L273 TraceCheckUtils]: 64: Hoare triple {13285#(<= main_~i~0 29)} assume true; {13285#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:41,062 INFO L273 TraceCheckUtils]: 65: Hoare triple {13285#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13286#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:41,063 INFO L273 TraceCheckUtils]: 66: Hoare triple {13286#(<= main_~i~0 30)} assume true; {13286#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:41,064 INFO L273 TraceCheckUtils]: 67: Hoare triple {13286#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13287#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:41,064 INFO L273 TraceCheckUtils]: 68: Hoare triple {13287#(<= main_~i~0 31)} assume true; {13287#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:41,065 INFO L273 TraceCheckUtils]: 69: Hoare triple {13287#(<= main_~i~0 31)} assume !(~i~0 < 100000); {13255#false} is VALID [2018-11-14 16:56:41,065 INFO L273 TraceCheckUtils]: 70: Hoare triple {13255#false} havoc ~x~0;~x~0 := 0; {13255#false} is VALID [2018-11-14 16:56:41,065 INFO L273 TraceCheckUtils]: 71: Hoare triple {13255#false} assume true; {13255#false} is VALID [2018-11-14 16:56:41,066 INFO L273 TraceCheckUtils]: 72: Hoare triple {13255#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13255#false} is VALID [2018-11-14 16:56:41,066 INFO L256 TraceCheckUtils]: 73: Hoare triple {13255#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {13255#false} is VALID [2018-11-14 16:56:41,066 INFO L273 TraceCheckUtils]: 74: Hoare triple {13255#false} ~cond := #in~cond; {13255#false} is VALID [2018-11-14 16:56:41,066 INFO L273 TraceCheckUtils]: 75: Hoare triple {13255#false} assume ~cond == 0; {13255#false} is VALID [2018-11-14 16:56:41,066 INFO L273 TraceCheckUtils]: 76: Hoare triple {13255#false} assume !false; {13255#false} is VALID [2018-11-14 16:56:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:41,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:41,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:41,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:56:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:41,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:41,315 INFO L256 TraceCheckUtils]: 0: Hoare triple {13254#true} call ULTIMATE.init(); {13254#true} is VALID [2018-11-14 16:56:41,316 INFO L273 TraceCheckUtils]: 1: Hoare triple {13254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13254#true} is VALID [2018-11-14 16:56:41,316 INFO L273 TraceCheckUtils]: 2: Hoare triple {13254#true} assume true; {13254#true} is VALID [2018-11-14 16:56:41,316 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13254#true} {13254#true} #50#return; {13254#true} is VALID [2018-11-14 16:56:41,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {13254#true} call #t~ret2 := main(); {13254#true} is VALID [2018-11-14 16:56:41,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {13254#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13306#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:41,317 INFO L273 TraceCheckUtils]: 6: Hoare triple {13306#(<= main_~i~0 0)} assume true; {13306#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:41,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {13306#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13257#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:41,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {13257#(<= main_~i~0 1)} assume true; {13257#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:41,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {13257#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13258#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:41,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {13258#(<= main_~i~0 2)} assume true; {13258#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:41,321 INFO L273 TraceCheckUtils]: 11: Hoare triple {13258#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13259#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:41,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {13259#(<= main_~i~0 3)} assume true; {13259#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:41,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {13259#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13260#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:41,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {13260#(<= main_~i~0 4)} assume true; {13260#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:41,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {13260#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13261#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:41,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {13261#(<= main_~i~0 5)} assume true; {13261#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:41,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {13261#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13262#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:41,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {13262#(<= main_~i~0 6)} assume true; {13262#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:41,326 INFO L273 TraceCheckUtils]: 19: Hoare triple {13262#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13263#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:41,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {13263#(<= main_~i~0 7)} assume true; {13263#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:41,328 INFO L273 TraceCheckUtils]: 21: Hoare triple {13263#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13264#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:41,328 INFO L273 TraceCheckUtils]: 22: Hoare triple {13264#(<= main_~i~0 8)} assume true; {13264#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:41,329 INFO L273 TraceCheckUtils]: 23: Hoare triple {13264#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13265#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:41,330 INFO L273 TraceCheckUtils]: 24: Hoare triple {13265#(<= main_~i~0 9)} assume true; {13265#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:41,330 INFO L273 TraceCheckUtils]: 25: Hoare triple {13265#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13266#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:41,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {13266#(<= main_~i~0 10)} assume true; {13266#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:41,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {13266#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13267#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:41,332 INFO L273 TraceCheckUtils]: 28: Hoare triple {13267#(<= main_~i~0 11)} assume true; {13267#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:41,333 INFO L273 TraceCheckUtils]: 29: Hoare triple {13267#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13268#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:41,334 INFO L273 TraceCheckUtils]: 30: Hoare triple {13268#(<= main_~i~0 12)} assume true; {13268#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:41,334 INFO L273 TraceCheckUtils]: 31: Hoare triple {13268#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13269#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:41,335 INFO L273 TraceCheckUtils]: 32: Hoare triple {13269#(<= main_~i~0 13)} assume true; {13269#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:41,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {13269#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13270#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:41,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {13270#(<= main_~i~0 14)} assume true; {13270#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:41,337 INFO L273 TraceCheckUtils]: 35: Hoare triple {13270#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13271#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:41,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {13271#(<= main_~i~0 15)} assume true; {13271#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:41,338 INFO L273 TraceCheckUtils]: 37: Hoare triple {13271#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13272#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:41,339 INFO L273 TraceCheckUtils]: 38: Hoare triple {13272#(<= main_~i~0 16)} assume true; {13272#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:41,340 INFO L273 TraceCheckUtils]: 39: Hoare triple {13272#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13273#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:41,340 INFO L273 TraceCheckUtils]: 40: Hoare triple {13273#(<= main_~i~0 17)} assume true; {13273#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:41,344 INFO L273 TraceCheckUtils]: 41: Hoare triple {13273#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13274#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:41,344 INFO L273 TraceCheckUtils]: 42: Hoare triple {13274#(<= main_~i~0 18)} assume true; {13274#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:41,347 INFO L273 TraceCheckUtils]: 43: Hoare triple {13274#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13275#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:41,347 INFO L273 TraceCheckUtils]: 44: Hoare triple {13275#(<= main_~i~0 19)} assume true; {13275#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:41,348 INFO L273 TraceCheckUtils]: 45: Hoare triple {13275#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13276#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:41,348 INFO L273 TraceCheckUtils]: 46: Hoare triple {13276#(<= main_~i~0 20)} assume true; {13276#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:41,348 INFO L273 TraceCheckUtils]: 47: Hoare triple {13276#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13277#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:41,349 INFO L273 TraceCheckUtils]: 48: Hoare triple {13277#(<= main_~i~0 21)} assume true; {13277#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:41,349 INFO L273 TraceCheckUtils]: 49: Hoare triple {13277#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13278#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:41,350 INFO L273 TraceCheckUtils]: 50: Hoare triple {13278#(<= main_~i~0 22)} assume true; {13278#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:41,350 INFO L273 TraceCheckUtils]: 51: Hoare triple {13278#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13279#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:41,351 INFO L273 TraceCheckUtils]: 52: Hoare triple {13279#(<= main_~i~0 23)} assume true; {13279#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:41,352 INFO L273 TraceCheckUtils]: 53: Hoare triple {13279#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13280#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:41,352 INFO L273 TraceCheckUtils]: 54: Hoare triple {13280#(<= main_~i~0 24)} assume true; {13280#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:41,353 INFO L273 TraceCheckUtils]: 55: Hoare triple {13280#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13281#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:41,354 INFO L273 TraceCheckUtils]: 56: Hoare triple {13281#(<= main_~i~0 25)} assume true; {13281#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:41,354 INFO L273 TraceCheckUtils]: 57: Hoare triple {13281#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13282#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:41,355 INFO L273 TraceCheckUtils]: 58: Hoare triple {13282#(<= main_~i~0 26)} assume true; {13282#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:41,356 INFO L273 TraceCheckUtils]: 59: Hoare triple {13282#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13283#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:41,356 INFO L273 TraceCheckUtils]: 60: Hoare triple {13283#(<= main_~i~0 27)} assume true; {13283#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:41,357 INFO L273 TraceCheckUtils]: 61: Hoare triple {13283#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13284#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:41,358 INFO L273 TraceCheckUtils]: 62: Hoare triple {13284#(<= main_~i~0 28)} assume true; {13284#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:41,379 INFO L273 TraceCheckUtils]: 63: Hoare triple {13284#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13285#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:41,393 INFO L273 TraceCheckUtils]: 64: Hoare triple {13285#(<= main_~i~0 29)} assume true; {13285#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:41,402 INFO L273 TraceCheckUtils]: 65: Hoare triple {13285#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13286#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:41,415 INFO L273 TraceCheckUtils]: 66: Hoare triple {13286#(<= main_~i~0 30)} assume true; {13286#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:41,416 INFO L273 TraceCheckUtils]: 67: Hoare triple {13286#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13287#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:41,416 INFO L273 TraceCheckUtils]: 68: Hoare triple {13287#(<= main_~i~0 31)} assume true; {13287#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:41,422 INFO L273 TraceCheckUtils]: 69: Hoare triple {13287#(<= main_~i~0 31)} assume !(~i~0 < 100000); {13255#false} is VALID [2018-11-14 16:56:41,422 INFO L273 TraceCheckUtils]: 70: Hoare triple {13255#false} havoc ~x~0;~x~0 := 0; {13255#false} is VALID [2018-11-14 16:56:41,422 INFO L273 TraceCheckUtils]: 71: Hoare triple {13255#false} assume true; {13255#false} is VALID [2018-11-14 16:56:41,422 INFO L273 TraceCheckUtils]: 72: Hoare triple {13255#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13255#false} is VALID [2018-11-14 16:56:41,422 INFO L256 TraceCheckUtils]: 73: Hoare triple {13255#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {13255#false} is VALID [2018-11-14 16:56:41,422 INFO L273 TraceCheckUtils]: 74: Hoare triple {13255#false} ~cond := #in~cond; {13255#false} is VALID [2018-11-14 16:56:41,423 INFO L273 TraceCheckUtils]: 75: Hoare triple {13255#false} assume ~cond == 0; {13255#false} is VALID [2018-11-14 16:56:41,423 INFO L273 TraceCheckUtils]: 76: Hoare triple {13255#false} assume !false; {13255#false} is VALID [2018-11-14 16:56:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:41,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:41,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-14 16:56:41,448 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2018-11-14 16:56:41,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:41,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 16:56:41,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:41,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 16:56:41,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 16:56:41,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 16:56:41,525 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 35 states. [2018-11-14 16:56:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:42,037 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-14 16:56:42,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 16:56:42,037 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2018-11-14 16:56:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 16:56:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 98 transitions. [2018-11-14 16:56:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 16:56:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 98 transitions. [2018-11-14 16:56:42,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 98 transitions. [2018-11-14 16:56:42,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:42,130 INFO L225 Difference]: With dead ends: 96 [2018-11-14 16:56:42,130 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 16:56:42,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 16:56:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 16:56:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-14 16:56:42,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:42,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2018-11-14 16:56:42,197 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-14 16:56:42,197 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-14 16:56:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:42,199 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-11-14 16:56:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-14 16:56:42,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:42,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:42,200 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-14 16:56:42,200 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-14 16:56:42,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:42,201 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-11-14 16:56:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-14 16:56:42,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:42,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:42,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:42,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-14 16:56:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-11-14 16:56:42,202 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 77 [2018-11-14 16:56:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:42,202 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-11-14 16:56:42,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 16:56:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-14 16:56:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-14 16:56:42,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:42,203 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:42,203 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:42,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1632621748, now seen corresponding path program 32 times [2018-11-14 16:56:42,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:42,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:42,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:56:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:43,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {13950#true} call ULTIMATE.init(); {13950#true} is VALID [2018-11-14 16:56:43,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {13950#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13950#true} is VALID [2018-11-14 16:56:43,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {13950#true} assume true; {13950#true} is VALID [2018-11-14 16:56:43,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13950#true} {13950#true} #50#return; {13950#true} is VALID [2018-11-14 16:56:43,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {13950#true} call #t~ret2 := main(); {13950#true} is VALID [2018-11-14 16:56:43,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {13950#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13952#(= main_~i~0 0)} is VALID [2018-11-14 16:56:43,413 INFO L273 TraceCheckUtils]: 6: Hoare triple {13952#(= main_~i~0 0)} assume true; {13952#(= main_~i~0 0)} is VALID [2018-11-14 16:56:43,414 INFO L273 TraceCheckUtils]: 7: Hoare triple {13952#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13953#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:43,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {13953#(<= main_~i~0 1)} assume true; {13953#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:43,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {13953#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13954#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:43,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {13954#(<= main_~i~0 2)} assume true; {13954#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:43,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {13954#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13955#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:43,417 INFO L273 TraceCheckUtils]: 12: Hoare triple {13955#(<= main_~i~0 3)} assume true; {13955#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:43,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {13955#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13956#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:43,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {13956#(<= main_~i~0 4)} assume true; {13956#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:43,420 INFO L273 TraceCheckUtils]: 15: Hoare triple {13956#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13957#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:43,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {13957#(<= main_~i~0 5)} assume true; {13957#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:43,421 INFO L273 TraceCheckUtils]: 17: Hoare triple {13957#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13958#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:43,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {13958#(<= main_~i~0 6)} assume true; {13958#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:43,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {13958#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13959#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:43,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {13959#(<= main_~i~0 7)} assume true; {13959#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:43,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {13959#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13960#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:43,425 INFO L273 TraceCheckUtils]: 22: Hoare triple {13960#(<= main_~i~0 8)} assume true; {13960#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:43,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {13960#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13961#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:43,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {13961#(<= main_~i~0 9)} assume true; {13961#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:43,427 INFO L273 TraceCheckUtils]: 25: Hoare triple {13961#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13962#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:43,427 INFO L273 TraceCheckUtils]: 26: Hoare triple {13962#(<= main_~i~0 10)} assume true; {13962#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:43,428 INFO L273 TraceCheckUtils]: 27: Hoare triple {13962#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13963#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:43,429 INFO L273 TraceCheckUtils]: 28: Hoare triple {13963#(<= main_~i~0 11)} assume true; {13963#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:43,430 INFO L273 TraceCheckUtils]: 29: Hoare triple {13963#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13964#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:43,430 INFO L273 TraceCheckUtils]: 30: Hoare triple {13964#(<= main_~i~0 12)} assume true; {13964#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:43,431 INFO L273 TraceCheckUtils]: 31: Hoare triple {13964#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13965#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:43,432 INFO L273 TraceCheckUtils]: 32: Hoare triple {13965#(<= main_~i~0 13)} assume true; {13965#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:43,433 INFO L273 TraceCheckUtils]: 33: Hoare triple {13965#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13966#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:43,433 INFO L273 TraceCheckUtils]: 34: Hoare triple {13966#(<= main_~i~0 14)} assume true; {13966#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:43,434 INFO L273 TraceCheckUtils]: 35: Hoare triple {13966#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13967#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:43,435 INFO L273 TraceCheckUtils]: 36: Hoare triple {13967#(<= main_~i~0 15)} assume true; {13967#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:43,436 INFO L273 TraceCheckUtils]: 37: Hoare triple {13967#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13968#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:43,436 INFO L273 TraceCheckUtils]: 38: Hoare triple {13968#(<= main_~i~0 16)} assume true; {13968#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:43,437 INFO L273 TraceCheckUtils]: 39: Hoare triple {13968#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13969#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:43,438 INFO L273 TraceCheckUtils]: 40: Hoare triple {13969#(<= main_~i~0 17)} assume true; {13969#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:43,438 INFO L273 TraceCheckUtils]: 41: Hoare triple {13969#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13970#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:43,439 INFO L273 TraceCheckUtils]: 42: Hoare triple {13970#(<= main_~i~0 18)} assume true; {13970#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:43,440 INFO L273 TraceCheckUtils]: 43: Hoare triple {13970#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:43,441 INFO L273 TraceCheckUtils]: 44: Hoare triple {13971#(<= main_~i~0 19)} assume true; {13971#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:43,441 INFO L273 TraceCheckUtils]: 45: Hoare triple {13971#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13972#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:43,442 INFO L273 TraceCheckUtils]: 46: Hoare triple {13972#(<= main_~i~0 20)} assume true; {13972#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:43,443 INFO L273 TraceCheckUtils]: 47: Hoare triple {13972#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13973#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:43,453 INFO L273 TraceCheckUtils]: 48: Hoare triple {13973#(<= main_~i~0 21)} assume true; {13973#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:43,454 INFO L273 TraceCheckUtils]: 49: Hoare triple {13973#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13974#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:43,454 INFO L273 TraceCheckUtils]: 50: Hoare triple {13974#(<= main_~i~0 22)} assume true; {13974#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:43,473 INFO L273 TraceCheckUtils]: 51: Hoare triple {13974#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13975#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:43,487 INFO L273 TraceCheckUtils]: 52: Hoare triple {13975#(<= main_~i~0 23)} assume true; {13975#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:43,488 INFO L273 TraceCheckUtils]: 53: Hoare triple {13975#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13976#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:43,488 INFO L273 TraceCheckUtils]: 54: Hoare triple {13976#(<= main_~i~0 24)} assume true; {13976#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:43,489 INFO L273 TraceCheckUtils]: 55: Hoare triple {13976#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13977#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:43,489 INFO L273 TraceCheckUtils]: 56: Hoare triple {13977#(<= main_~i~0 25)} assume true; {13977#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:43,490 INFO L273 TraceCheckUtils]: 57: Hoare triple {13977#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13978#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:43,490 INFO L273 TraceCheckUtils]: 58: Hoare triple {13978#(<= main_~i~0 26)} assume true; {13978#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:43,491 INFO L273 TraceCheckUtils]: 59: Hoare triple {13978#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13979#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:43,491 INFO L273 TraceCheckUtils]: 60: Hoare triple {13979#(<= main_~i~0 27)} assume true; {13979#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:43,492 INFO L273 TraceCheckUtils]: 61: Hoare triple {13979#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13980#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:43,492 INFO L273 TraceCheckUtils]: 62: Hoare triple {13980#(<= main_~i~0 28)} assume true; {13980#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:43,493 INFO L273 TraceCheckUtils]: 63: Hoare triple {13980#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13981#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:43,493 INFO L273 TraceCheckUtils]: 64: Hoare triple {13981#(<= main_~i~0 29)} assume true; {13981#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:43,494 INFO L273 TraceCheckUtils]: 65: Hoare triple {13981#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13982#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:43,495 INFO L273 TraceCheckUtils]: 66: Hoare triple {13982#(<= main_~i~0 30)} assume true; {13982#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:43,496 INFO L273 TraceCheckUtils]: 67: Hoare triple {13982#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13983#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:43,513 INFO L273 TraceCheckUtils]: 68: Hoare triple {13983#(<= main_~i~0 31)} assume true; {13983#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:43,517 INFO L273 TraceCheckUtils]: 69: Hoare triple {13983#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13984#(<= main_~i~0 32)} is VALID [2018-11-14 16:56:43,518 INFO L273 TraceCheckUtils]: 70: Hoare triple {13984#(<= main_~i~0 32)} assume true; {13984#(<= main_~i~0 32)} is VALID [2018-11-14 16:56:43,518 INFO L273 TraceCheckUtils]: 71: Hoare triple {13984#(<= main_~i~0 32)} assume !(~i~0 < 100000); {13951#false} is VALID [2018-11-14 16:56:43,518 INFO L273 TraceCheckUtils]: 72: Hoare triple {13951#false} havoc ~x~0;~x~0 := 0; {13951#false} is VALID [2018-11-14 16:56:43,519 INFO L273 TraceCheckUtils]: 73: Hoare triple {13951#false} assume true; {13951#false} is VALID [2018-11-14 16:56:43,519 INFO L273 TraceCheckUtils]: 74: Hoare triple {13951#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13951#false} is VALID [2018-11-14 16:56:43,519 INFO L256 TraceCheckUtils]: 75: Hoare triple {13951#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {13951#false} is VALID [2018-11-14 16:56:43,519 INFO L273 TraceCheckUtils]: 76: Hoare triple {13951#false} ~cond := #in~cond; {13951#false} is VALID [2018-11-14 16:56:43,519 INFO L273 TraceCheckUtils]: 77: Hoare triple {13951#false} assume ~cond == 0; {13951#false} is VALID [2018-11-14 16:56:43,520 INFO L273 TraceCheckUtils]: 78: Hoare triple {13951#false} assume !false; {13951#false} is VALID [2018-11-14 16:56:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:43,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:43,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:43,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:56:43,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:56:43,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:43,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:43,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {13950#true} call ULTIMATE.init(); {13950#true} is VALID [2018-11-14 16:56:43,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {13950#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13950#true} is VALID [2018-11-14 16:56:43,784 INFO L273 TraceCheckUtils]: 2: Hoare triple {13950#true} assume true; {13950#true} is VALID [2018-11-14 16:56:43,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13950#true} {13950#true} #50#return; {13950#true} is VALID [2018-11-14 16:56:43,785 INFO L256 TraceCheckUtils]: 4: Hoare triple {13950#true} call #t~ret2 := main(); {13950#true} is VALID [2018-11-14 16:56:43,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {13950#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14003#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:43,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {14003#(<= main_~i~0 0)} assume true; {14003#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:43,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {14003#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13953#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:43,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {13953#(<= main_~i~0 1)} assume true; {13953#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:43,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {13953#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13954#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:43,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {13954#(<= main_~i~0 2)} assume true; {13954#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:43,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {13954#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13955#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:43,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {13955#(<= main_~i~0 3)} assume true; {13955#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:43,789 INFO L273 TraceCheckUtils]: 13: Hoare triple {13955#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13956#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:43,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {13956#(<= main_~i~0 4)} assume true; {13956#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:43,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {13956#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13957#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:43,791 INFO L273 TraceCheckUtils]: 16: Hoare triple {13957#(<= main_~i~0 5)} assume true; {13957#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:43,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {13957#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13958#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:43,793 INFO L273 TraceCheckUtils]: 18: Hoare triple {13958#(<= main_~i~0 6)} assume true; {13958#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:43,793 INFO L273 TraceCheckUtils]: 19: Hoare triple {13958#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13959#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:43,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {13959#(<= main_~i~0 7)} assume true; {13959#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:43,795 INFO L273 TraceCheckUtils]: 21: Hoare triple {13959#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13960#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:43,795 INFO L273 TraceCheckUtils]: 22: Hoare triple {13960#(<= main_~i~0 8)} assume true; {13960#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:43,796 INFO L273 TraceCheckUtils]: 23: Hoare triple {13960#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13961#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:43,797 INFO L273 TraceCheckUtils]: 24: Hoare triple {13961#(<= main_~i~0 9)} assume true; {13961#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:43,798 INFO L273 TraceCheckUtils]: 25: Hoare triple {13961#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13962#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:43,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {13962#(<= main_~i~0 10)} assume true; {13962#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:43,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {13962#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13963#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:43,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {13963#(<= main_~i~0 11)} assume true; {13963#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:43,800 INFO L273 TraceCheckUtils]: 29: Hoare triple {13963#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13964#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:43,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {13964#(<= main_~i~0 12)} assume true; {13964#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:43,802 INFO L273 TraceCheckUtils]: 31: Hoare triple {13964#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13965#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:43,802 INFO L273 TraceCheckUtils]: 32: Hoare triple {13965#(<= main_~i~0 13)} assume true; {13965#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:43,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {13965#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13966#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:43,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {13966#(<= main_~i~0 14)} assume true; {13966#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:43,804 INFO L273 TraceCheckUtils]: 35: Hoare triple {13966#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13967#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:43,805 INFO L273 TraceCheckUtils]: 36: Hoare triple {13967#(<= main_~i~0 15)} assume true; {13967#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:43,806 INFO L273 TraceCheckUtils]: 37: Hoare triple {13967#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13968#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:43,806 INFO L273 TraceCheckUtils]: 38: Hoare triple {13968#(<= main_~i~0 16)} assume true; {13968#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:43,807 INFO L273 TraceCheckUtils]: 39: Hoare triple {13968#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13969#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:43,807 INFO L273 TraceCheckUtils]: 40: Hoare triple {13969#(<= main_~i~0 17)} assume true; {13969#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:43,808 INFO L273 TraceCheckUtils]: 41: Hoare triple {13969#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13970#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:43,809 INFO L273 TraceCheckUtils]: 42: Hoare triple {13970#(<= main_~i~0 18)} assume true; {13970#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:43,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {13970#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:43,810 INFO L273 TraceCheckUtils]: 44: Hoare triple {13971#(<= main_~i~0 19)} assume true; {13971#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:43,811 INFO L273 TraceCheckUtils]: 45: Hoare triple {13971#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13972#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:43,811 INFO L273 TraceCheckUtils]: 46: Hoare triple {13972#(<= main_~i~0 20)} assume true; {13972#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:43,812 INFO L273 TraceCheckUtils]: 47: Hoare triple {13972#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13973#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:43,813 INFO L273 TraceCheckUtils]: 48: Hoare triple {13973#(<= main_~i~0 21)} assume true; {13973#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:43,814 INFO L273 TraceCheckUtils]: 49: Hoare triple {13973#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13974#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:43,814 INFO L273 TraceCheckUtils]: 50: Hoare triple {13974#(<= main_~i~0 22)} assume true; {13974#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:43,815 INFO L273 TraceCheckUtils]: 51: Hoare triple {13974#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13975#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:43,815 INFO L273 TraceCheckUtils]: 52: Hoare triple {13975#(<= main_~i~0 23)} assume true; {13975#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:43,816 INFO L273 TraceCheckUtils]: 53: Hoare triple {13975#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13976#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:43,817 INFO L273 TraceCheckUtils]: 54: Hoare triple {13976#(<= main_~i~0 24)} assume true; {13976#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:43,818 INFO L273 TraceCheckUtils]: 55: Hoare triple {13976#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13977#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:43,818 INFO L273 TraceCheckUtils]: 56: Hoare triple {13977#(<= main_~i~0 25)} assume true; {13977#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:43,819 INFO L273 TraceCheckUtils]: 57: Hoare triple {13977#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13978#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:43,820 INFO L273 TraceCheckUtils]: 58: Hoare triple {13978#(<= main_~i~0 26)} assume true; {13978#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:43,820 INFO L273 TraceCheckUtils]: 59: Hoare triple {13978#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13979#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:43,821 INFO L273 TraceCheckUtils]: 60: Hoare triple {13979#(<= main_~i~0 27)} assume true; {13979#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:43,822 INFO L273 TraceCheckUtils]: 61: Hoare triple {13979#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13980#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:43,822 INFO L273 TraceCheckUtils]: 62: Hoare triple {13980#(<= main_~i~0 28)} assume true; {13980#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:43,823 INFO L273 TraceCheckUtils]: 63: Hoare triple {13980#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13981#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:43,824 INFO L273 TraceCheckUtils]: 64: Hoare triple {13981#(<= main_~i~0 29)} assume true; {13981#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:43,825 INFO L273 TraceCheckUtils]: 65: Hoare triple {13981#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13982#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:43,825 INFO L273 TraceCheckUtils]: 66: Hoare triple {13982#(<= main_~i~0 30)} assume true; {13982#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:43,826 INFO L273 TraceCheckUtils]: 67: Hoare triple {13982#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13983#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:43,827 INFO L273 TraceCheckUtils]: 68: Hoare triple {13983#(<= main_~i~0 31)} assume true; {13983#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:43,828 INFO L273 TraceCheckUtils]: 69: Hoare triple {13983#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13984#(<= main_~i~0 32)} is VALID [2018-11-14 16:56:43,828 INFO L273 TraceCheckUtils]: 70: Hoare triple {13984#(<= main_~i~0 32)} assume true; {13984#(<= main_~i~0 32)} is VALID [2018-11-14 16:56:43,829 INFO L273 TraceCheckUtils]: 71: Hoare triple {13984#(<= main_~i~0 32)} assume !(~i~0 < 100000); {13951#false} is VALID [2018-11-14 16:56:43,829 INFO L273 TraceCheckUtils]: 72: Hoare triple {13951#false} havoc ~x~0;~x~0 := 0; {13951#false} is VALID [2018-11-14 16:56:43,829 INFO L273 TraceCheckUtils]: 73: Hoare triple {13951#false} assume true; {13951#false} is VALID [2018-11-14 16:56:43,829 INFO L273 TraceCheckUtils]: 74: Hoare triple {13951#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13951#false} is VALID [2018-11-14 16:56:43,830 INFO L256 TraceCheckUtils]: 75: Hoare triple {13951#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {13951#false} is VALID [2018-11-14 16:56:43,830 INFO L273 TraceCheckUtils]: 76: Hoare triple {13951#false} ~cond := #in~cond; {13951#false} is VALID [2018-11-14 16:56:43,830 INFO L273 TraceCheckUtils]: 77: Hoare triple {13951#false} assume ~cond == 0; {13951#false} is VALID [2018-11-14 16:56:43,830 INFO L273 TraceCheckUtils]: 78: Hoare triple {13951#false} assume !false; {13951#false} is VALID [2018-11-14 16:56:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:43,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:43,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-14 16:56:43,856 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-11-14 16:56:43,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:43,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-14 16:56:43,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:43,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-14 16:56:43,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-14 16:56:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 16:56:43,934 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 36 states. [2018-11-14 16:56:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:44,862 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-11-14 16:56:44,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 16:56:44,863 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-11-14 16:56:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:56:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 100 transitions. [2018-11-14 16:56:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:56:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 100 transitions. [2018-11-14 16:56:44,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 100 transitions. [2018-11-14 16:56:44,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:44,992 INFO L225 Difference]: With dead ends: 98 [2018-11-14 16:56:44,993 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 16:56:44,994 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 16:56:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 16:56:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-14 16:56:45,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:45,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2018-11-14 16:56:45,035 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-14 16:56:45,036 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-14 16:56:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:45,037 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2018-11-14 16:56:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-14 16:56:45,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:45,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:45,037 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-14 16:56:45,037 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-14 16:56:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:45,038 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2018-11-14 16:56:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-14 16:56:45,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:45,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:45,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:45,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-14 16:56:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-11-14 16:56:45,040 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 79 [2018-11-14 16:56:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:45,041 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-14 16:56:45,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-14 16:56:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-14 16:56:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-14 16:56:45,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:45,041 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:45,041 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:45,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:45,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1274496782, now seen corresponding path program 33 times [2018-11-14 16:56:45,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:45,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:45,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:45,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:45,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:45,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {14663#true} call ULTIMATE.init(); {14663#true} is VALID [2018-11-14 16:56:45,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {14663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14663#true} is VALID [2018-11-14 16:56:45,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {14663#true} assume true; {14663#true} is VALID [2018-11-14 16:56:45,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14663#true} {14663#true} #50#return; {14663#true} is VALID [2018-11-14 16:56:45,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {14663#true} call #t~ret2 := main(); {14663#true} is VALID [2018-11-14 16:56:45,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {14663#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14665#(= main_~i~0 0)} is VALID [2018-11-14 16:56:45,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {14665#(= main_~i~0 0)} assume true; {14665#(= main_~i~0 0)} is VALID [2018-11-14 16:56:45,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {14665#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14666#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:45,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {14666#(<= main_~i~0 1)} assume true; {14666#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:45,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {14666#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14667#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:45,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {14667#(<= main_~i~0 2)} assume true; {14667#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:45,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {14667#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14668#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:45,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {14668#(<= main_~i~0 3)} assume true; {14668#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:45,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {14668#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14669#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:45,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {14669#(<= main_~i~0 4)} assume true; {14669#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:45,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {14669#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14670#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:45,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {14670#(<= main_~i~0 5)} assume true; {14670#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:45,684 INFO L273 TraceCheckUtils]: 17: Hoare triple {14670#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14671#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:45,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {14671#(<= main_~i~0 6)} assume true; {14671#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:45,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {14671#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14672#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:45,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {14672#(<= main_~i~0 7)} assume true; {14672#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:45,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {14672#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14673#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:45,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {14673#(<= main_~i~0 8)} assume true; {14673#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:45,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {14673#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14674#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:45,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {14674#(<= main_~i~0 9)} assume true; {14674#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:45,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {14674#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14675#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:45,691 INFO L273 TraceCheckUtils]: 26: Hoare triple {14675#(<= main_~i~0 10)} assume true; {14675#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:45,692 INFO L273 TraceCheckUtils]: 27: Hoare triple {14675#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14676#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:45,692 INFO L273 TraceCheckUtils]: 28: Hoare triple {14676#(<= main_~i~0 11)} assume true; {14676#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:45,693 INFO L273 TraceCheckUtils]: 29: Hoare triple {14676#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14677#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:45,693 INFO L273 TraceCheckUtils]: 30: Hoare triple {14677#(<= main_~i~0 12)} assume true; {14677#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:45,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {14677#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14678#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:45,695 INFO L273 TraceCheckUtils]: 32: Hoare triple {14678#(<= main_~i~0 13)} assume true; {14678#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:45,696 INFO L273 TraceCheckUtils]: 33: Hoare triple {14678#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14679#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:45,696 INFO L273 TraceCheckUtils]: 34: Hoare triple {14679#(<= main_~i~0 14)} assume true; {14679#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:45,697 INFO L273 TraceCheckUtils]: 35: Hoare triple {14679#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14680#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:45,698 INFO L273 TraceCheckUtils]: 36: Hoare triple {14680#(<= main_~i~0 15)} assume true; {14680#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:45,699 INFO L273 TraceCheckUtils]: 37: Hoare triple {14680#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14681#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:45,699 INFO L273 TraceCheckUtils]: 38: Hoare triple {14681#(<= main_~i~0 16)} assume true; {14681#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:45,700 INFO L273 TraceCheckUtils]: 39: Hoare triple {14681#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14682#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:45,701 INFO L273 TraceCheckUtils]: 40: Hoare triple {14682#(<= main_~i~0 17)} assume true; {14682#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:45,702 INFO L273 TraceCheckUtils]: 41: Hoare triple {14682#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14683#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:45,702 INFO L273 TraceCheckUtils]: 42: Hoare triple {14683#(<= main_~i~0 18)} assume true; {14683#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:45,703 INFO L273 TraceCheckUtils]: 43: Hoare triple {14683#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14684#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:45,703 INFO L273 TraceCheckUtils]: 44: Hoare triple {14684#(<= main_~i~0 19)} assume true; {14684#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:45,704 INFO L273 TraceCheckUtils]: 45: Hoare triple {14684#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14685#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:45,705 INFO L273 TraceCheckUtils]: 46: Hoare triple {14685#(<= main_~i~0 20)} assume true; {14685#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:45,706 INFO L273 TraceCheckUtils]: 47: Hoare triple {14685#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14686#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:45,706 INFO L273 TraceCheckUtils]: 48: Hoare triple {14686#(<= main_~i~0 21)} assume true; {14686#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:45,707 INFO L273 TraceCheckUtils]: 49: Hoare triple {14686#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14687#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:45,708 INFO L273 TraceCheckUtils]: 50: Hoare triple {14687#(<= main_~i~0 22)} assume true; {14687#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:45,709 INFO L273 TraceCheckUtils]: 51: Hoare triple {14687#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14688#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:45,709 INFO L273 TraceCheckUtils]: 52: Hoare triple {14688#(<= main_~i~0 23)} assume true; {14688#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:45,710 INFO L273 TraceCheckUtils]: 53: Hoare triple {14688#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14689#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:45,711 INFO L273 TraceCheckUtils]: 54: Hoare triple {14689#(<= main_~i~0 24)} assume true; {14689#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:45,711 INFO L273 TraceCheckUtils]: 55: Hoare triple {14689#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14690#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:45,712 INFO L273 TraceCheckUtils]: 56: Hoare triple {14690#(<= main_~i~0 25)} assume true; {14690#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:45,713 INFO L273 TraceCheckUtils]: 57: Hoare triple {14690#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14691#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:45,713 INFO L273 TraceCheckUtils]: 58: Hoare triple {14691#(<= main_~i~0 26)} assume true; {14691#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:45,714 INFO L273 TraceCheckUtils]: 59: Hoare triple {14691#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14692#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:45,715 INFO L273 TraceCheckUtils]: 60: Hoare triple {14692#(<= main_~i~0 27)} assume true; {14692#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:45,716 INFO L273 TraceCheckUtils]: 61: Hoare triple {14692#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14693#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:45,716 INFO L273 TraceCheckUtils]: 62: Hoare triple {14693#(<= main_~i~0 28)} assume true; {14693#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:45,717 INFO L273 TraceCheckUtils]: 63: Hoare triple {14693#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14694#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:45,718 INFO L273 TraceCheckUtils]: 64: Hoare triple {14694#(<= main_~i~0 29)} assume true; {14694#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:45,719 INFO L273 TraceCheckUtils]: 65: Hoare triple {14694#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14695#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:45,719 INFO L273 TraceCheckUtils]: 66: Hoare triple {14695#(<= main_~i~0 30)} assume true; {14695#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:45,720 INFO L273 TraceCheckUtils]: 67: Hoare triple {14695#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14696#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:45,721 INFO L273 TraceCheckUtils]: 68: Hoare triple {14696#(<= main_~i~0 31)} assume true; {14696#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:45,721 INFO L273 TraceCheckUtils]: 69: Hoare triple {14696#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14697#(<= main_~i~0 32)} is VALID [2018-11-14 16:56:45,722 INFO L273 TraceCheckUtils]: 70: Hoare triple {14697#(<= main_~i~0 32)} assume true; {14697#(<= main_~i~0 32)} is VALID [2018-11-14 16:56:45,723 INFO L273 TraceCheckUtils]: 71: Hoare triple {14697#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14698#(<= main_~i~0 33)} is VALID [2018-11-14 16:56:45,723 INFO L273 TraceCheckUtils]: 72: Hoare triple {14698#(<= main_~i~0 33)} assume true; {14698#(<= main_~i~0 33)} is VALID [2018-11-14 16:56:45,724 INFO L273 TraceCheckUtils]: 73: Hoare triple {14698#(<= main_~i~0 33)} assume !(~i~0 < 100000); {14664#false} is VALID [2018-11-14 16:56:45,724 INFO L273 TraceCheckUtils]: 74: Hoare triple {14664#false} havoc ~x~0;~x~0 := 0; {14664#false} is VALID [2018-11-14 16:56:45,725 INFO L273 TraceCheckUtils]: 75: Hoare triple {14664#false} assume true; {14664#false} is VALID [2018-11-14 16:56:45,725 INFO L273 TraceCheckUtils]: 76: Hoare triple {14664#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {14664#false} is VALID [2018-11-14 16:56:45,725 INFO L256 TraceCheckUtils]: 77: Hoare triple {14664#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {14664#false} is VALID [2018-11-14 16:56:45,725 INFO L273 TraceCheckUtils]: 78: Hoare triple {14664#false} ~cond := #in~cond; {14664#false} is VALID [2018-11-14 16:56:45,725 INFO L273 TraceCheckUtils]: 79: Hoare triple {14664#false} assume ~cond == 0; {14664#false} is VALID [2018-11-14 16:56:45,725 INFO L273 TraceCheckUtils]: 80: Hoare triple {14664#false} assume !false; {14664#false} is VALID [2018-11-14 16:56:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:45,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:45,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:45,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:56:53,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-14 16:56:53,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:53,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:53,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {14663#true} call ULTIMATE.init(); {14663#true} is VALID [2018-11-14 16:56:53,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {14663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14663#true} is VALID [2018-11-14 16:56:53,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {14663#true} assume true; {14663#true} is VALID [2018-11-14 16:56:53,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14663#true} {14663#true} #50#return; {14663#true} is VALID [2018-11-14 16:56:53,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {14663#true} call #t~ret2 := main(); {14663#true} is VALID [2018-11-14 16:56:53,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {14663#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14717#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:53,994 INFO L273 TraceCheckUtils]: 6: Hoare triple {14717#(<= main_~i~0 0)} assume true; {14717#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:53,995 INFO L273 TraceCheckUtils]: 7: Hoare triple {14717#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14666#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:53,996 INFO L273 TraceCheckUtils]: 8: Hoare triple {14666#(<= main_~i~0 1)} assume true; {14666#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:53,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {14666#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14667#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:53,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {14667#(<= main_~i~0 2)} assume true; {14667#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:53,999 INFO L273 TraceCheckUtils]: 11: Hoare triple {14667#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14668#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:53,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {14668#(<= main_~i~0 3)} assume true; {14668#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:54,000 INFO L273 TraceCheckUtils]: 13: Hoare triple {14668#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14669#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:54,001 INFO L273 TraceCheckUtils]: 14: Hoare triple {14669#(<= main_~i~0 4)} assume true; {14669#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:54,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {14669#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14670#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:54,003 INFO L273 TraceCheckUtils]: 16: Hoare triple {14670#(<= main_~i~0 5)} assume true; {14670#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:54,004 INFO L273 TraceCheckUtils]: 17: Hoare triple {14670#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14671#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:54,006 INFO L273 TraceCheckUtils]: 18: Hoare triple {14671#(<= main_~i~0 6)} assume true; {14671#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:54,008 INFO L273 TraceCheckUtils]: 19: Hoare triple {14671#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14672#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:54,008 INFO L273 TraceCheckUtils]: 20: Hoare triple {14672#(<= main_~i~0 7)} assume true; {14672#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:54,009 INFO L273 TraceCheckUtils]: 21: Hoare triple {14672#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14673#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:54,009 INFO L273 TraceCheckUtils]: 22: Hoare triple {14673#(<= main_~i~0 8)} assume true; {14673#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:54,010 INFO L273 TraceCheckUtils]: 23: Hoare triple {14673#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14674#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:54,010 INFO L273 TraceCheckUtils]: 24: Hoare triple {14674#(<= main_~i~0 9)} assume true; {14674#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:54,011 INFO L273 TraceCheckUtils]: 25: Hoare triple {14674#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14675#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:54,012 INFO L273 TraceCheckUtils]: 26: Hoare triple {14675#(<= main_~i~0 10)} assume true; {14675#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:54,013 INFO L273 TraceCheckUtils]: 27: Hoare triple {14675#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14676#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:54,014 INFO L273 TraceCheckUtils]: 28: Hoare triple {14676#(<= main_~i~0 11)} assume true; {14676#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:54,015 INFO L273 TraceCheckUtils]: 29: Hoare triple {14676#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14677#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:54,015 INFO L273 TraceCheckUtils]: 30: Hoare triple {14677#(<= main_~i~0 12)} assume true; {14677#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:54,016 INFO L273 TraceCheckUtils]: 31: Hoare triple {14677#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14678#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:54,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {14678#(<= main_~i~0 13)} assume true; {14678#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:54,018 INFO L273 TraceCheckUtils]: 33: Hoare triple {14678#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14679#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:54,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {14679#(<= main_~i~0 14)} assume true; {14679#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:54,020 INFO L273 TraceCheckUtils]: 35: Hoare triple {14679#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14680#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:54,020 INFO L273 TraceCheckUtils]: 36: Hoare triple {14680#(<= main_~i~0 15)} assume true; {14680#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:54,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {14680#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14681#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:54,022 INFO L273 TraceCheckUtils]: 38: Hoare triple {14681#(<= main_~i~0 16)} assume true; {14681#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:54,023 INFO L273 TraceCheckUtils]: 39: Hoare triple {14681#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14682#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:54,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {14682#(<= main_~i~0 17)} assume true; {14682#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:54,025 INFO L273 TraceCheckUtils]: 41: Hoare triple {14682#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14683#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:54,025 INFO L273 TraceCheckUtils]: 42: Hoare triple {14683#(<= main_~i~0 18)} assume true; {14683#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:54,026 INFO L273 TraceCheckUtils]: 43: Hoare triple {14683#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14684#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:54,027 INFO L273 TraceCheckUtils]: 44: Hoare triple {14684#(<= main_~i~0 19)} assume true; {14684#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:54,028 INFO L273 TraceCheckUtils]: 45: Hoare triple {14684#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14685#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:54,029 INFO L273 TraceCheckUtils]: 46: Hoare triple {14685#(<= main_~i~0 20)} assume true; {14685#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:54,030 INFO L273 TraceCheckUtils]: 47: Hoare triple {14685#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14686#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:54,030 INFO L273 TraceCheckUtils]: 48: Hoare triple {14686#(<= main_~i~0 21)} assume true; {14686#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:54,031 INFO L273 TraceCheckUtils]: 49: Hoare triple {14686#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14687#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:54,032 INFO L273 TraceCheckUtils]: 50: Hoare triple {14687#(<= main_~i~0 22)} assume true; {14687#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:54,033 INFO L273 TraceCheckUtils]: 51: Hoare triple {14687#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14688#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:54,034 INFO L273 TraceCheckUtils]: 52: Hoare triple {14688#(<= main_~i~0 23)} assume true; {14688#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:54,035 INFO L273 TraceCheckUtils]: 53: Hoare triple {14688#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14689#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:54,035 INFO L273 TraceCheckUtils]: 54: Hoare triple {14689#(<= main_~i~0 24)} assume true; {14689#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:54,036 INFO L273 TraceCheckUtils]: 55: Hoare triple {14689#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14690#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:54,037 INFO L273 TraceCheckUtils]: 56: Hoare triple {14690#(<= main_~i~0 25)} assume true; {14690#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:54,038 INFO L273 TraceCheckUtils]: 57: Hoare triple {14690#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14691#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:54,039 INFO L273 TraceCheckUtils]: 58: Hoare triple {14691#(<= main_~i~0 26)} assume true; {14691#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:54,040 INFO L273 TraceCheckUtils]: 59: Hoare triple {14691#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14692#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:54,040 INFO L273 TraceCheckUtils]: 60: Hoare triple {14692#(<= main_~i~0 27)} assume true; {14692#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:54,041 INFO L273 TraceCheckUtils]: 61: Hoare triple {14692#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14693#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:54,042 INFO L273 TraceCheckUtils]: 62: Hoare triple {14693#(<= main_~i~0 28)} assume true; {14693#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:54,043 INFO L273 TraceCheckUtils]: 63: Hoare triple {14693#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14694#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:54,044 INFO L273 TraceCheckUtils]: 64: Hoare triple {14694#(<= main_~i~0 29)} assume true; {14694#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:54,045 INFO L273 TraceCheckUtils]: 65: Hoare triple {14694#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14695#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:54,045 INFO L273 TraceCheckUtils]: 66: Hoare triple {14695#(<= main_~i~0 30)} assume true; {14695#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:54,046 INFO L273 TraceCheckUtils]: 67: Hoare triple {14695#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14696#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:54,047 INFO L273 TraceCheckUtils]: 68: Hoare triple {14696#(<= main_~i~0 31)} assume true; {14696#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:54,048 INFO L273 TraceCheckUtils]: 69: Hoare triple {14696#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14697#(<= main_~i~0 32)} is VALID [2018-11-14 16:56:54,049 INFO L273 TraceCheckUtils]: 70: Hoare triple {14697#(<= main_~i~0 32)} assume true; {14697#(<= main_~i~0 32)} is VALID [2018-11-14 16:56:54,050 INFO L273 TraceCheckUtils]: 71: Hoare triple {14697#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14698#(<= main_~i~0 33)} is VALID [2018-11-14 16:56:54,050 INFO L273 TraceCheckUtils]: 72: Hoare triple {14698#(<= main_~i~0 33)} assume true; {14698#(<= main_~i~0 33)} is VALID [2018-11-14 16:56:54,051 INFO L273 TraceCheckUtils]: 73: Hoare triple {14698#(<= main_~i~0 33)} assume !(~i~0 < 100000); {14664#false} is VALID [2018-11-14 16:56:54,051 INFO L273 TraceCheckUtils]: 74: Hoare triple {14664#false} havoc ~x~0;~x~0 := 0; {14664#false} is VALID [2018-11-14 16:56:54,052 INFO L273 TraceCheckUtils]: 75: Hoare triple {14664#false} assume true; {14664#false} is VALID [2018-11-14 16:56:54,052 INFO L273 TraceCheckUtils]: 76: Hoare triple {14664#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {14664#false} is VALID [2018-11-14 16:56:54,052 INFO L256 TraceCheckUtils]: 77: Hoare triple {14664#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {14664#false} is VALID [2018-11-14 16:56:54,052 INFO L273 TraceCheckUtils]: 78: Hoare triple {14664#false} ~cond := #in~cond; {14664#false} is VALID [2018-11-14 16:56:54,053 INFO L273 TraceCheckUtils]: 79: Hoare triple {14664#false} assume ~cond == 0; {14664#false} is VALID [2018-11-14 16:56:54,053 INFO L273 TraceCheckUtils]: 80: Hoare triple {14664#false} assume !false; {14664#false} is VALID [2018-11-14 16:56:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:54,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:54,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-14 16:56:54,086 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2018-11-14 16:56:54,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:54,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-14 16:56:54,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:54,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-14 16:56:54,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-14 16:56:54,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 16:56:54,204 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 37 states. [2018-11-14 16:56:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:55,023 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-11-14 16:56:55,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-14 16:56:55,023 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2018-11-14 16:56:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 16:56:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 102 transitions. [2018-11-14 16:56:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 16:56:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 102 transitions. [2018-11-14 16:56:55,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 102 transitions. [2018-11-14 16:56:55,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:55,121 INFO L225 Difference]: With dead ends: 100 [2018-11-14 16:56:55,122 INFO L226 Difference]: Without dead ends: 88 [2018-11-14 16:56:55,122 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 16:56:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-14 16:56:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-14 16:56:55,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:55,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-14 16:56:55,161 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-14 16:56:55,161 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-14 16:56:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:55,163 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-11-14 16:56:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-11-14 16:56:55,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:55,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:55,164 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-14 16:56:55,164 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-14 16:56:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:55,165 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-11-14 16:56:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-11-14 16:56:55,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:55,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:55,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:55,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-14 16:56:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-11-14 16:56:55,167 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 81 [2018-11-14 16:56:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:55,167 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-11-14 16:56:55,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-14 16:56:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-11-14 16:56:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-14 16:56:55,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:55,168 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:56:55,169 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:55,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash 713788136, now seen corresponding path program 34 times [2018-11-14 16:56:55,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:55,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:55,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:56,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {15393#true} call ULTIMATE.init(); {15393#true} is VALID [2018-11-14 16:56:56,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {15393#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15393#true} is VALID [2018-11-14 16:56:56,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {15393#true} assume true; {15393#true} is VALID [2018-11-14 16:56:56,891 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15393#true} {15393#true} #50#return; {15393#true} is VALID [2018-11-14 16:56:56,891 INFO L256 TraceCheckUtils]: 4: Hoare triple {15393#true} call #t~ret2 := main(); {15393#true} is VALID [2018-11-14 16:56:56,891 INFO L273 TraceCheckUtils]: 5: Hoare triple {15393#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15395#(= main_~i~0 0)} is VALID [2018-11-14 16:56:56,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {15395#(= main_~i~0 0)} assume true; {15395#(= main_~i~0 0)} is VALID [2018-11-14 16:56:56,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {15395#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15396#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:56,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {15396#(<= main_~i~0 1)} assume true; {15396#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:56,894 INFO L273 TraceCheckUtils]: 9: Hoare triple {15396#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15397#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:56,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {15397#(<= main_~i~0 2)} assume true; {15397#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:56,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {15397#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15398#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:56,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {15398#(<= main_~i~0 3)} assume true; {15398#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:56,929 INFO L273 TraceCheckUtils]: 13: Hoare triple {15398#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15399#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:56,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {15399#(<= main_~i~0 4)} assume true; {15399#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:56,952 INFO L273 TraceCheckUtils]: 15: Hoare triple {15399#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15400#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:56,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {15400#(<= main_~i~0 5)} assume true; {15400#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:56,975 INFO L273 TraceCheckUtils]: 17: Hoare triple {15400#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15401#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:56,984 INFO L273 TraceCheckUtils]: 18: Hoare triple {15401#(<= main_~i~0 6)} assume true; {15401#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:57,000 INFO L273 TraceCheckUtils]: 19: Hoare triple {15401#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15402#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:57,009 INFO L273 TraceCheckUtils]: 20: Hoare triple {15402#(<= main_~i~0 7)} assume true; {15402#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:57,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {15402#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15403#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:57,034 INFO L273 TraceCheckUtils]: 22: Hoare triple {15403#(<= main_~i~0 8)} assume true; {15403#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:57,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {15403#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15404#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:57,060 INFO L273 TraceCheckUtils]: 24: Hoare triple {15404#(<= main_~i~0 9)} assume true; {15404#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:57,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {15404#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15405#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:57,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {15405#(<= main_~i~0 10)} assume true; {15405#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:57,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {15405#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15406#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:57,108 INFO L273 TraceCheckUtils]: 28: Hoare triple {15406#(<= main_~i~0 11)} assume true; {15406#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:57,121 INFO L273 TraceCheckUtils]: 29: Hoare triple {15406#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15407#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:57,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {15407#(<= main_~i~0 12)} assume true; {15407#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:57,137 INFO L273 TraceCheckUtils]: 31: Hoare triple {15407#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15408#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:57,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {15408#(<= main_~i~0 13)} assume true; {15408#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:57,138 INFO L273 TraceCheckUtils]: 33: Hoare triple {15408#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15409#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:57,141 INFO L273 TraceCheckUtils]: 34: Hoare triple {15409#(<= main_~i~0 14)} assume true; {15409#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:57,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {15409#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15410#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:57,144 INFO L273 TraceCheckUtils]: 36: Hoare triple {15410#(<= main_~i~0 15)} assume true; {15410#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:57,144 INFO L273 TraceCheckUtils]: 37: Hoare triple {15410#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15411#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:57,145 INFO L273 TraceCheckUtils]: 38: Hoare triple {15411#(<= main_~i~0 16)} assume true; {15411#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:57,146 INFO L273 TraceCheckUtils]: 39: Hoare triple {15411#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15412#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:57,146 INFO L273 TraceCheckUtils]: 40: Hoare triple {15412#(<= main_~i~0 17)} assume true; {15412#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:57,147 INFO L273 TraceCheckUtils]: 41: Hoare triple {15412#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15413#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:57,148 INFO L273 TraceCheckUtils]: 42: Hoare triple {15413#(<= main_~i~0 18)} assume true; {15413#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:57,149 INFO L273 TraceCheckUtils]: 43: Hoare triple {15413#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15414#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:57,149 INFO L273 TraceCheckUtils]: 44: Hoare triple {15414#(<= main_~i~0 19)} assume true; {15414#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:57,150 INFO L273 TraceCheckUtils]: 45: Hoare triple {15414#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15415#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:57,151 INFO L273 TraceCheckUtils]: 46: Hoare triple {15415#(<= main_~i~0 20)} assume true; {15415#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:57,152 INFO L273 TraceCheckUtils]: 47: Hoare triple {15415#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15416#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:57,152 INFO L273 TraceCheckUtils]: 48: Hoare triple {15416#(<= main_~i~0 21)} assume true; {15416#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:57,153 INFO L273 TraceCheckUtils]: 49: Hoare triple {15416#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15417#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:57,154 INFO L273 TraceCheckUtils]: 50: Hoare triple {15417#(<= main_~i~0 22)} assume true; {15417#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:57,154 INFO L273 TraceCheckUtils]: 51: Hoare triple {15417#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15418#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:57,155 INFO L273 TraceCheckUtils]: 52: Hoare triple {15418#(<= main_~i~0 23)} assume true; {15418#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:57,156 INFO L273 TraceCheckUtils]: 53: Hoare triple {15418#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15419#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:57,156 INFO L273 TraceCheckUtils]: 54: Hoare triple {15419#(<= main_~i~0 24)} assume true; {15419#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:57,157 INFO L273 TraceCheckUtils]: 55: Hoare triple {15419#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15420#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:57,158 INFO L273 TraceCheckUtils]: 56: Hoare triple {15420#(<= main_~i~0 25)} assume true; {15420#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:57,159 INFO L273 TraceCheckUtils]: 57: Hoare triple {15420#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15421#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:57,159 INFO L273 TraceCheckUtils]: 58: Hoare triple {15421#(<= main_~i~0 26)} assume true; {15421#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:57,160 INFO L273 TraceCheckUtils]: 59: Hoare triple {15421#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15422#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:57,161 INFO L273 TraceCheckUtils]: 60: Hoare triple {15422#(<= main_~i~0 27)} assume true; {15422#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:57,162 INFO L273 TraceCheckUtils]: 61: Hoare triple {15422#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15423#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:57,162 INFO L273 TraceCheckUtils]: 62: Hoare triple {15423#(<= main_~i~0 28)} assume true; {15423#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:57,163 INFO L273 TraceCheckUtils]: 63: Hoare triple {15423#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15424#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:57,164 INFO L273 TraceCheckUtils]: 64: Hoare triple {15424#(<= main_~i~0 29)} assume true; {15424#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:57,164 INFO L273 TraceCheckUtils]: 65: Hoare triple {15424#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15425#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:57,165 INFO L273 TraceCheckUtils]: 66: Hoare triple {15425#(<= main_~i~0 30)} assume true; {15425#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:57,166 INFO L273 TraceCheckUtils]: 67: Hoare triple {15425#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15426#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:57,166 INFO L273 TraceCheckUtils]: 68: Hoare triple {15426#(<= main_~i~0 31)} assume true; {15426#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:57,167 INFO L273 TraceCheckUtils]: 69: Hoare triple {15426#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15427#(<= main_~i~0 32)} is VALID [2018-11-14 16:56:57,168 INFO L273 TraceCheckUtils]: 70: Hoare triple {15427#(<= main_~i~0 32)} assume true; {15427#(<= main_~i~0 32)} is VALID [2018-11-14 16:56:57,169 INFO L273 TraceCheckUtils]: 71: Hoare triple {15427#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15428#(<= main_~i~0 33)} is VALID [2018-11-14 16:56:57,169 INFO L273 TraceCheckUtils]: 72: Hoare triple {15428#(<= main_~i~0 33)} assume true; {15428#(<= main_~i~0 33)} is VALID [2018-11-14 16:56:57,170 INFO L273 TraceCheckUtils]: 73: Hoare triple {15428#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15429#(<= main_~i~0 34)} is VALID [2018-11-14 16:56:57,171 INFO L273 TraceCheckUtils]: 74: Hoare triple {15429#(<= main_~i~0 34)} assume true; {15429#(<= main_~i~0 34)} is VALID [2018-11-14 16:56:57,171 INFO L273 TraceCheckUtils]: 75: Hoare triple {15429#(<= main_~i~0 34)} assume !(~i~0 < 100000); {15394#false} is VALID [2018-11-14 16:56:57,171 INFO L273 TraceCheckUtils]: 76: Hoare triple {15394#false} havoc ~x~0;~x~0 := 0; {15394#false} is VALID [2018-11-14 16:56:57,172 INFO L273 TraceCheckUtils]: 77: Hoare triple {15394#false} assume true; {15394#false} is VALID [2018-11-14 16:56:57,172 INFO L273 TraceCheckUtils]: 78: Hoare triple {15394#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {15394#false} is VALID [2018-11-14 16:56:57,172 INFO L256 TraceCheckUtils]: 79: Hoare triple {15394#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {15394#false} is VALID [2018-11-14 16:56:57,172 INFO L273 TraceCheckUtils]: 80: Hoare triple {15394#false} ~cond := #in~cond; {15394#false} is VALID [2018-11-14 16:56:57,172 INFO L273 TraceCheckUtils]: 81: Hoare triple {15394#false} assume ~cond == 0; {15394#false} is VALID [2018-11-14 16:56:57,173 INFO L273 TraceCheckUtils]: 82: Hoare triple {15394#false} assume !false; {15394#false} is VALID [2018-11-14 16:56:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:57,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:57,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:57,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:56:57,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:56:57,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:57,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:57,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {15393#true} call ULTIMATE.init(); {15393#true} is VALID [2018-11-14 16:56:57,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {15393#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15393#true} is VALID [2018-11-14 16:56:57,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {15393#true} assume true; {15393#true} is VALID [2018-11-14 16:56:57,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15393#true} {15393#true} #50#return; {15393#true} is VALID [2018-11-14 16:56:57,486 INFO L256 TraceCheckUtils]: 4: Hoare triple {15393#true} call #t~ret2 := main(); {15393#true} is VALID [2018-11-14 16:56:57,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {15393#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15448#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:57,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {15448#(<= main_~i~0 0)} assume true; {15448#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:57,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {15448#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15396#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:57,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {15396#(<= main_~i~0 1)} assume true; {15396#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:57,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {15396#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15397#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:57,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {15397#(<= main_~i~0 2)} assume true; {15397#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:57,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {15397#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15398#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:57,490 INFO L273 TraceCheckUtils]: 12: Hoare triple {15398#(<= main_~i~0 3)} assume true; {15398#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:57,491 INFO L273 TraceCheckUtils]: 13: Hoare triple {15398#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15399#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:57,491 INFO L273 TraceCheckUtils]: 14: Hoare triple {15399#(<= main_~i~0 4)} assume true; {15399#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:57,492 INFO L273 TraceCheckUtils]: 15: Hoare triple {15399#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15400#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:57,493 INFO L273 TraceCheckUtils]: 16: Hoare triple {15400#(<= main_~i~0 5)} assume true; {15400#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:57,494 INFO L273 TraceCheckUtils]: 17: Hoare triple {15400#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15401#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:57,494 INFO L273 TraceCheckUtils]: 18: Hoare triple {15401#(<= main_~i~0 6)} assume true; {15401#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:57,495 INFO L273 TraceCheckUtils]: 19: Hoare triple {15401#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15402#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:57,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {15402#(<= main_~i~0 7)} assume true; {15402#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:57,496 INFO L273 TraceCheckUtils]: 21: Hoare triple {15402#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15403#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:57,497 INFO L273 TraceCheckUtils]: 22: Hoare triple {15403#(<= main_~i~0 8)} assume true; {15403#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:57,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {15403#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15404#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:57,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {15404#(<= main_~i~0 9)} assume true; {15404#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:57,499 INFO L273 TraceCheckUtils]: 25: Hoare triple {15404#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15405#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:57,500 INFO L273 TraceCheckUtils]: 26: Hoare triple {15405#(<= main_~i~0 10)} assume true; {15405#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:57,501 INFO L273 TraceCheckUtils]: 27: Hoare triple {15405#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15406#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:57,501 INFO L273 TraceCheckUtils]: 28: Hoare triple {15406#(<= main_~i~0 11)} assume true; {15406#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:57,502 INFO L273 TraceCheckUtils]: 29: Hoare triple {15406#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15407#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:57,503 INFO L273 TraceCheckUtils]: 30: Hoare triple {15407#(<= main_~i~0 12)} assume true; {15407#(<= main_~i~0 12)} is VALID [2018-11-14 16:56:57,504 INFO L273 TraceCheckUtils]: 31: Hoare triple {15407#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15408#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:57,504 INFO L273 TraceCheckUtils]: 32: Hoare triple {15408#(<= main_~i~0 13)} assume true; {15408#(<= main_~i~0 13)} is VALID [2018-11-14 16:56:57,505 INFO L273 TraceCheckUtils]: 33: Hoare triple {15408#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15409#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:57,505 INFO L273 TraceCheckUtils]: 34: Hoare triple {15409#(<= main_~i~0 14)} assume true; {15409#(<= main_~i~0 14)} is VALID [2018-11-14 16:56:57,506 INFO L273 TraceCheckUtils]: 35: Hoare triple {15409#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15410#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:57,507 INFO L273 TraceCheckUtils]: 36: Hoare triple {15410#(<= main_~i~0 15)} assume true; {15410#(<= main_~i~0 15)} is VALID [2018-11-14 16:56:57,508 INFO L273 TraceCheckUtils]: 37: Hoare triple {15410#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15411#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:57,508 INFO L273 TraceCheckUtils]: 38: Hoare triple {15411#(<= main_~i~0 16)} assume true; {15411#(<= main_~i~0 16)} is VALID [2018-11-14 16:56:57,509 INFO L273 TraceCheckUtils]: 39: Hoare triple {15411#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15412#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:57,510 INFO L273 TraceCheckUtils]: 40: Hoare triple {15412#(<= main_~i~0 17)} assume true; {15412#(<= main_~i~0 17)} is VALID [2018-11-14 16:56:57,511 INFO L273 TraceCheckUtils]: 41: Hoare triple {15412#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15413#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:57,511 INFO L273 TraceCheckUtils]: 42: Hoare triple {15413#(<= main_~i~0 18)} assume true; {15413#(<= main_~i~0 18)} is VALID [2018-11-14 16:56:57,512 INFO L273 TraceCheckUtils]: 43: Hoare triple {15413#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15414#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:57,512 INFO L273 TraceCheckUtils]: 44: Hoare triple {15414#(<= main_~i~0 19)} assume true; {15414#(<= main_~i~0 19)} is VALID [2018-11-14 16:56:57,513 INFO L273 TraceCheckUtils]: 45: Hoare triple {15414#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15415#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:57,514 INFO L273 TraceCheckUtils]: 46: Hoare triple {15415#(<= main_~i~0 20)} assume true; {15415#(<= main_~i~0 20)} is VALID [2018-11-14 16:56:57,515 INFO L273 TraceCheckUtils]: 47: Hoare triple {15415#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15416#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:57,515 INFO L273 TraceCheckUtils]: 48: Hoare triple {15416#(<= main_~i~0 21)} assume true; {15416#(<= main_~i~0 21)} is VALID [2018-11-14 16:56:57,516 INFO L273 TraceCheckUtils]: 49: Hoare triple {15416#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15417#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:57,517 INFO L273 TraceCheckUtils]: 50: Hoare triple {15417#(<= main_~i~0 22)} assume true; {15417#(<= main_~i~0 22)} is VALID [2018-11-14 16:56:57,518 INFO L273 TraceCheckUtils]: 51: Hoare triple {15417#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15418#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:57,518 INFO L273 TraceCheckUtils]: 52: Hoare triple {15418#(<= main_~i~0 23)} assume true; {15418#(<= main_~i~0 23)} is VALID [2018-11-14 16:56:57,519 INFO L273 TraceCheckUtils]: 53: Hoare triple {15418#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15419#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:57,519 INFO L273 TraceCheckUtils]: 54: Hoare triple {15419#(<= main_~i~0 24)} assume true; {15419#(<= main_~i~0 24)} is VALID [2018-11-14 16:56:57,520 INFO L273 TraceCheckUtils]: 55: Hoare triple {15419#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15420#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:57,521 INFO L273 TraceCheckUtils]: 56: Hoare triple {15420#(<= main_~i~0 25)} assume true; {15420#(<= main_~i~0 25)} is VALID [2018-11-14 16:56:57,522 INFO L273 TraceCheckUtils]: 57: Hoare triple {15420#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15421#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:57,522 INFO L273 TraceCheckUtils]: 58: Hoare triple {15421#(<= main_~i~0 26)} assume true; {15421#(<= main_~i~0 26)} is VALID [2018-11-14 16:56:57,523 INFO L273 TraceCheckUtils]: 59: Hoare triple {15421#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15422#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:57,524 INFO L273 TraceCheckUtils]: 60: Hoare triple {15422#(<= main_~i~0 27)} assume true; {15422#(<= main_~i~0 27)} is VALID [2018-11-14 16:56:57,525 INFO L273 TraceCheckUtils]: 61: Hoare triple {15422#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15423#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:57,525 INFO L273 TraceCheckUtils]: 62: Hoare triple {15423#(<= main_~i~0 28)} assume true; {15423#(<= main_~i~0 28)} is VALID [2018-11-14 16:56:57,526 INFO L273 TraceCheckUtils]: 63: Hoare triple {15423#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15424#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:57,527 INFO L273 TraceCheckUtils]: 64: Hoare triple {15424#(<= main_~i~0 29)} assume true; {15424#(<= main_~i~0 29)} is VALID [2018-11-14 16:56:57,527 INFO L273 TraceCheckUtils]: 65: Hoare triple {15424#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15425#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:57,528 INFO L273 TraceCheckUtils]: 66: Hoare triple {15425#(<= main_~i~0 30)} assume true; {15425#(<= main_~i~0 30)} is VALID [2018-11-14 16:56:57,529 INFO L273 TraceCheckUtils]: 67: Hoare triple {15425#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15426#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:57,529 INFO L273 TraceCheckUtils]: 68: Hoare triple {15426#(<= main_~i~0 31)} assume true; {15426#(<= main_~i~0 31)} is VALID [2018-11-14 16:56:57,530 INFO L273 TraceCheckUtils]: 69: Hoare triple {15426#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15427#(<= main_~i~0 32)} is VALID [2018-11-14 16:56:57,531 INFO L273 TraceCheckUtils]: 70: Hoare triple {15427#(<= main_~i~0 32)} assume true; {15427#(<= main_~i~0 32)} is VALID [2018-11-14 16:56:57,532 INFO L273 TraceCheckUtils]: 71: Hoare triple {15427#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15428#(<= main_~i~0 33)} is VALID [2018-11-14 16:56:57,532 INFO L273 TraceCheckUtils]: 72: Hoare triple {15428#(<= main_~i~0 33)} assume true; {15428#(<= main_~i~0 33)} is VALID [2018-11-14 16:56:57,533 INFO L273 TraceCheckUtils]: 73: Hoare triple {15428#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15429#(<= main_~i~0 34)} is VALID [2018-11-14 16:56:57,534 INFO L273 TraceCheckUtils]: 74: Hoare triple {15429#(<= main_~i~0 34)} assume true; {15429#(<= main_~i~0 34)} is VALID [2018-11-14 16:56:57,534 INFO L273 TraceCheckUtils]: 75: Hoare triple {15429#(<= main_~i~0 34)} assume !(~i~0 < 100000); {15394#false} is VALID [2018-11-14 16:56:57,534 INFO L273 TraceCheckUtils]: 76: Hoare triple {15394#false} havoc ~x~0;~x~0 := 0; {15394#false} is VALID [2018-11-14 16:56:57,535 INFO L273 TraceCheckUtils]: 77: Hoare triple {15394#false} assume true; {15394#false} is VALID [2018-11-14 16:56:57,535 INFO L273 TraceCheckUtils]: 78: Hoare triple {15394#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {15394#false} is VALID [2018-11-14 16:56:57,535 INFO L256 TraceCheckUtils]: 79: Hoare triple {15394#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {15394#false} is VALID [2018-11-14 16:56:57,535 INFO L273 TraceCheckUtils]: 80: Hoare triple {15394#false} ~cond := #in~cond; {15394#false} is VALID [2018-11-14 16:56:57,535 INFO L273 TraceCheckUtils]: 81: Hoare triple {15394#false} assume ~cond == 0; {15394#false} is VALID [2018-11-14 16:56:57,536 INFO L273 TraceCheckUtils]: 82: Hoare triple {15394#false} assume !false; {15394#false} is VALID [2018-11-14 16:56:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:56:57,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:57,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-14 16:56:57,562 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2018-11-14 16:56:57,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:57,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 16:56:57,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:57,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 16:56:57,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 16:56:57,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 16:56:57,747 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 38 states.