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_init2_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:46:13,712 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:46:13,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:46:13,732 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:46:13,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:46:13,734 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:46:13,735 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:46:13,739 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:46:13,740 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:46:13,744 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:46:13,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:46:13,747 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:46:13,748 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:46:13,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:46:13,753 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:46:13,754 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:46:13,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:46:13,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:46:13,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:46:13,772 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:46:13,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:46:13,776 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:46:13,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:46:13,780 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:46:13,781 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:46:13,781 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:46:13,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:46:13,785 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:46:13,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:46:13,787 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:46:13,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:46:13,788 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:46:13,788 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:46:13,788 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:46:13,789 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:46:13,790 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:46:13,790 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-18 22:46:13,805 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:46:13,806 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:46:13,806 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:46:13,807 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:46:13,807 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:46:13,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:46:13,808 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:46:13,808 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:46:13,808 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:46:13,808 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:46:13,808 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:46:13,809 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:46:13,809 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:46:13,809 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:46:13,809 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:46:13,809 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:46:13,810 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:46:13,810 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:46:13,810 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:46:13,810 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:46:13,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:46:13,811 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:46:13,811 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:46:13,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:46:13,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:46:13,811 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:46:13,812 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:46:13,812 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:46:13,812 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:46:13,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:46:13,812 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:46:13,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:46:13,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:46:13,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:46:13,888 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:46:13,889 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:46:13,889 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init2_false-unreach-call_ground.i [2018-11-18 22:46:13,950 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9e940ad/c82a409100794bbfb2bec650f77d6621/FLAGe340d7e33 [2018-11-18 22:46:14,406 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:46:14,407 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init2_false-unreach-call_ground.i [2018-11-18 22:46:14,413 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9e940ad/c82a409100794bbfb2bec650f77d6621/FLAGe340d7e33 [2018-11-18 22:46:14,777 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9e940ad/c82a409100794bbfb2bec650f77d6621 [2018-11-18 22:46:14,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:46:14,794 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:46:14,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:46:14,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:46:14,801 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:46:14,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:46:14" (1/1) ... [2018-11-18 22:46:14,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289ef1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:14, skipping insertion in model container [2018-11-18 22:46:14,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:46:14" (1/1) ... [2018-11-18 22:46:14,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:46:14,840 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:46:15,096 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:46:15,101 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:46:15,132 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:46:15,164 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:46:15,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:15 WrapperNode [2018-11-18 22:46:15,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:46:15,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:46:15,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:46:15,167 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:46:15,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:15" (1/1) ... [2018-11-18 22:46:15,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:15" (1/1) ... [2018-11-18 22:46:15,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:15" (1/1) ... [2018-11-18 22:46:15,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:15" (1/1) ... [2018-11-18 22:46:15,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:15" (1/1) ... [2018-11-18 22:46:15,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:15" (1/1) ... [2018-11-18 22:46:15,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:15" (1/1) ... [2018-11-18 22:46:15,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:46:15,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:46:15,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:46:15,232 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:46:15,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:15" (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-18 22:46:15,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:46:15,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:46:15,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:46:15,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:46:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:46:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:46:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:46:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:46:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:46:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:46:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:46:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:46:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:46:15,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:46:15,895 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:46:15,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:46:15 BoogieIcfgContainer [2018-11-18 22:46:15,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:46:15,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:46:15,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:46:15,901 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:46:15,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:46:14" (1/3) ... [2018-11-18 22:46:15,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372dbeff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:46:15, skipping insertion in model container [2018-11-18 22:46:15,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:15" (2/3) ... [2018-11-18 22:46:15,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372dbeff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:46:15, skipping insertion in model container [2018-11-18 22:46:15,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:46:15" (3/3) ... [2018-11-18 22:46:15,905 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init2_false-unreach-call_ground.i [2018-11-18 22:46:15,915 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:46:15,924 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:46:15,938 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:46:15,972 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:46:15,973 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:46:15,973 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:46:15,974 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:46:15,974 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:46:15,975 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:46:15,975 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:46:15,975 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:46:15,976 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:46:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-18 22:46:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 22:46:16,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:16,003 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:16,006 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:16,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:16,012 INFO L82 PathProgramCache]: Analyzing trace with hash 339384385, now seen corresponding path program 1 times [2018-11-18 22:46:16,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:16,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:16,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:16,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:16,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:16,191 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-18 22:46:16,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31#true} is VALID [2018-11-18 22:46:16,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-18 22:46:16,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #64#return; {31#true} is VALID [2018-11-18 22:46:16,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2018-11-18 22:46:16,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {31#true} is VALID [2018-11-18 22:46:16,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-18 22:46:16,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#false} ~i~0 := 0; {32#false} is VALID [2018-11-18 22:46:16,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} assume !true; {32#false} is VALID [2018-11-18 22:46:16,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} havoc ~x~0;~x~0 := 0; {32#false} is VALID [2018-11-18 22:46:16,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {32#false} assume true; {32#false} is VALID [2018-11-18 22:46:16,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {32#false} is VALID [2018-11-18 22:46:16,213 INFO L256 TraceCheckUtils]: 12: Hoare triple {32#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {32#false} is VALID [2018-11-18 22:46:16,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-18 22:46:16,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2018-11-18 22:46:16,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-18 22:46:16,218 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-18 22:46:16,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:46:16,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:46:16,226 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 22:46:16,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:16,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:46:16,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:16,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:46:16,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:46:16,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:46:16,330 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-18 22:46:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:16,590 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-18 22:46:16,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:46:16,590 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 22:46:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:46:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2018-11-18 22:46:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:46:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2018-11-18 22:46:16,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 59 transitions. [2018-11-18 22:46:16,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:16,914 INFO L225 Difference]: With dead ends: 48 [2018-11-18 22:46:16,914 INFO L226 Difference]: Without dead ends: 23 [2018-11-18 22:46:16,918 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-18 22:46:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-18 22:46:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 22:46:16,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:16,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-18 22:46:16,958 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-18 22:46:16,958 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-18 22:46:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:16,962 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-18 22:46:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-18 22:46:16,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:16,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:16,963 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-18 22:46:16,964 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-18 22:46:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:16,968 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-18 22:46:16,968 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-18 22:46:16,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:16,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:16,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:16,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:46:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-18 22:46:16,974 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2018-11-18 22:46:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:16,974 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 22:46:16,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:46:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-18 22:46:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 22:46:16,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:16,976 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:16,976 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:16,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:16,977 INFO L82 PathProgramCache]: Analyzing trace with hash -665726485, now seen corresponding path program 1 times [2018-11-18 22:46:16,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:16,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:16,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:16,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:16,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:17,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2018-11-18 22:46:17,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {174#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {174#true} is VALID [2018-11-18 22:46:17,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {174#true} assume true; {174#true} is VALID [2018-11-18 22:46:17,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {174#true} {174#true} #64#return; {174#true} is VALID [2018-11-18 22:46:17,146 INFO L256 TraceCheckUtils]: 4: Hoare triple {174#true} call #t~ret2 := main(); {174#true} is VALID [2018-11-18 22:46:17,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {174#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {176#(= main_~i~0 0)} is VALID [2018-11-18 22:46:17,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {176#(= main_~i~0 0)} assume true; {176#(= main_~i~0 0)} is VALID [2018-11-18 22:46:17,181 INFO L273 TraceCheckUtils]: 7: Hoare triple {176#(= main_~i~0 0)} assume !(~i~0 < 100000); {175#false} is VALID [2018-11-18 22:46:17,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {175#false} ~i~0 := 0; {175#false} is VALID [2018-11-18 22:46:17,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {175#false} assume true; {175#false} is VALID [2018-11-18 22:46:17,182 INFO L273 TraceCheckUtils]: 10: Hoare triple {175#false} assume !(~i~0 < 100000); {175#false} is VALID [2018-11-18 22:46:17,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {175#false} havoc ~x~0;~x~0 := 0; {175#false} is VALID [2018-11-18 22:46:17,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {175#false} assume true; {175#false} is VALID [2018-11-18 22:46:17,183 INFO L273 TraceCheckUtils]: 13: Hoare triple {175#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {175#false} is VALID [2018-11-18 22:46:17,183 INFO L256 TraceCheckUtils]: 14: Hoare triple {175#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {175#false} is VALID [2018-11-18 22:46:17,183 INFO L273 TraceCheckUtils]: 15: Hoare triple {175#false} ~cond := #in~cond; {175#false} is VALID [2018-11-18 22:46:17,184 INFO L273 TraceCheckUtils]: 16: Hoare triple {175#false} assume 0 == ~cond; {175#false} is VALID [2018-11-18 22:46:17,184 INFO L273 TraceCheckUtils]: 17: Hoare triple {175#false} assume !false; {175#false} is VALID [2018-11-18 22:46:17,186 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-18 22:46:17,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:46:17,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:46:17,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 22:46:17,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:17,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:46:17,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:17,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:46:17,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:46:17,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:46:17,229 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2018-11-18 22:46:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:17,378 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-18 22:46:17,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:46:17,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 22:46:17,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:46:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-18 22:46:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:46:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-18 22:46:17,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2018-11-18 22:46:17,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:17,647 INFO L225 Difference]: With dead ends: 42 [2018-11-18 22:46:17,647 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 22:46:17,648 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-18 22:46:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 22:46:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-18 22:46:17,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:17,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-18 22:46:17,780 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-18 22:46:17,781 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-18 22:46:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:17,783 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-18 22:46:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-18 22:46:17,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:17,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:17,784 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-18 22:46:17,785 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-18 22:46:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:17,787 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-18 22:46:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-18 22:46:17,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:17,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:17,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:17,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:46:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-18 22:46:17,791 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-18 22:46:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:17,792 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-18 22:46:17,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:46:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-18 22:46:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 22:46:17,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:17,793 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:17,793 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:17,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1817372075, now seen corresponding path program 1 times [2018-11-18 22:46:17,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:17,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:17,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:17,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:17,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:17,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {328#true} call ULTIMATE.init(); {328#true} is VALID [2018-11-18 22:46:17,916 INFO L273 TraceCheckUtils]: 1: Hoare triple {328#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {328#true} is VALID [2018-11-18 22:46:17,916 INFO L273 TraceCheckUtils]: 2: Hoare triple {328#true} assume true; {328#true} is VALID [2018-11-18 22:46:17,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {328#true} {328#true} #64#return; {328#true} is VALID [2018-11-18 22:46:17,917 INFO L256 TraceCheckUtils]: 4: Hoare triple {328#true} call #t~ret2 := main(); {328#true} is VALID [2018-11-18 22:46:17,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {328#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {330#(= main_~i~0 0)} is VALID [2018-11-18 22:46:17,920 INFO L273 TraceCheckUtils]: 6: Hoare triple {330#(= main_~i~0 0)} assume true; {330#(= main_~i~0 0)} is VALID [2018-11-18 22:46:17,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {330#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {331#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:17,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {331#(<= main_~i~0 1)} assume true; {331#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:17,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {331#(<= main_~i~0 1)} assume !(~i~0 < 100000); {329#false} is VALID [2018-11-18 22:46:17,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {329#false} ~i~0 := 0; {329#false} is VALID [2018-11-18 22:46:17,927 INFO L273 TraceCheckUtils]: 11: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-18 22:46:17,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {329#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {329#false} is VALID [2018-11-18 22:46:17,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-18 22:46:17,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {329#false} assume !(~i~0 < 100000); {329#false} is VALID [2018-11-18 22:46:17,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {329#false} havoc ~x~0;~x~0 := 0; {329#false} is VALID [2018-11-18 22:46:17,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-18 22:46:17,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {329#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {329#false} is VALID [2018-11-18 22:46:17,929 INFO L256 TraceCheckUtils]: 18: Hoare triple {329#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {329#false} is VALID [2018-11-18 22:46:17,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {329#false} ~cond := #in~cond; {329#false} is VALID [2018-11-18 22:46:17,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {329#false} assume 0 == ~cond; {329#false} is VALID [2018-11-18 22:46:17,930 INFO L273 TraceCheckUtils]: 21: Hoare triple {329#false} assume !false; {329#false} is VALID [2018-11-18 22:46:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:46:17,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:17,932 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-18 22:46:17,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:17,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:18,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {328#true} call ULTIMATE.init(); {328#true} is VALID [2018-11-18 22:46:18,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {328#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {328#true} is VALID [2018-11-18 22:46:18,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {328#true} assume true; {328#true} is VALID [2018-11-18 22:46:18,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {328#true} {328#true} #64#return; {328#true} is VALID [2018-11-18 22:46:18,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {328#true} call #t~ret2 := main(); {328#true} is VALID [2018-11-18 22:46:18,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {328#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {350#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:18,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {350#(<= main_~i~0 0)} assume true; {350#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:18,111 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {331#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:18,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {331#(<= main_~i~0 1)} assume true; {331#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:18,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {331#(<= main_~i~0 1)} assume !(~i~0 < 100000); {329#false} is VALID [2018-11-18 22:46:18,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {329#false} ~i~0 := 0; {329#false} is VALID [2018-11-18 22:46:18,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-18 22:46:18,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {329#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {329#false} is VALID [2018-11-18 22:46:18,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-18 22:46:18,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {329#false} assume !(~i~0 < 100000); {329#false} is VALID [2018-11-18 22:46:18,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {329#false} havoc ~x~0;~x~0 := 0; {329#false} is VALID [2018-11-18 22:46:18,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {329#false} assume true; {329#false} is VALID [2018-11-18 22:46:18,123 INFO L273 TraceCheckUtils]: 17: Hoare triple {329#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {329#false} is VALID [2018-11-18 22:46:18,123 INFO L256 TraceCheckUtils]: 18: Hoare triple {329#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {329#false} is VALID [2018-11-18 22:46:18,124 INFO L273 TraceCheckUtils]: 19: Hoare triple {329#false} ~cond := #in~cond; {329#false} is VALID [2018-11-18 22:46:18,124 INFO L273 TraceCheckUtils]: 20: Hoare triple {329#false} assume 0 == ~cond; {329#false} is VALID [2018-11-18 22:46:18,124 INFO L273 TraceCheckUtils]: 21: Hoare triple {329#false} assume !false; {329#false} is VALID [2018-11-18 22:46:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:46:18,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:18,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:46:18,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 22:46:18,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:18,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:46:18,285 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-18 22:46:18,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:46:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:46:18,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:46:18,286 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2018-11-18 22:46:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:18,627 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-18 22:46:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:46:18,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 22:46:18,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:46:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-18 22:46:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:46:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-18 22:46:18,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-18 22:46:18,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:18,734 INFO L225 Difference]: With dead ends: 48 [2018-11-18 22:46:18,734 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 22:46:18,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:46:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 22:46:18,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 22:46:18,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:18,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-18 22:46:18,763 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 22:46:18,763 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 22:46:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:18,766 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-18 22:46:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-18 22:46:18,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:18,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:18,767 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 22:46:18,767 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 22:46:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:18,770 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-18 22:46:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-18 22:46:18,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:18,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:18,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:18,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 22:46:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-18 22:46:18,773 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2018-11-18 22:46:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:18,774 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-18 22:46:18,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:46:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-18 22:46:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 22:46:18,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:18,775 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:18,775 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:18,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1737156203, now seen corresponding path program 2 times [2018-11-18 22:46:18,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:18,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:18,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:18,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:18,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:18,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {570#true} call ULTIMATE.init(); {570#true} is VALID [2018-11-18 22:46:18,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {570#true} is VALID [2018-11-18 22:46:18,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {570#true} assume true; {570#true} is VALID [2018-11-18 22:46:18,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {570#true} {570#true} #64#return; {570#true} is VALID [2018-11-18 22:46:18,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {570#true} call #t~ret2 := main(); {570#true} is VALID [2018-11-18 22:46:18,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {570#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {572#(= main_~i~0 0)} is VALID [2018-11-18 22:46:18,935 INFO L273 TraceCheckUtils]: 6: Hoare triple {572#(= main_~i~0 0)} assume true; {572#(= main_~i~0 0)} is VALID [2018-11-18 22:46:18,936 INFO L273 TraceCheckUtils]: 7: Hoare triple {572#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {573#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:18,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#(<= main_~i~0 1)} assume true; {573#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:18,937 INFO L273 TraceCheckUtils]: 9: Hoare triple {573#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {574#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:18,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {574#(<= main_~i~0 2)} assume true; {574#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:18,939 INFO L273 TraceCheckUtils]: 11: Hoare triple {574#(<= main_~i~0 2)} assume !(~i~0 < 100000); {571#false} is VALID [2018-11-18 22:46:18,940 INFO L273 TraceCheckUtils]: 12: Hoare triple {571#false} ~i~0 := 0; {571#false} is VALID [2018-11-18 22:46:18,940 INFO L273 TraceCheckUtils]: 13: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:46:18,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {571#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {571#false} is VALID [2018-11-18 22:46:18,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:46:18,941 INFO L273 TraceCheckUtils]: 16: Hoare triple {571#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {571#false} is VALID [2018-11-18 22:46:18,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:46:18,942 INFO L273 TraceCheckUtils]: 18: Hoare triple {571#false} assume !(~i~0 < 100000); {571#false} is VALID [2018-11-18 22:46:18,943 INFO L273 TraceCheckUtils]: 19: Hoare triple {571#false} havoc ~x~0;~x~0 := 0; {571#false} is VALID [2018-11-18 22:46:18,943 INFO L273 TraceCheckUtils]: 20: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:46:18,943 INFO L273 TraceCheckUtils]: 21: Hoare triple {571#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {571#false} is VALID [2018-11-18 22:46:18,944 INFO L256 TraceCheckUtils]: 22: Hoare triple {571#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {571#false} is VALID [2018-11-18 22:46:18,944 INFO L273 TraceCheckUtils]: 23: Hoare triple {571#false} ~cond := #in~cond; {571#false} is VALID [2018-11-18 22:46:18,944 INFO L273 TraceCheckUtils]: 24: Hoare triple {571#false} assume 0 == ~cond; {571#false} is VALID [2018-11-18 22:46:18,944 INFO L273 TraceCheckUtils]: 25: Hoare triple {571#false} assume !false; {571#false} is VALID [2018-11-18 22:46:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 22:46:18,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:18,946 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-18 22:46:18,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:46:18,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:46:18,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:19,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:19,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {570#true} call ULTIMATE.init(); {570#true} is VALID [2018-11-18 22:46:19,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {570#true} is VALID [2018-11-18 22:46:19,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {570#true} assume true; {570#true} is VALID [2018-11-18 22:46:19,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {570#true} {570#true} #64#return; {570#true} is VALID [2018-11-18 22:46:19,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {570#true} call #t~ret2 := main(); {570#true} is VALID [2018-11-18 22:46:19,129 INFO L273 TraceCheckUtils]: 5: Hoare triple {570#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {593#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:19,130 INFO L273 TraceCheckUtils]: 6: Hoare triple {593#(<= main_~i~0 0)} assume true; {593#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:19,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {593#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {573#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:19,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#(<= main_~i~0 1)} assume true; {573#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:19,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {573#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {574#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:19,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {574#(<= main_~i~0 2)} assume true; {574#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:19,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {574#(<= main_~i~0 2)} assume !(~i~0 < 100000); {571#false} is VALID [2018-11-18 22:46:19,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {571#false} ~i~0 := 0; {571#false} is VALID [2018-11-18 22:46:19,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:46:19,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {571#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {571#false} is VALID [2018-11-18 22:46:19,138 INFO L273 TraceCheckUtils]: 15: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:46:19,138 INFO L273 TraceCheckUtils]: 16: Hoare triple {571#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {571#false} is VALID [2018-11-18 22:46:19,139 INFO L273 TraceCheckUtils]: 17: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:46:19,139 INFO L273 TraceCheckUtils]: 18: Hoare triple {571#false} assume !(~i~0 < 100000); {571#false} is VALID [2018-11-18 22:46:19,139 INFO L273 TraceCheckUtils]: 19: Hoare triple {571#false} havoc ~x~0;~x~0 := 0; {571#false} is VALID [2018-11-18 22:46:19,140 INFO L273 TraceCheckUtils]: 20: Hoare triple {571#false} assume true; {571#false} is VALID [2018-11-18 22:46:19,140 INFO L273 TraceCheckUtils]: 21: Hoare triple {571#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {571#false} is VALID [2018-11-18 22:46:19,140 INFO L256 TraceCheckUtils]: 22: Hoare triple {571#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {571#false} is VALID [2018-11-18 22:46:19,140 INFO L273 TraceCheckUtils]: 23: Hoare triple {571#false} ~cond := #in~cond; {571#false} is VALID [2018-11-18 22:46:19,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {571#false} assume 0 == ~cond; {571#false} is VALID [2018-11-18 22:46:19,141 INFO L273 TraceCheckUtils]: 25: Hoare triple {571#false} assume !false; {571#false} is VALID [2018-11-18 22:46:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 22:46:19,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:19,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 22:46:19,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-18 22:46:19,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:19,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:46:19,222 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-18 22:46:19,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:46:19,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:46:19,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:46:19,223 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 6 states. [2018-11-18 22:46:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:19,470 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-18 22:46:19,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:46:19,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-18 22:46:19,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:46:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-18 22:46:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:46:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-18 22:46:19,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2018-11-18 22:46:19,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:19,556 INFO L225 Difference]: With dead ends: 54 [2018-11-18 22:46:19,556 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 22:46:19,557 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-18 22:46:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 22:46:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-18 22:46:19,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:19,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-18 22:46:19,580 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-18 22:46:19,580 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-18 22:46:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:19,582 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-18 22:46:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-18 22:46:19,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:19,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:19,583 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-18 22:46:19,583 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-18 22:46:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:19,586 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-18 22:46:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-18 22:46:19,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:19,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:19,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:19,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 22:46:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-18 22:46:19,590 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 26 [2018-11-18 22:46:19,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:19,590 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-18 22:46:19,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:46:19,590 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-18 22:46:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 22:46:19,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:19,592 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:19,592 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:19,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:19,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1942219733, now seen corresponding path program 3 times [2018-11-18 22:46:19,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:19,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:19,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:19,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:19,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:19,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2018-11-18 22:46:19,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {848#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {848#true} is VALID [2018-11-18 22:46:19,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-18 22:46:19,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #64#return; {848#true} is VALID [2018-11-18 22:46:19,730 INFO L256 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret2 := main(); {848#true} is VALID [2018-11-18 22:46:19,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {848#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {850#(= main_~i~0 0)} is VALID [2018-11-18 22:46:19,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {850#(= main_~i~0 0)} assume true; {850#(= main_~i~0 0)} is VALID [2018-11-18 22:46:19,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {850#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {851#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:19,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {851#(<= main_~i~0 1)} assume true; {851#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:19,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {851#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {852#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:19,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {852#(<= main_~i~0 2)} assume true; {852#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:19,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {852#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {853#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:19,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {853#(<= main_~i~0 3)} assume true; {853#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:19,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {853#(<= main_~i~0 3)} assume !(~i~0 < 100000); {849#false} is VALID [2018-11-18 22:46:19,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {849#false} ~i~0 := 0; {849#false} is VALID [2018-11-18 22:46:19,739 INFO L273 TraceCheckUtils]: 15: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-18 22:46:19,739 INFO L273 TraceCheckUtils]: 16: Hoare triple {849#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {849#false} is VALID [2018-11-18 22:46:19,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-18 22:46:19,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {849#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {849#false} is VALID [2018-11-18 22:46:19,740 INFO L273 TraceCheckUtils]: 19: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-18 22:46:19,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {849#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {849#false} is VALID [2018-11-18 22:46:19,741 INFO L273 TraceCheckUtils]: 21: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-18 22:46:19,741 INFO L273 TraceCheckUtils]: 22: Hoare triple {849#false} assume !(~i~0 < 100000); {849#false} is VALID [2018-11-18 22:46:19,742 INFO L273 TraceCheckUtils]: 23: Hoare triple {849#false} havoc ~x~0;~x~0 := 0; {849#false} is VALID [2018-11-18 22:46:19,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-18 22:46:19,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {849#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {849#false} is VALID [2018-11-18 22:46:19,742 INFO L256 TraceCheckUtils]: 26: Hoare triple {849#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {849#false} is VALID [2018-11-18 22:46:19,743 INFO L273 TraceCheckUtils]: 27: Hoare triple {849#false} ~cond := #in~cond; {849#false} is VALID [2018-11-18 22:46:19,743 INFO L273 TraceCheckUtils]: 28: Hoare triple {849#false} assume 0 == ~cond; {849#false} is VALID [2018-11-18 22:46:19,743 INFO L273 TraceCheckUtils]: 29: Hoare triple {849#false} assume !false; {849#false} is VALID [2018-11-18 22:46:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 22:46:19,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:19,745 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-18 22:46:19,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:46:19,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 22:46:19,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:19,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:19,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2018-11-18 22:46:19,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {848#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {848#true} is VALID [2018-11-18 22:46:19,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-18 22:46:19,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #64#return; {848#true} is VALID [2018-11-18 22:46:19,894 INFO L256 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret2 := main(); {848#true} is VALID [2018-11-18 22:46:19,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {848#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {848#true} is VALID [2018-11-18 22:46:19,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-18 22:46:19,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {848#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {848#true} is VALID [2018-11-18 22:46:19,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-18 22:46:19,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {848#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {848#true} is VALID [2018-11-18 22:46:19,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-18 22:46:19,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {848#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {848#true} is VALID [2018-11-18 22:46:19,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {848#true} assume true; {848#true} is VALID [2018-11-18 22:46:19,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {848#true} assume !(~i~0 < 100000); {848#true} is VALID [2018-11-18 22:46:19,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {848#true} ~i~0 := 0; {899#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:19,897 INFO L273 TraceCheckUtils]: 15: Hoare triple {899#(<= main_~i~0 0)} assume true; {899#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:19,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {899#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {851#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:19,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {851#(<= main_~i~0 1)} assume true; {851#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:19,911 INFO L273 TraceCheckUtils]: 18: Hoare triple {851#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {852#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:19,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {852#(<= main_~i~0 2)} assume true; {852#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:19,913 INFO L273 TraceCheckUtils]: 20: Hoare triple {852#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {853#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:19,914 INFO L273 TraceCheckUtils]: 21: Hoare triple {853#(<= main_~i~0 3)} assume true; {853#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:19,914 INFO L273 TraceCheckUtils]: 22: Hoare triple {853#(<= main_~i~0 3)} assume !(~i~0 < 100000); {849#false} is VALID [2018-11-18 22:46:19,914 INFO L273 TraceCheckUtils]: 23: Hoare triple {849#false} havoc ~x~0;~x~0 := 0; {849#false} is VALID [2018-11-18 22:46:19,915 INFO L273 TraceCheckUtils]: 24: Hoare triple {849#false} assume true; {849#false} is VALID [2018-11-18 22:46:19,915 INFO L273 TraceCheckUtils]: 25: Hoare triple {849#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {849#false} is VALID [2018-11-18 22:46:19,916 INFO L256 TraceCheckUtils]: 26: Hoare triple {849#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {849#false} is VALID [2018-11-18 22:46:19,916 INFO L273 TraceCheckUtils]: 27: Hoare triple {849#false} ~cond := #in~cond; {849#false} is VALID [2018-11-18 22:46:19,916 INFO L273 TraceCheckUtils]: 28: Hoare triple {849#false} assume 0 == ~cond; {849#false} is VALID [2018-11-18 22:46:19,917 INFO L273 TraceCheckUtils]: 29: Hoare triple {849#false} assume !false; {849#false} is VALID [2018-11-18 22:46:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 22:46:19,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:19,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 22:46:19,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-18 22:46:19,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:19,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:46:19,986 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-18 22:46:19,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:46:19,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:46:19,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:46:19,987 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 7 states. [2018-11-18 22:46:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:20,182 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-18 22:46:20,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:46:20,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-18 22:46:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:46:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2018-11-18 22:46:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:46:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2018-11-18 22:46:20,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2018-11-18 22:46:20,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:20,383 INFO L225 Difference]: With dead ends: 60 [2018-11-18 22:46:20,384 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 22:46:20,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-18 22:46:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 22:46:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 22:46:20,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:20,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-18 22:46:20,406 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-18 22:46:20,406 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-18 22:46:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:20,409 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-18 22:46:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-18 22:46:20,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:20,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:20,410 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-18 22:46:20,410 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-18 22:46:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:20,413 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-18 22:46:20,413 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-18 22:46:20,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:20,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:20,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:20,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 22:46:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-18 22:46:20,416 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 30 [2018-11-18 22:46:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:20,417 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-18 22:46:20,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:46:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-18 22:46:20,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 22:46:20,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:20,418 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:20,418 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:20,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:20,419 INFO L82 PathProgramCache]: Analyzing trace with hash -732385557, now seen corresponding path program 4 times [2018-11-18 22:46:20,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:20,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:20,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:20,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:20,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:20,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID [2018-11-18 22:46:20,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {1162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1162#true} is VALID [2018-11-18 22:46:20,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2018-11-18 22:46:20,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #64#return; {1162#true} is VALID [2018-11-18 22:46:20,629 INFO L256 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret2 := main(); {1162#true} is VALID [2018-11-18 22:46:20,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {1162#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1164#(= main_~i~0 0)} is VALID [2018-11-18 22:46:20,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {1164#(= main_~i~0 0)} assume true; {1164#(= main_~i~0 0)} is VALID [2018-11-18 22:46:20,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {1164#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1165#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:20,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {1165#(<= main_~i~0 1)} assume true; {1165#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:20,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {1165#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1166#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:20,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {1166#(<= main_~i~0 2)} assume true; {1166#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:20,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {1166#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1167#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:20,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {1167#(<= main_~i~0 3)} assume true; {1167#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:20,666 INFO L273 TraceCheckUtils]: 13: Hoare triple {1167#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1168#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:20,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {1168#(<= main_~i~0 4)} assume true; {1168#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:20,682 INFO L273 TraceCheckUtils]: 15: Hoare triple {1168#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1163#false} is VALID [2018-11-18 22:46:20,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {1163#false} ~i~0 := 0; {1163#false} is VALID [2018-11-18 22:46:20,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:46:20,683 INFO L273 TraceCheckUtils]: 18: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:46:20,683 INFO L273 TraceCheckUtils]: 19: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:46:20,683 INFO L273 TraceCheckUtils]: 20: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:46:20,684 INFO L273 TraceCheckUtils]: 21: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:46:20,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:46:20,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:46:20,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:46:20,684 INFO L273 TraceCheckUtils]: 25: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:46:20,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {1163#false} assume !(~i~0 < 100000); {1163#false} is VALID [2018-11-18 22:46:20,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {1163#false} havoc ~x~0;~x~0 := 0; {1163#false} is VALID [2018-11-18 22:46:20,685 INFO L273 TraceCheckUtils]: 28: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:46:20,685 INFO L273 TraceCheckUtils]: 29: Hoare triple {1163#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1163#false} is VALID [2018-11-18 22:46:20,685 INFO L256 TraceCheckUtils]: 30: Hoare triple {1163#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1163#false} is VALID [2018-11-18 22:46:20,686 INFO L273 TraceCheckUtils]: 31: Hoare triple {1163#false} ~cond := #in~cond; {1163#false} is VALID [2018-11-18 22:46:20,686 INFO L273 TraceCheckUtils]: 32: Hoare triple {1163#false} assume 0 == ~cond; {1163#false} is VALID [2018-11-18 22:46:20,686 INFO L273 TraceCheckUtils]: 33: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2018-11-18 22:46:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 22:46:20,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:20,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 22:46:20,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:46:20,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:46:20,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:20,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:20,975 INFO L256 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID [2018-11-18 22:46:20,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {1162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1162#true} is VALID [2018-11-18 22:46:20,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2018-11-18 22:46:20,976 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #64#return; {1162#true} is VALID [2018-11-18 22:46:20,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret2 := main(); {1162#true} is VALID [2018-11-18 22:46:20,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {1162#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1187#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:20,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {1187#(<= main_~i~0 0)} assume true; {1187#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:20,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {1187#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1165#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:20,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {1165#(<= main_~i~0 1)} assume true; {1165#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:20,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {1165#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1166#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:20,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {1166#(<= main_~i~0 2)} assume true; {1166#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:20,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {1166#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1167#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:20,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {1167#(<= main_~i~0 3)} assume true; {1167#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:20,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {1167#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1168#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:20,990 INFO L273 TraceCheckUtils]: 14: Hoare triple {1168#(<= main_~i~0 4)} assume true; {1168#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:20,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {1168#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1163#false} is VALID [2018-11-18 22:46:20,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {1163#false} ~i~0 := 0; {1163#false} is VALID [2018-11-18 22:46:20,992 INFO L273 TraceCheckUtils]: 17: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:46:20,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:46:20,993 INFO L273 TraceCheckUtils]: 19: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:46:20,993 INFO L273 TraceCheckUtils]: 20: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:46:20,993 INFO L273 TraceCheckUtils]: 21: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:46:20,993 INFO L273 TraceCheckUtils]: 22: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:46:20,994 INFO L273 TraceCheckUtils]: 23: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:46:20,994 INFO L273 TraceCheckUtils]: 24: Hoare triple {1163#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#false} is VALID [2018-11-18 22:46:20,994 INFO L273 TraceCheckUtils]: 25: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:46:20,994 INFO L273 TraceCheckUtils]: 26: Hoare triple {1163#false} assume !(~i~0 < 100000); {1163#false} is VALID [2018-11-18 22:46:20,994 INFO L273 TraceCheckUtils]: 27: Hoare triple {1163#false} havoc ~x~0;~x~0 := 0; {1163#false} is VALID [2018-11-18 22:46:20,995 INFO L273 TraceCheckUtils]: 28: Hoare triple {1163#false} assume true; {1163#false} is VALID [2018-11-18 22:46:20,995 INFO L273 TraceCheckUtils]: 29: Hoare triple {1163#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1163#false} is VALID [2018-11-18 22:46:20,995 INFO L256 TraceCheckUtils]: 30: Hoare triple {1163#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1163#false} is VALID [2018-11-18 22:46:20,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {1163#false} ~cond := #in~cond; {1163#false} is VALID [2018-11-18 22:46:20,996 INFO L273 TraceCheckUtils]: 32: Hoare triple {1163#false} assume 0 == ~cond; {1163#false} is VALID [2018-11-18 22:46:20,996 INFO L273 TraceCheckUtils]: 33: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2018-11-18 22:46:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 22:46:21,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:21,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:46:21,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-18 22:46:21,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:21,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:46:21,073 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-18 22:46:21,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:46:21,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:46:21,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:46:21,074 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 8 states. [2018-11-18 22:46:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:21,206 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-11-18 22:46:21,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:46:21,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-18 22:46:21,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:21,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:46:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-18 22:46:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:46:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-18 22:46:21,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2018-11-18 22:46:21,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:21,335 INFO L225 Difference]: With dead ends: 66 [2018-11-18 22:46:21,335 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 22:46:21,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 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-18 22:46:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 22:46:21,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-18 22:46:21,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:21,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-18 22:46:21,363 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-18 22:46:21,363 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-18 22:46:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:21,365 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-18 22:46:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-18 22:46:21,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:21,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:21,366 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-18 22:46:21,366 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-18 22:46:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:21,368 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-18 22:46:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-18 22:46:21,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:21,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:21,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:21,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:46:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-18 22:46:21,372 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 34 [2018-11-18 22:46:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:21,372 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-18 22:46:21,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:46:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-18 22:46:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 22:46:21,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:21,376 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:21,376 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:21,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:21,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1518143829, now seen corresponding path program 5 times [2018-11-18 22:46:21,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:21,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:21,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:21,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:21,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:21,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {1512#true} call ULTIMATE.init(); {1512#true} is VALID [2018-11-18 22:46:21,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {1512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1512#true} is VALID [2018-11-18 22:46:21,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:46:21,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1512#true} {1512#true} #64#return; {1512#true} is VALID [2018-11-18 22:46:21,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {1512#true} call #t~ret2 := main(); {1512#true} is VALID [2018-11-18 22:46:21,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {1512#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1514#(= main_~i~0 0)} is VALID [2018-11-18 22:46:21,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {1514#(= main_~i~0 0)} assume true; {1514#(= main_~i~0 0)} is VALID [2018-11-18 22:46:21,682 INFO L273 TraceCheckUtils]: 7: Hoare triple {1514#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1515#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:21,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {1515#(<= main_~i~0 1)} assume true; {1515#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:21,683 INFO L273 TraceCheckUtils]: 9: Hoare triple {1515#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1516#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:21,684 INFO L273 TraceCheckUtils]: 10: Hoare triple {1516#(<= main_~i~0 2)} assume true; {1516#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:21,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {1516#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1517#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:21,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {1517#(<= main_~i~0 3)} assume true; {1517#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:21,687 INFO L273 TraceCheckUtils]: 13: Hoare triple {1517#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1518#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:21,687 INFO L273 TraceCheckUtils]: 14: Hoare triple {1518#(<= main_~i~0 4)} assume true; {1518#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:21,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {1518#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1519#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:21,689 INFO L273 TraceCheckUtils]: 16: Hoare triple {1519#(<= main_~i~0 5)} assume true; {1519#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:21,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {1519#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1513#false} is VALID [2018-11-18 22:46:21,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {1513#false} ~i~0 := 0; {1513#false} is VALID [2018-11-18 22:46:21,691 INFO L273 TraceCheckUtils]: 19: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:46:21,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1513#false} is VALID [2018-11-18 22:46:21,691 INFO L273 TraceCheckUtils]: 21: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:46:21,692 INFO L273 TraceCheckUtils]: 22: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1513#false} is VALID [2018-11-18 22:46:21,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:46:21,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1513#false} is VALID [2018-11-18 22:46:21,693 INFO L273 TraceCheckUtils]: 25: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:46:21,693 INFO L273 TraceCheckUtils]: 26: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1513#false} is VALID [2018-11-18 22:46:21,693 INFO L273 TraceCheckUtils]: 27: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:46:21,693 INFO L273 TraceCheckUtils]: 28: Hoare triple {1513#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1513#false} is VALID [2018-11-18 22:46:21,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:46:21,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {1513#false} assume !(~i~0 < 100000); {1513#false} is VALID [2018-11-18 22:46:21,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {1513#false} havoc ~x~0;~x~0 := 0; {1513#false} is VALID [2018-11-18 22:46:21,694 INFO L273 TraceCheckUtils]: 32: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:46:21,694 INFO L273 TraceCheckUtils]: 33: Hoare triple {1513#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1513#false} is VALID [2018-11-18 22:46:21,695 INFO L256 TraceCheckUtils]: 34: Hoare triple {1513#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1513#false} is VALID [2018-11-18 22:46:21,695 INFO L273 TraceCheckUtils]: 35: Hoare triple {1513#false} ~cond := #in~cond; {1513#false} is VALID [2018-11-18 22:46:21,695 INFO L273 TraceCheckUtils]: 36: Hoare triple {1513#false} assume 0 == ~cond; {1513#false} is VALID [2018-11-18 22:46:21,695 INFO L273 TraceCheckUtils]: 37: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2018-11-18 22:46:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 22:46:21,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:21,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 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-18 22:46:21,708 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:46:21,793 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:46:21,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:21,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:21,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {1512#true} call ULTIMATE.init(); {1512#true} is VALID [2018-11-18 22:46:21,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {1512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1512#true} is VALID [2018-11-18 22:46:21,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:46:21,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1512#true} {1512#true} #64#return; {1512#true} is VALID [2018-11-18 22:46:21,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {1512#true} call #t~ret2 := main(); {1512#true} is VALID [2018-11-18 22:46:21,918 INFO L273 TraceCheckUtils]: 5: Hoare triple {1512#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1512#true} is VALID [2018-11-18 22:46:21,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:46:21,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1512#true} is VALID [2018-11-18 22:46:21,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:46:21,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1512#true} is VALID [2018-11-18 22:46:21,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:46:21,920 INFO L273 TraceCheckUtils]: 11: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1512#true} is VALID [2018-11-18 22:46:21,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:46:21,921 INFO L273 TraceCheckUtils]: 13: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1512#true} is VALID [2018-11-18 22:46:21,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:46:21,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {1512#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1512#true} is VALID [2018-11-18 22:46:21,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {1512#true} assume true; {1512#true} is VALID [2018-11-18 22:46:21,922 INFO L273 TraceCheckUtils]: 17: Hoare triple {1512#true} assume !(~i~0 < 100000); {1512#true} is VALID [2018-11-18 22:46:21,922 INFO L273 TraceCheckUtils]: 18: Hoare triple {1512#true} ~i~0 := 0; {1577#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:21,923 INFO L273 TraceCheckUtils]: 19: Hoare triple {1577#(<= main_~i~0 0)} assume true; {1577#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:21,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {1577#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1515#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:21,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {1515#(<= main_~i~0 1)} assume true; {1515#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:21,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {1515#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1516#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:21,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {1516#(<= main_~i~0 2)} assume true; {1516#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:21,926 INFO L273 TraceCheckUtils]: 24: Hoare triple {1516#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1517#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:21,927 INFO L273 TraceCheckUtils]: 25: Hoare triple {1517#(<= main_~i~0 3)} assume true; {1517#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:21,928 INFO L273 TraceCheckUtils]: 26: Hoare triple {1517#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1518#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:21,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {1518#(<= main_~i~0 4)} assume true; {1518#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:21,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {1518#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1519#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:21,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {1519#(<= main_~i~0 5)} assume true; {1519#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:21,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {1519#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1513#false} is VALID [2018-11-18 22:46:21,932 INFO L273 TraceCheckUtils]: 31: Hoare triple {1513#false} havoc ~x~0;~x~0 := 0; {1513#false} is VALID [2018-11-18 22:46:21,932 INFO L273 TraceCheckUtils]: 32: Hoare triple {1513#false} assume true; {1513#false} is VALID [2018-11-18 22:46:21,932 INFO L273 TraceCheckUtils]: 33: Hoare triple {1513#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1513#false} is VALID [2018-11-18 22:46:21,933 INFO L256 TraceCheckUtils]: 34: Hoare triple {1513#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1513#false} is VALID [2018-11-18 22:46:21,933 INFO L273 TraceCheckUtils]: 35: Hoare triple {1513#false} ~cond := #in~cond; {1513#false} is VALID [2018-11-18 22:46:21,933 INFO L273 TraceCheckUtils]: 36: Hoare triple {1513#false} assume 0 == ~cond; {1513#false} is VALID [2018-11-18 22:46:21,934 INFO L273 TraceCheckUtils]: 37: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2018-11-18 22:46:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 22:46:21,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:21,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 22:46:21,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-18 22:46:21,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:21,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:46:22,018 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-18 22:46:22,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:46:22,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:46:22,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:46:22,019 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 9 states. [2018-11-18 22:46:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:22,231 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-11-18 22:46:22,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:46:22,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-18 22:46:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:46:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2018-11-18 22:46:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:46:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2018-11-18 22:46:22,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 67 transitions. [2018-11-18 22:46:22,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:22,319 INFO L225 Difference]: With dead ends: 72 [2018-11-18 22:46:22,320 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 22:46:22,321 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:46:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 22:46:22,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-18 22:46:22,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:22,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-18 22:46:22,343 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-18 22:46:22,343 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-18 22:46:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:22,346 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-18 22:46:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-18 22:46:22,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:22,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:22,347 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-18 22:46:22,347 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-18 22:46:22,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:22,349 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-18 22:46:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-18 22:46:22,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:22,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:22,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:22,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:46:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-18 22:46:22,352 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 38 [2018-11-18 22:46:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:22,353 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-18 22:46:22,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:46:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-18 22:46:22,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 22:46:22,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:22,354 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:22,354 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:22,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:22,355 INFO L82 PathProgramCache]: Analyzing trace with hash 84749163, now seen corresponding path program 6 times [2018-11-18 22:46:22,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:22,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:22,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:22,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:22,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:22,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2018-11-18 22:46:22,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {1898#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1898#true} is VALID [2018-11-18 22:46:22,519 INFO L273 TraceCheckUtils]: 2: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:46:22,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1898#true} {1898#true} #64#return; {1898#true} is VALID [2018-11-18 22:46:22,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {1898#true} call #t~ret2 := main(); {1898#true} is VALID [2018-11-18 22:46:22,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {1898#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1900#(= main_~i~0 0)} is VALID [2018-11-18 22:46:22,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {1900#(= main_~i~0 0)} assume true; {1900#(= main_~i~0 0)} is VALID [2018-11-18 22:46:22,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {1900#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1901#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:22,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {1901#(<= main_~i~0 1)} assume true; {1901#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:22,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {1901#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1902#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:22,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {1902#(<= main_~i~0 2)} assume true; {1902#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:22,526 INFO L273 TraceCheckUtils]: 11: Hoare triple {1902#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1903#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:22,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {1903#(<= main_~i~0 3)} assume true; {1903#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:22,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {1903#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1904#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:22,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {1904#(<= main_~i~0 4)} assume true; {1904#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:22,530 INFO L273 TraceCheckUtils]: 15: Hoare triple {1904#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1905#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:22,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {1905#(<= main_~i~0 5)} assume true; {1905#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:22,539 INFO L273 TraceCheckUtils]: 17: Hoare triple {1905#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1906#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:22,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {1906#(<= main_~i~0 6)} assume true; {1906#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:22,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {1906#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1899#false} is VALID [2018-11-18 22:46:22,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {1899#false} ~i~0 := 0; {1899#false} is VALID [2018-11-18 22:46:22,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:46:22,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1899#false} is VALID [2018-11-18 22:46:22,542 INFO L273 TraceCheckUtils]: 23: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:46:22,542 INFO L273 TraceCheckUtils]: 24: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1899#false} is VALID [2018-11-18 22:46:22,542 INFO L273 TraceCheckUtils]: 25: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:46:22,542 INFO L273 TraceCheckUtils]: 26: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1899#false} is VALID [2018-11-18 22:46:22,543 INFO L273 TraceCheckUtils]: 27: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:46:22,543 INFO L273 TraceCheckUtils]: 28: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1899#false} is VALID [2018-11-18 22:46:22,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:46:22,543 INFO L273 TraceCheckUtils]: 30: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1899#false} is VALID [2018-11-18 22:46:22,543 INFO L273 TraceCheckUtils]: 31: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:46:22,544 INFO L273 TraceCheckUtils]: 32: Hoare triple {1899#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1899#false} is VALID [2018-11-18 22:46:22,544 INFO L273 TraceCheckUtils]: 33: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:46:22,544 INFO L273 TraceCheckUtils]: 34: Hoare triple {1899#false} assume !(~i~0 < 100000); {1899#false} is VALID [2018-11-18 22:46:22,544 INFO L273 TraceCheckUtils]: 35: Hoare triple {1899#false} havoc ~x~0;~x~0 := 0; {1899#false} is VALID [2018-11-18 22:46:22,544 INFO L273 TraceCheckUtils]: 36: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:46:22,544 INFO L273 TraceCheckUtils]: 37: Hoare triple {1899#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1899#false} is VALID [2018-11-18 22:46:22,545 INFO L256 TraceCheckUtils]: 38: Hoare triple {1899#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1899#false} is VALID [2018-11-18 22:46:22,545 INFO L273 TraceCheckUtils]: 39: Hoare triple {1899#false} ~cond := #in~cond; {1899#false} is VALID [2018-11-18 22:46:22,545 INFO L273 TraceCheckUtils]: 40: Hoare triple {1899#false} assume 0 == ~cond; {1899#false} is VALID [2018-11-18 22:46:22,545 INFO L273 TraceCheckUtils]: 41: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2018-11-18 22:46:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 22:46:22,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:22,548 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-18 22:46:22,557 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:46:22,626 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 22:46:22,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:22,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:22,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2018-11-18 22:46:22,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {1898#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1898#true} is VALID [2018-11-18 22:46:22,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:46:22,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1898#true} {1898#true} #64#return; {1898#true} is VALID [2018-11-18 22:46:22,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {1898#true} call #t~ret2 := main(); {1898#true} is VALID [2018-11-18 22:46:22,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {1898#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1898#true} is VALID [2018-11-18 22:46:22,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:46:22,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1898#true} is VALID [2018-11-18 22:46:22,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:46:22,903 INFO L273 TraceCheckUtils]: 9: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1898#true} is VALID [2018-11-18 22:46:22,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:46:22,904 INFO L273 TraceCheckUtils]: 11: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1898#true} is VALID [2018-11-18 22:46:22,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:46:22,904 INFO L273 TraceCheckUtils]: 13: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1898#true} is VALID [2018-11-18 22:46:22,905 INFO L273 TraceCheckUtils]: 14: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:46:22,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1898#true} is VALID [2018-11-18 22:46:22,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-18 22:46:22,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {1898#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1961#(<= main_~i~0 100000)} is VALID [2018-11-18 22:46:22,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {1961#(<= main_~i~0 100000)} assume true; {1961#(<= main_~i~0 100000)} is VALID [2018-11-18 22:46:22,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {1961#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {1898#true} is VALID [2018-11-18 22:46:22,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {1898#true} ~i~0 := 0; {1971#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:22,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {1971#(<= main_~i~0 0)} assume true; {1971#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:22,914 INFO L273 TraceCheckUtils]: 22: Hoare triple {1971#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1901#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:22,914 INFO L273 TraceCheckUtils]: 23: Hoare triple {1901#(<= main_~i~0 1)} assume true; {1901#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:22,915 INFO L273 TraceCheckUtils]: 24: Hoare triple {1901#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1902#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:22,916 INFO L273 TraceCheckUtils]: 25: Hoare triple {1902#(<= main_~i~0 2)} assume true; {1902#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:22,917 INFO L273 TraceCheckUtils]: 26: Hoare triple {1902#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1903#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:22,917 INFO L273 TraceCheckUtils]: 27: Hoare triple {1903#(<= main_~i~0 3)} assume true; {1903#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:22,918 INFO L273 TraceCheckUtils]: 28: Hoare triple {1903#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1904#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:22,918 INFO L273 TraceCheckUtils]: 29: Hoare triple {1904#(<= main_~i~0 4)} assume true; {1904#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:22,919 INFO L273 TraceCheckUtils]: 30: Hoare triple {1904#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1905#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:22,919 INFO L273 TraceCheckUtils]: 31: Hoare triple {1905#(<= main_~i~0 5)} assume true; {1905#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:22,920 INFO L273 TraceCheckUtils]: 32: Hoare triple {1905#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1906#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:22,921 INFO L273 TraceCheckUtils]: 33: Hoare triple {1906#(<= main_~i~0 6)} assume true; {1906#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:22,921 INFO L273 TraceCheckUtils]: 34: Hoare triple {1906#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1899#false} is VALID [2018-11-18 22:46:22,922 INFO L273 TraceCheckUtils]: 35: Hoare triple {1899#false} havoc ~x~0;~x~0 := 0; {1899#false} is VALID [2018-11-18 22:46:22,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {1899#false} assume true; {1899#false} is VALID [2018-11-18 22:46:22,922 INFO L273 TraceCheckUtils]: 37: Hoare triple {1899#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1899#false} is VALID [2018-11-18 22:46:22,923 INFO L256 TraceCheckUtils]: 38: Hoare triple {1899#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1899#false} is VALID [2018-11-18 22:46:22,923 INFO L273 TraceCheckUtils]: 39: Hoare triple {1899#false} ~cond := #in~cond; {1899#false} is VALID [2018-11-18 22:46:22,923 INFO L273 TraceCheckUtils]: 40: Hoare triple {1899#false} assume 0 == ~cond; {1899#false} is VALID [2018-11-18 22:46:22,923 INFO L273 TraceCheckUtils]: 41: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2018-11-18 22:46:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 22:46:22,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:22,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-11-18 22:46:22,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-11-18 22:46:22,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:22,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:46:22,998 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-18 22:46:22,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:46:22,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:46:22,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:46:23,000 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 11 states. [2018-11-18 22:46:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:23,395 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-18 22:46:23,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:46:23,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-11-18 22:46:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:46:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2018-11-18 22:46:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:46:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2018-11-18 22:46:23,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2018-11-18 22:46:23,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:23,528 INFO L225 Difference]: With dead ends: 78 [2018-11-18 22:46:23,528 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 22:46:23,528 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:46:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 22:46:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-18 22:46:23,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:23,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-18 22:46:23,572 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-18 22:46:23,572 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-18 22:46:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:23,575 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-18 22:46:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-18 22:46:23,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:23,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:23,575 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-18 22:46:23,576 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-18 22:46:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:23,578 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-18 22:46:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-18 22:46:23,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:23,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:23,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:23,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 22:46:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-18 22:46:23,594 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 42 [2018-11-18 22:46:23,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:23,595 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-18 22:46:23,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:46:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-18 22:46:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 22:46:23,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:23,596 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:23,596 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:23,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:23,598 INFO L82 PathProgramCache]: Analyzing trace with hash -872837845, now seen corresponding path program 7 times [2018-11-18 22:46:23,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:23,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:23,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:23,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:23,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:23,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {2321#true} call ULTIMATE.init(); {2321#true} is VALID [2018-11-18 22:46:23,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {2321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2321#true} is VALID [2018-11-18 22:46:23,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {2321#true} assume true; {2321#true} is VALID [2018-11-18 22:46:23,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2321#true} {2321#true} #64#return; {2321#true} is VALID [2018-11-18 22:46:23,850 INFO L256 TraceCheckUtils]: 4: Hoare triple {2321#true} call #t~ret2 := main(); {2321#true} is VALID [2018-11-18 22:46:23,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {2321#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2323#(= main_~i~0 0)} is VALID [2018-11-18 22:46:23,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {2323#(= main_~i~0 0)} assume true; {2323#(= main_~i~0 0)} is VALID [2018-11-18 22:46:23,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {2323#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2324#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:23,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {2324#(<= main_~i~0 1)} assume true; {2324#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:23,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {2324#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2325#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:23,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 2)} assume true; {2325#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:23,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {2325#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2326#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:23,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 3)} assume true; {2326#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:23,856 INFO L273 TraceCheckUtils]: 13: Hoare triple {2326#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2327#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:23,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {2327#(<= main_~i~0 4)} assume true; {2327#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:23,857 INFO L273 TraceCheckUtils]: 15: Hoare triple {2327#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2328#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:23,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {2328#(<= main_~i~0 5)} assume true; {2328#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:23,859 INFO L273 TraceCheckUtils]: 17: Hoare triple {2328#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2329#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:23,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {2329#(<= main_~i~0 6)} assume true; {2329#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:23,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {2329#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2330#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:23,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {2330#(<= main_~i~0 7)} assume true; {2330#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:23,862 INFO L273 TraceCheckUtils]: 21: Hoare triple {2330#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2322#false} is VALID [2018-11-18 22:46:23,862 INFO L273 TraceCheckUtils]: 22: Hoare triple {2322#false} ~i~0 := 0; {2322#false} is VALID [2018-11-18 22:46:23,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:23,863 INFO L273 TraceCheckUtils]: 24: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:23,863 INFO L273 TraceCheckUtils]: 25: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:23,863 INFO L273 TraceCheckUtils]: 26: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:23,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:23,864 INFO L273 TraceCheckUtils]: 28: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:23,864 INFO L273 TraceCheckUtils]: 29: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:23,864 INFO L273 TraceCheckUtils]: 30: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:23,864 INFO L273 TraceCheckUtils]: 31: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:23,865 INFO L273 TraceCheckUtils]: 32: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:23,865 INFO L273 TraceCheckUtils]: 33: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:23,865 INFO L273 TraceCheckUtils]: 34: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:23,865 INFO L273 TraceCheckUtils]: 35: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:23,866 INFO L273 TraceCheckUtils]: 36: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:23,866 INFO L273 TraceCheckUtils]: 37: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:23,866 INFO L273 TraceCheckUtils]: 38: Hoare triple {2322#false} assume !(~i~0 < 100000); {2322#false} is VALID [2018-11-18 22:46:23,866 INFO L273 TraceCheckUtils]: 39: Hoare triple {2322#false} havoc ~x~0;~x~0 := 0; {2322#false} is VALID [2018-11-18 22:46:23,866 INFO L273 TraceCheckUtils]: 40: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:23,866 INFO L273 TraceCheckUtils]: 41: Hoare triple {2322#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2322#false} is VALID [2018-11-18 22:46:23,867 INFO L256 TraceCheckUtils]: 42: Hoare triple {2322#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2322#false} is VALID [2018-11-18 22:46:23,867 INFO L273 TraceCheckUtils]: 43: Hoare triple {2322#false} ~cond := #in~cond; {2322#false} is VALID [2018-11-18 22:46:23,867 INFO L273 TraceCheckUtils]: 44: Hoare triple {2322#false} assume 0 == ~cond; {2322#false} is VALID [2018-11-18 22:46:23,867 INFO L273 TraceCheckUtils]: 45: Hoare triple {2322#false} assume !false; {2322#false} is VALID [2018-11-18 22:46:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-18 22:46:23,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:23,869 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-18 22:46:23,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:23,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:24,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {2321#true} call ULTIMATE.init(); {2321#true} is VALID [2018-11-18 22:46:24,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {2321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2321#true} is VALID [2018-11-18 22:46:24,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {2321#true} assume true; {2321#true} is VALID [2018-11-18 22:46:24,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2321#true} {2321#true} #64#return; {2321#true} is VALID [2018-11-18 22:46:24,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {2321#true} call #t~ret2 := main(); {2321#true} is VALID [2018-11-18 22:46:24,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {2321#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2349#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:24,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {2349#(<= main_~i~0 0)} assume true; {2349#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:24,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {2349#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2324#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:24,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {2324#(<= main_~i~0 1)} assume true; {2324#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:24,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {2324#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2325#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:24,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 2)} assume true; {2325#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:24,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {2325#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2326#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:24,638 INFO L273 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 3)} assume true; {2326#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:24,648 INFO L273 TraceCheckUtils]: 13: Hoare triple {2326#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2327#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:24,648 INFO L273 TraceCheckUtils]: 14: Hoare triple {2327#(<= main_~i~0 4)} assume true; {2327#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:24,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {2327#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2328#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:24,653 INFO L273 TraceCheckUtils]: 16: Hoare triple {2328#(<= main_~i~0 5)} assume true; {2328#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:24,653 INFO L273 TraceCheckUtils]: 17: Hoare triple {2328#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2329#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:24,654 INFO L273 TraceCheckUtils]: 18: Hoare triple {2329#(<= main_~i~0 6)} assume true; {2329#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:24,654 INFO L273 TraceCheckUtils]: 19: Hoare triple {2329#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2330#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:24,655 INFO L273 TraceCheckUtils]: 20: Hoare triple {2330#(<= main_~i~0 7)} assume true; {2330#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:24,655 INFO L273 TraceCheckUtils]: 21: Hoare triple {2330#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2322#false} is VALID [2018-11-18 22:46:24,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {2322#false} ~i~0 := 0; {2322#false} is VALID [2018-11-18 22:46:24,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:24,656 INFO L273 TraceCheckUtils]: 24: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:24,656 INFO L273 TraceCheckUtils]: 25: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:24,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:24,656 INFO L273 TraceCheckUtils]: 27: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:24,656 INFO L273 TraceCheckUtils]: 28: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:24,656 INFO L273 TraceCheckUtils]: 29: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:24,656 INFO L273 TraceCheckUtils]: 30: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:24,657 INFO L273 TraceCheckUtils]: 31: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:24,657 INFO L273 TraceCheckUtils]: 32: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:24,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:24,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:24,657 INFO L273 TraceCheckUtils]: 35: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:24,657 INFO L273 TraceCheckUtils]: 36: Hoare triple {2322#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2322#false} is VALID [2018-11-18 22:46:24,657 INFO L273 TraceCheckUtils]: 37: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:24,657 INFO L273 TraceCheckUtils]: 38: Hoare triple {2322#false} assume !(~i~0 < 100000); {2322#false} is VALID [2018-11-18 22:46:24,658 INFO L273 TraceCheckUtils]: 39: Hoare triple {2322#false} havoc ~x~0;~x~0 := 0; {2322#false} is VALID [2018-11-18 22:46:24,658 INFO L273 TraceCheckUtils]: 40: Hoare triple {2322#false} assume true; {2322#false} is VALID [2018-11-18 22:46:24,658 INFO L273 TraceCheckUtils]: 41: Hoare triple {2322#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2322#false} is VALID [2018-11-18 22:46:24,658 INFO L256 TraceCheckUtils]: 42: Hoare triple {2322#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2322#false} is VALID [2018-11-18 22:46:24,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {2322#false} ~cond := #in~cond; {2322#false} is VALID [2018-11-18 22:46:24,658 INFO L273 TraceCheckUtils]: 44: Hoare triple {2322#false} assume 0 == ~cond; {2322#false} is VALID [2018-11-18 22:46:24,658 INFO L273 TraceCheckUtils]: 45: Hoare triple {2322#false} assume !false; {2322#false} is VALID [2018-11-18 22:46:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-18 22:46:24,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:24,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:46:24,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-18 22:46:24,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:24,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:46:24,708 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-18 22:46:24,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:46:24,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:46:24,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:46:24,709 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 11 states. [2018-11-18 22:46:24,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:24,998 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-18 22:46:24,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:46:24,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-18 22:46:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:46:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2018-11-18 22:46:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:46:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2018-11-18 22:46:25,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2018-11-18 22:46:25,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:25,096 INFO L225 Difference]: With dead ends: 84 [2018-11-18 22:46:25,096 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 22:46:25,097 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:46:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 22:46:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-18 22:46:25,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:25,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-18 22:46:25,122 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-18 22:46:25,123 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-18 22:46:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:25,126 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-18 22:46:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-18 22:46:25,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:25,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:25,126 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-18 22:46:25,126 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-18 22:46:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:25,128 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-18 22:46:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-18 22:46:25,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:25,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:25,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:25,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 22:46:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-18 22:46:25,131 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 46 [2018-11-18 22:46:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:25,131 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-18 22:46:25,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:46:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-18 22:46:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 22:46:25,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:25,132 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:25,132 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:25,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:25,133 INFO L82 PathProgramCache]: Analyzing trace with hash -621126677, now seen corresponding path program 8 times [2018-11-18 22:46:25,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:25,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:25,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:25,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:25,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:25,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {2779#true} call ULTIMATE.init(); {2779#true} is VALID [2018-11-18 22:46:25,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {2779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2779#true} is VALID [2018-11-18 22:46:25,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {2779#true} assume true; {2779#true} is VALID [2018-11-18 22:46:25,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2779#true} {2779#true} #64#return; {2779#true} is VALID [2018-11-18 22:46:25,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {2779#true} call #t~ret2 := main(); {2779#true} is VALID [2018-11-18 22:46:25,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {2779#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2781#(= main_~i~0 0)} is VALID [2018-11-18 22:46:25,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {2781#(= main_~i~0 0)} assume true; {2781#(= main_~i~0 0)} is VALID [2018-11-18 22:46:25,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {2781#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2782#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:25,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {2782#(<= main_~i~0 1)} assume true; {2782#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:25,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {2782#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2783#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:25,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {2783#(<= main_~i~0 2)} assume true; {2783#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:25,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {2783#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2784#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:25,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {2784#(<= main_~i~0 3)} assume true; {2784#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:25,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {2784#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2785#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:25,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {2785#(<= main_~i~0 4)} assume true; {2785#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:25,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {2785#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2786#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:25,357 INFO L273 TraceCheckUtils]: 16: Hoare triple {2786#(<= main_~i~0 5)} assume true; {2786#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:25,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {2786#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2787#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:25,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {2787#(<= main_~i~0 6)} assume true; {2787#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:25,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {2787#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2788#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:25,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {2788#(<= main_~i~0 7)} assume true; {2788#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:25,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {2788#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2789#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:25,360 INFO L273 TraceCheckUtils]: 22: Hoare triple {2789#(<= main_~i~0 8)} assume true; {2789#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:25,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {2789#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2780#false} is VALID [2018-11-18 22:46:25,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {2780#false} ~i~0 := 0; {2780#false} is VALID [2018-11-18 22:46:25,361 INFO L273 TraceCheckUtils]: 25: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,362 INFO L273 TraceCheckUtils]: 26: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,362 INFO L273 TraceCheckUtils]: 27: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,362 INFO L273 TraceCheckUtils]: 28: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,362 INFO L273 TraceCheckUtils]: 29: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,363 INFO L273 TraceCheckUtils]: 30: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,363 INFO L273 TraceCheckUtils]: 31: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,363 INFO L273 TraceCheckUtils]: 32: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,363 INFO L273 TraceCheckUtils]: 33: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,363 INFO L273 TraceCheckUtils]: 34: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,364 INFO L273 TraceCheckUtils]: 35: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,364 INFO L273 TraceCheckUtils]: 36: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,364 INFO L273 TraceCheckUtils]: 37: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,364 INFO L273 TraceCheckUtils]: 38: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,364 INFO L273 TraceCheckUtils]: 39: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,364 INFO L273 TraceCheckUtils]: 40: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,364 INFO L273 TraceCheckUtils]: 41: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,365 INFO L273 TraceCheckUtils]: 42: Hoare triple {2780#false} assume !(~i~0 < 100000); {2780#false} is VALID [2018-11-18 22:46:25,365 INFO L273 TraceCheckUtils]: 43: Hoare triple {2780#false} havoc ~x~0;~x~0 := 0; {2780#false} is VALID [2018-11-18 22:46:25,365 INFO L273 TraceCheckUtils]: 44: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,365 INFO L273 TraceCheckUtils]: 45: Hoare triple {2780#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2780#false} is VALID [2018-11-18 22:46:25,365 INFO L256 TraceCheckUtils]: 46: Hoare triple {2780#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2780#false} is VALID [2018-11-18 22:46:25,365 INFO L273 TraceCheckUtils]: 47: Hoare triple {2780#false} ~cond := #in~cond; {2780#false} is VALID [2018-11-18 22:46:25,365 INFO L273 TraceCheckUtils]: 48: Hoare triple {2780#false} assume 0 == ~cond; {2780#false} is VALID [2018-11-18 22:46:25,366 INFO L273 TraceCheckUtils]: 49: Hoare triple {2780#false} assume !false; {2780#false} is VALID [2018-11-18 22:46:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 22:46:25,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:25,367 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-18 22:46:25,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:46:25,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:46:25,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:25,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:25,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {2779#true} call ULTIMATE.init(); {2779#true} is VALID [2018-11-18 22:46:25,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {2779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2779#true} is VALID [2018-11-18 22:46:25,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {2779#true} assume true; {2779#true} is VALID [2018-11-18 22:46:25,564 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2779#true} {2779#true} #64#return; {2779#true} is VALID [2018-11-18 22:46:25,564 INFO L256 TraceCheckUtils]: 4: Hoare triple {2779#true} call #t~ret2 := main(); {2779#true} is VALID [2018-11-18 22:46:25,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {2779#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2808#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:25,565 INFO L273 TraceCheckUtils]: 6: Hoare triple {2808#(<= main_~i~0 0)} assume true; {2808#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:25,566 INFO L273 TraceCheckUtils]: 7: Hoare triple {2808#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2782#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:25,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {2782#(<= main_~i~0 1)} assume true; {2782#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:25,567 INFO L273 TraceCheckUtils]: 9: Hoare triple {2782#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2783#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:25,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {2783#(<= main_~i~0 2)} assume true; {2783#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:25,568 INFO L273 TraceCheckUtils]: 11: Hoare triple {2783#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2784#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:25,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {2784#(<= main_~i~0 3)} assume true; {2784#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:25,569 INFO L273 TraceCheckUtils]: 13: Hoare triple {2784#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2785#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:25,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {2785#(<= main_~i~0 4)} assume true; {2785#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:25,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {2785#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2786#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:25,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {2786#(<= main_~i~0 5)} assume true; {2786#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:25,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {2786#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2787#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:25,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {2787#(<= main_~i~0 6)} assume true; {2787#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:25,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {2787#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2788#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:25,575 INFO L273 TraceCheckUtils]: 20: Hoare triple {2788#(<= main_~i~0 7)} assume true; {2788#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:25,576 INFO L273 TraceCheckUtils]: 21: Hoare triple {2788#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2789#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:25,577 INFO L273 TraceCheckUtils]: 22: Hoare triple {2789#(<= main_~i~0 8)} assume true; {2789#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:25,578 INFO L273 TraceCheckUtils]: 23: Hoare triple {2789#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2780#false} is VALID [2018-11-18 22:46:25,578 INFO L273 TraceCheckUtils]: 24: Hoare triple {2780#false} ~i~0 := 0; {2780#false} is VALID [2018-11-18 22:46:25,578 INFO L273 TraceCheckUtils]: 25: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,579 INFO L273 TraceCheckUtils]: 26: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,579 INFO L273 TraceCheckUtils]: 27: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,580 INFO L273 TraceCheckUtils]: 30: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,580 INFO L273 TraceCheckUtils]: 31: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,580 INFO L273 TraceCheckUtils]: 32: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,580 INFO L273 TraceCheckUtils]: 33: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,581 INFO L273 TraceCheckUtils]: 34: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,581 INFO L273 TraceCheckUtils]: 35: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,581 INFO L273 TraceCheckUtils]: 36: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,582 INFO L273 TraceCheckUtils]: 37: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,582 INFO L273 TraceCheckUtils]: 38: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,582 INFO L273 TraceCheckUtils]: 39: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,582 INFO L273 TraceCheckUtils]: 40: Hoare triple {2780#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2780#false} is VALID [2018-11-18 22:46:25,582 INFO L273 TraceCheckUtils]: 41: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,583 INFO L273 TraceCheckUtils]: 42: Hoare triple {2780#false} assume !(~i~0 < 100000); {2780#false} is VALID [2018-11-18 22:46:25,583 INFO L273 TraceCheckUtils]: 43: Hoare triple {2780#false} havoc ~x~0;~x~0 := 0; {2780#false} is VALID [2018-11-18 22:46:25,583 INFO L273 TraceCheckUtils]: 44: Hoare triple {2780#false} assume true; {2780#false} is VALID [2018-11-18 22:46:25,583 INFO L273 TraceCheckUtils]: 45: Hoare triple {2780#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2780#false} is VALID [2018-11-18 22:46:25,583 INFO L256 TraceCheckUtils]: 46: Hoare triple {2780#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2780#false} is VALID [2018-11-18 22:46:25,583 INFO L273 TraceCheckUtils]: 47: Hoare triple {2780#false} ~cond := #in~cond; {2780#false} is VALID [2018-11-18 22:46:25,584 INFO L273 TraceCheckUtils]: 48: Hoare triple {2780#false} assume 0 == ~cond; {2780#false} is VALID [2018-11-18 22:46:25,584 INFO L273 TraceCheckUtils]: 49: Hoare triple {2780#false} assume !false; {2780#false} is VALID [2018-11-18 22:46:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 22:46:25,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:25,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:46:25,608 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-18 22:46:25,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:25,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:46:25,646 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-18 22:46:25,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:46:25,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:46:25,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:46:25,647 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 12 states. [2018-11-18 22:46:26,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:26,191 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-11-18 22:46:26,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:46:26,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-18 22:46:26,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:46:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2018-11-18 22:46:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:46:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2018-11-18 22:46:26,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 79 transitions. [2018-11-18 22:46:26,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:26,265 INFO L225 Difference]: With dead ends: 90 [2018-11-18 22:46:26,266 INFO L226 Difference]: Without dead ends: 59 [2018-11-18 22:46:26,267 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:46:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-18 22:46:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-18 22:46:26,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:26,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-18 22:46:26,303 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-18 22:46:26,303 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-18 22:46:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:26,306 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-18 22:46:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-18 22:46:26,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:26,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:26,306 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-18 22:46:26,307 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-18 22:46:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:26,308 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-18 22:46:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-18 22:46:26,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:26,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:26,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:26,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 22:46:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-18 22:46:26,310 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 50 [2018-11-18 22:46:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:26,310 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-18 22:46:26,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:46:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-18 22:46:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 22:46:26,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:26,311 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:26,311 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:26,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:26,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1316083627, now seen corresponding path program 9 times [2018-11-18 22:46:26,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:26,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:26,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:26,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:26,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:26,582 INFO L256 TraceCheckUtils]: 0: Hoare triple {3273#true} call ULTIMATE.init(); {3273#true} is VALID [2018-11-18 22:46:26,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {3273#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3273#true} is VALID [2018-11-18 22:46:26,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:46:26,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3273#true} {3273#true} #64#return; {3273#true} is VALID [2018-11-18 22:46:26,583 INFO L256 TraceCheckUtils]: 4: Hoare triple {3273#true} call #t~ret2 := main(); {3273#true} is VALID [2018-11-18 22:46:26,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {3273#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3275#(= main_~i~0 0)} is VALID [2018-11-18 22:46:26,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {3275#(= main_~i~0 0)} assume true; {3275#(= main_~i~0 0)} is VALID [2018-11-18 22:46:26,585 INFO L273 TraceCheckUtils]: 7: Hoare triple {3275#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3276#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:26,585 INFO L273 TraceCheckUtils]: 8: Hoare triple {3276#(<= main_~i~0 1)} assume true; {3276#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:26,586 INFO L273 TraceCheckUtils]: 9: Hoare triple {3276#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3277#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:26,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {3277#(<= main_~i~0 2)} assume true; {3277#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:26,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {3277#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3278#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:26,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {3278#(<= main_~i~0 3)} assume true; {3278#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:26,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {3278#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3279#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:26,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {3279#(<= main_~i~0 4)} assume true; {3279#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:26,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {3279#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3280#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:26,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {3280#(<= main_~i~0 5)} assume true; {3280#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:26,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {3280#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3281#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:26,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {3281#(<= main_~i~0 6)} assume true; {3281#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:26,594 INFO L273 TraceCheckUtils]: 19: Hoare triple {3281#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3282#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:26,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {3282#(<= main_~i~0 7)} assume true; {3282#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:26,596 INFO L273 TraceCheckUtils]: 21: Hoare triple {3282#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3283#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:26,596 INFO L273 TraceCheckUtils]: 22: Hoare triple {3283#(<= main_~i~0 8)} assume true; {3283#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:26,597 INFO L273 TraceCheckUtils]: 23: Hoare triple {3283#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3284#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:26,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {3284#(<= main_~i~0 9)} assume true; {3284#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:26,598 INFO L273 TraceCheckUtils]: 25: Hoare triple {3284#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3274#false} is VALID [2018-11-18 22:46:26,599 INFO L273 TraceCheckUtils]: 26: Hoare triple {3274#false} ~i~0 := 0; {3274#false} is VALID [2018-11-18 22:46:26,599 INFO L273 TraceCheckUtils]: 27: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:46:26,599 INFO L273 TraceCheckUtils]: 28: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:46:26,599 INFO L273 TraceCheckUtils]: 29: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:46:26,600 INFO L273 TraceCheckUtils]: 30: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:46:26,600 INFO L273 TraceCheckUtils]: 31: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:46:26,600 INFO L273 TraceCheckUtils]: 32: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:46:26,601 INFO L273 TraceCheckUtils]: 33: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:46:26,601 INFO L273 TraceCheckUtils]: 34: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:46:26,601 INFO L273 TraceCheckUtils]: 35: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:46:26,601 INFO L273 TraceCheckUtils]: 36: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:46:26,602 INFO L273 TraceCheckUtils]: 37: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:46:26,602 INFO L273 TraceCheckUtils]: 38: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:46:26,602 INFO L273 TraceCheckUtils]: 39: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:46:26,602 INFO L273 TraceCheckUtils]: 40: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:46:26,602 INFO L273 TraceCheckUtils]: 41: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:46:26,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:46:26,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:46:26,603 INFO L273 TraceCheckUtils]: 44: Hoare triple {3274#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3274#false} is VALID [2018-11-18 22:46:26,603 INFO L273 TraceCheckUtils]: 45: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:46:26,603 INFO L273 TraceCheckUtils]: 46: Hoare triple {3274#false} assume !(~i~0 < 100000); {3274#false} is VALID [2018-11-18 22:46:26,603 INFO L273 TraceCheckUtils]: 47: Hoare triple {3274#false} havoc ~x~0;~x~0 := 0; {3274#false} is VALID [2018-11-18 22:46:26,604 INFO L273 TraceCheckUtils]: 48: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:46:26,604 INFO L273 TraceCheckUtils]: 49: Hoare triple {3274#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3274#false} is VALID [2018-11-18 22:46:26,604 INFO L256 TraceCheckUtils]: 50: Hoare triple {3274#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3274#false} is VALID [2018-11-18 22:46:26,604 INFO L273 TraceCheckUtils]: 51: Hoare triple {3274#false} ~cond := #in~cond; {3274#false} is VALID [2018-11-18 22:46:26,604 INFO L273 TraceCheckUtils]: 52: Hoare triple {3274#false} assume 0 == ~cond; {3274#false} is VALID [2018-11-18 22:46:26,605 INFO L273 TraceCheckUtils]: 53: Hoare triple {3274#false} assume !false; {3274#false} is VALID [2018-11-18 22:46:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-18 22:46:26,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:26,607 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-18 22:46:26,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:46:26,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 22:46:26,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:26,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:26,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {3273#true} call ULTIMATE.init(); {3273#true} is VALID [2018-11-18 22:46:26,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {3273#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3273#true} is VALID [2018-11-18 22:46:26,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:46:26,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3273#true} {3273#true} #64#return; {3273#true} is VALID [2018-11-18 22:46:26,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {3273#true} call #t~ret2 := main(); {3273#true} is VALID [2018-11-18 22:46:26,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {3273#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3273#true} is VALID [2018-11-18 22:46:26,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:46:26,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:46:26,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:46:26,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:46:26,947 INFO L273 TraceCheckUtils]: 10: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:46:26,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:46:26,947 INFO L273 TraceCheckUtils]: 12: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:46:26,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:46:26,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:46:26,948 INFO L273 TraceCheckUtils]: 15: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:46:26,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:46:26,948 INFO L273 TraceCheckUtils]: 17: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:46:26,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:46:26,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:46:26,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:46:26,949 INFO L273 TraceCheckUtils]: 21: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:46:26,949 INFO L273 TraceCheckUtils]: 22: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:46:26,949 INFO L273 TraceCheckUtils]: 23: Hoare triple {3273#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3273#true} is VALID [2018-11-18 22:46:26,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {3273#true} assume true; {3273#true} is VALID [2018-11-18 22:46:26,950 INFO L273 TraceCheckUtils]: 25: Hoare triple {3273#true} assume !(~i~0 < 100000); {3273#true} is VALID [2018-11-18 22:46:26,964 INFO L273 TraceCheckUtils]: 26: Hoare triple {3273#true} ~i~0 := 0; {3366#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:26,969 INFO L273 TraceCheckUtils]: 27: Hoare triple {3366#(<= main_~i~0 0)} assume true; {3366#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:26,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {3366#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3276#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:26,971 INFO L273 TraceCheckUtils]: 29: Hoare triple {3276#(<= main_~i~0 1)} assume true; {3276#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:26,971 INFO L273 TraceCheckUtils]: 30: Hoare triple {3276#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3277#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:26,973 INFO L273 TraceCheckUtils]: 31: Hoare triple {3277#(<= main_~i~0 2)} assume true; {3277#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:26,973 INFO L273 TraceCheckUtils]: 32: Hoare triple {3277#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3278#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:26,974 INFO L273 TraceCheckUtils]: 33: Hoare triple {3278#(<= main_~i~0 3)} assume true; {3278#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:26,974 INFO L273 TraceCheckUtils]: 34: Hoare triple {3278#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3279#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:26,974 INFO L273 TraceCheckUtils]: 35: Hoare triple {3279#(<= main_~i~0 4)} assume true; {3279#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:26,975 INFO L273 TraceCheckUtils]: 36: Hoare triple {3279#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3280#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:26,975 INFO L273 TraceCheckUtils]: 37: Hoare triple {3280#(<= main_~i~0 5)} assume true; {3280#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:26,976 INFO L273 TraceCheckUtils]: 38: Hoare triple {3280#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3281#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:26,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {3281#(<= main_~i~0 6)} assume true; {3281#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:26,977 INFO L273 TraceCheckUtils]: 40: Hoare triple {3281#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3282#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:26,978 INFO L273 TraceCheckUtils]: 41: Hoare triple {3282#(<= main_~i~0 7)} assume true; {3282#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:26,979 INFO L273 TraceCheckUtils]: 42: Hoare triple {3282#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3283#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:26,980 INFO L273 TraceCheckUtils]: 43: Hoare triple {3283#(<= main_~i~0 8)} assume true; {3283#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:26,980 INFO L273 TraceCheckUtils]: 44: Hoare triple {3283#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3284#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:26,981 INFO L273 TraceCheckUtils]: 45: Hoare triple {3284#(<= main_~i~0 9)} assume true; {3284#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:26,982 INFO L273 TraceCheckUtils]: 46: Hoare triple {3284#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3274#false} is VALID [2018-11-18 22:46:26,982 INFO L273 TraceCheckUtils]: 47: Hoare triple {3274#false} havoc ~x~0;~x~0 := 0; {3274#false} is VALID [2018-11-18 22:46:26,982 INFO L273 TraceCheckUtils]: 48: Hoare triple {3274#false} assume true; {3274#false} is VALID [2018-11-18 22:46:26,982 INFO L273 TraceCheckUtils]: 49: Hoare triple {3274#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3274#false} is VALID [2018-11-18 22:46:26,983 INFO L256 TraceCheckUtils]: 50: Hoare triple {3274#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3274#false} is VALID [2018-11-18 22:46:26,983 INFO L273 TraceCheckUtils]: 51: Hoare triple {3274#false} ~cond := #in~cond; {3274#false} is VALID [2018-11-18 22:46:26,983 INFO L273 TraceCheckUtils]: 52: Hoare triple {3274#false} assume 0 == ~cond; {3274#false} is VALID [2018-11-18 22:46:26,983 INFO L273 TraceCheckUtils]: 53: Hoare triple {3274#false} assume !false; {3274#false} is VALID [2018-11-18 22:46:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-18 22:46:27,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:27,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 22:46:27,006 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-11-18 22:46:27,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:27,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:46:27,063 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-18 22:46:27,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:46:27,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:46:27,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:46:27,065 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 13 states. [2018-11-18 22:46:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:27,307 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-11-18 22:46:27,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:46:27,308 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-11-18 22:46:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:46:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2018-11-18 22:46:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:46:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2018-11-18 22:46:27,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 83 transitions. [2018-11-18 22:46:27,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:27,386 INFO L225 Difference]: With dead ends: 96 [2018-11-18 22:46:27,387 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 22:46:27,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 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-18 22:46:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 22:46:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-18 22:46:27,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:27,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 63 states. [2018-11-18 22:46:27,453 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-18 22:46:27,453 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-18 22:46:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:27,455 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-18 22:46:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-18 22:46:27,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:27,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:27,456 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-18 22:46:27,456 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-18 22:46:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:27,457 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-18 22:46:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-18 22:46:27,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:27,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:27,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:27,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 22:46:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-18 22:46:27,459 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 54 [2018-11-18 22:46:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:27,460 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-18 22:46:27,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:46:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-18 22:46:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 22:46:27,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:27,461 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:27,461 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:27,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:27,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1301135253, now seen corresponding path program 10 times [2018-11-18 22:46:27,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:27,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:27,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:27,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:27,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:27,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {3803#true} call ULTIMATE.init(); {3803#true} is VALID [2018-11-18 22:46:27,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {3803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3803#true} is VALID [2018-11-18 22:46:27,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {3803#true} assume true; {3803#true} is VALID [2018-11-18 22:46:27,738 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3803#true} {3803#true} #64#return; {3803#true} is VALID [2018-11-18 22:46:27,738 INFO L256 TraceCheckUtils]: 4: Hoare triple {3803#true} call #t~ret2 := main(); {3803#true} is VALID [2018-11-18 22:46:27,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {3803#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3805#(= main_~i~0 0)} is VALID [2018-11-18 22:46:27,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {3805#(= main_~i~0 0)} assume true; {3805#(= main_~i~0 0)} is VALID [2018-11-18 22:46:27,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {3805#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3806#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:27,740 INFO L273 TraceCheckUtils]: 8: Hoare triple {3806#(<= main_~i~0 1)} assume true; {3806#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:27,741 INFO L273 TraceCheckUtils]: 9: Hoare triple {3806#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3807#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:27,742 INFO L273 TraceCheckUtils]: 10: Hoare triple {3807#(<= main_~i~0 2)} assume true; {3807#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:27,743 INFO L273 TraceCheckUtils]: 11: Hoare triple {3807#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3808#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:27,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {3808#(<= main_~i~0 3)} assume true; {3808#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:27,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {3808#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3809#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:27,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {3809#(<= main_~i~0 4)} assume true; {3809#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:27,746 INFO L273 TraceCheckUtils]: 15: Hoare triple {3809#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3810#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:27,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {3810#(<= main_~i~0 5)} assume true; {3810#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:27,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {3810#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3811#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:27,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {3811#(<= main_~i~0 6)} assume true; {3811#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:27,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {3811#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3812#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:27,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {3812#(<= main_~i~0 7)} assume true; {3812#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:27,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {3812#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3813#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:27,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {3813#(<= main_~i~0 8)} assume true; {3813#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:27,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {3813#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3814#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:27,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {3814#(<= main_~i~0 9)} assume true; {3814#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:27,763 INFO L273 TraceCheckUtils]: 25: Hoare triple {3814#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3815#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:27,763 INFO L273 TraceCheckUtils]: 26: Hoare triple {3815#(<= main_~i~0 10)} assume true; {3815#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:27,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {3815#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3804#false} is VALID [2018-11-18 22:46:27,763 INFO L273 TraceCheckUtils]: 28: Hoare triple {3804#false} ~i~0 := 0; {3804#false} is VALID [2018-11-18 22:46:27,764 INFO L273 TraceCheckUtils]: 29: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:27,764 INFO L273 TraceCheckUtils]: 30: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:27,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:27,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:27,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:27,764 INFO L273 TraceCheckUtils]: 34: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:27,764 INFO L273 TraceCheckUtils]: 35: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:27,764 INFO L273 TraceCheckUtils]: 36: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:27,765 INFO L273 TraceCheckUtils]: 37: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:27,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:27,765 INFO L273 TraceCheckUtils]: 39: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:27,765 INFO L273 TraceCheckUtils]: 40: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:27,765 INFO L273 TraceCheckUtils]: 41: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:27,765 INFO L273 TraceCheckUtils]: 42: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:27,765 INFO L273 TraceCheckUtils]: 43: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:27,765 INFO L273 TraceCheckUtils]: 44: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:27,766 INFO L273 TraceCheckUtils]: 45: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:27,766 INFO L273 TraceCheckUtils]: 46: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:27,766 INFO L273 TraceCheckUtils]: 47: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:27,766 INFO L273 TraceCheckUtils]: 48: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:27,767 INFO L273 TraceCheckUtils]: 49: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:27,767 INFO L273 TraceCheckUtils]: 50: Hoare triple {3804#false} assume !(~i~0 < 100000); {3804#false} is VALID [2018-11-18 22:46:27,767 INFO L273 TraceCheckUtils]: 51: Hoare triple {3804#false} havoc ~x~0;~x~0 := 0; {3804#false} is VALID [2018-11-18 22:46:27,767 INFO L273 TraceCheckUtils]: 52: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:27,767 INFO L273 TraceCheckUtils]: 53: Hoare triple {3804#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3804#false} is VALID [2018-11-18 22:46:27,767 INFO L256 TraceCheckUtils]: 54: Hoare triple {3804#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3804#false} is VALID [2018-11-18 22:46:27,768 INFO L273 TraceCheckUtils]: 55: Hoare triple {3804#false} ~cond := #in~cond; {3804#false} is VALID [2018-11-18 22:46:27,768 INFO L273 TraceCheckUtils]: 56: Hoare triple {3804#false} assume 0 == ~cond; {3804#false} is VALID [2018-11-18 22:46:27,768 INFO L273 TraceCheckUtils]: 57: Hoare triple {3804#false} assume !false; {3804#false} is VALID [2018-11-18 22:46:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 22:46:27,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:27,770 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-18 22:46:27,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:46:27,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:46:27,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:27,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:27,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {3803#true} call ULTIMATE.init(); {3803#true} is VALID [2018-11-18 22:46:27,944 INFO L273 TraceCheckUtils]: 1: Hoare triple {3803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3803#true} is VALID [2018-11-18 22:46:27,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {3803#true} assume true; {3803#true} is VALID [2018-11-18 22:46:27,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3803#true} {3803#true} #64#return; {3803#true} is VALID [2018-11-18 22:46:27,945 INFO L256 TraceCheckUtils]: 4: Hoare triple {3803#true} call #t~ret2 := main(); {3803#true} is VALID [2018-11-18 22:46:27,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {3803#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3834#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:27,978 INFO L273 TraceCheckUtils]: 6: Hoare triple {3834#(<= main_~i~0 0)} assume true; {3834#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:27,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {3834#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3806#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:28,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {3806#(<= main_~i~0 1)} assume true; {3806#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:28,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {3806#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3807#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:28,024 INFO L273 TraceCheckUtils]: 10: Hoare triple {3807#(<= main_~i~0 2)} assume true; {3807#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:28,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {3807#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3808#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:28,048 INFO L273 TraceCheckUtils]: 12: Hoare triple {3808#(<= main_~i~0 3)} assume true; {3808#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:28,054 INFO L273 TraceCheckUtils]: 13: Hoare triple {3808#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3809#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:28,054 INFO L273 TraceCheckUtils]: 14: Hoare triple {3809#(<= main_~i~0 4)} assume true; {3809#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:28,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {3809#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3810#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:28,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {3810#(<= main_~i~0 5)} assume true; {3810#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:28,058 INFO L273 TraceCheckUtils]: 17: Hoare triple {3810#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3811#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:28,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {3811#(<= main_~i~0 6)} assume true; {3811#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:28,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {3811#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3812#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:28,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {3812#(<= main_~i~0 7)} assume true; {3812#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:28,061 INFO L273 TraceCheckUtils]: 21: Hoare triple {3812#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3813#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:28,061 INFO L273 TraceCheckUtils]: 22: Hoare triple {3813#(<= main_~i~0 8)} assume true; {3813#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:28,061 INFO L273 TraceCheckUtils]: 23: Hoare triple {3813#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3814#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:28,062 INFO L273 TraceCheckUtils]: 24: Hoare triple {3814#(<= main_~i~0 9)} assume true; {3814#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:28,062 INFO L273 TraceCheckUtils]: 25: Hoare triple {3814#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3815#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:28,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {3815#(<= main_~i~0 10)} assume true; {3815#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:28,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {3815#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3804#false} is VALID [2018-11-18 22:46:28,063 INFO L273 TraceCheckUtils]: 28: Hoare triple {3804#false} ~i~0 := 0; {3804#false} is VALID [2018-11-18 22:46:28,063 INFO L273 TraceCheckUtils]: 29: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:28,063 INFO L273 TraceCheckUtils]: 30: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:28,064 INFO L273 TraceCheckUtils]: 31: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:28,064 INFO L273 TraceCheckUtils]: 32: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:28,064 INFO L273 TraceCheckUtils]: 33: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:28,064 INFO L273 TraceCheckUtils]: 34: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:28,064 INFO L273 TraceCheckUtils]: 35: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:28,064 INFO L273 TraceCheckUtils]: 36: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:28,064 INFO L273 TraceCheckUtils]: 37: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:28,064 INFO L273 TraceCheckUtils]: 38: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:28,065 INFO L273 TraceCheckUtils]: 39: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:28,065 INFO L273 TraceCheckUtils]: 40: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:28,065 INFO L273 TraceCheckUtils]: 41: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:28,065 INFO L273 TraceCheckUtils]: 42: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:28,065 INFO L273 TraceCheckUtils]: 43: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:28,065 INFO L273 TraceCheckUtils]: 44: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:28,065 INFO L273 TraceCheckUtils]: 45: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:28,065 INFO L273 TraceCheckUtils]: 46: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:28,065 INFO L273 TraceCheckUtils]: 47: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:28,066 INFO L273 TraceCheckUtils]: 48: Hoare triple {3804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3804#false} is VALID [2018-11-18 22:46:28,066 INFO L273 TraceCheckUtils]: 49: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:28,066 INFO L273 TraceCheckUtils]: 50: Hoare triple {3804#false} assume !(~i~0 < 100000); {3804#false} is VALID [2018-11-18 22:46:28,066 INFO L273 TraceCheckUtils]: 51: Hoare triple {3804#false} havoc ~x~0;~x~0 := 0; {3804#false} is VALID [2018-11-18 22:46:28,066 INFO L273 TraceCheckUtils]: 52: Hoare triple {3804#false} assume true; {3804#false} is VALID [2018-11-18 22:46:28,066 INFO L273 TraceCheckUtils]: 53: Hoare triple {3804#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3804#false} is VALID [2018-11-18 22:46:28,066 INFO L256 TraceCheckUtils]: 54: Hoare triple {3804#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3804#false} is VALID [2018-11-18 22:46:28,066 INFO L273 TraceCheckUtils]: 55: Hoare triple {3804#false} ~cond := #in~cond; {3804#false} is VALID [2018-11-18 22:46:28,067 INFO L273 TraceCheckUtils]: 56: Hoare triple {3804#false} assume 0 == ~cond; {3804#false} is VALID [2018-11-18 22:46:28,067 INFO L273 TraceCheckUtils]: 57: Hoare triple {3804#false} assume !false; {3804#false} is VALID [2018-11-18 22:46:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 22:46:28,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:28,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 22:46:28,088 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-11-18 22:46:28,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:28,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:46:28,124 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-18 22:46:28,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:46:28,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:46:28,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:46:28,125 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 14 states. [2018-11-18 22:46:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:28,454 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-18 22:46:28,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:46:28,455 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-11-18 22:46:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:46:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2018-11-18 22:46:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:46:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2018-11-18 22:46:28,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 87 transitions. [2018-11-18 22:46:28,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:28,572 INFO L225 Difference]: With dead ends: 102 [2018-11-18 22:46:28,572 INFO L226 Difference]: Without dead ends: 67 [2018-11-18 22:46:28,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 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-18 22:46:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-18 22:46:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-18 22:46:28,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:28,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-18 22:46:28,629 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-18 22:46:28,629 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-18 22:46:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:28,630 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-18 22:46:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-18 22:46:28,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:28,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:28,631 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-18 22:46:28,631 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-18 22:46:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:28,632 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-18 22:46:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-18 22:46:28,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:28,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:28,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:28,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 22:46:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-18 22:46:28,634 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 58 [2018-11-18 22:46:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:28,634 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-18 22:46:28,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:46:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-18 22:46:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 22:46:28,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:28,635 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:28,636 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:28,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash 918410795, now seen corresponding path program 11 times [2018-11-18 22:46:28,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:28,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:28,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:28,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {4369#true} call ULTIMATE.init(); {4369#true} is VALID [2018-11-18 22:46:28,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {4369#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4369#true} is VALID [2018-11-18 22:46:28,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:28,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4369#true} {4369#true} #64#return; {4369#true} is VALID [2018-11-18 22:46:28,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {4369#true} call #t~ret2 := main(); {4369#true} is VALID [2018-11-18 22:46:28,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {4369#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4371#(= main_~i~0 0)} is VALID [2018-11-18 22:46:28,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {4371#(= main_~i~0 0)} assume true; {4371#(= main_~i~0 0)} is VALID [2018-11-18 22:46:28,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {4371#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4372#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:28,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {4372#(<= main_~i~0 1)} assume true; {4372#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:28,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {4372#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4373#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:28,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {4373#(<= main_~i~0 2)} assume true; {4373#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:28,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {4373#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4374#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:28,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {4374#(<= main_~i~0 3)} assume true; {4374#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:28,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {4374#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4375#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:28,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {4375#(<= main_~i~0 4)} assume true; {4375#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:28,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {4375#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4376#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:28,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {4376#(<= main_~i~0 5)} assume true; {4376#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:28,858 INFO L273 TraceCheckUtils]: 17: Hoare triple {4376#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4377#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:28,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {4377#(<= main_~i~0 6)} assume true; {4377#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:28,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {4377#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4378#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:28,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {4378#(<= main_~i~0 7)} assume true; {4378#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:28,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {4378#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4379#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:28,862 INFO L273 TraceCheckUtils]: 22: Hoare triple {4379#(<= main_~i~0 8)} assume true; {4379#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:28,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {4379#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4380#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:28,863 INFO L273 TraceCheckUtils]: 24: Hoare triple {4380#(<= main_~i~0 9)} assume true; {4380#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:28,864 INFO L273 TraceCheckUtils]: 25: Hoare triple {4380#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4381#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:28,865 INFO L273 TraceCheckUtils]: 26: Hoare triple {4381#(<= main_~i~0 10)} assume true; {4381#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:28,865 INFO L273 TraceCheckUtils]: 27: Hoare triple {4381#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4382#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:28,866 INFO L273 TraceCheckUtils]: 28: Hoare triple {4382#(<= main_~i~0 11)} assume true; {4382#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:28,867 INFO L273 TraceCheckUtils]: 29: Hoare triple {4382#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4370#false} is VALID [2018-11-18 22:46:28,867 INFO L273 TraceCheckUtils]: 30: Hoare triple {4370#false} ~i~0 := 0; {4370#false} is VALID [2018-11-18 22:46:28,867 INFO L273 TraceCheckUtils]: 31: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,867 INFO L273 TraceCheckUtils]: 32: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:46:28,867 INFO L273 TraceCheckUtils]: 33: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,868 INFO L273 TraceCheckUtils]: 34: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:46:28,868 INFO L273 TraceCheckUtils]: 35: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,868 INFO L273 TraceCheckUtils]: 36: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:46:28,868 INFO L273 TraceCheckUtils]: 37: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,868 INFO L273 TraceCheckUtils]: 38: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:46:28,869 INFO L273 TraceCheckUtils]: 39: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,869 INFO L273 TraceCheckUtils]: 40: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:46:28,869 INFO L273 TraceCheckUtils]: 41: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,869 INFO L273 TraceCheckUtils]: 42: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:46:28,869 INFO L273 TraceCheckUtils]: 43: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,869 INFO L273 TraceCheckUtils]: 44: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:46:28,869 INFO L273 TraceCheckUtils]: 45: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,869 INFO L273 TraceCheckUtils]: 46: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:46:28,870 INFO L273 TraceCheckUtils]: 47: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,870 INFO L273 TraceCheckUtils]: 48: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:46:28,870 INFO L273 TraceCheckUtils]: 49: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,870 INFO L273 TraceCheckUtils]: 50: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:46:28,870 INFO L273 TraceCheckUtils]: 51: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,870 INFO L273 TraceCheckUtils]: 52: Hoare triple {4370#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-18 22:46:28,870 INFO L273 TraceCheckUtils]: 53: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,870 INFO L273 TraceCheckUtils]: 54: Hoare triple {4370#false} assume !(~i~0 < 100000); {4370#false} is VALID [2018-11-18 22:46:28,870 INFO L273 TraceCheckUtils]: 55: Hoare triple {4370#false} havoc ~x~0;~x~0 := 0; {4370#false} is VALID [2018-11-18 22:46:28,871 INFO L273 TraceCheckUtils]: 56: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:28,871 INFO L273 TraceCheckUtils]: 57: Hoare triple {4370#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4370#false} is VALID [2018-11-18 22:46:28,871 INFO L256 TraceCheckUtils]: 58: Hoare triple {4370#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4370#false} is VALID [2018-11-18 22:46:28,871 INFO L273 TraceCheckUtils]: 59: Hoare triple {4370#false} ~cond := #in~cond; {4370#false} is VALID [2018-11-18 22:46:28,871 INFO L273 TraceCheckUtils]: 60: Hoare triple {4370#false} assume 0 == ~cond; {4370#false} is VALID [2018-11-18 22:46:28,871 INFO L273 TraceCheckUtils]: 61: Hoare triple {4370#false} assume !false; {4370#false} is VALID [2018-11-18 22:46:28,874 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-18 22:46:28,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:28,874 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-18 22:46:28,888 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:46:29,701 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 22:46:29,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:29,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:29,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {4369#true} call ULTIMATE.init(); {4369#true} is VALID [2018-11-18 22:46:29,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {4369#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4369#true} is VALID [2018-11-18 22:46:29,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4369#true} {4369#true} #64#return; {4369#true} is VALID [2018-11-18 22:46:29,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {4369#true} call #t~ret2 := main(); {4369#true} is VALID [2018-11-18 22:46:29,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {4369#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4369#true} is VALID [2018-11-18 22:46:29,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:46:29,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:46:29,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:46:29,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:46:29,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:46:29,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,879 INFO L273 TraceCheckUtils]: 17: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:46:29,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:46:29,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,880 INFO L273 TraceCheckUtils]: 21: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:46:29,880 INFO L273 TraceCheckUtils]: 22: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,880 INFO L273 TraceCheckUtils]: 23: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:46:29,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:46:29,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {4369#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4369#true} is VALID [2018-11-18 22:46:29,881 INFO L273 TraceCheckUtils]: 28: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-18 22:46:29,881 INFO L273 TraceCheckUtils]: 29: Hoare triple {4369#true} assume !(~i~0 < 100000); {4369#true} is VALID [2018-11-18 22:46:29,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {4369#true} ~i~0 := 0; {4476#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:29,883 INFO L273 TraceCheckUtils]: 31: Hoare triple {4476#(<= main_~i~0 0)} assume true; {4476#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:29,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {4476#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4372#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:29,885 INFO L273 TraceCheckUtils]: 33: Hoare triple {4372#(<= main_~i~0 1)} assume true; {4372#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:29,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {4372#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4373#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:29,886 INFO L273 TraceCheckUtils]: 35: Hoare triple {4373#(<= main_~i~0 2)} assume true; {4373#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:29,887 INFO L273 TraceCheckUtils]: 36: Hoare triple {4373#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4374#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:29,888 INFO L273 TraceCheckUtils]: 37: Hoare triple {4374#(<= main_~i~0 3)} assume true; {4374#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:29,889 INFO L273 TraceCheckUtils]: 38: Hoare triple {4374#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4375#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:29,890 INFO L273 TraceCheckUtils]: 39: Hoare triple {4375#(<= main_~i~0 4)} assume true; {4375#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:29,891 INFO L273 TraceCheckUtils]: 40: Hoare triple {4375#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4376#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:29,891 INFO L273 TraceCheckUtils]: 41: Hoare triple {4376#(<= main_~i~0 5)} assume true; {4376#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:29,892 INFO L273 TraceCheckUtils]: 42: Hoare triple {4376#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4377#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:29,893 INFO L273 TraceCheckUtils]: 43: Hoare triple {4377#(<= main_~i~0 6)} assume true; {4377#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:29,894 INFO L273 TraceCheckUtils]: 44: Hoare triple {4377#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4378#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:29,895 INFO L273 TraceCheckUtils]: 45: Hoare triple {4378#(<= main_~i~0 7)} assume true; {4378#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:29,896 INFO L273 TraceCheckUtils]: 46: Hoare triple {4378#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4379#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:29,896 INFO L273 TraceCheckUtils]: 47: Hoare triple {4379#(<= main_~i~0 8)} assume true; {4379#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:29,897 INFO L273 TraceCheckUtils]: 48: Hoare triple {4379#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4380#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:29,898 INFO L273 TraceCheckUtils]: 49: Hoare triple {4380#(<= main_~i~0 9)} assume true; {4380#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:29,899 INFO L273 TraceCheckUtils]: 50: Hoare triple {4380#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4381#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:29,900 INFO L273 TraceCheckUtils]: 51: Hoare triple {4381#(<= main_~i~0 10)} assume true; {4381#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:29,901 INFO L273 TraceCheckUtils]: 52: Hoare triple {4381#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4382#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:29,901 INFO L273 TraceCheckUtils]: 53: Hoare triple {4382#(<= main_~i~0 11)} assume true; {4382#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:29,902 INFO L273 TraceCheckUtils]: 54: Hoare triple {4382#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4370#false} is VALID [2018-11-18 22:46:29,902 INFO L273 TraceCheckUtils]: 55: Hoare triple {4370#false} havoc ~x~0;~x~0 := 0; {4370#false} is VALID [2018-11-18 22:46:29,903 INFO L273 TraceCheckUtils]: 56: Hoare triple {4370#false} assume true; {4370#false} is VALID [2018-11-18 22:46:29,903 INFO L273 TraceCheckUtils]: 57: Hoare triple {4370#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4370#false} is VALID [2018-11-18 22:46:29,903 INFO L256 TraceCheckUtils]: 58: Hoare triple {4370#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4370#false} is VALID [2018-11-18 22:46:29,904 INFO L273 TraceCheckUtils]: 59: Hoare triple {4370#false} ~cond := #in~cond; {4370#false} is VALID [2018-11-18 22:46:29,904 INFO L273 TraceCheckUtils]: 60: Hoare triple {4370#false} assume 0 == ~cond; {4370#false} is VALID [2018-11-18 22:46:29,904 INFO L273 TraceCheckUtils]: 61: Hoare triple {4370#false} assume !false; {4370#false} is VALID [2018-11-18 22:46:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-18 22:46:29,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:29,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 22:46:29,928 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-11-18 22:46:29,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:29,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:46:30,002 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-18 22:46:30,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:46:30,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:46:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:46:30,004 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 15 states. [2018-11-18 22:46:30,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:30,363 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-11-18 22:46:30,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:46:30,363 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-11-18 22:46:30,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:46:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2018-11-18 22:46:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:46:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2018-11-18 22:46:30,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 91 transitions. [2018-11-18 22:46:30,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:30,899 INFO L225 Difference]: With dead ends: 108 [2018-11-18 22:46:30,899 INFO L226 Difference]: Without dead ends: 71 [2018-11-18 22:46:30,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:46:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-18 22:46:31,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-18 22:46:31,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:31,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 71 states. [2018-11-18 22:46:31,536 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-18 22:46:31,536 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-18 22:46:31,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:31,538 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-18 22:46:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-18 22:46:31,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:31,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:31,539 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-18 22:46:31,539 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-18 22:46:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:31,541 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-18 22:46:31,541 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-18 22:46:31,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:31,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:31,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:31,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 22:46:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-18 22:46:31,544 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 62 [2018-11-18 22:46:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:31,545 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-18 22:46:31,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:46:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-18 22:46:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 22:46:31,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:31,546 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:31,546 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:31,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:31,546 INFO L82 PathProgramCache]: Analyzing trace with hash -490284821, now seen corresponding path program 12 times [2018-11-18 22:46:31,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:31,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:31,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:31,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:31,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:32,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {4971#true} call ULTIMATE.init(); {4971#true} is VALID [2018-11-18 22:46:32,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {4971#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4971#true} is VALID [2018-11-18 22:46:32,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4971#true} {4971#true} #64#return; {4971#true} is VALID [2018-11-18 22:46:32,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {4971#true} call #t~ret2 := main(); {4971#true} is VALID [2018-11-18 22:46:32,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {4971#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4973#(= main_~i~0 0)} is VALID [2018-11-18 22:46:32,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {4973#(= main_~i~0 0)} assume true; {4973#(= main_~i~0 0)} is VALID [2018-11-18 22:46:32,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {4973#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4974#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:32,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {4974#(<= main_~i~0 1)} assume true; {4974#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:32,135 INFO L273 TraceCheckUtils]: 9: Hoare triple {4974#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4975#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:32,135 INFO L273 TraceCheckUtils]: 10: Hoare triple {4975#(<= main_~i~0 2)} assume true; {4975#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:32,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {4975#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4976#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:32,137 INFO L273 TraceCheckUtils]: 12: Hoare triple {4976#(<= main_~i~0 3)} assume true; {4976#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:32,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {4976#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4977#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:32,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {4977#(<= main_~i~0 4)} assume true; {4977#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:32,140 INFO L273 TraceCheckUtils]: 15: Hoare triple {4977#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4978#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:32,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {4978#(<= main_~i~0 5)} assume true; {4978#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:32,142 INFO L273 TraceCheckUtils]: 17: Hoare triple {4978#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4979#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:32,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {4979#(<= main_~i~0 6)} assume true; {4979#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:32,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {4979#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4980#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:32,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {4980#(<= main_~i~0 7)} assume true; {4980#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:32,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {4980#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4981#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:32,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {4981#(<= main_~i~0 8)} assume true; {4981#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:32,147 INFO L273 TraceCheckUtils]: 23: Hoare triple {4981#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4982#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:32,147 INFO L273 TraceCheckUtils]: 24: Hoare triple {4982#(<= main_~i~0 9)} assume true; {4982#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:32,148 INFO L273 TraceCheckUtils]: 25: Hoare triple {4982#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4983#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:32,149 INFO L273 TraceCheckUtils]: 26: Hoare triple {4983#(<= main_~i~0 10)} assume true; {4983#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:32,150 INFO L273 TraceCheckUtils]: 27: Hoare triple {4983#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4984#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:32,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {4984#(<= main_~i~0 11)} assume true; {4984#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:32,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {4984#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4985#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:32,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {4985#(<= main_~i~0 12)} assume true; {4985#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:32,153 INFO L273 TraceCheckUtils]: 31: Hoare triple {4985#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4972#false} is VALID [2018-11-18 22:46:32,154 INFO L273 TraceCheckUtils]: 32: Hoare triple {4972#false} ~i~0 := 0; {4972#false} is VALID [2018-11-18 22:46:32,154 INFO L273 TraceCheckUtils]: 33: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,154 INFO L273 TraceCheckUtils]: 34: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:46:32,154 INFO L273 TraceCheckUtils]: 35: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,155 INFO L273 TraceCheckUtils]: 36: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:46:32,155 INFO L273 TraceCheckUtils]: 37: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,155 INFO L273 TraceCheckUtils]: 38: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:46:32,155 INFO L273 TraceCheckUtils]: 39: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,156 INFO L273 TraceCheckUtils]: 40: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:46:32,156 INFO L273 TraceCheckUtils]: 41: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,156 INFO L273 TraceCheckUtils]: 42: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:46:32,156 INFO L273 TraceCheckUtils]: 43: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,157 INFO L273 TraceCheckUtils]: 44: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:46:32,157 INFO L273 TraceCheckUtils]: 45: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,157 INFO L273 TraceCheckUtils]: 46: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:46:32,157 INFO L273 TraceCheckUtils]: 47: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,158 INFO L273 TraceCheckUtils]: 48: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:46:32,158 INFO L273 TraceCheckUtils]: 49: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,158 INFO L273 TraceCheckUtils]: 50: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:46:32,158 INFO L273 TraceCheckUtils]: 51: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,158 INFO L273 TraceCheckUtils]: 52: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:46:32,158 INFO L273 TraceCheckUtils]: 53: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,159 INFO L273 TraceCheckUtils]: 54: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:46:32,159 INFO L273 TraceCheckUtils]: 55: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,159 INFO L273 TraceCheckUtils]: 56: Hoare triple {4972#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4972#false} is VALID [2018-11-18 22:46:32,159 INFO L273 TraceCheckUtils]: 57: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,159 INFO L273 TraceCheckUtils]: 58: Hoare triple {4972#false} assume !(~i~0 < 100000); {4972#false} is VALID [2018-11-18 22:46:32,159 INFO L273 TraceCheckUtils]: 59: Hoare triple {4972#false} havoc ~x~0;~x~0 := 0; {4972#false} is VALID [2018-11-18 22:46:32,159 INFO L273 TraceCheckUtils]: 60: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,160 INFO L273 TraceCheckUtils]: 61: Hoare triple {4972#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4972#false} is VALID [2018-11-18 22:46:32,160 INFO L256 TraceCheckUtils]: 62: Hoare triple {4972#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4972#false} is VALID [2018-11-18 22:46:32,160 INFO L273 TraceCheckUtils]: 63: Hoare triple {4972#false} ~cond := #in~cond; {4972#false} is VALID [2018-11-18 22:46:32,160 INFO L273 TraceCheckUtils]: 64: Hoare triple {4972#false} assume 0 == ~cond; {4972#false} is VALID [2018-11-18 22:46:32,160 INFO L273 TraceCheckUtils]: 65: Hoare triple {4972#false} assume !false; {4972#false} is VALID [2018-11-18 22:46:32,177 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-18 22:46:32,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:32,177 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-18 22:46:32,186 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:46:32,701 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-18 22:46:32,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:32,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:32,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {4971#true} call ULTIMATE.init(); {4971#true} is VALID [2018-11-18 22:46:32,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {4971#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4971#true} is VALID [2018-11-18 22:46:32,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4971#true} {4971#true} #64#return; {4971#true} is VALID [2018-11-18 22:46:32,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {4971#true} call #t~ret2 := main(); {4971#true} is VALID [2018-11-18 22:46:32,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {4971#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4971#true} is VALID [2018-11-18 22:46:32,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,969 INFO L273 TraceCheckUtils]: 7: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:46:32,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:46:32,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,970 INFO L273 TraceCheckUtils]: 11: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:46:32,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:46:32,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,971 INFO L273 TraceCheckUtils]: 15: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:46:32,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:46:32,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:46:32,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,972 INFO L273 TraceCheckUtils]: 21: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:46:32,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:46:32,972 INFO L273 TraceCheckUtils]: 24: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,972 INFO L273 TraceCheckUtils]: 25: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:46:32,972 INFO L273 TraceCheckUtils]: 26: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,972 INFO L273 TraceCheckUtils]: 27: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4971#true} is VALID [2018-11-18 22:46:32,972 INFO L273 TraceCheckUtils]: 28: Hoare triple {4971#true} assume true; {4971#true} is VALID [2018-11-18 22:46:32,973 INFO L273 TraceCheckUtils]: 29: Hoare triple {4971#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5076#(<= main_~i~0 100000)} is VALID [2018-11-18 22:46:32,973 INFO L273 TraceCheckUtils]: 30: Hoare triple {5076#(<= main_~i~0 100000)} assume true; {5076#(<= main_~i~0 100000)} is VALID [2018-11-18 22:46:32,973 INFO L273 TraceCheckUtils]: 31: Hoare triple {5076#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4971#true} is VALID [2018-11-18 22:46:32,974 INFO L273 TraceCheckUtils]: 32: Hoare triple {4971#true} ~i~0 := 0; {5086#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:32,974 INFO L273 TraceCheckUtils]: 33: Hoare triple {5086#(<= main_~i~0 0)} assume true; {5086#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:32,975 INFO L273 TraceCheckUtils]: 34: Hoare triple {5086#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4974#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:32,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {4974#(<= main_~i~0 1)} assume true; {4974#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:32,976 INFO L273 TraceCheckUtils]: 36: Hoare triple {4974#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4975#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:32,976 INFO L273 TraceCheckUtils]: 37: Hoare triple {4975#(<= main_~i~0 2)} assume true; {4975#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:32,977 INFO L273 TraceCheckUtils]: 38: Hoare triple {4975#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4976#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:32,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {4976#(<= main_~i~0 3)} assume true; {4976#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:32,978 INFO L273 TraceCheckUtils]: 40: Hoare triple {4976#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4977#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:32,979 INFO L273 TraceCheckUtils]: 41: Hoare triple {4977#(<= main_~i~0 4)} assume true; {4977#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:32,979 INFO L273 TraceCheckUtils]: 42: Hoare triple {4977#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4978#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:32,980 INFO L273 TraceCheckUtils]: 43: Hoare triple {4978#(<= main_~i~0 5)} assume true; {4978#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:32,981 INFO L273 TraceCheckUtils]: 44: Hoare triple {4978#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4979#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:32,981 INFO L273 TraceCheckUtils]: 45: Hoare triple {4979#(<= main_~i~0 6)} assume true; {4979#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:32,982 INFO L273 TraceCheckUtils]: 46: Hoare triple {4979#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4980#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:32,983 INFO L273 TraceCheckUtils]: 47: Hoare triple {4980#(<= main_~i~0 7)} assume true; {4980#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:32,984 INFO L273 TraceCheckUtils]: 48: Hoare triple {4980#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4981#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:32,984 INFO L273 TraceCheckUtils]: 49: Hoare triple {4981#(<= main_~i~0 8)} assume true; {4981#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:32,985 INFO L273 TraceCheckUtils]: 50: Hoare triple {4981#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4982#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:32,986 INFO L273 TraceCheckUtils]: 51: Hoare triple {4982#(<= main_~i~0 9)} assume true; {4982#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:32,987 INFO L273 TraceCheckUtils]: 52: Hoare triple {4982#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4983#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:32,987 INFO L273 TraceCheckUtils]: 53: Hoare triple {4983#(<= main_~i~0 10)} assume true; {4983#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:32,988 INFO L273 TraceCheckUtils]: 54: Hoare triple {4983#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4984#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:32,989 INFO L273 TraceCheckUtils]: 55: Hoare triple {4984#(<= main_~i~0 11)} assume true; {4984#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:32,990 INFO L273 TraceCheckUtils]: 56: Hoare triple {4984#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4985#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:32,990 INFO L273 TraceCheckUtils]: 57: Hoare triple {4985#(<= main_~i~0 12)} assume true; {4985#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:32,991 INFO L273 TraceCheckUtils]: 58: Hoare triple {4985#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4972#false} is VALID [2018-11-18 22:46:32,991 INFO L273 TraceCheckUtils]: 59: Hoare triple {4972#false} havoc ~x~0;~x~0 := 0; {4972#false} is VALID [2018-11-18 22:46:32,991 INFO L273 TraceCheckUtils]: 60: Hoare triple {4972#false} assume true; {4972#false} is VALID [2018-11-18 22:46:32,992 INFO L273 TraceCheckUtils]: 61: Hoare triple {4972#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4972#false} is VALID [2018-11-18 22:46:32,992 INFO L256 TraceCheckUtils]: 62: Hoare triple {4972#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4972#false} is VALID [2018-11-18 22:46:32,992 INFO L273 TraceCheckUtils]: 63: Hoare triple {4972#false} ~cond := #in~cond; {4972#false} is VALID [2018-11-18 22:46:32,992 INFO L273 TraceCheckUtils]: 64: Hoare triple {4972#false} assume 0 == ~cond; {4972#false} is VALID [2018-11-18 22:46:32,992 INFO L273 TraceCheckUtils]: 65: Hoare triple {4972#false} assume !false; {4972#false} is VALID [2018-11-18 22:46:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 156 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-18 22:46:33,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:33,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-11-18 22:46:33,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-11-18 22:46:33,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:33,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:46:33,084 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-18 22:46:33,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:46:33,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:46:33,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:46:33,085 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 17 states. [2018-11-18 22:46:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:33,519 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-11-18 22:46:33,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:46:33,520 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-11-18 22:46:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:46:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2018-11-18 22:46:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:46:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2018-11-18 22:46:33,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 95 transitions. [2018-11-18 22:46:34,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:34,089 INFO L225 Difference]: With dead ends: 114 [2018-11-18 22:46:34,090 INFO L226 Difference]: Without dead ends: 75 [2018-11-18 22:46:34,090 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:46:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-18 22:46:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-18 22:46:34,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:34,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2018-11-18 22:46:34,130 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-18 22:46:34,130 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-18 22:46:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:34,132 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-18 22:46:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-18 22:46:34,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:34,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:34,133 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-18 22:46:34,133 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-18 22:46:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:34,135 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-18 22:46:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-18 22:46:34,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:34,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:34,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:34,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 22:46:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-11-18 22:46:34,138 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 66 [2018-11-18 22:46:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:34,138 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-11-18 22:46:34,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:46:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-18 22:46:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 22:46:34,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:34,139 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:34,139 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:34,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash -911243093, now seen corresponding path program 13 times [2018-11-18 22:46:34,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:34,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:34,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:34,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {5610#true} call ULTIMATE.init(); {5610#true} is VALID [2018-11-18 22:46:34,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {5610#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5610#true} is VALID [2018-11-18 22:46:34,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {5610#true} assume true; {5610#true} is VALID [2018-11-18 22:46:34,738 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5610#true} {5610#true} #64#return; {5610#true} is VALID [2018-11-18 22:46:34,739 INFO L256 TraceCheckUtils]: 4: Hoare triple {5610#true} call #t~ret2 := main(); {5610#true} is VALID [2018-11-18 22:46:34,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {5610#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5612#(= main_~i~0 0)} is VALID [2018-11-18 22:46:34,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {5612#(= main_~i~0 0)} assume true; {5612#(= main_~i~0 0)} is VALID [2018-11-18 22:46:34,741 INFO L273 TraceCheckUtils]: 7: Hoare triple {5612#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5613#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:34,741 INFO L273 TraceCheckUtils]: 8: Hoare triple {5613#(<= main_~i~0 1)} assume true; {5613#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:34,742 INFO L273 TraceCheckUtils]: 9: Hoare triple {5613#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5614#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:34,743 INFO L273 TraceCheckUtils]: 10: Hoare triple {5614#(<= main_~i~0 2)} assume true; {5614#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:34,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {5614#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5615#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:34,744 INFO L273 TraceCheckUtils]: 12: Hoare triple {5615#(<= main_~i~0 3)} assume true; {5615#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:34,745 INFO L273 TraceCheckUtils]: 13: Hoare triple {5615#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5616#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:34,746 INFO L273 TraceCheckUtils]: 14: Hoare triple {5616#(<= main_~i~0 4)} assume true; {5616#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:34,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {5616#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5617#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:34,747 INFO L273 TraceCheckUtils]: 16: Hoare triple {5617#(<= main_~i~0 5)} assume true; {5617#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:34,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {5617#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5618#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:34,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {5618#(<= main_~i~0 6)} assume true; {5618#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:34,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {5618#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5619#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:34,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {5619#(<= main_~i~0 7)} assume true; {5619#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:34,751 INFO L273 TraceCheckUtils]: 21: Hoare triple {5619#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5620#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:34,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {5620#(<= main_~i~0 8)} assume true; {5620#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:34,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {5620#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5621#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:34,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {5621#(<= main_~i~0 9)} assume true; {5621#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:34,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {5621#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5622#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:34,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {5622#(<= main_~i~0 10)} assume true; {5622#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:34,756 INFO L273 TraceCheckUtils]: 27: Hoare triple {5622#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5623#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:34,756 INFO L273 TraceCheckUtils]: 28: Hoare triple {5623#(<= main_~i~0 11)} assume true; {5623#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:34,757 INFO L273 TraceCheckUtils]: 29: Hoare triple {5623#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5624#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:34,758 INFO L273 TraceCheckUtils]: 30: Hoare triple {5624#(<= main_~i~0 12)} assume true; {5624#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:34,759 INFO L273 TraceCheckUtils]: 31: Hoare triple {5624#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5625#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:34,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {5625#(<= main_~i~0 13)} assume true; {5625#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:34,760 INFO L273 TraceCheckUtils]: 33: Hoare triple {5625#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5611#false} is VALID [2018-11-18 22:46:34,760 INFO L273 TraceCheckUtils]: 34: Hoare triple {5611#false} ~i~0 := 0; {5611#false} is VALID [2018-11-18 22:46:34,760 INFO L273 TraceCheckUtils]: 35: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,761 INFO L273 TraceCheckUtils]: 36: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,761 INFO L273 TraceCheckUtils]: 37: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,761 INFO L273 TraceCheckUtils]: 38: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,761 INFO L273 TraceCheckUtils]: 39: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,761 INFO L273 TraceCheckUtils]: 40: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,762 INFO L273 TraceCheckUtils]: 41: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,762 INFO L273 TraceCheckUtils]: 42: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,762 INFO L273 TraceCheckUtils]: 43: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,762 INFO L273 TraceCheckUtils]: 44: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,762 INFO L273 TraceCheckUtils]: 45: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,763 INFO L273 TraceCheckUtils]: 46: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,763 INFO L273 TraceCheckUtils]: 47: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,763 INFO L273 TraceCheckUtils]: 48: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,763 INFO L273 TraceCheckUtils]: 49: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,763 INFO L273 TraceCheckUtils]: 50: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,763 INFO L273 TraceCheckUtils]: 51: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,763 INFO L273 TraceCheckUtils]: 52: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,763 INFO L273 TraceCheckUtils]: 53: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,764 INFO L273 TraceCheckUtils]: 54: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,764 INFO L273 TraceCheckUtils]: 55: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,764 INFO L273 TraceCheckUtils]: 56: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,764 INFO L273 TraceCheckUtils]: 57: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,764 INFO L273 TraceCheckUtils]: 58: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,764 INFO L273 TraceCheckUtils]: 59: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,764 INFO L273 TraceCheckUtils]: 60: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,764 INFO L273 TraceCheckUtils]: 61: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,764 INFO L273 TraceCheckUtils]: 62: Hoare triple {5611#false} assume !(~i~0 < 100000); {5611#false} is VALID [2018-11-18 22:46:34,765 INFO L273 TraceCheckUtils]: 63: Hoare triple {5611#false} havoc ~x~0;~x~0 := 0; {5611#false} is VALID [2018-11-18 22:46:34,765 INFO L273 TraceCheckUtils]: 64: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,765 INFO L273 TraceCheckUtils]: 65: Hoare triple {5611#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5611#false} is VALID [2018-11-18 22:46:34,765 INFO L256 TraceCheckUtils]: 66: Hoare triple {5611#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {5611#false} is VALID [2018-11-18 22:46:34,765 INFO L273 TraceCheckUtils]: 67: Hoare triple {5611#false} ~cond := #in~cond; {5611#false} is VALID [2018-11-18 22:46:34,765 INFO L273 TraceCheckUtils]: 68: Hoare triple {5611#false} assume 0 == ~cond; {5611#false} is VALID [2018-11-18 22:46:34,765 INFO L273 TraceCheckUtils]: 69: Hoare triple {5611#false} assume !false; {5611#false} is VALID [2018-11-18 22:46:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-18 22:46:34,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:34,768 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-18 22:46:34,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:34,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:34,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {5610#true} call ULTIMATE.init(); {5610#true} is VALID [2018-11-18 22:46:34,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {5610#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5610#true} is VALID [2018-11-18 22:46:34,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {5610#true} assume true; {5610#true} is VALID [2018-11-18 22:46:34,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5610#true} {5610#true} #64#return; {5610#true} is VALID [2018-11-18 22:46:34,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {5610#true} call #t~ret2 := main(); {5610#true} is VALID [2018-11-18 22:46:34,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {5610#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5644#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:34,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {5644#(<= main_~i~0 0)} assume true; {5644#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:34,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {5644#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5613#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:34,948 INFO L273 TraceCheckUtils]: 8: Hoare triple {5613#(<= main_~i~0 1)} assume true; {5613#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:34,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {5613#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5614#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:34,949 INFO L273 TraceCheckUtils]: 10: Hoare triple {5614#(<= main_~i~0 2)} assume true; {5614#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:34,950 INFO L273 TraceCheckUtils]: 11: Hoare triple {5614#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5615#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:34,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {5615#(<= main_~i~0 3)} assume true; {5615#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:34,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {5615#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5616#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:34,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {5616#(<= main_~i~0 4)} assume true; {5616#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:34,952 INFO L273 TraceCheckUtils]: 15: Hoare triple {5616#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5617#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:34,953 INFO L273 TraceCheckUtils]: 16: Hoare triple {5617#(<= main_~i~0 5)} assume true; {5617#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:34,954 INFO L273 TraceCheckUtils]: 17: Hoare triple {5617#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5618#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:34,955 INFO L273 TraceCheckUtils]: 18: Hoare triple {5618#(<= main_~i~0 6)} assume true; {5618#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:34,955 INFO L273 TraceCheckUtils]: 19: Hoare triple {5618#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5619#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:34,956 INFO L273 TraceCheckUtils]: 20: Hoare triple {5619#(<= main_~i~0 7)} assume true; {5619#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:34,957 INFO L273 TraceCheckUtils]: 21: Hoare triple {5619#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5620#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:34,957 INFO L273 TraceCheckUtils]: 22: Hoare triple {5620#(<= main_~i~0 8)} assume true; {5620#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:34,958 INFO L273 TraceCheckUtils]: 23: Hoare triple {5620#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5621#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:34,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {5621#(<= main_~i~0 9)} assume true; {5621#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:34,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {5621#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5622#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:34,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {5622#(<= main_~i~0 10)} assume true; {5622#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:34,962 INFO L273 TraceCheckUtils]: 27: Hoare triple {5622#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5623#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:34,963 INFO L273 TraceCheckUtils]: 28: Hoare triple {5623#(<= main_~i~0 11)} assume true; {5623#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:34,964 INFO L273 TraceCheckUtils]: 29: Hoare triple {5623#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5624#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:34,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {5624#(<= main_~i~0 12)} assume true; {5624#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:34,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {5624#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5625#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:34,966 INFO L273 TraceCheckUtils]: 32: Hoare triple {5625#(<= main_~i~0 13)} assume true; {5625#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:34,966 INFO L273 TraceCheckUtils]: 33: Hoare triple {5625#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5611#false} is VALID [2018-11-18 22:46:34,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {5611#false} ~i~0 := 0; {5611#false} is VALID [2018-11-18 22:46:34,967 INFO L273 TraceCheckUtils]: 35: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,967 INFO L273 TraceCheckUtils]: 36: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,967 INFO L273 TraceCheckUtils]: 37: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,967 INFO L273 TraceCheckUtils]: 38: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,968 INFO L273 TraceCheckUtils]: 39: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,968 INFO L273 TraceCheckUtils]: 40: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,968 INFO L273 TraceCheckUtils]: 41: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,968 INFO L273 TraceCheckUtils]: 42: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,968 INFO L273 TraceCheckUtils]: 43: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,969 INFO L273 TraceCheckUtils]: 44: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,969 INFO L273 TraceCheckUtils]: 45: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,969 INFO L273 TraceCheckUtils]: 46: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,969 INFO L273 TraceCheckUtils]: 47: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,970 INFO L273 TraceCheckUtils]: 48: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,970 INFO L273 TraceCheckUtils]: 49: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,970 INFO L273 TraceCheckUtils]: 50: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,970 INFO L273 TraceCheckUtils]: 51: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,970 INFO L273 TraceCheckUtils]: 52: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,970 INFO L273 TraceCheckUtils]: 53: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,970 INFO L273 TraceCheckUtils]: 54: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,970 INFO L273 TraceCheckUtils]: 55: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,971 INFO L273 TraceCheckUtils]: 56: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,971 INFO L273 TraceCheckUtils]: 57: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,971 INFO L273 TraceCheckUtils]: 58: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,971 INFO L273 TraceCheckUtils]: 59: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,971 INFO L273 TraceCheckUtils]: 60: Hoare triple {5611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5611#false} is VALID [2018-11-18 22:46:34,971 INFO L273 TraceCheckUtils]: 61: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,971 INFO L273 TraceCheckUtils]: 62: Hoare triple {5611#false} assume !(~i~0 < 100000); {5611#false} is VALID [2018-11-18 22:46:34,971 INFO L273 TraceCheckUtils]: 63: Hoare triple {5611#false} havoc ~x~0;~x~0 := 0; {5611#false} is VALID [2018-11-18 22:46:34,972 INFO L273 TraceCheckUtils]: 64: Hoare triple {5611#false} assume true; {5611#false} is VALID [2018-11-18 22:46:34,972 INFO L273 TraceCheckUtils]: 65: Hoare triple {5611#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5611#false} is VALID [2018-11-18 22:46:34,972 INFO L256 TraceCheckUtils]: 66: Hoare triple {5611#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {5611#false} is VALID [2018-11-18 22:46:34,972 INFO L273 TraceCheckUtils]: 67: Hoare triple {5611#false} ~cond := #in~cond; {5611#false} is VALID [2018-11-18 22:46:34,972 INFO L273 TraceCheckUtils]: 68: Hoare triple {5611#false} assume 0 == ~cond; {5611#false} is VALID [2018-11-18 22:46:34,972 INFO L273 TraceCheckUtils]: 69: Hoare triple {5611#false} assume !false; {5611#false} is VALID [2018-11-18 22:46:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-18 22:46:34,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:34,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 22:46:34,995 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-11-18 22:46:34,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:34,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:46:35,036 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-18 22:46:35,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:46:35,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:46:35,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:46:35,037 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 17 states. [2018-11-18 22:46:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:35,623 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-11-18 22:46:35,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:46:35,623 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-11-18 22:46:35,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:46:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-18 22:46:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:46:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-18 22:46:35,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2018-11-18 22:46:36,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:36,662 INFO L225 Difference]: With dead ends: 120 [2018-11-18 22:46:36,663 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 22:46:36,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:46:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 22:46:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-18 22:46:36,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:36,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2018-11-18 22:46:36,705 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-18 22:46:36,705 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-18 22:46:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:36,707 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-11-18 22:46:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-18 22:46:36,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:36,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:36,708 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-18 22:46:36,708 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-18 22:46:36,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:36,710 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-11-18 22:46:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-18 22:46:36,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:36,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:36,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:36,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 22:46:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-18 22:46:36,712 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 70 [2018-11-18 22:46:36,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:36,713 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-18 22:46:36,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:46:36,713 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-18 22:46:36,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 22:46:36,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:36,714 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:36,714 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:36,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:36,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1045046635, now seen corresponding path program 14 times [2018-11-18 22:46:36,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:36,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:36,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:36,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:36,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:37,452 INFO L256 TraceCheckUtils]: 0: Hoare triple {6284#true} call ULTIMATE.init(); {6284#true} is VALID [2018-11-18 22:46:37,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {6284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6284#true} is VALID [2018-11-18 22:46:37,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {6284#true} assume true; {6284#true} is VALID [2018-11-18 22:46:37,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6284#true} {6284#true} #64#return; {6284#true} is VALID [2018-11-18 22:46:37,453 INFO L256 TraceCheckUtils]: 4: Hoare triple {6284#true} call #t~ret2 := main(); {6284#true} is VALID [2018-11-18 22:46:37,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {6284#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6286#(= main_~i~0 0)} is VALID [2018-11-18 22:46:37,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {6286#(= main_~i~0 0)} assume true; {6286#(= main_~i~0 0)} is VALID [2018-11-18 22:46:37,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {6286#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6287#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:37,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {6287#(<= main_~i~0 1)} assume true; {6287#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:37,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {6287#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6288#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:37,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {6288#(<= main_~i~0 2)} assume true; {6288#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:37,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {6288#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6289#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:37,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {6289#(<= main_~i~0 3)} assume true; {6289#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:37,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {6289#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6290#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:37,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {6290#(<= main_~i~0 4)} assume true; {6290#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:37,464 INFO L273 TraceCheckUtils]: 15: Hoare triple {6290#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6291#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:37,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {6291#(<= main_~i~0 5)} assume true; {6291#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:37,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {6291#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6292#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:37,466 INFO L273 TraceCheckUtils]: 18: Hoare triple {6292#(<= main_~i~0 6)} assume true; {6292#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:37,468 INFO L273 TraceCheckUtils]: 19: Hoare triple {6292#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6293#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:37,468 INFO L273 TraceCheckUtils]: 20: Hoare triple {6293#(<= main_~i~0 7)} assume true; {6293#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:37,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {6293#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6294#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:37,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {6294#(<= main_~i~0 8)} assume true; {6294#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:37,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {6294#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6295#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:37,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {6295#(<= main_~i~0 9)} assume true; {6295#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:37,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {6295#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6296#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:37,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {6296#(<= main_~i~0 10)} assume true; {6296#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:37,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {6296#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6297#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:37,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {6297#(<= main_~i~0 11)} assume true; {6297#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:37,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {6297#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6298#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:37,478 INFO L273 TraceCheckUtils]: 30: Hoare triple {6298#(<= main_~i~0 12)} assume true; {6298#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:37,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {6298#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6299#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:37,479 INFO L273 TraceCheckUtils]: 32: Hoare triple {6299#(<= main_~i~0 13)} assume true; {6299#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:37,480 INFO L273 TraceCheckUtils]: 33: Hoare triple {6299#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6300#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:37,480 INFO L273 TraceCheckUtils]: 34: Hoare triple {6300#(<= main_~i~0 14)} assume true; {6300#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:37,481 INFO L273 TraceCheckUtils]: 35: Hoare triple {6300#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6285#false} is VALID [2018-11-18 22:46:37,481 INFO L273 TraceCheckUtils]: 36: Hoare triple {6285#false} ~i~0 := 0; {6285#false} is VALID [2018-11-18 22:46:37,481 INFO L273 TraceCheckUtils]: 37: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,482 INFO L273 TraceCheckUtils]: 40: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,482 INFO L273 TraceCheckUtils]: 41: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,482 INFO L273 TraceCheckUtils]: 42: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,483 INFO L273 TraceCheckUtils]: 43: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,483 INFO L273 TraceCheckUtils]: 44: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,483 INFO L273 TraceCheckUtils]: 45: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,483 INFO L273 TraceCheckUtils]: 46: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,483 INFO L273 TraceCheckUtils]: 47: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,484 INFO L273 TraceCheckUtils]: 48: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,484 INFO L273 TraceCheckUtils]: 49: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,484 INFO L273 TraceCheckUtils]: 50: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,484 INFO L273 TraceCheckUtils]: 51: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,484 INFO L273 TraceCheckUtils]: 52: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,484 INFO L273 TraceCheckUtils]: 53: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,484 INFO L273 TraceCheckUtils]: 54: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,484 INFO L273 TraceCheckUtils]: 55: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,485 INFO L273 TraceCheckUtils]: 56: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,485 INFO L273 TraceCheckUtils]: 57: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,485 INFO L273 TraceCheckUtils]: 58: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,485 INFO L273 TraceCheckUtils]: 59: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,485 INFO L273 TraceCheckUtils]: 60: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,485 INFO L273 TraceCheckUtils]: 61: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,485 INFO L273 TraceCheckUtils]: 62: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,485 INFO L273 TraceCheckUtils]: 63: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,486 INFO L273 TraceCheckUtils]: 64: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,486 INFO L273 TraceCheckUtils]: 65: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,486 INFO L273 TraceCheckUtils]: 66: Hoare triple {6285#false} assume !(~i~0 < 100000); {6285#false} is VALID [2018-11-18 22:46:37,486 INFO L273 TraceCheckUtils]: 67: Hoare triple {6285#false} havoc ~x~0;~x~0 := 0; {6285#false} is VALID [2018-11-18 22:46:37,486 INFO L273 TraceCheckUtils]: 68: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,486 INFO L273 TraceCheckUtils]: 69: Hoare triple {6285#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6285#false} is VALID [2018-11-18 22:46:37,486 INFO L256 TraceCheckUtils]: 70: Hoare triple {6285#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {6285#false} is VALID [2018-11-18 22:46:37,486 INFO L273 TraceCheckUtils]: 71: Hoare triple {6285#false} ~cond := #in~cond; {6285#false} is VALID [2018-11-18 22:46:37,487 INFO L273 TraceCheckUtils]: 72: Hoare triple {6285#false} assume 0 == ~cond; {6285#false} is VALID [2018-11-18 22:46:37,487 INFO L273 TraceCheckUtils]: 73: Hoare triple {6285#false} assume !false; {6285#false} is VALID [2018-11-18 22:46:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-18 22:46:37,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:37,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 22:46:37,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:46:37,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:46:37,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:37,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:37,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {6284#true} call ULTIMATE.init(); {6284#true} is VALID [2018-11-18 22:46:37,695 INFO L273 TraceCheckUtils]: 1: Hoare triple {6284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6284#true} is VALID [2018-11-18 22:46:37,695 INFO L273 TraceCheckUtils]: 2: Hoare triple {6284#true} assume true; {6284#true} is VALID [2018-11-18 22:46:37,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6284#true} {6284#true} #64#return; {6284#true} is VALID [2018-11-18 22:46:37,696 INFO L256 TraceCheckUtils]: 4: Hoare triple {6284#true} call #t~ret2 := main(); {6284#true} is VALID [2018-11-18 22:46:37,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {6284#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6319#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:37,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {6319#(<= main_~i~0 0)} assume true; {6319#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:37,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {6319#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6287#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:37,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {6287#(<= main_~i~0 1)} assume true; {6287#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:37,721 INFO L273 TraceCheckUtils]: 9: Hoare triple {6287#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6288#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:37,721 INFO L273 TraceCheckUtils]: 10: Hoare triple {6288#(<= main_~i~0 2)} assume true; {6288#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:37,722 INFO L273 TraceCheckUtils]: 11: Hoare triple {6288#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6289#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:37,722 INFO L273 TraceCheckUtils]: 12: Hoare triple {6289#(<= main_~i~0 3)} assume true; {6289#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:37,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {6289#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6290#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:37,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {6290#(<= main_~i~0 4)} assume true; {6290#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:37,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {6290#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6291#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:37,724 INFO L273 TraceCheckUtils]: 16: Hoare triple {6291#(<= main_~i~0 5)} assume true; {6291#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:37,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {6291#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6292#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:37,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {6292#(<= main_~i~0 6)} assume true; {6292#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:37,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {6292#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6293#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:37,727 INFO L273 TraceCheckUtils]: 20: Hoare triple {6293#(<= main_~i~0 7)} assume true; {6293#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:37,728 INFO L273 TraceCheckUtils]: 21: Hoare triple {6293#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6294#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:37,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {6294#(<= main_~i~0 8)} assume true; {6294#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:37,729 INFO L273 TraceCheckUtils]: 23: Hoare triple {6294#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6295#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:37,730 INFO L273 TraceCheckUtils]: 24: Hoare triple {6295#(<= main_~i~0 9)} assume true; {6295#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:37,731 INFO L273 TraceCheckUtils]: 25: Hoare triple {6295#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6296#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:37,731 INFO L273 TraceCheckUtils]: 26: Hoare triple {6296#(<= main_~i~0 10)} assume true; {6296#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:37,732 INFO L273 TraceCheckUtils]: 27: Hoare triple {6296#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6297#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:37,733 INFO L273 TraceCheckUtils]: 28: Hoare triple {6297#(<= main_~i~0 11)} assume true; {6297#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:37,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {6297#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6298#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:37,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {6298#(<= main_~i~0 12)} assume true; {6298#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:37,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {6298#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6299#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:37,736 INFO L273 TraceCheckUtils]: 32: Hoare triple {6299#(<= main_~i~0 13)} assume true; {6299#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:37,737 INFO L273 TraceCheckUtils]: 33: Hoare triple {6299#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6300#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:37,737 INFO L273 TraceCheckUtils]: 34: Hoare triple {6300#(<= main_~i~0 14)} assume true; {6300#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:37,738 INFO L273 TraceCheckUtils]: 35: Hoare triple {6300#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6285#false} is VALID [2018-11-18 22:46:37,738 INFO L273 TraceCheckUtils]: 36: Hoare triple {6285#false} ~i~0 := 0; {6285#false} is VALID [2018-11-18 22:46:37,738 INFO L273 TraceCheckUtils]: 37: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,739 INFO L273 TraceCheckUtils]: 38: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,739 INFO L273 TraceCheckUtils]: 40: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,740 INFO L273 TraceCheckUtils]: 41: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,740 INFO L273 TraceCheckUtils]: 42: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,740 INFO L273 TraceCheckUtils]: 43: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,741 INFO L273 TraceCheckUtils]: 45: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,741 INFO L273 TraceCheckUtils]: 46: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,741 INFO L273 TraceCheckUtils]: 47: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,741 INFO L273 TraceCheckUtils]: 48: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,742 INFO L273 TraceCheckUtils]: 49: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,742 INFO L273 TraceCheckUtils]: 50: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,742 INFO L273 TraceCheckUtils]: 51: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,742 INFO L273 TraceCheckUtils]: 52: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,742 INFO L273 TraceCheckUtils]: 53: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,742 INFO L273 TraceCheckUtils]: 54: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,743 INFO L273 TraceCheckUtils]: 55: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,743 INFO L273 TraceCheckUtils]: 56: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,743 INFO L273 TraceCheckUtils]: 57: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,743 INFO L273 TraceCheckUtils]: 58: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,743 INFO L273 TraceCheckUtils]: 59: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,743 INFO L273 TraceCheckUtils]: 60: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,744 INFO L273 TraceCheckUtils]: 61: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,744 INFO L273 TraceCheckUtils]: 62: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,744 INFO L273 TraceCheckUtils]: 63: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,744 INFO L273 TraceCheckUtils]: 64: Hoare triple {6285#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6285#false} is VALID [2018-11-18 22:46:37,744 INFO L273 TraceCheckUtils]: 65: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,744 INFO L273 TraceCheckUtils]: 66: Hoare triple {6285#false} assume !(~i~0 < 100000); {6285#false} is VALID [2018-11-18 22:46:37,745 INFO L273 TraceCheckUtils]: 67: Hoare triple {6285#false} havoc ~x~0;~x~0 := 0; {6285#false} is VALID [2018-11-18 22:46:37,745 INFO L273 TraceCheckUtils]: 68: Hoare triple {6285#false} assume true; {6285#false} is VALID [2018-11-18 22:46:37,745 INFO L273 TraceCheckUtils]: 69: Hoare triple {6285#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6285#false} is VALID [2018-11-18 22:46:37,745 INFO L256 TraceCheckUtils]: 70: Hoare triple {6285#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {6285#false} is VALID [2018-11-18 22:46:37,745 INFO L273 TraceCheckUtils]: 71: Hoare triple {6285#false} ~cond := #in~cond; {6285#false} is VALID [2018-11-18 22:46:37,745 INFO L273 TraceCheckUtils]: 72: Hoare triple {6285#false} assume 0 == ~cond; {6285#false} is VALID [2018-11-18 22:46:37,746 INFO L273 TraceCheckUtils]: 73: Hoare triple {6285#false} assume !false; {6285#false} is VALID [2018-11-18 22:46:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-18 22:46:37,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:37,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 22:46:37,772 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2018-11-18 22:46:37,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:37,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:46:37,823 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-18 22:46:37,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:46:37,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:46:37,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:46:37,824 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 18 states. [2018-11-18 22:46:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:38,238 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-11-18 22:46:38,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:46:38,238 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2018-11-18 22:46:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:46:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 103 transitions. [2018-11-18 22:46:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:46:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 103 transitions. [2018-11-18 22:46:38,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 103 transitions. [2018-11-18 22:46:38,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:38,364 INFO L225 Difference]: With dead ends: 126 [2018-11-18 22:46:38,364 INFO L226 Difference]: Without dead ends: 83 [2018-11-18 22:46:38,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:46:38,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-18 22:46:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-18 22:46:38,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:38,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2018-11-18 22:46:38,470 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-18 22:46:38,470 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-18 22:46:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:38,472 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-18 22:46:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-18 22:46:38,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:38,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:38,472 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-18 22:46:38,473 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-18 22:46:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:38,474 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-18 22:46:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-18 22:46:38,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:38,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:38,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:38,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 22:46:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-18 22:46:38,477 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 74 [2018-11-18 22:46:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:38,477 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-18 22:46:38,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:46:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-18 22:46:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 22:46:38,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:38,478 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:38,478 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:38,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:38,479 INFO L82 PathProgramCache]: Analyzing trace with hash 119074603, now seen corresponding path program 15 times [2018-11-18 22:46:38,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:38,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:38,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:38,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:38,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:39,392 INFO L256 TraceCheckUtils]: 0: Hoare triple {6994#true} call ULTIMATE.init(); {6994#true} is VALID [2018-11-18 22:46:39,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {6994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6994#true} is VALID [2018-11-18 22:46:39,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {6994#true} assume true; {6994#true} is VALID [2018-11-18 22:46:39,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6994#true} {6994#true} #64#return; {6994#true} is VALID [2018-11-18 22:46:39,393 INFO L256 TraceCheckUtils]: 4: Hoare triple {6994#true} call #t~ret2 := main(); {6994#true} is VALID [2018-11-18 22:46:39,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {6994#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6996#(= main_~i~0 0)} is VALID [2018-11-18 22:46:39,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {6996#(= main_~i~0 0)} assume true; {6996#(= main_~i~0 0)} is VALID [2018-11-18 22:46:39,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {6996#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6997#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:39,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {6997#(<= main_~i~0 1)} assume true; {6997#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:39,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {6997#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6998#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:39,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {6998#(<= main_~i~0 2)} assume true; {6998#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:39,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {6998#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6999#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:39,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {6999#(<= main_~i~0 3)} assume true; {6999#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:39,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {6999#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7000#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:39,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {7000#(<= main_~i~0 4)} assume true; {7000#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:39,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {7000#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7001#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:39,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {7001#(<= main_~i~0 5)} assume true; {7001#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:39,401 INFO L273 TraceCheckUtils]: 17: Hoare triple {7001#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7002#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:39,401 INFO L273 TraceCheckUtils]: 18: Hoare triple {7002#(<= main_~i~0 6)} assume true; {7002#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:39,402 INFO L273 TraceCheckUtils]: 19: Hoare triple {7002#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7003#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:39,403 INFO L273 TraceCheckUtils]: 20: Hoare triple {7003#(<= main_~i~0 7)} assume true; {7003#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:39,404 INFO L273 TraceCheckUtils]: 21: Hoare triple {7003#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7004#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:39,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {7004#(<= main_~i~0 8)} assume true; {7004#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:39,405 INFO L273 TraceCheckUtils]: 23: Hoare triple {7004#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7005#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:39,406 INFO L273 TraceCheckUtils]: 24: Hoare triple {7005#(<= main_~i~0 9)} assume true; {7005#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:39,407 INFO L273 TraceCheckUtils]: 25: Hoare triple {7005#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7006#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:39,407 INFO L273 TraceCheckUtils]: 26: Hoare triple {7006#(<= main_~i~0 10)} assume true; {7006#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:39,408 INFO L273 TraceCheckUtils]: 27: Hoare triple {7006#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7007#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:39,409 INFO L273 TraceCheckUtils]: 28: Hoare triple {7007#(<= main_~i~0 11)} assume true; {7007#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:39,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {7007#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7008#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:39,410 INFO L273 TraceCheckUtils]: 30: Hoare triple {7008#(<= main_~i~0 12)} assume true; {7008#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:39,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {7008#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7009#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:39,412 INFO L273 TraceCheckUtils]: 32: Hoare triple {7009#(<= main_~i~0 13)} assume true; {7009#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:39,412 INFO L273 TraceCheckUtils]: 33: Hoare triple {7009#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7010#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:39,413 INFO L273 TraceCheckUtils]: 34: Hoare triple {7010#(<= main_~i~0 14)} assume true; {7010#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:39,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {7010#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7011#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:39,414 INFO L273 TraceCheckUtils]: 36: Hoare triple {7011#(<= main_~i~0 15)} assume true; {7011#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:39,415 INFO L273 TraceCheckUtils]: 37: Hoare triple {7011#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6995#false} is VALID [2018-11-18 22:46:39,415 INFO L273 TraceCheckUtils]: 38: Hoare triple {6995#false} ~i~0 := 0; {6995#false} is VALID [2018-11-18 22:46:39,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,416 INFO L273 TraceCheckUtils]: 40: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,416 INFO L273 TraceCheckUtils]: 41: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,416 INFO L273 TraceCheckUtils]: 42: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,416 INFO L273 TraceCheckUtils]: 43: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,417 INFO L273 TraceCheckUtils]: 44: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,417 INFO L273 TraceCheckUtils]: 45: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,417 INFO L273 TraceCheckUtils]: 46: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,417 INFO L273 TraceCheckUtils]: 48: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,418 INFO L273 TraceCheckUtils]: 49: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,418 INFO L273 TraceCheckUtils]: 50: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,418 INFO L273 TraceCheckUtils]: 51: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,418 INFO L273 TraceCheckUtils]: 52: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,419 INFO L273 TraceCheckUtils]: 54: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,419 INFO L273 TraceCheckUtils]: 55: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,419 INFO L273 TraceCheckUtils]: 56: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,419 INFO L273 TraceCheckUtils]: 57: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,419 INFO L273 TraceCheckUtils]: 58: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,420 INFO L273 TraceCheckUtils]: 59: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,420 INFO L273 TraceCheckUtils]: 60: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,420 INFO L273 TraceCheckUtils]: 61: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,420 INFO L273 TraceCheckUtils]: 62: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,420 INFO L273 TraceCheckUtils]: 63: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,420 INFO L273 TraceCheckUtils]: 64: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,420 INFO L273 TraceCheckUtils]: 65: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,420 INFO L273 TraceCheckUtils]: 67: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,421 INFO L273 TraceCheckUtils]: 68: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:39,421 INFO L273 TraceCheckUtils]: 69: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,421 INFO L273 TraceCheckUtils]: 70: Hoare triple {6995#false} assume !(~i~0 < 100000); {6995#false} is VALID [2018-11-18 22:46:39,421 INFO L273 TraceCheckUtils]: 71: Hoare triple {6995#false} havoc ~x~0;~x~0 := 0; {6995#false} is VALID [2018-11-18 22:46:39,421 INFO L273 TraceCheckUtils]: 72: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:39,421 INFO L273 TraceCheckUtils]: 73: Hoare triple {6995#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6995#false} is VALID [2018-11-18 22:46:39,421 INFO L256 TraceCheckUtils]: 74: Hoare triple {6995#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {6995#false} is VALID [2018-11-18 22:46:39,421 INFO L273 TraceCheckUtils]: 75: Hoare triple {6995#false} ~cond := #in~cond; {6995#false} is VALID [2018-11-18 22:46:39,422 INFO L273 TraceCheckUtils]: 76: Hoare triple {6995#false} assume 0 == ~cond; {6995#false} is VALID [2018-11-18 22:46:39,422 INFO L273 TraceCheckUtils]: 77: Hoare triple {6995#false} assume !false; {6995#false} is VALID [2018-11-18 22:46:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-11-18 22:46:39,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:39,425 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-18 22:46:39,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:46:39,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-18 22:46:39,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:39,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:40,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {6994#true} call ULTIMATE.init(); {6994#true} is VALID [2018-11-18 22:46:40,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {6994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6994#true} is VALID [2018-11-18 22:46:40,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {6994#true} assume true; {6994#true} is VALID [2018-11-18 22:46:40,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6994#true} {6994#true} #64#return; {6994#true} is VALID [2018-11-18 22:46:40,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {6994#true} call #t~ret2 := main(); {6994#true} is VALID [2018-11-18 22:46:40,189 INFO L273 TraceCheckUtils]: 5: Hoare triple {6994#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7030#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:40,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {7030#(<= main_~i~0 0)} assume true; {7030#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:40,190 INFO L273 TraceCheckUtils]: 7: Hoare triple {7030#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6997#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:40,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {6997#(<= main_~i~0 1)} assume true; {6997#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:40,191 INFO L273 TraceCheckUtils]: 9: Hoare triple {6997#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6998#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:40,192 INFO L273 TraceCheckUtils]: 10: Hoare triple {6998#(<= main_~i~0 2)} assume true; {6998#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:40,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {6998#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6999#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:40,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {6999#(<= main_~i~0 3)} assume true; {6999#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:40,194 INFO L273 TraceCheckUtils]: 13: Hoare triple {6999#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7000#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:40,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {7000#(<= main_~i~0 4)} assume true; {7000#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:40,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {7000#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7001#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:40,196 INFO L273 TraceCheckUtils]: 16: Hoare triple {7001#(<= main_~i~0 5)} assume true; {7001#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:40,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {7001#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7002#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:40,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {7002#(<= main_~i~0 6)} assume true; {7002#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:40,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {7002#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7003#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:40,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {7003#(<= main_~i~0 7)} assume true; {7003#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:40,200 INFO L273 TraceCheckUtils]: 21: Hoare triple {7003#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7004#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:40,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {7004#(<= main_~i~0 8)} assume true; {7004#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:40,201 INFO L273 TraceCheckUtils]: 23: Hoare triple {7004#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7005#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:40,202 INFO L273 TraceCheckUtils]: 24: Hoare triple {7005#(<= main_~i~0 9)} assume true; {7005#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:40,203 INFO L273 TraceCheckUtils]: 25: Hoare triple {7005#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7006#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:40,203 INFO L273 TraceCheckUtils]: 26: Hoare triple {7006#(<= main_~i~0 10)} assume true; {7006#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:40,204 INFO L273 TraceCheckUtils]: 27: Hoare triple {7006#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7007#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:40,205 INFO L273 TraceCheckUtils]: 28: Hoare triple {7007#(<= main_~i~0 11)} assume true; {7007#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:40,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {7007#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7008#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:40,206 INFO L273 TraceCheckUtils]: 30: Hoare triple {7008#(<= main_~i~0 12)} assume true; {7008#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:40,207 INFO L273 TraceCheckUtils]: 31: Hoare triple {7008#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7009#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:40,208 INFO L273 TraceCheckUtils]: 32: Hoare triple {7009#(<= main_~i~0 13)} assume true; {7009#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:40,209 INFO L273 TraceCheckUtils]: 33: Hoare triple {7009#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7010#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:40,209 INFO L273 TraceCheckUtils]: 34: Hoare triple {7010#(<= main_~i~0 14)} assume true; {7010#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:40,210 INFO L273 TraceCheckUtils]: 35: Hoare triple {7010#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7011#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:40,211 INFO L273 TraceCheckUtils]: 36: Hoare triple {7011#(<= main_~i~0 15)} assume true; {7011#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:40,211 INFO L273 TraceCheckUtils]: 37: Hoare triple {7011#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6995#false} is VALID [2018-11-18 22:46:40,212 INFO L273 TraceCheckUtils]: 38: Hoare triple {6995#false} ~i~0 := 0; {6995#false} is VALID [2018-11-18 22:46:40,212 INFO L273 TraceCheckUtils]: 39: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,212 INFO L273 TraceCheckUtils]: 40: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,212 INFO L273 TraceCheckUtils]: 41: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,212 INFO L273 TraceCheckUtils]: 42: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,213 INFO L273 TraceCheckUtils]: 43: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,213 INFO L273 TraceCheckUtils]: 44: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,213 INFO L273 TraceCheckUtils]: 45: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,213 INFO L273 TraceCheckUtils]: 46: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,213 INFO L273 TraceCheckUtils]: 47: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,214 INFO L273 TraceCheckUtils]: 48: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,214 INFO L273 TraceCheckUtils]: 49: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,214 INFO L273 TraceCheckUtils]: 50: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,214 INFO L273 TraceCheckUtils]: 51: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,214 INFO L273 TraceCheckUtils]: 52: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,215 INFO L273 TraceCheckUtils]: 53: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,215 INFO L273 TraceCheckUtils]: 54: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,215 INFO L273 TraceCheckUtils]: 55: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,215 INFO L273 TraceCheckUtils]: 56: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,215 INFO L273 TraceCheckUtils]: 57: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,215 INFO L273 TraceCheckUtils]: 58: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,215 INFO L273 TraceCheckUtils]: 59: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,215 INFO L273 TraceCheckUtils]: 60: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,216 INFO L273 TraceCheckUtils]: 61: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,216 INFO L273 TraceCheckUtils]: 62: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,216 INFO L273 TraceCheckUtils]: 63: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,216 INFO L273 TraceCheckUtils]: 64: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,216 INFO L273 TraceCheckUtils]: 65: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,216 INFO L273 TraceCheckUtils]: 66: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,216 INFO L273 TraceCheckUtils]: 67: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,216 INFO L273 TraceCheckUtils]: 68: Hoare triple {6995#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6995#false} is VALID [2018-11-18 22:46:40,217 INFO L273 TraceCheckUtils]: 69: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,217 INFO L273 TraceCheckUtils]: 70: Hoare triple {6995#false} assume !(~i~0 < 100000); {6995#false} is VALID [2018-11-18 22:46:40,217 INFO L273 TraceCheckUtils]: 71: Hoare triple {6995#false} havoc ~x~0;~x~0 := 0; {6995#false} is VALID [2018-11-18 22:46:40,217 INFO L273 TraceCheckUtils]: 72: Hoare triple {6995#false} assume true; {6995#false} is VALID [2018-11-18 22:46:40,217 INFO L273 TraceCheckUtils]: 73: Hoare triple {6995#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6995#false} is VALID [2018-11-18 22:46:40,217 INFO L256 TraceCheckUtils]: 74: Hoare triple {6995#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {6995#false} is VALID [2018-11-18 22:46:40,217 INFO L273 TraceCheckUtils]: 75: Hoare triple {6995#false} ~cond := #in~cond; {6995#false} is VALID [2018-11-18 22:46:40,217 INFO L273 TraceCheckUtils]: 76: Hoare triple {6995#false} assume 0 == ~cond; {6995#false} is VALID [2018-11-18 22:46:40,217 INFO L273 TraceCheckUtils]: 77: Hoare triple {6995#false} assume !false; {6995#false} is VALID [2018-11-18 22:46:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-11-18 22:46:40,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:40,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 22:46:40,242 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-11-18 22:46:40,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:40,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:46:40,288 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-18 22:46:40,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:46:40,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:46:40,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:46:40,289 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 19 states. [2018-11-18 22:46:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:40,786 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2018-11-18 22:46:40,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:46:40,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-11-18 22:46:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:46:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 107 transitions. [2018-11-18 22:46:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:46:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 107 transitions. [2018-11-18 22:46:40,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 107 transitions. [2018-11-18 22:46:40,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:40,906 INFO L225 Difference]: With dead ends: 132 [2018-11-18 22:46:40,906 INFO L226 Difference]: Without dead ends: 87 [2018-11-18 22:46:40,907 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:46:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-18 22:46:41,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-18 22:46:41,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:41,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 87 states. [2018-11-18 22:46:41,035 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2018-11-18 22:46:41,035 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2018-11-18 22:46:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:41,037 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-18 22:46:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-18 22:46:41,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:41,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:41,038 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2018-11-18 22:46:41,038 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2018-11-18 22:46:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:41,040 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-18 22:46:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-18 22:46:41,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:41,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:41,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:41,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-18 22:46:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-11-18 22:46:41,043 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 78 [2018-11-18 22:46:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:41,043 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-11-18 22:46:41,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:46:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-18 22:46:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 22:46:41,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:41,044 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:41,045 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:41,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1840372245, now seen corresponding path program 16 times [2018-11-18 22:46:41,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:41,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:41,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:41,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {7740#true} call ULTIMATE.init(); {7740#true} is VALID [2018-11-18 22:46:41,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {7740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7740#true} is VALID [2018-11-18 22:46:41,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {7740#true} assume true; {7740#true} is VALID [2018-11-18 22:46:41,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7740#true} {7740#true} #64#return; {7740#true} is VALID [2018-11-18 22:46:41,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {7740#true} call #t~ret2 := main(); {7740#true} is VALID [2018-11-18 22:46:41,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {7740#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7742#(= main_~i~0 0)} is VALID [2018-11-18 22:46:41,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {7742#(= main_~i~0 0)} assume true; {7742#(= main_~i~0 0)} is VALID [2018-11-18 22:46:41,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {7742#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7743#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:41,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {7743#(<= main_~i~0 1)} assume true; {7743#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:41,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {7743#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7744#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:41,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {7744#(<= main_~i~0 2)} assume true; {7744#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:41,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {7744#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7745#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:41,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {7745#(<= main_~i~0 3)} assume true; {7745#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:41,538 INFO L273 TraceCheckUtils]: 13: Hoare triple {7745#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7746#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:41,539 INFO L273 TraceCheckUtils]: 14: Hoare triple {7746#(<= main_~i~0 4)} assume true; {7746#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:41,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {7746#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7747#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:41,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {7747#(<= main_~i~0 5)} assume true; {7747#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:41,542 INFO L273 TraceCheckUtils]: 17: Hoare triple {7747#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7748#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:41,542 INFO L273 TraceCheckUtils]: 18: Hoare triple {7748#(<= main_~i~0 6)} assume true; {7748#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:41,543 INFO L273 TraceCheckUtils]: 19: Hoare triple {7748#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7749#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:41,544 INFO L273 TraceCheckUtils]: 20: Hoare triple {7749#(<= main_~i~0 7)} assume true; {7749#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:41,545 INFO L273 TraceCheckUtils]: 21: Hoare triple {7749#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7750#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:41,546 INFO L273 TraceCheckUtils]: 22: Hoare triple {7750#(<= main_~i~0 8)} assume true; {7750#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:41,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {7750#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7751#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:41,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {7751#(<= main_~i~0 9)} assume true; {7751#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:41,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {7751#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7752#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:41,549 INFO L273 TraceCheckUtils]: 26: Hoare triple {7752#(<= main_~i~0 10)} assume true; {7752#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:41,550 INFO L273 TraceCheckUtils]: 27: Hoare triple {7752#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7753#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:41,551 INFO L273 TraceCheckUtils]: 28: Hoare triple {7753#(<= main_~i~0 11)} assume true; {7753#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:41,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {7753#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7754#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:41,552 INFO L273 TraceCheckUtils]: 30: Hoare triple {7754#(<= main_~i~0 12)} assume true; {7754#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:41,553 INFO L273 TraceCheckUtils]: 31: Hoare triple {7754#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7755#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:41,554 INFO L273 TraceCheckUtils]: 32: Hoare triple {7755#(<= main_~i~0 13)} assume true; {7755#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:41,555 INFO L273 TraceCheckUtils]: 33: Hoare triple {7755#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7756#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:41,556 INFO L273 TraceCheckUtils]: 34: Hoare triple {7756#(<= main_~i~0 14)} assume true; {7756#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:41,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {7756#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7757#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:41,557 INFO L273 TraceCheckUtils]: 36: Hoare triple {7757#(<= main_~i~0 15)} assume true; {7757#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:41,558 INFO L273 TraceCheckUtils]: 37: Hoare triple {7757#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7758#(<= main_~i~0 16)} is VALID [2018-11-18 22:46:41,559 INFO L273 TraceCheckUtils]: 38: Hoare triple {7758#(<= main_~i~0 16)} assume true; {7758#(<= main_~i~0 16)} is VALID [2018-11-18 22:46:41,560 INFO L273 TraceCheckUtils]: 39: Hoare triple {7758#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-18 22:46:41,560 INFO L273 TraceCheckUtils]: 40: Hoare triple {7741#false} ~i~0 := 0; {7741#false} is VALID [2018-11-18 22:46:41,560 INFO L273 TraceCheckUtils]: 41: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,561 INFO L273 TraceCheckUtils]: 42: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,561 INFO L273 TraceCheckUtils]: 43: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,561 INFO L273 TraceCheckUtils]: 44: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,562 INFO L273 TraceCheckUtils]: 45: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,562 INFO L273 TraceCheckUtils]: 46: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,562 INFO L273 TraceCheckUtils]: 47: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,562 INFO L273 TraceCheckUtils]: 48: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,563 INFO L273 TraceCheckUtils]: 49: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,563 INFO L273 TraceCheckUtils]: 50: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,563 INFO L273 TraceCheckUtils]: 51: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,563 INFO L273 TraceCheckUtils]: 52: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,564 INFO L273 TraceCheckUtils]: 53: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,564 INFO L273 TraceCheckUtils]: 54: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,564 INFO L273 TraceCheckUtils]: 55: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,564 INFO L273 TraceCheckUtils]: 56: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,564 INFO L273 TraceCheckUtils]: 57: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,565 INFO L273 TraceCheckUtils]: 58: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,565 INFO L273 TraceCheckUtils]: 59: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,565 INFO L273 TraceCheckUtils]: 60: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,565 INFO L273 TraceCheckUtils]: 61: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,565 INFO L273 TraceCheckUtils]: 62: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,565 INFO L273 TraceCheckUtils]: 63: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,566 INFO L273 TraceCheckUtils]: 64: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,566 INFO L273 TraceCheckUtils]: 65: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,566 INFO L273 TraceCheckUtils]: 66: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,566 INFO L273 TraceCheckUtils]: 67: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,566 INFO L273 TraceCheckUtils]: 68: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,566 INFO L273 TraceCheckUtils]: 69: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,566 INFO L273 TraceCheckUtils]: 70: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,567 INFO L273 TraceCheckUtils]: 71: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,567 INFO L273 TraceCheckUtils]: 72: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:41,567 INFO L273 TraceCheckUtils]: 73: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,567 INFO L273 TraceCheckUtils]: 74: Hoare triple {7741#false} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-18 22:46:41,567 INFO L273 TraceCheckUtils]: 75: Hoare triple {7741#false} havoc ~x~0;~x~0 := 0; {7741#false} is VALID [2018-11-18 22:46:41,567 INFO L273 TraceCheckUtils]: 76: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:41,567 INFO L273 TraceCheckUtils]: 77: Hoare triple {7741#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7741#false} is VALID [2018-11-18 22:46:41,568 INFO L256 TraceCheckUtils]: 78: Hoare triple {7741#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {7741#false} is VALID [2018-11-18 22:46:41,568 INFO L273 TraceCheckUtils]: 79: Hoare triple {7741#false} ~cond := #in~cond; {7741#false} is VALID [2018-11-18 22:46:41,568 INFO L273 TraceCheckUtils]: 80: Hoare triple {7741#false} assume 0 == ~cond; {7741#false} is VALID [2018-11-18 22:46:41,568 INFO L273 TraceCheckUtils]: 81: Hoare triple {7741#false} assume !false; {7741#false} is VALID [2018-11-18 22:46:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-18 22:46:41,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:41,575 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-18 22:46:41,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:46:41,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:46:41,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:41,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:41,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {7740#true} call ULTIMATE.init(); {7740#true} is VALID [2018-11-18 22:46:41,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {7740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7740#true} is VALID [2018-11-18 22:46:41,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {7740#true} assume true; {7740#true} is VALID [2018-11-18 22:46:41,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7740#true} {7740#true} #64#return; {7740#true} is VALID [2018-11-18 22:46:41,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {7740#true} call #t~ret2 := main(); {7740#true} is VALID [2018-11-18 22:46:41,927 INFO L273 TraceCheckUtils]: 5: Hoare triple {7740#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7777#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:41,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {7777#(<= main_~i~0 0)} assume true; {7777#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:41,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {7777#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7743#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:41,963 INFO L273 TraceCheckUtils]: 8: Hoare triple {7743#(<= main_~i~0 1)} assume true; {7743#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:41,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {7743#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7744#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:41,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {7744#(<= main_~i~0 2)} assume true; {7744#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:41,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {7744#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7745#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:42,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {7745#(<= main_~i~0 3)} assume true; {7745#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:42,020 INFO L273 TraceCheckUtils]: 13: Hoare triple {7745#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7746#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:42,036 INFO L273 TraceCheckUtils]: 14: Hoare triple {7746#(<= main_~i~0 4)} assume true; {7746#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:42,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {7746#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7747#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:42,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {7747#(<= main_~i~0 5)} assume true; {7747#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:42,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {7747#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7748#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:42,086 INFO L273 TraceCheckUtils]: 18: Hoare triple {7748#(<= main_~i~0 6)} assume true; {7748#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:42,099 INFO L273 TraceCheckUtils]: 19: Hoare triple {7748#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7749#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:42,116 INFO L273 TraceCheckUtils]: 20: Hoare triple {7749#(<= main_~i~0 7)} assume true; {7749#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:42,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {7749#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7750#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:42,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {7750#(<= main_~i~0 8)} assume true; {7750#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:42,150 INFO L273 TraceCheckUtils]: 23: Hoare triple {7750#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7751#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:42,163 INFO L273 TraceCheckUtils]: 24: Hoare triple {7751#(<= main_~i~0 9)} assume true; {7751#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:42,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {7751#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7752#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:42,189 INFO L273 TraceCheckUtils]: 26: Hoare triple {7752#(<= main_~i~0 10)} assume true; {7752#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:42,202 INFO L273 TraceCheckUtils]: 27: Hoare triple {7752#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7753#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:42,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {7753#(<= main_~i~0 11)} assume true; {7753#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:42,227 INFO L273 TraceCheckUtils]: 29: Hoare triple {7753#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7754#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:42,245 INFO L273 TraceCheckUtils]: 30: Hoare triple {7754#(<= main_~i~0 12)} assume true; {7754#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:42,255 INFO L273 TraceCheckUtils]: 31: Hoare triple {7754#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7755#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:42,267 INFO L273 TraceCheckUtils]: 32: Hoare triple {7755#(<= main_~i~0 13)} assume true; {7755#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:42,280 INFO L273 TraceCheckUtils]: 33: Hoare triple {7755#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7756#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:42,293 INFO L273 TraceCheckUtils]: 34: Hoare triple {7756#(<= main_~i~0 14)} assume true; {7756#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:42,308 INFO L273 TraceCheckUtils]: 35: Hoare triple {7756#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7757#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:42,317 INFO L273 TraceCheckUtils]: 36: Hoare triple {7757#(<= main_~i~0 15)} assume true; {7757#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:42,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {7757#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7758#(<= main_~i~0 16)} is VALID [2018-11-18 22:46:42,342 INFO L273 TraceCheckUtils]: 38: Hoare triple {7758#(<= main_~i~0 16)} assume true; {7758#(<= main_~i~0 16)} is VALID [2018-11-18 22:46:42,355 INFO L273 TraceCheckUtils]: 39: Hoare triple {7758#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-18 22:46:42,355 INFO L273 TraceCheckUtils]: 40: Hoare triple {7741#false} ~i~0 := 0; {7741#false} is VALID [2018-11-18 22:46:42,356 INFO L273 TraceCheckUtils]: 41: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,356 INFO L273 TraceCheckUtils]: 42: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,356 INFO L273 TraceCheckUtils]: 43: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,356 INFO L273 TraceCheckUtils]: 44: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,356 INFO L273 TraceCheckUtils]: 45: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,357 INFO L273 TraceCheckUtils]: 46: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,357 INFO L273 TraceCheckUtils]: 47: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,357 INFO L273 TraceCheckUtils]: 48: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,357 INFO L273 TraceCheckUtils]: 49: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,357 INFO L273 TraceCheckUtils]: 50: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,357 INFO L273 TraceCheckUtils]: 51: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,358 INFO L273 TraceCheckUtils]: 52: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,358 INFO L273 TraceCheckUtils]: 53: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,358 INFO L273 TraceCheckUtils]: 54: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,358 INFO L273 TraceCheckUtils]: 55: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,359 INFO L273 TraceCheckUtils]: 56: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,359 INFO L273 TraceCheckUtils]: 57: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,359 INFO L273 TraceCheckUtils]: 58: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,359 INFO L273 TraceCheckUtils]: 59: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,359 INFO L273 TraceCheckUtils]: 60: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,360 INFO L273 TraceCheckUtils]: 61: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,360 INFO L273 TraceCheckUtils]: 62: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,360 INFO L273 TraceCheckUtils]: 63: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,360 INFO L273 TraceCheckUtils]: 64: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,361 INFO L273 TraceCheckUtils]: 65: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,361 INFO L273 TraceCheckUtils]: 66: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,361 INFO L273 TraceCheckUtils]: 67: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,361 INFO L273 TraceCheckUtils]: 68: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,362 INFO L273 TraceCheckUtils]: 69: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,362 INFO L273 TraceCheckUtils]: 70: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,362 INFO L273 TraceCheckUtils]: 71: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,362 INFO L273 TraceCheckUtils]: 72: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-18 22:46:42,362 INFO L273 TraceCheckUtils]: 73: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,363 INFO L273 TraceCheckUtils]: 74: Hoare triple {7741#false} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-18 22:46:42,363 INFO L273 TraceCheckUtils]: 75: Hoare triple {7741#false} havoc ~x~0;~x~0 := 0; {7741#false} is VALID [2018-11-18 22:46:42,363 INFO L273 TraceCheckUtils]: 76: Hoare triple {7741#false} assume true; {7741#false} is VALID [2018-11-18 22:46:42,363 INFO L273 TraceCheckUtils]: 77: Hoare triple {7741#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7741#false} is VALID [2018-11-18 22:46:42,364 INFO L256 TraceCheckUtils]: 78: Hoare triple {7741#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {7741#false} is VALID [2018-11-18 22:46:42,364 INFO L273 TraceCheckUtils]: 79: Hoare triple {7741#false} ~cond := #in~cond; {7741#false} is VALID [2018-11-18 22:46:42,364 INFO L273 TraceCheckUtils]: 80: Hoare triple {7741#false} assume 0 == ~cond; {7741#false} is VALID [2018-11-18 22:46:42,364 INFO L273 TraceCheckUtils]: 81: Hoare triple {7741#false} assume !false; {7741#false} is VALID [2018-11-18 22:46:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-18 22:46:42,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:42,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-18 22:46:42,410 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2018-11-18 22:46:42,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:42,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:46:42,751 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-18 22:46:42,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:46:42,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:46:42,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:46:42,753 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 20 states. [2018-11-18 22:46:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:43,211 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-11-18 22:46:43,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:46:43,212 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2018-11-18 22:46:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:46:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2018-11-18 22:46:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:46:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2018-11-18 22:46:43,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 111 transitions. [2018-11-18 22:46:43,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:43,382 INFO L225 Difference]: With dead ends: 138 [2018-11-18 22:46:43,382 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 22:46:43,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:46:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 22:46:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-18 22:46:43,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:43,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2018-11-18 22:46:43,425 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-18 22:46:43,425 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-18 22:46:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:43,427 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-11-18 22:46:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-18 22:46:43,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:43,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:43,428 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-18 22:46:43,428 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-18 22:46:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:43,430 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-11-18 22:46:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-18 22:46:43,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:43,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:43,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:43,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 22:46:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-11-18 22:46:43,433 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 82 [2018-11-18 22:46:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:43,433 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-11-18 22:46:43,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:46:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-18 22:46:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-18 22:46:43,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:43,435 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:43,435 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:43,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash 701237675, now seen corresponding path program 17 times [2018-11-18 22:46:43,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:43,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:43,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:43,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:44,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {8522#true} call ULTIMATE.init(); {8522#true} is VALID [2018-11-18 22:46:44,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {8522#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8522#true} is VALID [2018-11-18 22:46:44,624 INFO L273 TraceCheckUtils]: 2: Hoare triple {8522#true} assume true; {8522#true} is VALID [2018-11-18 22:46:44,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8522#true} {8522#true} #64#return; {8522#true} is VALID [2018-11-18 22:46:44,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {8522#true} call #t~ret2 := main(); {8522#true} is VALID [2018-11-18 22:46:44,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {8522#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8524#(= main_~i~0 0)} is VALID [2018-11-18 22:46:44,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {8524#(= main_~i~0 0)} assume true; {8524#(= main_~i~0 0)} is VALID [2018-11-18 22:46:44,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {8524#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8525#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:44,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {8525#(<= main_~i~0 1)} assume true; {8525#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:44,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {8525#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8526#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:44,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {8526#(<= main_~i~0 2)} assume true; {8526#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:44,630 INFO L273 TraceCheckUtils]: 11: Hoare triple {8526#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8527#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:44,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {8527#(<= main_~i~0 3)} assume true; {8527#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:44,631 INFO L273 TraceCheckUtils]: 13: Hoare triple {8527#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:44,632 INFO L273 TraceCheckUtils]: 14: Hoare triple {8528#(<= main_~i~0 4)} assume true; {8528#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:44,633 INFO L273 TraceCheckUtils]: 15: Hoare triple {8528#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:44,633 INFO L273 TraceCheckUtils]: 16: Hoare triple {8529#(<= main_~i~0 5)} assume true; {8529#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:44,634 INFO L273 TraceCheckUtils]: 17: Hoare triple {8529#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8530#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:44,635 INFO L273 TraceCheckUtils]: 18: Hoare triple {8530#(<= main_~i~0 6)} assume true; {8530#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:44,636 INFO L273 TraceCheckUtils]: 19: Hoare triple {8530#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8531#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:44,636 INFO L273 TraceCheckUtils]: 20: Hoare triple {8531#(<= main_~i~0 7)} assume true; {8531#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:44,637 INFO L273 TraceCheckUtils]: 21: Hoare triple {8531#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8532#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:44,638 INFO L273 TraceCheckUtils]: 22: Hoare triple {8532#(<= main_~i~0 8)} assume true; {8532#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:44,639 INFO L273 TraceCheckUtils]: 23: Hoare triple {8532#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8533#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:44,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {8533#(<= main_~i~0 9)} assume true; {8533#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:44,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {8533#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8534#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:44,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {8534#(<= main_~i~0 10)} assume true; {8534#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:44,642 INFO L273 TraceCheckUtils]: 27: Hoare triple {8534#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8535#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:44,642 INFO L273 TraceCheckUtils]: 28: Hoare triple {8535#(<= main_~i~0 11)} assume true; {8535#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:44,643 INFO L273 TraceCheckUtils]: 29: Hoare triple {8535#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8536#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:44,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {8536#(<= main_~i~0 12)} assume true; {8536#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:44,645 INFO L273 TraceCheckUtils]: 31: Hoare triple {8536#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8537#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:44,645 INFO L273 TraceCheckUtils]: 32: Hoare triple {8537#(<= main_~i~0 13)} assume true; {8537#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:44,646 INFO L273 TraceCheckUtils]: 33: Hoare triple {8537#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8538#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:44,647 INFO L273 TraceCheckUtils]: 34: Hoare triple {8538#(<= main_~i~0 14)} assume true; {8538#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:44,648 INFO L273 TraceCheckUtils]: 35: Hoare triple {8538#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8539#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:44,648 INFO L273 TraceCheckUtils]: 36: Hoare triple {8539#(<= main_~i~0 15)} assume true; {8539#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:44,649 INFO L273 TraceCheckUtils]: 37: Hoare triple {8539#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8540#(<= main_~i~0 16)} is VALID [2018-11-18 22:46:44,650 INFO L273 TraceCheckUtils]: 38: Hoare triple {8540#(<= main_~i~0 16)} assume true; {8540#(<= main_~i~0 16)} is VALID [2018-11-18 22:46:44,669 INFO L273 TraceCheckUtils]: 39: Hoare triple {8540#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8541#(<= main_~i~0 17)} is VALID [2018-11-18 22:46:44,683 INFO L273 TraceCheckUtils]: 40: Hoare triple {8541#(<= main_~i~0 17)} assume true; {8541#(<= main_~i~0 17)} is VALID [2018-11-18 22:46:44,692 INFO L273 TraceCheckUtils]: 41: Hoare triple {8541#(<= main_~i~0 17)} assume !(~i~0 < 100000); {8523#false} is VALID [2018-11-18 22:46:44,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {8523#false} ~i~0 := 0; {8523#false} is VALID [2018-11-18 22:46:44,692 INFO L273 TraceCheckUtils]: 43: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,693 INFO L273 TraceCheckUtils]: 45: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,693 INFO L273 TraceCheckUtils]: 46: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,693 INFO L273 TraceCheckUtils]: 47: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,693 INFO L273 TraceCheckUtils]: 48: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,693 INFO L273 TraceCheckUtils]: 49: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,693 INFO L273 TraceCheckUtils]: 50: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,694 INFO L273 TraceCheckUtils]: 51: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,694 INFO L273 TraceCheckUtils]: 52: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,694 INFO L273 TraceCheckUtils]: 53: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,694 INFO L273 TraceCheckUtils]: 54: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,694 INFO L273 TraceCheckUtils]: 55: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,695 INFO L273 TraceCheckUtils]: 56: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,695 INFO L273 TraceCheckUtils]: 57: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,695 INFO L273 TraceCheckUtils]: 58: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,695 INFO L273 TraceCheckUtils]: 59: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,695 INFO L273 TraceCheckUtils]: 60: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,695 INFO L273 TraceCheckUtils]: 61: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,695 INFO L273 TraceCheckUtils]: 62: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,696 INFO L273 TraceCheckUtils]: 63: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,696 INFO L273 TraceCheckUtils]: 64: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,696 INFO L273 TraceCheckUtils]: 65: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,696 INFO L273 TraceCheckUtils]: 66: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,696 INFO L273 TraceCheckUtils]: 67: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,696 INFO L273 TraceCheckUtils]: 68: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,697 INFO L273 TraceCheckUtils]: 69: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,697 INFO L273 TraceCheckUtils]: 70: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,697 INFO L273 TraceCheckUtils]: 71: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,697 INFO L273 TraceCheckUtils]: 72: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,697 INFO L273 TraceCheckUtils]: 73: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,697 INFO L273 TraceCheckUtils]: 74: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,698 INFO L273 TraceCheckUtils]: 75: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,698 INFO L273 TraceCheckUtils]: 76: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:44,698 INFO L273 TraceCheckUtils]: 77: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,698 INFO L273 TraceCheckUtils]: 78: Hoare triple {8523#false} assume !(~i~0 < 100000); {8523#false} is VALID [2018-11-18 22:46:44,698 INFO L273 TraceCheckUtils]: 79: Hoare triple {8523#false} havoc ~x~0;~x~0 := 0; {8523#false} is VALID [2018-11-18 22:46:44,698 INFO L273 TraceCheckUtils]: 80: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:44,699 INFO L273 TraceCheckUtils]: 81: Hoare triple {8523#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8523#false} is VALID [2018-11-18 22:46:44,699 INFO L256 TraceCheckUtils]: 82: Hoare triple {8523#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {8523#false} is VALID [2018-11-18 22:46:44,699 INFO L273 TraceCheckUtils]: 83: Hoare triple {8523#false} ~cond := #in~cond; {8523#false} is VALID [2018-11-18 22:46:44,699 INFO L273 TraceCheckUtils]: 84: Hoare triple {8523#false} assume 0 == ~cond; {8523#false} is VALID [2018-11-18 22:46:44,699 INFO L273 TraceCheckUtils]: 85: Hoare triple {8523#false} assume !false; {8523#false} is VALID [2018-11-18 22:46:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-11-18 22:46:44,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:44,705 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-18 22:46:44,714 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:46:57,791 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-18 22:46:57,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:57,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:58,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {8522#true} call ULTIMATE.init(); {8522#true} is VALID [2018-11-18 22:46:58,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {8522#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8522#true} is VALID [2018-11-18 22:46:58,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {8522#true} assume true; {8522#true} is VALID [2018-11-18 22:46:58,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8522#true} {8522#true} #64#return; {8522#true} is VALID [2018-11-18 22:46:58,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {8522#true} call #t~ret2 := main(); {8522#true} is VALID [2018-11-18 22:46:58,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {8522#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8560#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:58,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {8560#(<= main_~i~0 0)} assume true; {8560#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:58,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {8560#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8525#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:58,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {8525#(<= main_~i~0 1)} assume true; {8525#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:58,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {8525#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8526#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:58,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {8526#(<= main_~i~0 2)} assume true; {8526#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:58,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {8526#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8527#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:58,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {8527#(<= main_~i~0 3)} assume true; {8527#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:58,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {8527#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:58,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {8528#(<= main_~i~0 4)} assume true; {8528#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:58,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {8528#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:58,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {8529#(<= main_~i~0 5)} assume true; {8529#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:58,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {8529#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8530#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:58,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {8530#(<= main_~i~0 6)} assume true; {8530#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:58,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {8530#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8531#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:58,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {8531#(<= main_~i~0 7)} assume true; {8531#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:58,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {8531#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8532#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:58,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {8532#(<= main_~i~0 8)} assume true; {8532#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:58,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {8532#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8533#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:58,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {8533#(<= main_~i~0 9)} assume true; {8533#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:58,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {8533#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8534#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:58,020 INFO L273 TraceCheckUtils]: 26: Hoare triple {8534#(<= main_~i~0 10)} assume true; {8534#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:58,021 INFO L273 TraceCheckUtils]: 27: Hoare triple {8534#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8535#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:58,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {8535#(<= main_~i~0 11)} assume true; {8535#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:58,022 INFO L273 TraceCheckUtils]: 29: Hoare triple {8535#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8536#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:58,023 INFO L273 TraceCheckUtils]: 30: Hoare triple {8536#(<= main_~i~0 12)} assume true; {8536#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:58,024 INFO L273 TraceCheckUtils]: 31: Hoare triple {8536#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8537#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:58,024 INFO L273 TraceCheckUtils]: 32: Hoare triple {8537#(<= main_~i~0 13)} assume true; {8537#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:58,025 INFO L273 TraceCheckUtils]: 33: Hoare triple {8537#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8538#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:58,026 INFO L273 TraceCheckUtils]: 34: Hoare triple {8538#(<= main_~i~0 14)} assume true; {8538#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:58,026 INFO L273 TraceCheckUtils]: 35: Hoare triple {8538#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8539#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:58,027 INFO L273 TraceCheckUtils]: 36: Hoare triple {8539#(<= main_~i~0 15)} assume true; {8539#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:58,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {8539#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8540#(<= main_~i~0 16)} is VALID [2018-11-18 22:46:58,028 INFO L273 TraceCheckUtils]: 38: Hoare triple {8540#(<= main_~i~0 16)} assume true; {8540#(<= main_~i~0 16)} is VALID [2018-11-18 22:46:58,029 INFO L273 TraceCheckUtils]: 39: Hoare triple {8540#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8541#(<= main_~i~0 17)} is VALID [2018-11-18 22:46:58,030 INFO L273 TraceCheckUtils]: 40: Hoare triple {8541#(<= main_~i~0 17)} assume true; {8541#(<= main_~i~0 17)} is VALID [2018-11-18 22:46:58,031 INFO L273 TraceCheckUtils]: 41: Hoare triple {8541#(<= main_~i~0 17)} assume !(~i~0 < 100000); {8523#false} is VALID [2018-11-18 22:46:58,031 INFO L273 TraceCheckUtils]: 42: Hoare triple {8523#false} ~i~0 := 0; {8523#false} is VALID [2018-11-18 22:46:58,031 INFO L273 TraceCheckUtils]: 43: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,031 INFO L273 TraceCheckUtils]: 44: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,031 INFO L273 TraceCheckUtils]: 45: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,032 INFO L273 TraceCheckUtils]: 46: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,032 INFO L273 TraceCheckUtils]: 47: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,032 INFO L273 TraceCheckUtils]: 48: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,032 INFO L273 TraceCheckUtils]: 49: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,033 INFO L273 TraceCheckUtils]: 50: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,033 INFO L273 TraceCheckUtils]: 51: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,033 INFO L273 TraceCheckUtils]: 52: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,033 INFO L273 TraceCheckUtils]: 53: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,033 INFO L273 TraceCheckUtils]: 54: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,033 INFO L273 TraceCheckUtils]: 55: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,033 INFO L273 TraceCheckUtils]: 56: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,033 INFO L273 TraceCheckUtils]: 57: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,033 INFO L273 TraceCheckUtils]: 58: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,034 INFO L273 TraceCheckUtils]: 59: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,034 INFO L273 TraceCheckUtils]: 60: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,034 INFO L273 TraceCheckUtils]: 61: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,034 INFO L273 TraceCheckUtils]: 62: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,034 INFO L273 TraceCheckUtils]: 63: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,034 INFO L273 TraceCheckUtils]: 64: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,034 INFO L273 TraceCheckUtils]: 65: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,034 INFO L273 TraceCheckUtils]: 66: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,034 INFO L273 TraceCheckUtils]: 67: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,035 INFO L273 TraceCheckUtils]: 68: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,035 INFO L273 TraceCheckUtils]: 69: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,035 INFO L273 TraceCheckUtils]: 70: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,035 INFO L273 TraceCheckUtils]: 71: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,035 INFO L273 TraceCheckUtils]: 72: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,035 INFO L273 TraceCheckUtils]: 73: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,035 INFO L273 TraceCheckUtils]: 74: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,035 INFO L273 TraceCheckUtils]: 75: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,036 INFO L273 TraceCheckUtils]: 76: Hoare triple {8523#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#false} is VALID [2018-11-18 22:46:58,036 INFO L273 TraceCheckUtils]: 77: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,036 INFO L273 TraceCheckUtils]: 78: Hoare triple {8523#false} assume !(~i~0 < 100000); {8523#false} is VALID [2018-11-18 22:46:58,036 INFO L273 TraceCheckUtils]: 79: Hoare triple {8523#false} havoc ~x~0;~x~0 := 0; {8523#false} is VALID [2018-11-18 22:46:58,036 INFO L273 TraceCheckUtils]: 80: Hoare triple {8523#false} assume true; {8523#false} is VALID [2018-11-18 22:46:58,036 INFO L273 TraceCheckUtils]: 81: Hoare triple {8523#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8523#false} is VALID [2018-11-18 22:46:58,036 INFO L256 TraceCheckUtils]: 82: Hoare triple {8523#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {8523#false} is VALID [2018-11-18 22:46:58,036 INFO L273 TraceCheckUtils]: 83: Hoare triple {8523#false} ~cond := #in~cond; {8523#false} is VALID [2018-11-18 22:46:58,036 INFO L273 TraceCheckUtils]: 84: Hoare triple {8523#false} assume 0 == ~cond; {8523#false} is VALID [2018-11-18 22:46:58,037 INFO L273 TraceCheckUtils]: 85: Hoare triple {8523#false} assume !false; {8523#false} is VALID [2018-11-18 22:46:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-11-18 22:46:58,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:58,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-18 22:46:58,065 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2018-11-18 22:46:58,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:58,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:46:58,117 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-18 22:46:58,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:46:58,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:46:58,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:46:58,118 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 21 states. [2018-11-18 22:46:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:58,619 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2018-11-18 22:46:58,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 22:46:58,619 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2018-11-18 22:46:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:46:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2018-11-18 22:46:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:46:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2018-11-18 22:46:58,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 115 transitions. [2018-11-18 22:46:58,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:58,738 INFO L225 Difference]: With dead ends: 144 [2018-11-18 22:46:58,739 INFO L226 Difference]: Without dead ends: 95 [2018-11-18 22:46:58,739 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:46:58,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-18 22:46:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-11-18 22:46:58,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:58,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 95 states. [2018-11-18 22:46:58,784 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2018-11-18 22:46:58,784 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2018-11-18 22:46:58,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:58,787 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-18 22:46:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-18 22:46:58,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:58,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:58,787 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2018-11-18 22:46:58,788 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2018-11-18 22:46:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:58,789 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-18 22:46:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-18 22:46:58,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:58,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:58,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:58,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-18 22:46:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-11-18 22:46:58,792 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 86 [2018-11-18 22:46:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:58,792 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-11-18 22:46:58,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:46:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-18 22:46:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 22:46:58,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:58,793 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:58,794 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:58,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:58,794 INFO L82 PathProgramCache]: Analyzing trace with hash 656726635, now seen corresponding path program 18 times [2018-11-18 22:46:58,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:58,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:58,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:59,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {9340#true} call ULTIMATE.init(); {9340#true} is VALID [2018-11-18 22:46:59,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {9340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9340#true} is VALID [2018-11-18 22:46:59,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {9340#true} assume true; {9340#true} is VALID [2018-11-18 22:46:59,237 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9340#true} {9340#true} #64#return; {9340#true} is VALID [2018-11-18 22:46:59,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {9340#true} call #t~ret2 := main(); {9340#true} is VALID [2018-11-18 22:46:59,239 INFO L273 TraceCheckUtils]: 5: Hoare triple {9340#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9342#(= main_~i~0 0)} is VALID [2018-11-18 22:46:59,239 INFO L273 TraceCheckUtils]: 6: Hoare triple {9342#(= main_~i~0 0)} assume true; {9342#(= main_~i~0 0)} is VALID [2018-11-18 22:46:59,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {9342#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9343#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:59,240 INFO L273 TraceCheckUtils]: 8: Hoare triple {9343#(<= main_~i~0 1)} assume true; {9343#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:59,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {9343#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9344#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:59,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {9344#(<= main_~i~0 2)} assume true; {9344#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:59,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {9344#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9345#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:59,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {9345#(<= main_~i~0 3)} assume true; {9345#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:59,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {9345#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9346#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:59,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {9346#(<= main_~i~0 4)} assume true; {9346#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:59,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {9346#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9347#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:59,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {9347#(<= main_~i~0 5)} assume true; {9347#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:59,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {9347#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9348#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:59,247 INFO L273 TraceCheckUtils]: 18: Hoare triple {9348#(<= main_~i~0 6)} assume true; {9348#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:59,248 INFO L273 TraceCheckUtils]: 19: Hoare triple {9348#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9349#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:59,248 INFO L273 TraceCheckUtils]: 20: Hoare triple {9349#(<= main_~i~0 7)} assume true; {9349#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:59,249 INFO L273 TraceCheckUtils]: 21: Hoare triple {9349#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9350#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:59,249 INFO L273 TraceCheckUtils]: 22: Hoare triple {9350#(<= main_~i~0 8)} assume true; {9350#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:59,250 INFO L273 TraceCheckUtils]: 23: Hoare triple {9350#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9351#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:59,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {9351#(<= main_~i~0 9)} assume true; {9351#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:59,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {9351#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9352#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:59,252 INFO L273 TraceCheckUtils]: 26: Hoare triple {9352#(<= main_~i~0 10)} assume true; {9352#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:59,253 INFO L273 TraceCheckUtils]: 27: Hoare triple {9352#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:59,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {9353#(<= main_~i~0 11)} assume true; {9353#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:59,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {9353#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9354#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:59,255 INFO L273 TraceCheckUtils]: 30: Hoare triple {9354#(<= main_~i~0 12)} assume true; {9354#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:59,256 INFO L273 TraceCheckUtils]: 31: Hoare triple {9354#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9355#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:59,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {9355#(<= main_~i~0 13)} assume true; {9355#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:59,258 INFO L273 TraceCheckUtils]: 33: Hoare triple {9355#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9356#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:59,258 INFO L273 TraceCheckUtils]: 34: Hoare triple {9356#(<= main_~i~0 14)} assume true; {9356#(<= main_~i~0 14)} is VALID [2018-11-18 22:46:59,259 INFO L273 TraceCheckUtils]: 35: Hoare triple {9356#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9357#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:59,260 INFO L273 TraceCheckUtils]: 36: Hoare triple {9357#(<= main_~i~0 15)} assume true; {9357#(<= main_~i~0 15)} is VALID [2018-11-18 22:46:59,261 INFO L273 TraceCheckUtils]: 37: Hoare triple {9357#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9358#(<= main_~i~0 16)} is VALID [2018-11-18 22:46:59,261 INFO L273 TraceCheckUtils]: 38: Hoare triple {9358#(<= main_~i~0 16)} assume true; {9358#(<= main_~i~0 16)} is VALID [2018-11-18 22:46:59,262 INFO L273 TraceCheckUtils]: 39: Hoare triple {9358#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9359#(<= main_~i~0 17)} is VALID [2018-11-18 22:46:59,263 INFO L273 TraceCheckUtils]: 40: Hoare triple {9359#(<= main_~i~0 17)} assume true; {9359#(<= main_~i~0 17)} is VALID [2018-11-18 22:46:59,264 INFO L273 TraceCheckUtils]: 41: Hoare triple {9359#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9360#(<= main_~i~0 18)} is VALID [2018-11-18 22:46:59,264 INFO L273 TraceCheckUtils]: 42: Hoare triple {9360#(<= main_~i~0 18)} assume true; {9360#(<= main_~i~0 18)} is VALID [2018-11-18 22:46:59,265 INFO L273 TraceCheckUtils]: 43: Hoare triple {9360#(<= main_~i~0 18)} assume !(~i~0 < 100000); {9341#false} is VALID [2018-11-18 22:46:59,265 INFO L273 TraceCheckUtils]: 44: Hoare triple {9341#false} ~i~0 := 0; {9341#false} is VALID [2018-11-18 22:46:59,265 INFO L273 TraceCheckUtils]: 45: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,265 INFO L273 TraceCheckUtils]: 46: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,266 INFO L273 TraceCheckUtils]: 47: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,266 INFO L273 TraceCheckUtils]: 48: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,266 INFO L273 TraceCheckUtils]: 49: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,266 INFO L273 TraceCheckUtils]: 50: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,266 INFO L273 TraceCheckUtils]: 51: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,267 INFO L273 TraceCheckUtils]: 52: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,267 INFO L273 TraceCheckUtils]: 53: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,267 INFO L273 TraceCheckUtils]: 54: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,267 INFO L273 TraceCheckUtils]: 55: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,267 INFO L273 TraceCheckUtils]: 56: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,268 INFO L273 TraceCheckUtils]: 57: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,268 INFO L273 TraceCheckUtils]: 58: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,268 INFO L273 TraceCheckUtils]: 59: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,268 INFO L273 TraceCheckUtils]: 60: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,268 INFO L273 TraceCheckUtils]: 61: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,269 INFO L273 TraceCheckUtils]: 62: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,269 INFO L273 TraceCheckUtils]: 63: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,269 INFO L273 TraceCheckUtils]: 64: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,269 INFO L273 TraceCheckUtils]: 65: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,269 INFO L273 TraceCheckUtils]: 66: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,269 INFO L273 TraceCheckUtils]: 67: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,269 INFO L273 TraceCheckUtils]: 68: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,269 INFO L273 TraceCheckUtils]: 69: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,270 INFO L273 TraceCheckUtils]: 70: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,270 INFO L273 TraceCheckUtils]: 71: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,270 INFO L273 TraceCheckUtils]: 72: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,270 INFO L273 TraceCheckUtils]: 73: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,270 INFO L273 TraceCheckUtils]: 74: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,270 INFO L273 TraceCheckUtils]: 75: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,270 INFO L273 TraceCheckUtils]: 76: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,270 INFO L273 TraceCheckUtils]: 77: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,270 INFO L273 TraceCheckUtils]: 78: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,271 INFO L273 TraceCheckUtils]: 79: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,271 INFO L273 TraceCheckUtils]: 80: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:46:59,271 INFO L273 TraceCheckUtils]: 81: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,271 INFO L273 TraceCheckUtils]: 82: Hoare triple {9341#false} assume !(~i~0 < 100000); {9341#false} is VALID [2018-11-18 22:46:59,271 INFO L273 TraceCheckUtils]: 83: Hoare triple {9341#false} havoc ~x~0;~x~0 := 0; {9341#false} is VALID [2018-11-18 22:46:59,271 INFO L273 TraceCheckUtils]: 84: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:46:59,271 INFO L273 TraceCheckUtils]: 85: Hoare triple {9341#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9341#false} is VALID [2018-11-18 22:46:59,271 INFO L256 TraceCheckUtils]: 86: Hoare triple {9341#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {9341#false} is VALID [2018-11-18 22:46:59,272 INFO L273 TraceCheckUtils]: 87: Hoare triple {9341#false} ~cond := #in~cond; {9341#false} is VALID [2018-11-18 22:46:59,272 INFO L273 TraceCheckUtils]: 88: Hoare triple {9341#false} assume 0 == ~cond; {9341#false} is VALID [2018-11-18 22:46:59,272 INFO L273 TraceCheckUtils]: 89: Hoare triple {9341#false} assume !false; {9341#false} is VALID [2018-11-18 22:46:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-18 22:46:59,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:59,276 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-18 22:46:59,289 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:47:24,183 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-18 22:47:24,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:24,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:24,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {9340#true} call ULTIMATE.init(); {9340#true} is VALID [2018-11-18 22:47:24,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {9340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9340#true} is VALID [2018-11-18 22:47:24,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {9340#true} assume true; {9340#true} is VALID [2018-11-18 22:47:24,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9340#true} {9340#true} #64#return; {9340#true} is VALID [2018-11-18 22:47:24,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {9340#true} call #t~ret2 := main(); {9340#true} is VALID [2018-11-18 22:47:24,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {9340#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9379#(<= main_~i~0 0)} is VALID [2018-11-18 22:47:24,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {9379#(<= main_~i~0 0)} assume true; {9379#(<= main_~i~0 0)} is VALID [2018-11-18 22:47:24,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {9379#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9343#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:24,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {9343#(<= main_~i~0 1)} assume true; {9343#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:24,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {9343#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9344#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:24,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {9344#(<= main_~i~0 2)} assume true; {9344#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:24,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {9344#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9345#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:24,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {9345#(<= main_~i~0 3)} assume true; {9345#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:24,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {9345#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9346#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:24,400 INFO L273 TraceCheckUtils]: 14: Hoare triple {9346#(<= main_~i~0 4)} assume true; {9346#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:24,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {9346#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9347#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:24,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {9347#(<= main_~i~0 5)} assume true; {9347#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:24,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {9347#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9348#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:24,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {9348#(<= main_~i~0 6)} assume true; {9348#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:24,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {9348#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9349#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:24,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {9349#(<= main_~i~0 7)} assume true; {9349#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:24,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {9349#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9350#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:24,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {9350#(<= main_~i~0 8)} assume true; {9350#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:24,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {9350#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9351#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:24,407 INFO L273 TraceCheckUtils]: 24: Hoare triple {9351#(<= main_~i~0 9)} assume true; {9351#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:24,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {9351#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9352#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:24,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {9352#(<= main_~i~0 10)} assume true; {9352#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:24,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {9352#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9353#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:24,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {9353#(<= main_~i~0 11)} assume true; {9353#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:24,411 INFO L273 TraceCheckUtils]: 29: Hoare triple {9353#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9354#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:24,412 INFO L273 TraceCheckUtils]: 30: Hoare triple {9354#(<= main_~i~0 12)} assume true; {9354#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:24,413 INFO L273 TraceCheckUtils]: 31: Hoare triple {9354#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9355#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:24,413 INFO L273 TraceCheckUtils]: 32: Hoare triple {9355#(<= main_~i~0 13)} assume true; {9355#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:24,414 INFO L273 TraceCheckUtils]: 33: Hoare triple {9355#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9356#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:24,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {9356#(<= main_~i~0 14)} assume true; {9356#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:24,415 INFO L273 TraceCheckUtils]: 35: Hoare triple {9356#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9357#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:24,416 INFO L273 TraceCheckUtils]: 36: Hoare triple {9357#(<= main_~i~0 15)} assume true; {9357#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:24,417 INFO L273 TraceCheckUtils]: 37: Hoare triple {9357#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9358#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:24,417 INFO L273 TraceCheckUtils]: 38: Hoare triple {9358#(<= main_~i~0 16)} assume true; {9358#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:24,418 INFO L273 TraceCheckUtils]: 39: Hoare triple {9358#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9359#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:24,419 INFO L273 TraceCheckUtils]: 40: Hoare triple {9359#(<= main_~i~0 17)} assume true; {9359#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:24,420 INFO L273 TraceCheckUtils]: 41: Hoare triple {9359#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9360#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:24,420 INFO L273 TraceCheckUtils]: 42: Hoare triple {9360#(<= main_~i~0 18)} assume true; {9360#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:24,421 INFO L273 TraceCheckUtils]: 43: Hoare triple {9360#(<= main_~i~0 18)} assume !(~i~0 < 100000); {9341#false} is VALID [2018-11-18 22:47:24,421 INFO L273 TraceCheckUtils]: 44: Hoare triple {9341#false} ~i~0 := 0; {9341#false} is VALID [2018-11-18 22:47:24,421 INFO L273 TraceCheckUtils]: 45: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,422 INFO L273 TraceCheckUtils]: 46: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,422 INFO L273 TraceCheckUtils]: 47: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,422 INFO L273 TraceCheckUtils]: 48: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,422 INFO L273 TraceCheckUtils]: 49: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,422 INFO L273 TraceCheckUtils]: 50: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,423 INFO L273 TraceCheckUtils]: 51: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,423 INFO L273 TraceCheckUtils]: 52: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,423 INFO L273 TraceCheckUtils]: 53: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,423 INFO L273 TraceCheckUtils]: 54: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,423 INFO L273 TraceCheckUtils]: 55: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,424 INFO L273 TraceCheckUtils]: 56: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,424 INFO L273 TraceCheckUtils]: 57: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,424 INFO L273 TraceCheckUtils]: 58: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,424 INFO L273 TraceCheckUtils]: 59: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,424 INFO L273 TraceCheckUtils]: 60: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,424 INFO L273 TraceCheckUtils]: 61: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,424 INFO L273 TraceCheckUtils]: 62: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,424 INFO L273 TraceCheckUtils]: 63: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,424 INFO L273 TraceCheckUtils]: 64: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,425 INFO L273 TraceCheckUtils]: 65: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,425 INFO L273 TraceCheckUtils]: 66: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,425 INFO L273 TraceCheckUtils]: 67: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,425 INFO L273 TraceCheckUtils]: 68: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,425 INFO L273 TraceCheckUtils]: 69: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,425 INFO L273 TraceCheckUtils]: 70: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,425 INFO L273 TraceCheckUtils]: 71: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,425 INFO L273 TraceCheckUtils]: 72: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,425 INFO L273 TraceCheckUtils]: 73: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,426 INFO L273 TraceCheckUtils]: 74: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,426 INFO L273 TraceCheckUtils]: 75: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,426 INFO L273 TraceCheckUtils]: 76: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,426 INFO L273 TraceCheckUtils]: 77: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,426 INFO L273 TraceCheckUtils]: 78: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,426 INFO L273 TraceCheckUtils]: 79: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,426 INFO L273 TraceCheckUtils]: 80: Hoare triple {9341#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9341#false} is VALID [2018-11-18 22:47:24,426 INFO L273 TraceCheckUtils]: 81: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,426 INFO L273 TraceCheckUtils]: 82: Hoare triple {9341#false} assume !(~i~0 < 100000); {9341#false} is VALID [2018-11-18 22:47:24,427 INFO L273 TraceCheckUtils]: 83: Hoare triple {9341#false} havoc ~x~0;~x~0 := 0; {9341#false} is VALID [2018-11-18 22:47:24,427 INFO L273 TraceCheckUtils]: 84: Hoare triple {9341#false} assume true; {9341#false} is VALID [2018-11-18 22:47:24,427 INFO L273 TraceCheckUtils]: 85: Hoare triple {9341#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9341#false} is VALID [2018-11-18 22:47:24,427 INFO L256 TraceCheckUtils]: 86: Hoare triple {9341#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {9341#false} is VALID [2018-11-18 22:47:24,427 INFO L273 TraceCheckUtils]: 87: Hoare triple {9341#false} ~cond := #in~cond; {9341#false} is VALID [2018-11-18 22:47:24,427 INFO L273 TraceCheckUtils]: 88: Hoare triple {9341#false} assume 0 == ~cond; {9341#false} is VALID [2018-11-18 22:47:24,427 INFO L273 TraceCheckUtils]: 89: Hoare triple {9341#false} assume !false; {9341#false} is VALID [2018-11-18 22:47:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-18 22:47:24,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:24,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-18 22:47:24,458 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2018-11-18 22:47:24,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:24,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-18 22:47:24,511 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-18 22:47:24,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 22:47:24,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 22:47:24,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:47:24,512 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 22 states. [2018-11-18 22:47:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:25,070 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2018-11-18 22:47:25,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 22:47:25,070 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2018-11-18 22:47:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:47:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 119 transitions. [2018-11-18 22:47:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:47:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 119 transitions. [2018-11-18 22:47:25,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 119 transitions. [2018-11-18 22:47:25,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:25,183 INFO L225 Difference]: With dead ends: 150 [2018-11-18 22:47:25,183 INFO L226 Difference]: Without dead ends: 99 [2018-11-18 22:47:25,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:47:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-18 22:47:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-18 22:47:25,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:25,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 99 states. [2018-11-18 22:47:25,248 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 99 states. [2018-11-18 22:47:25,248 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 99 states. [2018-11-18 22:47:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:25,250 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-18 22:47:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-18 22:47:25,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:25,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:25,251 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 99 states. [2018-11-18 22:47:25,251 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 99 states. [2018-11-18 22:47:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:25,252 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-18 22:47:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-18 22:47:25,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:25,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:25,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:25,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 22:47:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-11-18 22:47:25,254 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 90 [2018-11-18 22:47:25,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:25,254 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-11-18 22:47:25,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 22:47:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-18 22:47:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 22:47:25,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:25,255 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:25,255 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:25,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:25,256 INFO L82 PathProgramCache]: Analyzing trace with hash 664459307, now seen corresponding path program 19 times [2018-11-18 22:47:25,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:25,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:25,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:25,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:25,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:25,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {10194#true} call ULTIMATE.init(); {10194#true} is VALID [2018-11-18 22:47:25,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {10194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10194#true} is VALID [2018-11-18 22:47:25,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {10194#true} assume true; {10194#true} is VALID [2018-11-18 22:47:25,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10194#true} {10194#true} #64#return; {10194#true} is VALID [2018-11-18 22:47:25,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {10194#true} call #t~ret2 := main(); {10194#true} is VALID [2018-11-18 22:47:25,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {10194#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10196#(= main_~i~0 0)} is VALID [2018-11-18 22:47:25,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {10196#(= main_~i~0 0)} assume true; {10196#(= main_~i~0 0)} is VALID [2018-11-18 22:47:25,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {10196#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10197#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:25,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {10197#(<= main_~i~0 1)} assume true; {10197#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:25,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {10197#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10198#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:25,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {10198#(<= main_~i~0 2)} assume true; {10198#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:25,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {10198#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10199#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:25,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {10199#(<= main_~i~0 3)} assume true; {10199#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:25,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {10199#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10200#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:25,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {10200#(<= main_~i~0 4)} assume true; {10200#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:25,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {10200#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10201#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:25,645 INFO L273 TraceCheckUtils]: 16: Hoare triple {10201#(<= main_~i~0 5)} assume true; {10201#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:25,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {10201#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10202#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:25,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {10202#(<= main_~i~0 6)} assume true; {10202#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:25,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {10202#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10203#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:25,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {10203#(<= main_~i~0 7)} assume true; {10203#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:25,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {10203#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10204#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:25,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {10204#(<= main_~i~0 8)} assume true; {10204#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:25,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {10204#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:25,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {10205#(<= main_~i~0 9)} assume true; {10205#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:25,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {10205#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:25,652 INFO L273 TraceCheckUtils]: 26: Hoare triple {10206#(<= main_~i~0 10)} assume true; {10206#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:25,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {10206#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10207#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:25,653 INFO L273 TraceCheckUtils]: 28: Hoare triple {10207#(<= main_~i~0 11)} assume true; {10207#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:25,654 INFO L273 TraceCheckUtils]: 29: Hoare triple {10207#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10208#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:25,655 INFO L273 TraceCheckUtils]: 30: Hoare triple {10208#(<= main_~i~0 12)} assume true; {10208#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:25,656 INFO L273 TraceCheckUtils]: 31: Hoare triple {10208#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10209#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:25,656 INFO L273 TraceCheckUtils]: 32: Hoare triple {10209#(<= main_~i~0 13)} assume true; {10209#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:25,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {10209#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10210#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:25,658 INFO L273 TraceCheckUtils]: 34: Hoare triple {10210#(<= main_~i~0 14)} assume true; {10210#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:25,658 INFO L273 TraceCheckUtils]: 35: Hoare triple {10210#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10211#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:25,659 INFO L273 TraceCheckUtils]: 36: Hoare triple {10211#(<= main_~i~0 15)} assume true; {10211#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:25,660 INFO L273 TraceCheckUtils]: 37: Hoare triple {10211#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10212#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:25,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {10212#(<= main_~i~0 16)} assume true; {10212#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:25,661 INFO L273 TraceCheckUtils]: 39: Hoare triple {10212#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10213#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:25,662 INFO L273 TraceCheckUtils]: 40: Hoare triple {10213#(<= main_~i~0 17)} assume true; {10213#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:25,663 INFO L273 TraceCheckUtils]: 41: Hoare triple {10213#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10214#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:25,663 INFO L273 TraceCheckUtils]: 42: Hoare triple {10214#(<= main_~i~0 18)} assume true; {10214#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:25,664 INFO L273 TraceCheckUtils]: 43: Hoare triple {10214#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10215#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:25,665 INFO L273 TraceCheckUtils]: 44: Hoare triple {10215#(<= main_~i~0 19)} assume true; {10215#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:25,666 INFO L273 TraceCheckUtils]: 45: Hoare triple {10215#(<= main_~i~0 19)} assume !(~i~0 < 100000); {10195#false} is VALID [2018-11-18 22:47:25,666 INFO L273 TraceCheckUtils]: 46: Hoare triple {10195#false} ~i~0 := 0; {10195#false} is VALID [2018-11-18 22:47:25,666 INFO L273 TraceCheckUtils]: 47: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,666 INFO L273 TraceCheckUtils]: 48: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,666 INFO L273 TraceCheckUtils]: 49: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,667 INFO L273 TraceCheckUtils]: 50: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,667 INFO L273 TraceCheckUtils]: 51: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,667 INFO L273 TraceCheckUtils]: 52: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,667 INFO L273 TraceCheckUtils]: 53: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,667 INFO L273 TraceCheckUtils]: 54: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,668 INFO L273 TraceCheckUtils]: 55: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,668 INFO L273 TraceCheckUtils]: 56: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,668 INFO L273 TraceCheckUtils]: 57: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,668 INFO L273 TraceCheckUtils]: 58: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,668 INFO L273 TraceCheckUtils]: 59: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,669 INFO L273 TraceCheckUtils]: 60: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,669 INFO L273 TraceCheckUtils]: 61: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,669 INFO L273 TraceCheckUtils]: 62: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,669 INFO L273 TraceCheckUtils]: 63: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,669 INFO L273 TraceCheckUtils]: 64: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,669 INFO L273 TraceCheckUtils]: 65: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,669 INFO L273 TraceCheckUtils]: 66: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,669 INFO L273 TraceCheckUtils]: 67: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,670 INFO L273 TraceCheckUtils]: 68: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,670 INFO L273 TraceCheckUtils]: 69: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,670 INFO L273 TraceCheckUtils]: 70: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,670 INFO L273 TraceCheckUtils]: 71: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,670 INFO L273 TraceCheckUtils]: 72: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,670 INFO L273 TraceCheckUtils]: 73: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,670 INFO L273 TraceCheckUtils]: 74: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,670 INFO L273 TraceCheckUtils]: 75: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,670 INFO L273 TraceCheckUtils]: 76: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,671 INFO L273 TraceCheckUtils]: 77: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,671 INFO L273 TraceCheckUtils]: 78: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,671 INFO L273 TraceCheckUtils]: 79: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,671 INFO L273 TraceCheckUtils]: 80: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,671 INFO L273 TraceCheckUtils]: 81: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,671 INFO L273 TraceCheckUtils]: 82: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,671 INFO L273 TraceCheckUtils]: 83: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,671 INFO L273 TraceCheckUtils]: 84: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:25,671 INFO L273 TraceCheckUtils]: 85: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,672 INFO L273 TraceCheckUtils]: 86: Hoare triple {10195#false} assume !(~i~0 < 100000); {10195#false} is VALID [2018-11-18 22:47:25,672 INFO L273 TraceCheckUtils]: 87: Hoare triple {10195#false} havoc ~x~0;~x~0 := 0; {10195#false} is VALID [2018-11-18 22:47:25,672 INFO L273 TraceCheckUtils]: 88: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:25,672 INFO L273 TraceCheckUtils]: 89: Hoare triple {10195#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10195#false} is VALID [2018-11-18 22:47:25,672 INFO L256 TraceCheckUtils]: 90: Hoare triple {10195#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {10195#false} is VALID [2018-11-18 22:47:25,672 INFO L273 TraceCheckUtils]: 91: Hoare triple {10195#false} ~cond := #in~cond; {10195#false} is VALID [2018-11-18 22:47:25,672 INFO L273 TraceCheckUtils]: 92: Hoare triple {10195#false} assume 0 == ~cond; {10195#false} is VALID [2018-11-18 22:47:25,672 INFO L273 TraceCheckUtils]: 93: Hoare triple {10195#false} assume !false; {10195#false} is VALID [2018-11-18 22:47:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-18 22:47:25,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:25,677 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-18 22:47:25,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:47:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:25,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:25,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {10194#true} call ULTIMATE.init(); {10194#true} is VALID [2018-11-18 22:47:25,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {10194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10194#true} is VALID [2018-11-18 22:47:25,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {10194#true} assume true; {10194#true} is VALID [2018-11-18 22:47:25,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10194#true} {10194#true} #64#return; {10194#true} is VALID [2018-11-18 22:47:25,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {10194#true} call #t~ret2 := main(); {10194#true} is VALID [2018-11-18 22:47:25,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {10194#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10234#(<= main_~i~0 0)} is VALID [2018-11-18 22:47:25,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {10234#(<= main_~i~0 0)} assume true; {10234#(<= main_~i~0 0)} is VALID [2018-11-18 22:47:25,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {10234#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10197#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:25,994 INFO L273 TraceCheckUtils]: 8: Hoare triple {10197#(<= main_~i~0 1)} assume true; {10197#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:25,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {10197#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10198#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:25,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {10198#(<= main_~i~0 2)} assume true; {10198#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:25,996 INFO L273 TraceCheckUtils]: 11: Hoare triple {10198#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10199#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:25,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {10199#(<= main_~i~0 3)} assume true; {10199#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:25,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {10199#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10200#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:25,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {10200#(<= main_~i~0 4)} assume true; {10200#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:25,999 INFO L273 TraceCheckUtils]: 15: Hoare triple {10200#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10201#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:26,000 INFO L273 TraceCheckUtils]: 16: Hoare triple {10201#(<= main_~i~0 5)} assume true; {10201#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:26,000 INFO L273 TraceCheckUtils]: 17: Hoare triple {10201#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10202#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:26,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {10202#(<= main_~i~0 6)} assume true; {10202#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:26,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {10202#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10203#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:26,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {10203#(<= main_~i~0 7)} assume true; {10203#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:26,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {10203#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10204#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:26,004 INFO L273 TraceCheckUtils]: 22: Hoare triple {10204#(<= main_~i~0 8)} assume true; {10204#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:26,005 INFO L273 TraceCheckUtils]: 23: Hoare triple {10204#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:26,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {10205#(<= main_~i~0 9)} assume true; {10205#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:26,006 INFO L273 TraceCheckUtils]: 25: Hoare triple {10205#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:26,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {10206#(<= main_~i~0 10)} assume true; {10206#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:26,008 INFO L273 TraceCheckUtils]: 27: Hoare triple {10206#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10207#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:26,008 INFO L273 TraceCheckUtils]: 28: Hoare triple {10207#(<= main_~i~0 11)} assume true; {10207#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:26,009 INFO L273 TraceCheckUtils]: 29: Hoare triple {10207#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10208#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:26,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {10208#(<= main_~i~0 12)} assume true; {10208#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:26,011 INFO L273 TraceCheckUtils]: 31: Hoare triple {10208#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10209#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:26,011 INFO L273 TraceCheckUtils]: 32: Hoare triple {10209#(<= main_~i~0 13)} assume true; {10209#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:26,012 INFO L273 TraceCheckUtils]: 33: Hoare triple {10209#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10210#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:26,013 INFO L273 TraceCheckUtils]: 34: Hoare triple {10210#(<= main_~i~0 14)} assume true; {10210#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:26,014 INFO L273 TraceCheckUtils]: 35: Hoare triple {10210#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10211#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:26,014 INFO L273 TraceCheckUtils]: 36: Hoare triple {10211#(<= main_~i~0 15)} assume true; {10211#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:26,015 INFO L273 TraceCheckUtils]: 37: Hoare triple {10211#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10212#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:26,016 INFO L273 TraceCheckUtils]: 38: Hoare triple {10212#(<= main_~i~0 16)} assume true; {10212#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:26,017 INFO L273 TraceCheckUtils]: 39: Hoare triple {10212#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10213#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:26,017 INFO L273 TraceCheckUtils]: 40: Hoare triple {10213#(<= main_~i~0 17)} assume true; {10213#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:26,018 INFO L273 TraceCheckUtils]: 41: Hoare triple {10213#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10214#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:26,019 INFO L273 TraceCheckUtils]: 42: Hoare triple {10214#(<= main_~i~0 18)} assume true; {10214#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:26,019 INFO L273 TraceCheckUtils]: 43: Hoare triple {10214#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10215#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:26,020 INFO L273 TraceCheckUtils]: 44: Hoare triple {10215#(<= main_~i~0 19)} assume true; {10215#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:26,021 INFO L273 TraceCheckUtils]: 45: Hoare triple {10215#(<= main_~i~0 19)} assume !(~i~0 < 100000); {10195#false} is VALID [2018-11-18 22:47:26,021 INFO L273 TraceCheckUtils]: 46: Hoare triple {10195#false} ~i~0 := 0; {10195#false} is VALID [2018-11-18 22:47:26,021 INFO L273 TraceCheckUtils]: 47: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,021 INFO L273 TraceCheckUtils]: 48: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,021 INFO L273 TraceCheckUtils]: 49: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,022 INFO L273 TraceCheckUtils]: 50: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,022 INFO L273 TraceCheckUtils]: 51: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,022 INFO L273 TraceCheckUtils]: 52: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,022 INFO L273 TraceCheckUtils]: 53: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,022 INFO L273 TraceCheckUtils]: 54: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,023 INFO L273 TraceCheckUtils]: 55: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,023 INFO L273 TraceCheckUtils]: 56: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,023 INFO L273 TraceCheckUtils]: 57: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,023 INFO L273 TraceCheckUtils]: 58: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,023 INFO L273 TraceCheckUtils]: 59: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,024 INFO L273 TraceCheckUtils]: 60: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,024 INFO L273 TraceCheckUtils]: 61: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,024 INFO L273 TraceCheckUtils]: 62: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,024 INFO L273 TraceCheckUtils]: 63: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,024 INFO L273 TraceCheckUtils]: 64: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,024 INFO L273 TraceCheckUtils]: 65: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,024 INFO L273 TraceCheckUtils]: 66: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,024 INFO L273 TraceCheckUtils]: 67: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,024 INFO L273 TraceCheckUtils]: 68: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,025 INFO L273 TraceCheckUtils]: 69: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,025 INFO L273 TraceCheckUtils]: 70: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,025 INFO L273 TraceCheckUtils]: 71: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,025 INFO L273 TraceCheckUtils]: 72: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,025 INFO L273 TraceCheckUtils]: 73: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,025 INFO L273 TraceCheckUtils]: 74: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,025 INFO L273 TraceCheckUtils]: 75: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,025 INFO L273 TraceCheckUtils]: 76: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,025 INFO L273 TraceCheckUtils]: 77: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,026 INFO L273 TraceCheckUtils]: 78: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,026 INFO L273 TraceCheckUtils]: 79: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,026 INFO L273 TraceCheckUtils]: 80: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,026 INFO L273 TraceCheckUtils]: 81: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,026 INFO L273 TraceCheckUtils]: 82: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,026 INFO L273 TraceCheckUtils]: 83: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,026 INFO L273 TraceCheckUtils]: 84: Hoare triple {10195#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10195#false} is VALID [2018-11-18 22:47:26,026 INFO L273 TraceCheckUtils]: 85: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,027 INFO L273 TraceCheckUtils]: 86: Hoare triple {10195#false} assume !(~i~0 < 100000); {10195#false} is VALID [2018-11-18 22:47:26,027 INFO L273 TraceCheckUtils]: 87: Hoare triple {10195#false} havoc ~x~0;~x~0 := 0; {10195#false} is VALID [2018-11-18 22:47:26,027 INFO L273 TraceCheckUtils]: 88: Hoare triple {10195#false} assume true; {10195#false} is VALID [2018-11-18 22:47:26,027 INFO L273 TraceCheckUtils]: 89: Hoare triple {10195#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10195#false} is VALID [2018-11-18 22:47:26,027 INFO L256 TraceCheckUtils]: 90: Hoare triple {10195#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {10195#false} is VALID [2018-11-18 22:47:26,027 INFO L273 TraceCheckUtils]: 91: Hoare triple {10195#false} ~cond := #in~cond; {10195#false} is VALID [2018-11-18 22:47:26,027 INFO L273 TraceCheckUtils]: 92: Hoare triple {10195#false} assume 0 == ~cond; {10195#false} is VALID [2018-11-18 22:47:26,027 INFO L273 TraceCheckUtils]: 93: Hoare triple {10195#false} assume !false; {10195#false} is VALID [2018-11-18 22:47:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-18 22:47:26,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:26,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-18 22:47:26,052 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-11-18 22:47:26,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:26,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 22:47:26,108 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-18 22:47:26,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 22:47:26,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 22:47:26,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:47:26,109 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 23 states. [2018-11-18 22:47:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:26,727 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2018-11-18 22:47:26,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 22:47:26,727 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-11-18 22:47:26,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:47:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2018-11-18 22:47:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:47:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2018-11-18 22:47:26,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 123 transitions. [2018-11-18 22:47:26,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:26,862 INFO L225 Difference]: With dead ends: 156 [2018-11-18 22:47:26,862 INFO L226 Difference]: Without dead ends: 103 [2018-11-18 22:47:26,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:47:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-18 22:47:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-18 22:47:26,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:26,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 103 states. [2018-11-18 22:47:26,911 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2018-11-18 22:47:26,911 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2018-11-18 22:47:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:26,913 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-11-18 22:47:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-18 22:47:26,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:26,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:26,914 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2018-11-18 22:47:26,914 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2018-11-18 22:47:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:26,915 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-11-18 22:47:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-18 22:47:26,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:26,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:26,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:26,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 22:47:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-11-18 22:47:26,918 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 94 [2018-11-18 22:47:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:26,918 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-11-18 22:47:26,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 22:47:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-18 22:47:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 22:47:26,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:26,920 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:26,920 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:26,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:26,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1075856107, now seen corresponding path program 20 times [2018-11-18 22:47:26,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:26,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:26,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:26,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:47:26,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:27,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {11084#true} call ULTIMATE.init(); {11084#true} is VALID [2018-11-18 22:47:27,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {11084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11084#true} is VALID [2018-11-18 22:47:27,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {11084#true} assume true; {11084#true} is VALID [2018-11-18 22:47:27,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11084#true} {11084#true} #64#return; {11084#true} is VALID [2018-11-18 22:47:27,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {11084#true} call #t~ret2 := main(); {11084#true} is VALID [2018-11-18 22:47:27,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {11084#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11086#(= main_~i~0 0)} is VALID [2018-11-18 22:47:27,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {11086#(= main_~i~0 0)} assume true; {11086#(= main_~i~0 0)} is VALID [2018-11-18 22:47:27,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {11086#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11087#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:27,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {11087#(<= main_~i~0 1)} assume true; {11087#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:27,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {11087#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11088#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:27,717 INFO L273 TraceCheckUtils]: 10: Hoare triple {11088#(<= main_~i~0 2)} assume true; {11088#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:27,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {11088#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11089#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:27,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {11089#(<= main_~i~0 3)} assume true; {11089#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:27,719 INFO L273 TraceCheckUtils]: 13: Hoare triple {11089#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11090#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:27,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {11090#(<= main_~i~0 4)} assume true; {11090#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:27,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {11090#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11091#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:27,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {11091#(<= main_~i~0 5)} assume true; {11091#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:27,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {11091#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11092#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:27,723 INFO L273 TraceCheckUtils]: 18: Hoare triple {11092#(<= main_~i~0 6)} assume true; {11092#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:27,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {11092#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11093#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:27,724 INFO L273 TraceCheckUtils]: 20: Hoare triple {11093#(<= main_~i~0 7)} assume true; {11093#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:27,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {11093#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11094#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:27,726 INFO L273 TraceCheckUtils]: 22: Hoare triple {11094#(<= main_~i~0 8)} assume true; {11094#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:27,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {11094#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11095#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:27,727 INFO L273 TraceCheckUtils]: 24: Hoare triple {11095#(<= main_~i~0 9)} assume true; {11095#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:27,728 INFO L273 TraceCheckUtils]: 25: Hoare triple {11095#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11096#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:27,729 INFO L273 TraceCheckUtils]: 26: Hoare triple {11096#(<= main_~i~0 10)} assume true; {11096#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:27,729 INFO L273 TraceCheckUtils]: 27: Hoare triple {11096#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11097#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:27,730 INFO L273 TraceCheckUtils]: 28: Hoare triple {11097#(<= main_~i~0 11)} assume true; {11097#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:27,731 INFO L273 TraceCheckUtils]: 29: Hoare triple {11097#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11098#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:27,731 INFO L273 TraceCheckUtils]: 30: Hoare triple {11098#(<= main_~i~0 12)} assume true; {11098#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:27,732 INFO L273 TraceCheckUtils]: 31: Hoare triple {11098#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11099#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:27,733 INFO L273 TraceCheckUtils]: 32: Hoare triple {11099#(<= main_~i~0 13)} assume true; {11099#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:27,734 INFO L273 TraceCheckUtils]: 33: Hoare triple {11099#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11100#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:27,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {11100#(<= main_~i~0 14)} assume true; {11100#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:27,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {11100#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:27,736 INFO L273 TraceCheckUtils]: 36: Hoare triple {11101#(<= main_~i~0 15)} assume true; {11101#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:27,737 INFO L273 TraceCheckUtils]: 37: Hoare triple {11101#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:27,737 INFO L273 TraceCheckUtils]: 38: Hoare triple {11102#(<= main_~i~0 16)} assume true; {11102#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:27,738 INFO L273 TraceCheckUtils]: 39: Hoare triple {11102#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:27,739 INFO L273 TraceCheckUtils]: 40: Hoare triple {11103#(<= main_~i~0 17)} assume true; {11103#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:27,740 INFO L273 TraceCheckUtils]: 41: Hoare triple {11103#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11104#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:27,740 INFO L273 TraceCheckUtils]: 42: Hoare triple {11104#(<= main_~i~0 18)} assume true; {11104#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:27,741 INFO L273 TraceCheckUtils]: 43: Hoare triple {11104#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11105#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:27,742 INFO L273 TraceCheckUtils]: 44: Hoare triple {11105#(<= main_~i~0 19)} assume true; {11105#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:27,743 INFO L273 TraceCheckUtils]: 45: Hoare triple {11105#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11106#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:27,743 INFO L273 TraceCheckUtils]: 46: Hoare triple {11106#(<= main_~i~0 20)} assume true; {11106#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:27,744 INFO L273 TraceCheckUtils]: 47: Hoare triple {11106#(<= main_~i~0 20)} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-18 22:47:27,744 INFO L273 TraceCheckUtils]: 48: Hoare triple {11085#false} ~i~0 := 0; {11085#false} is VALID [2018-11-18 22:47:27,744 INFO L273 TraceCheckUtils]: 49: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,744 INFO L273 TraceCheckUtils]: 50: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,745 INFO L273 TraceCheckUtils]: 51: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,745 INFO L273 TraceCheckUtils]: 52: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,745 INFO L273 TraceCheckUtils]: 53: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,745 INFO L273 TraceCheckUtils]: 54: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,745 INFO L273 TraceCheckUtils]: 55: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,746 INFO L273 TraceCheckUtils]: 56: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,746 INFO L273 TraceCheckUtils]: 57: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,746 INFO L273 TraceCheckUtils]: 58: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,746 INFO L273 TraceCheckUtils]: 59: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,746 INFO L273 TraceCheckUtils]: 60: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,747 INFO L273 TraceCheckUtils]: 61: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,747 INFO L273 TraceCheckUtils]: 62: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,747 INFO L273 TraceCheckUtils]: 63: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,747 INFO L273 TraceCheckUtils]: 64: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,747 INFO L273 TraceCheckUtils]: 65: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,748 INFO L273 TraceCheckUtils]: 66: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,748 INFO L273 TraceCheckUtils]: 67: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,748 INFO L273 TraceCheckUtils]: 68: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,748 INFO L273 TraceCheckUtils]: 69: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,748 INFO L273 TraceCheckUtils]: 70: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,748 INFO L273 TraceCheckUtils]: 71: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,748 INFO L273 TraceCheckUtils]: 72: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,748 INFO L273 TraceCheckUtils]: 73: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,749 INFO L273 TraceCheckUtils]: 74: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,749 INFO L273 TraceCheckUtils]: 75: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,749 INFO L273 TraceCheckUtils]: 76: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,749 INFO L273 TraceCheckUtils]: 77: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,749 INFO L273 TraceCheckUtils]: 78: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,749 INFO L273 TraceCheckUtils]: 79: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,749 INFO L273 TraceCheckUtils]: 80: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,749 INFO L273 TraceCheckUtils]: 81: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,749 INFO L273 TraceCheckUtils]: 82: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,750 INFO L273 TraceCheckUtils]: 83: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,750 INFO L273 TraceCheckUtils]: 84: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,750 INFO L273 TraceCheckUtils]: 85: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,750 INFO L273 TraceCheckUtils]: 86: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,750 INFO L273 TraceCheckUtils]: 87: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,750 INFO L273 TraceCheckUtils]: 88: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:27,750 INFO L273 TraceCheckUtils]: 89: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,750 INFO L273 TraceCheckUtils]: 90: Hoare triple {11085#false} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-18 22:47:27,750 INFO L273 TraceCheckUtils]: 91: Hoare triple {11085#false} havoc ~x~0;~x~0 := 0; {11085#false} is VALID [2018-11-18 22:47:27,751 INFO L273 TraceCheckUtils]: 92: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:27,751 INFO L273 TraceCheckUtils]: 93: Hoare triple {11085#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11085#false} is VALID [2018-11-18 22:47:27,751 INFO L256 TraceCheckUtils]: 94: Hoare triple {11085#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {11085#false} is VALID [2018-11-18 22:47:27,751 INFO L273 TraceCheckUtils]: 95: Hoare triple {11085#false} ~cond := #in~cond; {11085#false} is VALID [2018-11-18 22:47:27,751 INFO L273 TraceCheckUtils]: 96: Hoare triple {11085#false} assume 0 == ~cond; {11085#false} is VALID [2018-11-18 22:47:27,751 INFO L273 TraceCheckUtils]: 97: Hoare triple {11085#false} assume !false; {11085#false} is VALID [2018-11-18 22:47:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-18 22:47:27,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:27,756 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-18 22:47:27,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:47:27,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:47:27,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:27,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:27,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {11084#true} call ULTIMATE.init(); {11084#true} is VALID [2018-11-18 22:47:27,984 INFO L273 TraceCheckUtils]: 1: Hoare triple {11084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11084#true} is VALID [2018-11-18 22:47:27,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {11084#true} assume true; {11084#true} is VALID [2018-11-18 22:47:27,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11084#true} {11084#true} #64#return; {11084#true} is VALID [2018-11-18 22:47:27,985 INFO L256 TraceCheckUtils]: 4: Hoare triple {11084#true} call #t~ret2 := main(); {11084#true} is VALID [2018-11-18 22:47:27,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {11084#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11125#(<= main_~i~0 0)} is VALID [2018-11-18 22:47:27,986 INFO L273 TraceCheckUtils]: 6: Hoare triple {11125#(<= main_~i~0 0)} assume true; {11125#(<= main_~i~0 0)} is VALID [2018-11-18 22:47:27,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {11125#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11087#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:27,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {11087#(<= main_~i~0 1)} assume true; {11087#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:27,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {11087#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11088#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:27,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {11088#(<= main_~i~0 2)} assume true; {11088#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:27,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {11088#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11089#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:27,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {11089#(<= main_~i~0 3)} assume true; {11089#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:27,990 INFO L273 TraceCheckUtils]: 13: Hoare triple {11089#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11090#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:27,990 INFO L273 TraceCheckUtils]: 14: Hoare triple {11090#(<= main_~i~0 4)} assume true; {11090#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:27,991 INFO L273 TraceCheckUtils]: 15: Hoare triple {11090#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11091#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:27,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {11091#(<= main_~i~0 5)} assume true; {11091#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:27,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {11091#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11092#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:27,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {11092#(<= main_~i~0 6)} assume true; {11092#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:27,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {11092#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11093#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:27,995 INFO L273 TraceCheckUtils]: 20: Hoare triple {11093#(<= main_~i~0 7)} assume true; {11093#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:27,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {11093#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11094#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:27,996 INFO L273 TraceCheckUtils]: 22: Hoare triple {11094#(<= main_~i~0 8)} assume true; {11094#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:27,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {11094#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11095#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:27,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {11095#(<= main_~i~0 9)} assume true; {11095#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:27,999 INFO L273 TraceCheckUtils]: 25: Hoare triple {11095#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11096#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:27,999 INFO L273 TraceCheckUtils]: 26: Hoare triple {11096#(<= main_~i~0 10)} assume true; {11096#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:28,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {11096#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11097#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:28,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {11097#(<= main_~i~0 11)} assume true; {11097#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:28,002 INFO L273 TraceCheckUtils]: 29: Hoare triple {11097#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11098#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:28,002 INFO L273 TraceCheckUtils]: 30: Hoare triple {11098#(<= main_~i~0 12)} assume true; {11098#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:28,003 INFO L273 TraceCheckUtils]: 31: Hoare triple {11098#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11099#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:28,004 INFO L273 TraceCheckUtils]: 32: Hoare triple {11099#(<= main_~i~0 13)} assume true; {11099#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:28,004 INFO L273 TraceCheckUtils]: 33: Hoare triple {11099#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11100#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:28,005 INFO L273 TraceCheckUtils]: 34: Hoare triple {11100#(<= main_~i~0 14)} assume true; {11100#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:28,006 INFO L273 TraceCheckUtils]: 35: Hoare triple {11100#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:28,006 INFO L273 TraceCheckUtils]: 36: Hoare triple {11101#(<= main_~i~0 15)} assume true; {11101#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:28,007 INFO L273 TraceCheckUtils]: 37: Hoare triple {11101#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:28,008 INFO L273 TraceCheckUtils]: 38: Hoare triple {11102#(<= main_~i~0 16)} assume true; {11102#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:28,009 INFO L273 TraceCheckUtils]: 39: Hoare triple {11102#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:28,009 INFO L273 TraceCheckUtils]: 40: Hoare triple {11103#(<= main_~i~0 17)} assume true; {11103#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:28,010 INFO L273 TraceCheckUtils]: 41: Hoare triple {11103#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11104#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:28,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {11104#(<= main_~i~0 18)} assume true; {11104#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:28,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {11104#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11105#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:28,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {11105#(<= main_~i~0 19)} assume true; {11105#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:28,013 INFO L273 TraceCheckUtils]: 45: Hoare triple {11105#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11106#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:28,014 INFO L273 TraceCheckUtils]: 46: Hoare triple {11106#(<= main_~i~0 20)} assume true; {11106#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:28,014 INFO L273 TraceCheckUtils]: 47: Hoare triple {11106#(<= main_~i~0 20)} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-18 22:47:28,015 INFO L273 TraceCheckUtils]: 48: Hoare triple {11085#false} ~i~0 := 0; {11085#false} is VALID [2018-11-18 22:47:28,015 INFO L273 TraceCheckUtils]: 49: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,015 INFO L273 TraceCheckUtils]: 50: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,015 INFO L273 TraceCheckUtils]: 51: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,015 INFO L273 TraceCheckUtils]: 52: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,016 INFO L273 TraceCheckUtils]: 53: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,016 INFO L273 TraceCheckUtils]: 54: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,016 INFO L273 TraceCheckUtils]: 55: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,016 INFO L273 TraceCheckUtils]: 56: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,016 INFO L273 TraceCheckUtils]: 57: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,016 INFO L273 TraceCheckUtils]: 58: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,017 INFO L273 TraceCheckUtils]: 59: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,017 INFO L273 TraceCheckUtils]: 60: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,017 INFO L273 TraceCheckUtils]: 61: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,017 INFO L273 TraceCheckUtils]: 62: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,018 INFO L273 TraceCheckUtils]: 63: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,018 INFO L273 TraceCheckUtils]: 64: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,018 INFO L273 TraceCheckUtils]: 65: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,018 INFO L273 TraceCheckUtils]: 66: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,018 INFO L273 TraceCheckUtils]: 67: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,018 INFO L273 TraceCheckUtils]: 68: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,018 INFO L273 TraceCheckUtils]: 69: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,019 INFO L273 TraceCheckUtils]: 70: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,019 INFO L273 TraceCheckUtils]: 71: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,019 INFO L273 TraceCheckUtils]: 72: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,019 INFO L273 TraceCheckUtils]: 73: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,019 INFO L273 TraceCheckUtils]: 74: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,019 INFO L273 TraceCheckUtils]: 75: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,019 INFO L273 TraceCheckUtils]: 76: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,019 INFO L273 TraceCheckUtils]: 77: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,019 INFO L273 TraceCheckUtils]: 78: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,020 INFO L273 TraceCheckUtils]: 79: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,020 INFO L273 TraceCheckUtils]: 80: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,020 INFO L273 TraceCheckUtils]: 81: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,020 INFO L273 TraceCheckUtils]: 82: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,020 INFO L273 TraceCheckUtils]: 83: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,020 INFO L273 TraceCheckUtils]: 84: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,020 INFO L273 TraceCheckUtils]: 85: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,020 INFO L273 TraceCheckUtils]: 86: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,021 INFO L273 TraceCheckUtils]: 87: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,021 INFO L273 TraceCheckUtils]: 88: Hoare triple {11085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11085#false} is VALID [2018-11-18 22:47:28,021 INFO L273 TraceCheckUtils]: 89: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,021 INFO L273 TraceCheckUtils]: 90: Hoare triple {11085#false} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-18 22:47:28,021 INFO L273 TraceCheckUtils]: 91: Hoare triple {11085#false} havoc ~x~0;~x~0 := 0; {11085#false} is VALID [2018-11-18 22:47:28,021 INFO L273 TraceCheckUtils]: 92: Hoare triple {11085#false} assume true; {11085#false} is VALID [2018-11-18 22:47:28,021 INFO L273 TraceCheckUtils]: 93: Hoare triple {11085#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11085#false} is VALID [2018-11-18 22:47:28,021 INFO L256 TraceCheckUtils]: 94: Hoare triple {11085#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {11085#false} is VALID [2018-11-18 22:47:28,021 INFO L273 TraceCheckUtils]: 95: Hoare triple {11085#false} ~cond := #in~cond; {11085#false} is VALID [2018-11-18 22:47:28,022 INFO L273 TraceCheckUtils]: 96: Hoare triple {11085#false} assume 0 == ~cond; {11085#false} is VALID [2018-11-18 22:47:28,022 INFO L273 TraceCheckUtils]: 97: Hoare triple {11085#false} assume !false; {11085#false} is VALID [2018-11-18 22:47:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-18 22:47:28,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:28,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-18 22:47:28,046 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2018-11-18 22:47:28,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:28,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 22:47:28,103 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-18 22:47:28,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 22:47:28,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 22:47:28,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:47:28,104 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 24 states. [2018-11-18 22:47:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:28,482 INFO L93 Difference]: Finished difference Result 162 states and 167 transitions. [2018-11-18 22:47:28,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 22:47:28,482 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2018-11-18 22:47:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:47:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 127 transitions. [2018-11-18 22:47:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:47:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 127 transitions. [2018-11-18 22:47:28,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 127 transitions. [2018-11-18 22:47:28,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:28,605 INFO L225 Difference]: With dead ends: 162 [2018-11-18 22:47:28,605 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 22:47:28,606 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 98 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-18 22:47:28,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 22:47:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-18 22:47:28,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:28,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 107 states. [2018-11-18 22:47:28,667 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states. [2018-11-18 22:47:28,667 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states. [2018-11-18 22:47:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:28,668 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-11-18 22:47:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-11-18 22:47:28,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:28,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:28,669 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states. [2018-11-18 22:47:28,669 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states. [2018-11-18 22:47:28,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:28,670 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-11-18 22:47:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-11-18 22:47:28,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:28,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:28,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:28,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-18 22:47:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-11-18 22:47:28,673 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 98 [2018-11-18 22:47:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:28,673 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-11-18 22:47:28,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 22:47:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-11-18 22:47:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 22:47:28,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:28,674 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:28,675 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:28,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash 827808427, now seen corresponding path program 21 times [2018-11-18 22:47:28,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:28,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:28,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:29,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {12010#true} call ULTIMATE.init(); {12010#true} is VALID [2018-11-18 22:47:29,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {12010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12010#true} is VALID [2018-11-18 22:47:29,240 INFO L273 TraceCheckUtils]: 2: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:29,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12010#true} {12010#true} #64#return; {12010#true} is VALID [2018-11-18 22:47:29,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {12010#true} call #t~ret2 := main(); {12010#true} is VALID [2018-11-18 22:47:29,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {12010#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12012#(= main_~i~0 0)} is VALID [2018-11-18 22:47:29,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {12012#(= main_~i~0 0)} assume true; {12012#(= main_~i~0 0)} is VALID [2018-11-18 22:47:29,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {12012#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12013#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:29,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {12013#(<= main_~i~0 1)} assume true; {12013#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:29,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {12013#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12014#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:29,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {12014#(<= main_~i~0 2)} assume true; {12014#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:29,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {12014#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12015#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:29,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {12015#(<= main_~i~0 3)} assume true; {12015#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:29,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {12015#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12016#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:29,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {12016#(<= main_~i~0 4)} assume true; {12016#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:29,249 INFO L273 TraceCheckUtils]: 15: Hoare triple {12016#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12017#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:29,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {12017#(<= main_~i~0 5)} assume true; {12017#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:29,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {12017#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12018#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:29,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {12018#(<= main_~i~0 6)} assume true; {12018#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:29,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {12018#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12019#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:29,252 INFO L273 TraceCheckUtils]: 20: Hoare triple {12019#(<= main_~i~0 7)} assume true; {12019#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:29,253 INFO L273 TraceCheckUtils]: 21: Hoare triple {12019#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12020#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:29,254 INFO L273 TraceCheckUtils]: 22: Hoare triple {12020#(<= main_~i~0 8)} assume true; {12020#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:29,255 INFO L273 TraceCheckUtils]: 23: Hoare triple {12020#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12021#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:29,255 INFO L273 TraceCheckUtils]: 24: Hoare triple {12021#(<= main_~i~0 9)} assume true; {12021#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:29,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {12021#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12022#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:29,257 INFO L273 TraceCheckUtils]: 26: Hoare triple {12022#(<= main_~i~0 10)} assume true; {12022#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:29,257 INFO L273 TraceCheckUtils]: 27: Hoare triple {12022#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12023#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:29,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {12023#(<= main_~i~0 11)} assume true; {12023#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:29,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {12023#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12024#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:29,259 INFO L273 TraceCheckUtils]: 30: Hoare triple {12024#(<= main_~i~0 12)} assume true; {12024#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:29,260 INFO L273 TraceCheckUtils]: 31: Hoare triple {12024#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12025#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:29,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {12025#(<= main_~i~0 13)} assume true; {12025#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:29,262 INFO L273 TraceCheckUtils]: 33: Hoare triple {12025#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12026#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:29,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {12026#(<= main_~i~0 14)} assume true; {12026#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:29,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {12026#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12027#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:29,264 INFO L273 TraceCheckUtils]: 36: Hoare triple {12027#(<= main_~i~0 15)} assume true; {12027#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:29,265 INFO L273 TraceCheckUtils]: 37: Hoare triple {12027#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12028#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:29,265 INFO L273 TraceCheckUtils]: 38: Hoare triple {12028#(<= main_~i~0 16)} assume true; {12028#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:29,266 INFO L273 TraceCheckUtils]: 39: Hoare triple {12028#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12029#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:29,267 INFO L273 TraceCheckUtils]: 40: Hoare triple {12029#(<= main_~i~0 17)} assume true; {12029#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:29,268 INFO L273 TraceCheckUtils]: 41: Hoare triple {12029#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12030#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:29,268 INFO L273 TraceCheckUtils]: 42: Hoare triple {12030#(<= main_~i~0 18)} assume true; {12030#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:29,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {12030#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12031#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:29,270 INFO L273 TraceCheckUtils]: 44: Hoare triple {12031#(<= main_~i~0 19)} assume true; {12031#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:29,271 INFO L273 TraceCheckUtils]: 45: Hoare triple {12031#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12032#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:29,271 INFO L273 TraceCheckUtils]: 46: Hoare triple {12032#(<= main_~i~0 20)} assume true; {12032#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:29,272 INFO L273 TraceCheckUtils]: 47: Hoare triple {12032#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12033#(<= main_~i~0 21)} is VALID [2018-11-18 22:47:29,273 INFO L273 TraceCheckUtils]: 48: Hoare triple {12033#(<= main_~i~0 21)} assume true; {12033#(<= main_~i~0 21)} is VALID [2018-11-18 22:47:29,273 INFO L273 TraceCheckUtils]: 49: Hoare triple {12033#(<= main_~i~0 21)} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-18 22:47:29,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {12011#false} ~i~0 := 0; {12011#false} is VALID [2018-11-18 22:47:29,274 INFO L273 TraceCheckUtils]: 51: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,274 INFO L273 TraceCheckUtils]: 52: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,274 INFO L273 TraceCheckUtils]: 54: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,274 INFO L273 TraceCheckUtils]: 55: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,275 INFO L273 TraceCheckUtils]: 56: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,275 INFO L273 TraceCheckUtils]: 57: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,275 INFO L273 TraceCheckUtils]: 58: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,275 INFO L273 TraceCheckUtils]: 59: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,275 INFO L273 TraceCheckUtils]: 60: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,276 INFO L273 TraceCheckUtils]: 61: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,276 INFO L273 TraceCheckUtils]: 62: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,276 INFO L273 TraceCheckUtils]: 63: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,276 INFO L273 TraceCheckUtils]: 64: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,276 INFO L273 TraceCheckUtils]: 65: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,276 INFO L273 TraceCheckUtils]: 66: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,276 INFO L273 TraceCheckUtils]: 67: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,277 INFO L273 TraceCheckUtils]: 68: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,277 INFO L273 TraceCheckUtils]: 69: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,277 INFO L273 TraceCheckUtils]: 70: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,277 INFO L273 TraceCheckUtils]: 71: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,277 INFO L273 TraceCheckUtils]: 72: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,277 INFO L273 TraceCheckUtils]: 73: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,277 INFO L273 TraceCheckUtils]: 74: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,278 INFO L273 TraceCheckUtils]: 75: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,278 INFO L273 TraceCheckUtils]: 76: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,278 INFO L273 TraceCheckUtils]: 77: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,278 INFO L273 TraceCheckUtils]: 78: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,278 INFO L273 TraceCheckUtils]: 79: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,278 INFO L273 TraceCheckUtils]: 80: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,278 INFO L273 TraceCheckUtils]: 81: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,278 INFO L273 TraceCheckUtils]: 82: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,278 INFO L273 TraceCheckUtils]: 83: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,279 INFO L273 TraceCheckUtils]: 84: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,279 INFO L273 TraceCheckUtils]: 85: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,279 INFO L273 TraceCheckUtils]: 86: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,279 INFO L273 TraceCheckUtils]: 87: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,279 INFO L273 TraceCheckUtils]: 88: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,279 INFO L273 TraceCheckUtils]: 89: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,279 INFO L273 TraceCheckUtils]: 90: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,279 INFO L273 TraceCheckUtils]: 91: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,279 INFO L273 TraceCheckUtils]: 92: Hoare triple {12011#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12011#false} is VALID [2018-11-18 22:47:29,280 INFO L273 TraceCheckUtils]: 93: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,280 INFO L273 TraceCheckUtils]: 94: Hoare triple {12011#false} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-18 22:47:29,280 INFO L273 TraceCheckUtils]: 95: Hoare triple {12011#false} havoc ~x~0;~x~0 := 0; {12011#false} is VALID [2018-11-18 22:47:29,280 INFO L273 TraceCheckUtils]: 96: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:29,280 INFO L273 TraceCheckUtils]: 97: Hoare triple {12011#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12011#false} is VALID [2018-11-18 22:47:29,280 INFO L256 TraceCheckUtils]: 98: Hoare triple {12011#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {12011#false} is VALID [2018-11-18 22:47:29,280 INFO L273 TraceCheckUtils]: 99: Hoare triple {12011#false} ~cond := #in~cond; {12011#false} is VALID [2018-11-18 22:47:29,280 INFO L273 TraceCheckUtils]: 100: Hoare triple {12011#false} assume 0 == ~cond; {12011#false} is VALID [2018-11-18 22:47:29,280 INFO L273 TraceCheckUtils]: 101: Hoare triple {12011#false} assume !false; {12011#false} is VALID [2018-11-18 22:47:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-18 22:47:29,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:29,286 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-18 22:47:29,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:47:32,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-18 22:47:32,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:32,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:32,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {12010#true} call ULTIMATE.init(); {12010#true} is VALID [2018-11-18 22:47:32,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {12010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12010#true} is VALID [2018-11-18 22:47:32,680 INFO L273 TraceCheckUtils]: 2: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,680 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12010#true} {12010#true} #64#return; {12010#true} is VALID [2018-11-18 22:47:32,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {12010#true} call #t~ret2 := main(); {12010#true} is VALID [2018-11-18 22:47:32,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {12010#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12010#true} is VALID [2018-11-18 22:47:32,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,681 INFO L273 TraceCheckUtils]: 13: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,681 INFO L273 TraceCheckUtils]: 15: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,681 INFO L273 TraceCheckUtils]: 16: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,682 INFO L273 TraceCheckUtils]: 19: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,682 INFO L273 TraceCheckUtils]: 24: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,682 INFO L273 TraceCheckUtils]: 26: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,683 INFO L273 TraceCheckUtils]: 27: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,683 INFO L273 TraceCheckUtils]: 28: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,683 INFO L273 TraceCheckUtils]: 29: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,683 INFO L273 TraceCheckUtils]: 31: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,683 INFO L273 TraceCheckUtils]: 32: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,683 INFO L273 TraceCheckUtils]: 33: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,683 INFO L273 TraceCheckUtils]: 34: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,683 INFO L273 TraceCheckUtils]: 35: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,684 INFO L273 TraceCheckUtils]: 36: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,684 INFO L273 TraceCheckUtils]: 37: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,684 INFO L273 TraceCheckUtils]: 38: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,684 INFO L273 TraceCheckUtils]: 39: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,684 INFO L273 TraceCheckUtils]: 40: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,684 INFO L273 TraceCheckUtils]: 41: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,684 INFO L273 TraceCheckUtils]: 42: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,684 INFO L273 TraceCheckUtils]: 43: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,685 INFO L273 TraceCheckUtils]: 45: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,685 INFO L273 TraceCheckUtils]: 46: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,685 INFO L273 TraceCheckUtils]: 47: Hoare triple {12010#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12010#true} is VALID [2018-11-18 22:47:32,685 INFO L273 TraceCheckUtils]: 48: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-18 22:47:32,685 INFO L273 TraceCheckUtils]: 49: Hoare triple {12010#true} assume !(~i~0 < 100000); {12010#true} is VALID [2018-11-18 22:47:32,685 INFO L273 TraceCheckUtils]: 50: Hoare triple {12010#true} ~i~0 := 0; {12187#(<= main_~i~0 0)} is VALID [2018-11-18 22:47:32,686 INFO L273 TraceCheckUtils]: 51: Hoare triple {12187#(<= main_~i~0 0)} assume true; {12187#(<= main_~i~0 0)} is VALID [2018-11-18 22:47:32,686 INFO L273 TraceCheckUtils]: 52: Hoare triple {12187#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12013#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:32,687 INFO L273 TraceCheckUtils]: 53: Hoare triple {12013#(<= main_~i~0 1)} assume true; {12013#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:32,687 INFO L273 TraceCheckUtils]: 54: Hoare triple {12013#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12014#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:32,688 INFO L273 TraceCheckUtils]: 55: Hoare triple {12014#(<= main_~i~0 2)} assume true; {12014#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:32,688 INFO L273 TraceCheckUtils]: 56: Hoare triple {12014#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12015#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:32,689 INFO L273 TraceCheckUtils]: 57: Hoare triple {12015#(<= main_~i~0 3)} assume true; {12015#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:32,690 INFO L273 TraceCheckUtils]: 58: Hoare triple {12015#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12016#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:32,690 INFO L273 TraceCheckUtils]: 59: Hoare triple {12016#(<= main_~i~0 4)} assume true; {12016#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:32,691 INFO L273 TraceCheckUtils]: 60: Hoare triple {12016#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12017#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:32,692 INFO L273 TraceCheckUtils]: 61: Hoare triple {12017#(<= main_~i~0 5)} assume true; {12017#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:32,693 INFO L273 TraceCheckUtils]: 62: Hoare triple {12017#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12018#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:32,693 INFO L273 TraceCheckUtils]: 63: Hoare triple {12018#(<= main_~i~0 6)} assume true; {12018#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:32,694 INFO L273 TraceCheckUtils]: 64: Hoare triple {12018#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12019#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:32,695 INFO L273 TraceCheckUtils]: 65: Hoare triple {12019#(<= main_~i~0 7)} assume true; {12019#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:32,696 INFO L273 TraceCheckUtils]: 66: Hoare triple {12019#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12020#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:32,696 INFO L273 TraceCheckUtils]: 67: Hoare triple {12020#(<= main_~i~0 8)} assume true; {12020#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:32,697 INFO L273 TraceCheckUtils]: 68: Hoare triple {12020#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12021#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:32,698 INFO L273 TraceCheckUtils]: 69: Hoare triple {12021#(<= main_~i~0 9)} assume true; {12021#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:32,698 INFO L273 TraceCheckUtils]: 70: Hoare triple {12021#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12022#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:32,699 INFO L273 TraceCheckUtils]: 71: Hoare triple {12022#(<= main_~i~0 10)} assume true; {12022#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:32,700 INFO L273 TraceCheckUtils]: 72: Hoare triple {12022#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12023#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:32,700 INFO L273 TraceCheckUtils]: 73: Hoare triple {12023#(<= main_~i~0 11)} assume true; {12023#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:32,701 INFO L273 TraceCheckUtils]: 74: Hoare triple {12023#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12024#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:32,702 INFO L273 TraceCheckUtils]: 75: Hoare triple {12024#(<= main_~i~0 12)} assume true; {12024#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:32,703 INFO L273 TraceCheckUtils]: 76: Hoare triple {12024#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12025#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:32,703 INFO L273 TraceCheckUtils]: 77: Hoare triple {12025#(<= main_~i~0 13)} assume true; {12025#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:32,704 INFO L273 TraceCheckUtils]: 78: Hoare triple {12025#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12026#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:32,705 INFO L273 TraceCheckUtils]: 79: Hoare triple {12026#(<= main_~i~0 14)} assume true; {12026#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:32,706 INFO L273 TraceCheckUtils]: 80: Hoare triple {12026#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12027#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:32,706 INFO L273 TraceCheckUtils]: 81: Hoare triple {12027#(<= main_~i~0 15)} assume true; {12027#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:32,707 INFO L273 TraceCheckUtils]: 82: Hoare triple {12027#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12028#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:32,708 INFO L273 TraceCheckUtils]: 83: Hoare triple {12028#(<= main_~i~0 16)} assume true; {12028#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:32,709 INFO L273 TraceCheckUtils]: 84: Hoare triple {12028#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12029#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:32,709 INFO L273 TraceCheckUtils]: 85: Hoare triple {12029#(<= main_~i~0 17)} assume true; {12029#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:32,710 INFO L273 TraceCheckUtils]: 86: Hoare triple {12029#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12030#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:32,711 INFO L273 TraceCheckUtils]: 87: Hoare triple {12030#(<= main_~i~0 18)} assume true; {12030#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:32,711 INFO L273 TraceCheckUtils]: 88: Hoare triple {12030#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12031#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:32,712 INFO L273 TraceCheckUtils]: 89: Hoare triple {12031#(<= main_~i~0 19)} assume true; {12031#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:32,713 INFO L273 TraceCheckUtils]: 90: Hoare triple {12031#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12032#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:32,713 INFO L273 TraceCheckUtils]: 91: Hoare triple {12032#(<= main_~i~0 20)} assume true; {12032#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:32,714 INFO L273 TraceCheckUtils]: 92: Hoare triple {12032#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12033#(<= main_~i~0 21)} is VALID [2018-11-18 22:47:32,715 INFO L273 TraceCheckUtils]: 93: Hoare triple {12033#(<= main_~i~0 21)} assume true; {12033#(<= main_~i~0 21)} is VALID [2018-11-18 22:47:32,716 INFO L273 TraceCheckUtils]: 94: Hoare triple {12033#(<= main_~i~0 21)} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-18 22:47:32,716 INFO L273 TraceCheckUtils]: 95: Hoare triple {12011#false} havoc ~x~0;~x~0 := 0; {12011#false} is VALID [2018-11-18 22:47:32,716 INFO L273 TraceCheckUtils]: 96: Hoare triple {12011#false} assume true; {12011#false} is VALID [2018-11-18 22:47:32,716 INFO L273 TraceCheckUtils]: 97: Hoare triple {12011#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12011#false} is VALID [2018-11-18 22:47:32,716 INFO L256 TraceCheckUtils]: 98: Hoare triple {12011#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {12011#false} is VALID [2018-11-18 22:47:32,717 INFO L273 TraceCheckUtils]: 99: Hoare triple {12011#false} ~cond := #in~cond; {12011#false} is VALID [2018-11-18 22:47:32,717 INFO L273 TraceCheckUtils]: 100: Hoare triple {12011#false} assume 0 == ~cond; {12011#false} is VALID [2018-11-18 22:47:32,717 INFO L273 TraceCheckUtils]: 101: Hoare triple {12011#false} assume !false; {12011#false} is VALID [2018-11-18 22:47:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-18 22:47:32,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:32,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-18 22:47:32,748 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2018-11-18 22:47:32,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:32,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 22:47:32,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:32,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 22:47:32,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 22:47:32,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:47:32,855 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 25 states. [2018-11-18 22:47:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:33,171 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2018-11-18 22:47:33,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 22:47:33,171 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2018-11-18 22:47:33,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:47:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 131 transitions. [2018-11-18 22:47:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:47:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 131 transitions. [2018-11-18 22:47:33,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 131 transitions. [2018-11-18 22:47:33,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:33,297 INFO L225 Difference]: With dead ends: 168 [2018-11-18 22:47:33,298 INFO L226 Difference]: Without dead ends: 111 [2018-11-18 22:47:33,298 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:47:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-18 22:47:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-18 22:47:33,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:33,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 111 states. [2018-11-18 22:47:33,350 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-18 22:47:33,351 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-18 22:47:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:33,352 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-18 22:47:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-18 22:47:33,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:33,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:33,353 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-18 22:47:33,353 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-18 22:47:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:33,354 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-18 22:47:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-18 22:47:33,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:33,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:33,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:33,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-18 22:47:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-11-18 22:47:33,357 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 102 [2018-11-18 22:47:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:33,357 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-11-18 22:47:33,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 22:47:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-18 22:47:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 22:47:33,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:33,358 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:33,359 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:33,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1684906133, now seen corresponding path program 22 times [2018-11-18 22:47:33,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:33,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:33,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:33,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {12972#true} call ULTIMATE.init(); {12972#true} is VALID [2018-11-18 22:47:33,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {12972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12972#true} is VALID [2018-11-18 22:47:33,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {12972#true} assume true; {12972#true} is VALID [2018-11-18 22:47:33,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12972#true} {12972#true} #64#return; {12972#true} is VALID [2018-11-18 22:47:33,933 INFO L256 TraceCheckUtils]: 4: Hoare triple {12972#true} call #t~ret2 := main(); {12972#true} is VALID [2018-11-18 22:47:33,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {12972#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12974#(= main_~i~0 0)} is VALID [2018-11-18 22:47:33,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {12974#(= main_~i~0 0)} assume true; {12974#(= main_~i~0 0)} is VALID [2018-11-18 22:47:33,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {12974#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12975#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:33,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {12975#(<= main_~i~0 1)} assume true; {12975#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:33,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {12975#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12976#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:33,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {12976#(<= main_~i~0 2)} assume true; {12976#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:33,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {12976#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12977#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:33,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {12977#(<= main_~i~0 3)} assume true; {12977#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:33,938 INFO L273 TraceCheckUtils]: 13: Hoare triple {12977#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12978#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:33,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {12978#(<= main_~i~0 4)} assume true; {12978#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:33,939 INFO L273 TraceCheckUtils]: 15: Hoare triple {12978#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12979#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:33,940 INFO L273 TraceCheckUtils]: 16: Hoare triple {12979#(<= main_~i~0 5)} assume true; {12979#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:33,941 INFO L273 TraceCheckUtils]: 17: Hoare triple {12979#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12980#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:33,941 INFO L273 TraceCheckUtils]: 18: Hoare triple {12980#(<= main_~i~0 6)} assume true; {12980#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:33,942 INFO L273 TraceCheckUtils]: 19: Hoare triple {12980#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12981#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:33,943 INFO L273 TraceCheckUtils]: 20: Hoare triple {12981#(<= main_~i~0 7)} assume true; {12981#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:33,944 INFO L273 TraceCheckUtils]: 21: Hoare triple {12981#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12982#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:33,944 INFO L273 TraceCheckUtils]: 22: Hoare triple {12982#(<= main_~i~0 8)} assume true; {12982#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:33,945 INFO L273 TraceCheckUtils]: 23: Hoare triple {12982#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12983#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:33,946 INFO L273 TraceCheckUtils]: 24: Hoare triple {12983#(<= main_~i~0 9)} assume true; {12983#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:33,947 INFO L273 TraceCheckUtils]: 25: Hoare triple {12983#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12984#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:33,947 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#(<= main_~i~0 10)} assume true; {12984#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:33,948 INFO L273 TraceCheckUtils]: 27: Hoare triple {12984#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12985#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:33,949 INFO L273 TraceCheckUtils]: 28: Hoare triple {12985#(<= main_~i~0 11)} assume true; {12985#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:33,950 INFO L273 TraceCheckUtils]: 29: Hoare triple {12985#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12986#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:33,950 INFO L273 TraceCheckUtils]: 30: Hoare triple {12986#(<= main_~i~0 12)} assume true; {12986#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:33,951 INFO L273 TraceCheckUtils]: 31: Hoare triple {12986#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12987#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:33,952 INFO L273 TraceCheckUtils]: 32: Hoare triple {12987#(<= main_~i~0 13)} assume true; {12987#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:33,952 INFO L273 TraceCheckUtils]: 33: Hoare triple {12987#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12988#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:33,953 INFO L273 TraceCheckUtils]: 34: Hoare triple {12988#(<= main_~i~0 14)} assume true; {12988#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:33,954 INFO L273 TraceCheckUtils]: 35: Hoare triple {12988#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12989#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:33,954 INFO L273 TraceCheckUtils]: 36: Hoare triple {12989#(<= main_~i~0 15)} assume true; {12989#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:33,955 INFO L273 TraceCheckUtils]: 37: Hoare triple {12989#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12990#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:33,956 INFO L273 TraceCheckUtils]: 38: Hoare triple {12990#(<= main_~i~0 16)} assume true; {12990#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:33,957 INFO L273 TraceCheckUtils]: 39: Hoare triple {12990#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12991#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:33,957 INFO L273 TraceCheckUtils]: 40: Hoare triple {12991#(<= main_~i~0 17)} assume true; {12991#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:33,958 INFO L273 TraceCheckUtils]: 41: Hoare triple {12991#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12992#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:33,959 INFO L273 TraceCheckUtils]: 42: Hoare triple {12992#(<= main_~i~0 18)} assume true; {12992#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:33,960 INFO L273 TraceCheckUtils]: 43: Hoare triple {12992#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12993#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:33,960 INFO L273 TraceCheckUtils]: 44: Hoare triple {12993#(<= main_~i~0 19)} assume true; {12993#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:33,961 INFO L273 TraceCheckUtils]: 45: Hoare triple {12993#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12994#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:33,962 INFO L273 TraceCheckUtils]: 46: Hoare triple {12994#(<= main_~i~0 20)} assume true; {12994#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:33,963 INFO L273 TraceCheckUtils]: 47: Hoare triple {12994#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12995#(<= main_~i~0 21)} is VALID [2018-11-18 22:47:33,963 INFO L273 TraceCheckUtils]: 48: Hoare triple {12995#(<= main_~i~0 21)} assume true; {12995#(<= main_~i~0 21)} is VALID [2018-11-18 22:47:33,964 INFO L273 TraceCheckUtils]: 49: Hoare triple {12995#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12996#(<= main_~i~0 22)} is VALID [2018-11-18 22:47:33,965 INFO L273 TraceCheckUtils]: 50: Hoare triple {12996#(<= main_~i~0 22)} assume true; {12996#(<= main_~i~0 22)} is VALID [2018-11-18 22:47:33,965 INFO L273 TraceCheckUtils]: 51: Hoare triple {12996#(<= main_~i~0 22)} assume !(~i~0 < 100000); {12973#false} is VALID [2018-11-18 22:47:33,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {12973#false} ~i~0 := 0; {12973#false} is VALID [2018-11-18 22:47:33,966 INFO L273 TraceCheckUtils]: 53: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,966 INFO L273 TraceCheckUtils]: 54: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,966 INFO L273 TraceCheckUtils]: 55: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,966 INFO L273 TraceCheckUtils]: 56: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,967 INFO L273 TraceCheckUtils]: 59: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,967 INFO L273 TraceCheckUtils]: 60: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,967 INFO L273 TraceCheckUtils]: 61: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,968 INFO L273 TraceCheckUtils]: 62: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,968 INFO L273 TraceCheckUtils]: 63: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,968 INFO L273 TraceCheckUtils]: 64: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,968 INFO L273 TraceCheckUtils]: 65: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,968 INFO L273 TraceCheckUtils]: 66: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,969 INFO L273 TraceCheckUtils]: 67: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,969 INFO L273 TraceCheckUtils]: 68: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,969 INFO L273 TraceCheckUtils]: 69: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,969 INFO L273 TraceCheckUtils]: 70: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,969 INFO L273 TraceCheckUtils]: 71: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,970 INFO L273 TraceCheckUtils]: 72: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,970 INFO L273 TraceCheckUtils]: 73: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,970 INFO L273 TraceCheckUtils]: 74: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,970 INFO L273 TraceCheckUtils]: 75: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,970 INFO L273 TraceCheckUtils]: 76: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,970 INFO L273 TraceCheckUtils]: 77: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,970 INFO L273 TraceCheckUtils]: 78: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,970 INFO L273 TraceCheckUtils]: 79: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,970 INFO L273 TraceCheckUtils]: 80: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,971 INFO L273 TraceCheckUtils]: 81: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,971 INFO L273 TraceCheckUtils]: 82: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,971 INFO L273 TraceCheckUtils]: 83: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,971 INFO L273 TraceCheckUtils]: 84: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,971 INFO L273 TraceCheckUtils]: 85: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,971 INFO L273 TraceCheckUtils]: 86: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,971 INFO L273 TraceCheckUtils]: 87: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,971 INFO L273 TraceCheckUtils]: 88: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,971 INFO L273 TraceCheckUtils]: 89: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,972 INFO L273 TraceCheckUtils]: 90: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,972 INFO L273 TraceCheckUtils]: 91: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,972 INFO L273 TraceCheckUtils]: 92: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,972 INFO L273 TraceCheckUtils]: 93: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,972 INFO L273 TraceCheckUtils]: 94: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,972 INFO L273 TraceCheckUtils]: 95: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,972 INFO L273 TraceCheckUtils]: 96: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:33,972 INFO L273 TraceCheckUtils]: 97: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,972 INFO L273 TraceCheckUtils]: 98: Hoare triple {12973#false} assume !(~i~0 < 100000); {12973#false} is VALID [2018-11-18 22:47:33,973 INFO L273 TraceCheckUtils]: 99: Hoare triple {12973#false} havoc ~x~0;~x~0 := 0; {12973#false} is VALID [2018-11-18 22:47:33,973 INFO L273 TraceCheckUtils]: 100: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:33,973 INFO L273 TraceCheckUtils]: 101: Hoare triple {12973#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12973#false} is VALID [2018-11-18 22:47:33,973 INFO L256 TraceCheckUtils]: 102: Hoare triple {12973#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {12973#false} is VALID [2018-11-18 22:47:33,973 INFO L273 TraceCheckUtils]: 103: Hoare triple {12973#false} ~cond := #in~cond; {12973#false} is VALID [2018-11-18 22:47:33,973 INFO L273 TraceCheckUtils]: 104: Hoare triple {12973#false} assume 0 == ~cond; {12973#false} is VALID [2018-11-18 22:47:33,973 INFO L273 TraceCheckUtils]: 105: Hoare triple {12973#false} assume !false; {12973#false} is VALID [2018-11-18 22:47:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-18 22:47:33,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:33,987 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-18 22:47:33,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:47:34,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:47:34,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:34,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:34,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {12972#true} call ULTIMATE.init(); {12972#true} is VALID [2018-11-18 22:47:34,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {12972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12972#true} is VALID [2018-11-18 22:47:34,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {12972#true} assume true; {12972#true} is VALID [2018-11-18 22:47:34,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12972#true} {12972#true} #64#return; {12972#true} is VALID [2018-11-18 22:47:34,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {12972#true} call #t~ret2 := main(); {12972#true} is VALID [2018-11-18 22:47:34,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {12972#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13015#(<= main_~i~0 0)} is VALID [2018-11-18 22:47:34,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {13015#(<= main_~i~0 0)} assume true; {13015#(<= main_~i~0 0)} is VALID [2018-11-18 22:47:34,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {13015#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12975#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:34,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {12975#(<= main_~i~0 1)} assume true; {12975#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:34,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {12975#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12976#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:34,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {12976#(<= main_~i~0 2)} assume true; {12976#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:34,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {12976#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12977#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:34,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {12977#(<= main_~i~0 3)} assume true; {12977#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:34,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {12977#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12978#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:34,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {12978#(<= main_~i~0 4)} assume true; {12978#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:34,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {12978#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12979#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:34,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {12979#(<= main_~i~0 5)} assume true; {12979#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:34,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {12979#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12980#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:34,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {12980#(<= main_~i~0 6)} assume true; {12980#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:34,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {12980#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12981#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:34,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {12981#(<= main_~i~0 7)} assume true; {12981#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:34,379 INFO L273 TraceCheckUtils]: 21: Hoare triple {12981#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12982#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:34,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {12982#(<= main_~i~0 8)} assume true; {12982#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:34,380 INFO L273 TraceCheckUtils]: 23: Hoare triple {12982#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12983#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:34,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {12983#(<= main_~i~0 9)} assume true; {12983#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:34,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {12983#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12984#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:34,382 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#(<= main_~i~0 10)} assume true; {12984#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:34,383 INFO L273 TraceCheckUtils]: 27: Hoare triple {12984#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12985#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:34,384 INFO L273 TraceCheckUtils]: 28: Hoare triple {12985#(<= main_~i~0 11)} assume true; {12985#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:34,385 INFO L273 TraceCheckUtils]: 29: Hoare triple {12985#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12986#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:34,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {12986#(<= main_~i~0 12)} assume true; {12986#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:34,386 INFO L273 TraceCheckUtils]: 31: Hoare triple {12986#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12987#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:34,387 INFO L273 TraceCheckUtils]: 32: Hoare triple {12987#(<= main_~i~0 13)} assume true; {12987#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:34,388 INFO L273 TraceCheckUtils]: 33: Hoare triple {12987#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12988#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:34,388 INFO L273 TraceCheckUtils]: 34: Hoare triple {12988#(<= main_~i~0 14)} assume true; {12988#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:34,389 INFO L273 TraceCheckUtils]: 35: Hoare triple {12988#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12989#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:34,390 INFO L273 TraceCheckUtils]: 36: Hoare triple {12989#(<= main_~i~0 15)} assume true; {12989#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:34,391 INFO L273 TraceCheckUtils]: 37: Hoare triple {12989#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12990#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:34,391 INFO L273 TraceCheckUtils]: 38: Hoare triple {12990#(<= main_~i~0 16)} assume true; {12990#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:34,392 INFO L273 TraceCheckUtils]: 39: Hoare triple {12990#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12991#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:34,393 INFO L273 TraceCheckUtils]: 40: Hoare triple {12991#(<= main_~i~0 17)} assume true; {12991#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:34,393 INFO L273 TraceCheckUtils]: 41: Hoare triple {12991#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12992#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:34,394 INFO L273 TraceCheckUtils]: 42: Hoare triple {12992#(<= main_~i~0 18)} assume true; {12992#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:34,395 INFO L273 TraceCheckUtils]: 43: Hoare triple {12992#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12993#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:34,396 INFO L273 TraceCheckUtils]: 44: Hoare triple {12993#(<= main_~i~0 19)} assume true; {12993#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:34,396 INFO L273 TraceCheckUtils]: 45: Hoare triple {12993#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12994#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:34,397 INFO L273 TraceCheckUtils]: 46: Hoare triple {12994#(<= main_~i~0 20)} assume true; {12994#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:34,398 INFO L273 TraceCheckUtils]: 47: Hoare triple {12994#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12995#(<= main_~i~0 21)} is VALID [2018-11-18 22:47:34,398 INFO L273 TraceCheckUtils]: 48: Hoare triple {12995#(<= main_~i~0 21)} assume true; {12995#(<= main_~i~0 21)} is VALID [2018-11-18 22:47:34,399 INFO L273 TraceCheckUtils]: 49: Hoare triple {12995#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12996#(<= main_~i~0 22)} is VALID [2018-11-18 22:47:34,400 INFO L273 TraceCheckUtils]: 50: Hoare triple {12996#(<= main_~i~0 22)} assume true; {12996#(<= main_~i~0 22)} is VALID [2018-11-18 22:47:34,401 INFO L273 TraceCheckUtils]: 51: Hoare triple {12996#(<= main_~i~0 22)} assume !(~i~0 < 100000); {12973#false} is VALID [2018-11-18 22:47:34,401 INFO L273 TraceCheckUtils]: 52: Hoare triple {12973#false} ~i~0 := 0; {12973#false} is VALID [2018-11-18 22:47:34,401 INFO L273 TraceCheckUtils]: 53: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,401 INFO L273 TraceCheckUtils]: 54: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,401 INFO L273 TraceCheckUtils]: 55: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,402 INFO L273 TraceCheckUtils]: 56: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,402 INFO L273 TraceCheckUtils]: 57: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,402 INFO L273 TraceCheckUtils]: 58: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,402 INFO L273 TraceCheckUtils]: 59: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,402 INFO L273 TraceCheckUtils]: 60: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,403 INFO L273 TraceCheckUtils]: 61: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,403 INFO L273 TraceCheckUtils]: 62: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,403 INFO L273 TraceCheckUtils]: 63: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,403 INFO L273 TraceCheckUtils]: 64: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,403 INFO L273 TraceCheckUtils]: 65: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,403 INFO L273 TraceCheckUtils]: 66: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,404 INFO L273 TraceCheckUtils]: 67: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,404 INFO L273 TraceCheckUtils]: 68: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,404 INFO L273 TraceCheckUtils]: 69: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,404 INFO L273 TraceCheckUtils]: 70: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,404 INFO L273 TraceCheckUtils]: 71: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,404 INFO L273 TraceCheckUtils]: 72: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,404 INFO L273 TraceCheckUtils]: 73: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,404 INFO L273 TraceCheckUtils]: 74: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,404 INFO L273 TraceCheckUtils]: 75: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,405 INFO L273 TraceCheckUtils]: 76: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,405 INFO L273 TraceCheckUtils]: 77: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,405 INFO L273 TraceCheckUtils]: 78: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,405 INFO L273 TraceCheckUtils]: 79: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,405 INFO L273 TraceCheckUtils]: 80: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,405 INFO L273 TraceCheckUtils]: 81: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,405 INFO L273 TraceCheckUtils]: 82: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,405 INFO L273 TraceCheckUtils]: 83: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,405 INFO L273 TraceCheckUtils]: 84: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,406 INFO L273 TraceCheckUtils]: 85: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,406 INFO L273 TraceCheckUtils]: 86: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,406 INFO L273 TraceCheckUtils]: 87: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,406 INFO L273 TraceCheckUtils]: 88: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,406 INFO L273 TraceCheckUtils]: 89: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,406 INFO L273 TraceCheckUtils]: 90: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,406 INFO L273 TraceCheckUtils]: 91: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,406 INFO L273 TraceCheckUtils]: 92: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,406 INFO L273 TraceCheckUtils]: 93: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,407 INFO L273 TraceCheckUtils]: 94: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,407 INFO L273 TraceCheckUtils]: 95: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,407 INFO L273 TraceCheckUtils]: 96: Hoare triple {12973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12973#false} is VALID [2018-11-18 22:47:34,407 INFO L273 TraceCheckUtils]: 97: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,407 INFO L273 TraceCheckUtils]: 98: Hoare triple {12973#false} assume !(~i~0 < 100000); {12973#false} is VALID [2018-11-18 22:47:34,407 INFO L273 TraceCheckUtils]: 99: Hoare triple {12973#false} havoc ~x~0;~x~0 := 0; {12973#false} is VALID [2018-11-18 22:47:34,407 INFO L273 TraceCheckUtils]: 100: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-18 22:47:34,407 INFO L273 TraceCheckUtils]: 101: Hoare triple {12973#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12973#false} is VALID [2018-11-18 22:47:34,408 INFO L256 TraceCheckUtils]: 102: Hoare triple {12973#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {12973#false} is VALID [2018-11-18 22:47:34,408 INFO L273 TraceCheckUtils]: 103: Hoare triple {12973#false} ~cond := #in~cond; {12973#false} is VALID [2018-11-18 22:47:34,408 INFO L273 TraceCheckUtils]: 104: Hoare triple {12973#false} assume 0 == ~cond; {12973#false} is VALID [2018-11-18 22:47:34,408 INFO L273 TraceCheckUtils]: 105: Hoare triple {12973#false} assume !false; {12973#false} is VALID [2018-11-18 22:47:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-18 22:47:34,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:34,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-18 22:47:34,433 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2018-11-18 22:47:34,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:34,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-18 22:47:34,524 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-18 22:47:34,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 22:47:34,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 22:47:34,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:47:34,525 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 26 states. [2018-11-18 22:47:35,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:35,499 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2018-11-18 22:47:35,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 22:47:35,499 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2018-11-18 22:47:35,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:47:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 135 transitions. [2018-11-18 22:47:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:47:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 135 transitions. [2018-11-18 22:47:35,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 135 transitions. [2018-11-18 22:47:35,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:35,630 INFO L225 Difference]: With dead ends: 174 [2018-11-18 22:47:35,631 INFO L226 Difference]: Without dead ends: 115 [2018-11-18 22:47:35,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 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-18 22:47:35,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-18 22:47:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-18 22:47:35,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:35,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 115 states. [2018-11-18 22:47:35,711 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2018-11-18 22:47:35,711 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2018-11-18 22:47:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:35,713 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-11-18 22:47:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-11-18 22:47:35,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:35,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:35,714 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2018-11-18 22:47:35,714 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2018-11-18 22:47:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:35,715 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-11-18 22:47:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-11-18 22:47:35,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:35,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:35,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:35,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 22:47:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-11-18 22:47:35,717 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 106 [2018-11-18 22:47:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:35,717 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-11-18 22:47:35,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 22:47:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-11-18 22:47:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 22:47:35,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:35,718 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:35,718 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:35,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:35,719 INFO L82 PathProgramCache]: Analyzing trace with hash 852726059, now seen corresponding path program 23 times [2018-11-18 22:47:35,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:35,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:35,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:35,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:35,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:36,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {13970#true} call ULTIMATE.init(); {13970#true} is VALID [2018-11-18 22:47:36,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {13970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13970#true} is VALID [2018-11-18 22:47:36,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {13970#true} assume true; {13970#true} is VALID [2018-11-18 22:47:36,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13970#true} {13970#true} #64#return; {13970#true} is VALID [2018-11-18 22:47:36,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {13970#true} call #t~ret2 := main(); {13970#true} is VALID [2018-11-18 22:47:36,310 INFO L273 TraceCheckUtils]: 5: Hoare triple {13970#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13972#(= main_~i~0 0)} is VALID [2018-11-18 22:47:36,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {13972#(= main_~i~0 0)} assume true; {13972#(= main_~i~0 0)} is VALID [2018-11-18 22:47:36,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {13972#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13973#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:36,312 INFO L273 TraceCheckUtils]: 8: Hoare triple {13973#(<= main_~i~0 1)} assume true; {13973#(<= main_~i~0 1)} is VALID [2018-11-18 22:47:36,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {13973#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13974#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:36,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {13974#(<= main_~i~0 2)} assume true; {13974#(<= main_~i~0 2)} is VALID [2018-11-18 22:47:36,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {13974#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13975#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:36,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {13975#(<= main_~i~0 3)} assume true; {13975#(<= main_~i~0 3)} is VALID [2018-11-18 22:47:36,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {13975#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13976#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:36,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {13976#(<= main_~i~0 4)} assume true; {13976#(<= main_~i~0 4)} is VALID [2018-11-18 22:47:36,318 INFO L273 TraceCheckUtils]: 15: Hoare triple {13976#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13977#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:36,318 INFO L273 TraceCheckUtils]: 16: Hoare triple {13977#(<= main_~i~0 5)} assume true; {13977#(<= main_~i~0 5)} is VALID [2018-11-18 22:47:36,319 INFO L273 TraceCheckUtils]: 17: Hoare triple {13977#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13978#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:36,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {13978#(<= main_~i~0 6)} assume true; {13978#(<= main_~i~0 6)} is VALID [2018-11-18 22:47:36,321 INFO L273 TraceCheckUtils]: 19: Hoare triple {13978#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13979#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:36,321 INFO L273 TraceCheckUtils]: 20: Hoare triple {13979#(<= main_~i~0 7)} assume true; {13979#(<= main_~i~0 7)} is VALID [2018-11-18 22:47:36,322 INFO L273 TraceCheckUtils]: 21: Hoare triple {13979#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13980#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:36,323 INFO L273 TraceCheckUtils]: 22: Hoare triple {13980#(<= main_~i~0 8)} assume true; {13980#(<= main_~i~0 8)} is VALID [2018-11-18 22:47:36,324 INFO L273 TraceCheckUtils]: 23: Hoare triple {13980#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13981#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:36,324 INFO L273 TraceCheckUtils]: 24: Hoare triple {13981#(<= main_~i~0 9)} assume true; {13981#(<= main_~i~0 9)} is VALID [2018-11-18 22:47:36,325 INFO L273 TraceCheckUtils]: 25: Hoare triple {13981#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13982#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:36,326 INFO L273 TraceCheckUtils]: 26: Hoare triple {13982#(<= main_~i~0 10)} assume true; {13982#(<= main_~i~0 10)} is VALID [2018-11-18 22:47:36,327 INFO L273 TraceCheckUtils]: 27: Hoare triple {13982#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13983#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:36,328 INFO L273 TraceCheckUtils]: 28: Hoare triple {13983#(<= main_~i~0 11)} assume true; {13983#(<= main_~i~0 11)} is VALID [2018-11-18 22:47:36,329 INFO L273 TraceCheckUtils]: 29: Hoare triple {13983#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13984#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:36,329 INFO L273 TraceCheckUtils]: 30: Hoare triple {13984#(<= main_~i~0 12)} assume true; {13984#(<= main_~i~0 12)} is VALID [2018-11-18 22:47:36,330 INFO L273 TraceCheckUtils]: 31: Hoare triple {13984#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13985#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:36,331 INFO L273 TraceCheckUtils]: 32: Hoare triple {13985#(<= main_~i~0 13)} assume true; {13985#(<= main_~i~0 13)} is VALID [2018-11-18 22:47:36,332 INFO L273 TraceCheckUtils]: 33: Hoare triple {13985#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13986#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:36,333 INFO L273 TraceCheckUtils]: 34: Hoare triple {13986#(<= main_~i~0 14)} assume true; {13986#(<= main_~i~0 14)} is VALID [2018-11-18 22:47:36,334 INFO L273 TraceCheckUtils]: 35: Hoare triple {13986#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13987#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:36,334 INFO L273 TraceCheckUtils]: 36: Hoare triple {13987#(<= main_~i~0 15)} assume true; {13987#(<= main_~i~0 15)} is VALID [2018-11-18 22:47:36,335 INFO L273 TraceCheckUtils]: 37: Hoare triple {13987#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13988#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:36,336 INFO L273 TraceCheckUtils]: 38: Hoare triple {13988#(<= main_~i~0 16)} assume true; {13988#(<= main_~i~0 16)} is VALID [2018-11-18 22:47:36,337 INFO L273 TraceCheckUtils]: 39: Hoare triple {13988#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13989#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:36,338 INFO L273 TraceCheckUtils]: 40: Hoare triple {13989#(<= main_~i~0 17)} assume true; {13989#(<= main_~i~0 17)} is VALID [2018-11-18 22:47:36,339 INFO L273 TraceCheckUtils]: 41: Hoare triple {13989#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13990#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:36,339 INFO L273 TraceCheckUtils]: 42: Hoare triple {13990#(<= main_~i~0 18)} assume true; {13990#(<= main_~i~0 18)} is VALID [2018-11-18 22:47:36,341 INFO L273 TraceCheckUtils]: 43: Hoare triple {13990#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13991#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:36,341 INFO L273 TraceCheckUtils]: 44: Hoare triple {13991#(<= main_~i~0 19)} assume true; {13991#(<= main_~i~0 19)} is VALID [2018-11-18 22:47:36,342 INFO L273 TraceCheckUtils]: 45: Hoare triple {13991#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13992#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:36,343 INFO L273 TraceCheckUtils]: 46: Hoare triple {13992#(<= main_~i~0 20)} assume true; {13992#(<= main_~i~0 20)} is VALID [2018-11-18 22:47:36,344 INFO L273 TraceCheckUtils]: 47: Hoare triple {13992#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13993#(<= main_~i~0 21)} is VALID [2018-11-18 22:47:36,344 INFO L273 TraceCheckUtils]: 48: Hoare triple {13993#(<= main_~i~0 21)} assume true; {13993#(<= main_~i~0 21)} is VALID [2018-11-18 22:47:36,346 INFO L273 TraceCheckUtils]: 49: Hoare triple {13993#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13994#(<= main_~i~0 22)} is VALID [2018-11-18 22:47:36,346 INFO L273 TraceCheckUtils]: 50: Hoare triple {13994#(<= main_~i~0 22)} assume true; {13994#(<= main_~i~0 22)} is VALID [2018-11-18 22:47:36,347 INFO L273 TraceCheckUtils]: 51: Hoare triple {13994#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13995#(<= main_~i~0 23)} is VALID [2018-11-18 22:47:36,348 INFO L273 TraceCheckUtils]: 52: Hoare triple {13995#(<= main_~i~0 23)} assume true; {13995#(<= main_~i~0 23)} is VALID [2018-11-18 22:47:36,349 INFO L273 TraceCheckUtils]: 53: Hoare triple {13995#(<= main_~i~0 23)} assume !(~i~0 < 100000); {13971#false} is VALID [2018-11-18 22:47:36,349 INFO L273 TraceCheckUtils]: 54: Hoare triple {13971#false} ~i~0 := 0; {13971#false} is VALID [2018-11-18 22:47:36,349 INFO L273 TraceCheckUtils]: 55: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,349 INFO L273 TraceCheckUtils]: 56: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,350 INFO L273 TraceCheckUtils]: 57: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,350 INFO L273 TraceCheckUtils]: 58: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,350 INFO L273 TraceCheckUtils]: 59: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,350 INFO L273 TraceCheckUtils]: 60: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,351 INFO L273 TraceCheckUtils]: 61: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,351 INFO L273 TraceCheckUtils]: 62: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,351 INFO L273 TraceCheckUtils]: 63: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,351 INFO L273 TraceCheckUtils]: 64: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,352 INFO L273 TraceCheckUtils]: 65: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,352 INFO L273 TraceCheckUtils]: 66: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,352 INFO L273 TraceCheckUtils]: 67: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,352 INFO L273 TraceCheckUtils]: 68: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,352 INFO L273 TraceCheckUtils]: 69: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,353 INFO L273 TraceCheckUtils]: 70: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,353 INFO L273 TraceCheckUtils]: 71: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,353 INFO L273 TraceCheckUtils]: 72: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,353 INFO L273 TraceCheckUtils]: 73: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,353 INFO L273 TraceCheckUtils]: 74: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,353 INFO L273 TraceCheckUtils]: 75: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,353 INFO L273 TraceCheckUtils]: 76: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,354 INFO L273 TraceCheckUtils]: 77: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,354 INFO L273 TraceCheckUtils]: 78: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,354 INFO L273 TraceCheckUtils]: 79: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,354 INFO L273 TraceCheckUtils]: 80: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,354 INFO L273 TraceCheckUtils]: 81: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,354 INFO L273 TraceCheckUtils]: 82: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,354 INFO L273 TraceCheckUtils]: 83: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,355 INFO L273 TraceCheckUtils]: 84: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,355 INFO L273 TraceCheckUtils]: 85: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,355 INFO L273 TraceCheckUtils]: 86: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,355 INFO L273 TraceCheckUtils]: 87: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,355 INFO L273 TraceCheckUtils]: 88: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,355 INFO L273 TraceCheckUtils]: 89: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,355 INFO L273 TraceCheckUtils]: 90: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,356 INFO L273 TraceCheckUtils]: 91: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,356 INFO L273 TraceCheckUtils]: 92: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,356 INFO L273 TraceCheckUtils]: 93: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,356 INFO L273 TraceCheckUtils]: 94: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,356 INFO L273 TraceCheckUtils]: 95: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,356 INFO L273 TraceCheckUtils]: 96: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,356 INFO L273 TraceCheckUtils]: 97: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,357 INFO L273 TraceCheckUtils]: 98: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,357 INFO L273 TraceCheckUtils]: 99: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,357 INFO L273 TraceCheckUtils]: 100: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:47:36,357 INFO L273 TraceCheckUtils]: 101: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,357 INFO L273 TraceCheckUtils]: 102: Hoare triple {13971#false} assume !(~i~0 < 100000); {13971#false} is VALID [2018-11-18 22:47:36,357 INFO L273 TraceCheckUtils]: 103: Hoare triple {13971#false} havoc ~x~0;~x~0 := 0; {13971#false} is VALID [2018-11-18 22:47:36,357 INFO L273 TraceCheckUtils]: 104: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:47:36,358 INFO L273 TraceCheckUtils]: 105: Hoare triple {13971#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13971#false} is VALID [2018-11-18 22:47:36,358 INFO L256 TraceCheckUtils]: 106: Hoare triple {13971#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {13971#false} is VALID [2018-11-18 22:47:36,358 INFO L273 TraceCheckUtils]: 107: Hoare triple {13971#false} ~cond := #in~cond; {13971#false} is VALID [2018-11-18 22:47:36,358 INFO L273 TraceCheckUtils]: 108: Hoare triple {13971#false} assume 0 == ~cond; {13971#false} is VALID [2018-11-18 22:47:36,358 INFO L273 TraceCheckUtils]: 109: Hoare triple {13971#false} assume !false; {13971#false} is VALID [2018-11-18 22:47:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-11-18 22:47:36,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:36,371 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-18 22:47:36,400 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:48:44,810 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-18 22:48:44,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:48:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:44,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:48:45,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {13970#true} call ULTIMATE.init(); {13970#true} is VALID [2018-11-18 22:48:45,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {13970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13970#true} is VALID [2018-11-18 22:48:45,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {13970#true} assume true; {13970#true} is VALID [2018-11-18 22:48:45,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13970#true} {13970#true} #64#return; {13970#true} is VALID [2018-11-18 22:48:45,068 INFO L256 TraceCheckUtils]: 4: Hoare triple {13970#true} call #t~ret2 := main(); {13970#true} is VALID [2018-11-18 22:48:45,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {13970#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14014#(<= main_~i~0 0)} is VALID [2018-11-18 22:48:45,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {14014#(<= main_~i~0 0)} assume true; {14014#(<= main_~i~0 0)} is VALID [2018-11-18 22:48:45,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {14014#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13973#(<= main_~i~0 1)} is VALID [2018-11-18 22:48:45,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {13973#(<= main_~i~0 1)} assume true; {13973#(<= main_~i~0 1)} is VALID [2018-11-18 22:48:45,072 INFO L273 TraceCheckUtils]: 9: Hoare triple {13973#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13974#(<= main_~i~0 2)} is VALID [2018-11-18 22:48:45,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {13974#(<= main_~i~0 2)} assume true; {13974#(<= main_~i~0 2)} is VALID [2018-11-18 22:48:45,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {13974#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13975#(<= main_~i~0 3)} is VALID [2018-11-18 22:48:45,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {13975#(<= main_~i~0 3)} assume true; {13975#(<= main_~i~0 3)} is VALID [2018-11-18 22:48:45,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {13975#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13976#(<= main_~i~0 4)} is VALID [2018-11-18 22:48:45,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {13976#(<= main_~i~0 4)} assume true; {13976#(<= main_~i~0 4)} is VALID [2018-11-18 22:48:45,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {13976#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13977#(<= main_~i~0 5)} is VALID [2018-11-18 22:48:45,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {13977#(<= main_~i~0 5)} assume true; {13977#(<= main_~i~0 5)} is VALID [2018-11-18 22:48:45,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {13977#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13978#(<= main_~i~0 6)} is VALID [2018-11-18 22:48:45,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {13978#(<= main_~i~0 6)} assume true; {13978#(<= main_~i~0 6)} is VALID [2018-11-18 22:48:45,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {13978#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13979#(<= main_~i~0 7)} is VALID [2018-11-18 22:48:45,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {13979#(<= main_~i~0 7)} assume true; {13979#(<= main_~i~0 7)} is VALID [2018-11-18 22:48:45,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {13979#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13980#(<= main_~i~0 8)} is VALID [2018-11-18 22:48:45,081 INFO L273 TraceCheckUtils]: 22: Hoare triple {13980#(<= main_~i~0 8)} assume true; {13980#(<= main_~i~0 8)} is VALID [2018-11-18 22:48:45,082 INFO L273 TraceCheckUtils]: 23: Hoare triple {13980#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13981#(<= main_~i~0 9)} is VALID [2018-11-18 22:48:45,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {13981#(<= main_~i~0 9)} assume true; {13981#(<= main_~i~0 9)} is VALID [2018-11-18 22:48:45,083 INFO L273 TraceCheckUtils]: 25: Hoare triple {13981#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13982#(<= main_~i~0 10)} is VALID [2018-11-18 22:48:45,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {13982#(<= main_~i~0 10)} assume true; {13982#(<= main_~i~0 10)} is VALID [2018-11-18 22:48:45,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {13982#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13983#(<= main_~i~0 11)} is VALID [2018-11-18 22:48:45,085 INFO L273 TraceCheckUtils]: 28: Hoare triple {13983#(<= main_~i~0 11)} assume true; {13983#(<= main_~i~0 11)} is VALID [2018-11-18 22:48:45,086 INFO L273 TraceCheckUtils]: 29: Hoare triple {13983#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13984#(<= main_~i~0 12)} is VALID [2018-11-18 22:48:45,086 INFO L273 TraceCheckUtils]: 30: Hoare triple {13984#(<= main_~i~0 12)} assume true; {13984#(<= main_~i~0 12)} is VALID [2018-11-18 22:48:45,087 INFO L273 TraceCheckUtils]: 31: Hoare triple {13984#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13985#(<= main_~i~0 13)} is VALID [2018-11-18 22:48:45,088 INFO L273 TraceCheckUtils]: 32: Hoare triple {13985#(<= main_~i~0 13)} assume true; {13985#(<= main_~i~0 13)} is VALID [2018-11-18 22:48:45,089 INFO L273 TraceCheckUtils]: 33: Hoare triple {13985#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13986#(<= main_~i~0 14)} is VALID [2018-11-18 22:48:45,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {13986#(<= main_~i~0 14)} assume true; {13986#(<= main_~i~0 14)} is VALID [2018-11-18 22:48:45,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {13986#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13987#(<= main_~i~0 15)} is VALID [2018-11-18 22:48:45,091 INFO L273 TraceCheckUtils]: 36: Hoare triple {13987#(<= main_~i~0 15)} assume true; {13987#(<= main_~i~0 15)} is VALID [2018-11-18 22:48:45,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {13987#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13988#(<= main_~i~0 16)} is VALID [2018-11-18 22:48:45,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {13988#(<= main_~i~0 16)} assume true; {13988#(<= main_~i~0 16)} is VALID [2018-11-18 22:48:45,093 INFO L273 TraceCheckUtils]: 39: Hoare triple {13988#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13989#(<= main_~i~0 17)} is VALID [2018-11-18 22:48:45,093 INFO L273 TraceCheckUtils]: 40: Hoare triple {13989#(<= main_~i~0 17)} assume true; {13989#(<= main_~i~0 17)} is VALID [2018-11-18 22:48:45,094 INFO L273 TraceCheckUtils]: 41: Hoare triple {13989#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13990#(<= main_~i~0 18)} is VALID [2018-11-18 22:48:45,095 INFO L273 TraceCheckUtils]: 42: Hoare triple {13990#(<= main_~i~0 18)} assume true; {13990#(<= main_~i~0 18)} is VALID [2018-11-18 22:48:45,096 INFO L273 TraceCheckUtils]: 43: Hoare triple {13990#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13991#(<= main_~i~0 19)} is VALID [2018-11-18 22:48:45,096 INFO L273 TraceCheckUtils]: 44: Hoare triple {13991#(<= main_~i~0 19)} assume true; {13991#(<= main_~i~0 19)} is VALID [2018-11-18 22:48:45,097 INFO L273 TraceCheckUtils]: 45: Hoare triple {13991#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13992#(<= main_~i~0 20)} is VALID [2018-11-18 22:48:45,097 INFO L273 TraceCheckUtils]: 46: Hoare triple {13992#(<= main_~i~0 20)} assume true; {13992#(<= main_~i~0 20)} is VALID [2018-11-18 22:48:45,098 INFO L273 TraceCheckUtils]: 47: Hoare triple {13992#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13993#(<= main_~i~0 21)} is VALID [2018-11-18 22:48:45,099 INFO L273 TraceCheckUtils]: 48: Hoare triple {13993#(<= main_~i~0 21)} assume true; {13993#(<= main_~i~0 21)} is VALID [2018-11-18 22:48:45,100 INFO L273 TraceCheckUtils]: 49: Hoare triple {13993#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13994#(<= main_~i~0 22)} is VALID [2018-11-18 22:48:45,100 INFO L273 TraceCheckUtils]: 50: Hoare triple {13994#(<= main_~i~0 22)} assume true; {13994#(<= main_~i~0 22)} is VALID [2018-11-18 22:48:45,101 INFO L273 TraceCheckUtils]: 51: Hoare triple {13994#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13995#(<= main_~i~0 23)} is VALID [2018-11-18 22:48:45,102 INFO L273 TraceCheckUtils]: 52: Hoare triple {13995#(<= main_~i~0 23)} assume true; {13995#(<= main_~i~0 23)} is VALID [2018-11-18 22:48:45,102 INFO L273 TraceCheckUtils]: 53: Hoare triple {13995#(<= main_~i~0 23)} assume !(~i~0 < 100000); {13971#false} is VALID [2018-11-18 22:48:45,102 INFO L273 TraceCheckUtils]: 54: Hoare triple {13971#false} ~i~0 := 0; {13971#false} is VALID [2018-11-18 22:48:45,103 INFO L273 TraceCheckUtils]: 55: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,103 INFO L273 TraceCheckUtils]: 56: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,103 INFO L273 TraceCheckUtils]: 57: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,103 INFO L273 TraceCheckUtils]: 58: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,103 INFO L273 TraceCheckUtils]: 59: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,103 INFO L273 TraceCheckUtils]: 60: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,104 INFO L273 TraceCheckUtils]: 61: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,104 INFO L273 TraceCheckUtils]: 62: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,104 INFO L273 TraceCheckUtils]: 63: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,104 INFO L273 TraceCheckUtils]: 64: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,104 INFO L273 TraceCheckUtils]: 65: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,105 INFO L273 TraceCheckUtils]: 66: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,105 INFO L273 TraceCheckUtils]: 67: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,105 INFO L273 TraceCheckUtils]: 68: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,105 INFO L273 TraceCheckUtils]: 69: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,105 INFO L273 TraceCheckUtils]: 70: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,105 INFO L273 TraceCheckUtils]: 71: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,105 INFO L273 TraceCheckUtils]: 72: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,106 INFO L273 TraceCheckUtils]: 73: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,106 INFO L273 TraceCheckUtils]: 74: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,106 INFO L273 TraceCheckUtils]: 75: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,106 INFO L273 TraceCheckUtils]: 76: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,106 INFO L273 TraceCheckUtils]: 77: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,106 INFO L273 TraceCheckUtils]: 78: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,106 INFO L273 TraceCheckUtils]: 79: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,106 INFO L273 TraceCheckUtils]: 80: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,106 INFO L273 TraceCheckUtils]: 81: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,107 INFO L273 TraceCheckUtils]: 82: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,107 INFO L273 TraceCheckUtils]: 83: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,107 INFO L273 TraceCheckUtils]: 84: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,107 INFO L273 TraceCheckUtils]: 85: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,107 INFO L273 TraceCheckUtils]: 86: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,107 INFO L273 TraceCheckUtils]: 87: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,107 INFO L273 TraceCheckUtils]: 88: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,107 INFO L273 TraceCheckUtils]: 89: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,107 INFO L273 TraceCheckUtils]: 90: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,108 INFO L273 TraceCheckUtils]: 91: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,108 INFO L273 TraceCheckUtils]: 92: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,108 INFO L273 TraceCheckUtils]: 93: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,108 INFO L273 TraceCheckUtils]: 94: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,108 INFO L273 TraceCheckUtils]: 95: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,108 INFO L273 TraceCheckUtils]: 96: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,108 INFO L273 TraceCheckUtils]: 97: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,108 INFO L273 TraceCheckUtils]: 98: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,108 INFO L273 TraceCheckUtils]: 99: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,109 INFO L273 TraceCheckUtils]: 100: Hoare triple {13971#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13971#false} is VALID [2018-11-18 22:48:45,109 INFO L273 TraceCheckUtils]: 101: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,109 INFO L273 TraceCheckUtils]: 102: Hoare triple {13971#false} assume !(~i~0 < 100000); {13971#false} is VALID [2018-11-18 22:48:45,109 INFO L273 TraceCheckUtils]: 103: Hoare triple {13971#false} havoc ~x~0;~x~0 := 0; {13971#false} is VALID [2018-11-18 22:48:45,109 INFO L273 TraceCheckUtils]: 104: Hoare triple {13971#false} assume true; {13971#false} is VALID [2018-11-18 22:48:45,109 INFO L273 TraceCheckUtils]: 105: Hoare triple {13971#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13971#false} is VALID [2018-11-18 22:48:45,109 INFO L256 TraceCheckUtils]: 106: Hoare triple {13971#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {13971#false} is VALID [2018-11-18 22:48:45,109 INFO L273 TraceCheckUtils]: 107: Hoare triple {13971#false} ~cond := #in~cond; {13971#false} is VALID [2018-11-18 22:48:45,109 INFO L273 TraceCheckUtils]: 108: Hoare triple {13971#false} assume 0 == ~cond; {13971#false} is VALID [2018-11-18 22:48:45,110 INFO L273 TraceCheckUtils]: 109: Hoare triple {13971#false} assume !false; {13971#false} is VALID [2018-11-18 22:48:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-11-18 22:48:45,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:48:45,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-18 22:48:45,146 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-18 22:48:45,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:48:45,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-18 22:48:45,204 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-18 22:48:45,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 22:48:45,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 22:48:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:48:45,205 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 27 states. [2018-11-18 22:48:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:45,813 INFO L93 Difference]: Finished difference Result 180 states and 185 transitions. [2018-11-18 22:48:45,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 22:48:45,814 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-18 22:48:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:48:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:48:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 139 transitions. [2018-11-18 22:48:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:48:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 139 transitions. [2018-11-18 22:48:45,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 139 transitions. [2018-11-18 22:48:45,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:48:45,941 INFO L225 Difference]: With dead ends: 180 [2018-11-18 22:48:45,941 INFO L226 Difference]: Without dead ends: 119 [2018-11-18 22:48:45,941 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:48:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-18 22:48:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-11-18 22:48:46,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:48:46,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 119 states. [2018-11-18 22:48:46,008 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 119 states. [2018-11-18 22:48:46,008 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 119 states. [2018-11-18 22:48:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:46,010 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-11-18 22:48:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-11-18 22:48:46,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:48:46,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:48:46,011 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 119 states. [2018-11-18 22:48:46,011 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 119 states. [2018-11-18 22:48:46,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:46,012 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-11-18 22:48:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-11-18 22:48:46,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:48:46,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:48:46,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:48:46,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:48:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-18 22:48:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-11-18 22:48:46,014 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 110 [2018-11-18 22:48:46,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:48:46,015 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-11-18 22:48:46,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 22:48:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-11-18 22:48:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 22:48:46,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:48:46,015 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:48:46,016 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:48:46,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:48:46,016 INFO L82 PathProgramCache]: Analyzing trace with hash -221433877, now seen corresponding path program 24 times [2018-11-18 22:48:46,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:48:46,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:48:46,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:48:46,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:48:46,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:48:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:46,751 INFO L256 TraceCheckUtils]: 0: Hoare triple {15004#true} call ULTIMATE.init(); {15004#true} is VALID [2018-11-18 22:48:46,752 INFO L273 TraceCheckUtils]: 1: Hoare triple {15004#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15004#true} is VALID [2018-11-18 22:48:46,752 INFO L273 TraceCheckUtils]: 2: Hoare triple {15004#true} assume true; {15004#true} is VALID [2018-11-18 22:48:46,752 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15004#true} {15004#true} #64#return; {15004#true} is VALID [2018-11-18 22:48:46,752 INFO L256 TraceCheckUtils]: 4: Hoare triple {15004#true} call #t~ret2 := main(); {15004#true} is VALID [2018-11-18 22:48:46,753 INFO L273 TraceCheckUtils]: 5: Hoare triple {15004#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15006#(= main_~i~0 0)} is VALID [2018-11-18 22:48:46,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {15006#(= main_~i~0 0)} assume true; {15006#(= main_~i~0 0)} is VALID [2018-11-18 22:48:46,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {15006#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15007#(<= main_~i~0 1)} is VALID [2018-11-18 22:48:46,755 INFO L273 TraceCheckUtils]: 8: Hoare triple {15007#(<= main_~i~0 1)} assume true; {15007#(<= main_~i~0 1)} is VALID [2018-11-18 22:48:46,756 INFO L273 TraceCheckUtils]: 9: Hoare triple {15007#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15008#(<= main_~i~0 2)} is VALID [2018-11-18 22:48:46,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {15008#(<= main_~i~0 2)} assume true; {15008#(<= main_~i~0 2)} is VALID [2018-11-18 22:48:46,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {15008#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15009#(<= main_~i~0 3)} is VALID [2018-11-18 22:48:46,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {15009#(<= main_~i~0 3)} assume true; {15009#(<= main_~i~0 3)} is VALID [2018-11-18 22:48:46,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {15009#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15010#(<= main_~i~0 4)} is VALID [2018-11-18 22:48:46,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {15010#(<= main_~i~0 4)} assume true; {15010#(<= main_~i~0 4)} is VALID [2018-11-18 22:48:46,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {15010#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15011#(<= main_~i~0 5)} is VALID [2018-11-18 22:48:46,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {15011#(<= main_~i~0 5)} assume true; {15011#(<= main_~i~0 5)} is VALID [2018-11-18 22:48:46,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {15011#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15012#(<= main_~i~0 6)} is VALID [2018-11-18 22:48:46,762 INFO L273 TraceCheckUtils]: 18: Hoare triple {15012#(<= main_~i~0 6)} assume true; {15012#(<= main_~i~0 6)} is VALID [2018-11-18 22:48:46,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {15012#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15013#(<= main_~i~0 7)} is VALID [2018-11-18 22:48:46,763 INFO L273 TraceCheckUtils]: 20: Hoare triple {15013#(<= main_~i~0 7)} assume true; {15013#(<= main_~i~0 7)} is VALID [2018-11-18 22:48:46,764 INFO L273 TraceCheckUtils]: 21: Hoare triple {15013#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15014#(<= main_~i~0 8)} is VALID [2018-11-18 22:48:46,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {15014#(<= main_~i~0 8)} assume true; {15014#(<= main_~i~0 8)} is VALID [2018-11-18 22:48:46,766 INFO L273 TraceCheckUtils]: 23: Hoare triple {15014#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15015#(<= main_~i~0 9)} is VALID [2018-11-18 22:48:46,766 INFO L273 TraceCheckUtils]: 24: Hoare triple {15015#(<= main_~i~0 9)} assume true; {15015#(<= main_~i~0 9)} is VALID [2018-11-18 22:48:46,767 INFO L273 TraceCheckUtils]: 25: Hoare triple {15015#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15016#(<= main_~i~0 10)} is VALID [2018-11-18 22:48:46,768 INFO L273 TraceCheckUtils]: 26: Hoare triple {15016#(<= main_~i~0 10)} assume true; {15016#(<= main_~i~0 10)} is VALID [2018-11-18 22:48:46,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {15016#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15017#(<= main_~i~0 11)} is VALID [2018-11-18 22:48:46,769 INFO L273 TraceCheckUtils]: 28: Hoare triple {15017#(<= main_~i~0 11)} assume true; {15017#(<= main_~i~0 11)} is VALID [2018-11-18 22:48:46,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {15017#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15018#(<= main_~i~0 12)} is VALID [2018-11-18 22:48:46,771 INFO L273 TraceCheckUtils]: 30: Hoare triple {15018#(<= main_~i~0 12)} assume true; {15018#(<= main_~i~0 12)} is VALID [2018-11-18 22:48:46,771 INFO L273 TraceCheckUtils]: 31: Hoare triple {15018#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15019#(<= main_~i~0 13)} is VALID [2018-11-18 22:48:46,772 INFO L273 TraceCheckUtils]: 32: Hoare triple {15019#(<= main_~i~0 13)} assume true; {15019#(<= main_~i~0 13)} is VALID [2018-11-18 22:48:46,773 INFO L273 TraceCheckUtils]: 33: Hoare triple {15019#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15020#(<= main_~i~0 14)} is VALID [2018-11-18 22:48:46,773 INFO L273 TraceCheckUtils]: 34: Hoare triple {15020#(<= main_~i~0 14)} assume true; {15020#(<= main_~i~0 14)} is VALID [2018-11-18 22:48:46,774 INFO L273 TraceCheckUtils]: 35: Hoare triple {15020#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15021#(<= main_~i~0 15)} is VALID [2018-11-18 22:48:46,775 INFO L273 TraceCheckUtils]: 36: Hoare triple {15021#(<= main_~i~0 15)} assume true; {15021#(<= main_~i~0 15)} is VALID [2018-11-18 22:48:46,776 INFO L273 TraceCheckUtils]: 37: Hoare triple {15021#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15022#(<= main_~i~0 16)} is VALID [2018-11-18 22:48:46,776 INFO L273 TraceCheckUtils]: 38: Hoare triple {15022#(<= main_~i~0 16)} assume true; {15022#(<= main_~i~0 16)} is VALID [2018-11-18 22:48:46,777 INFO L273 TraceCheckUtils]: 39: Hoare triple {15022#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15023#(<= main_~i~0 17)} is VALID [2018-11-18 22:48:46,778 INFO L273 TraceCheckUtils]: 40: Hoare triple {15023#(<= main_~i~0 17)} assume true; {15023#(<= main_~i~0 17)} is VALID [2018-11-18 22:48:46,779 INFO L273 TraceCheckUtils]: 41: Hoare triple {15023#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15024#(<= main_~i~0 18)} is VALID [2018-11-18 22:48:46,779 INFO L273 TraceCheckUtils]: 42: Hoare triple {15024#(<= main_~i~0 18)} assume true; {15024#(<= main_~i~0 18)} is VALID [2018-11-18 22:48:46,780 INFO L273 TraceCheckUtils]: 43: Hoare triple {15024#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15025#(<= main_~i~0 19)} is VALID [2018-11-18 22:48:46,781 INFO L273 TraceCheckUtils]: 44: Hoare triple {15025#(<= main_~i~0 19)} assume true; {15025#(<= main_~i~0 19)} is VALID [2018-11-18 22:48:46,781 INFO L273 TraceCheckUtils]: 45: Hoare triple {15025#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15026#(<= main_~i~0 20)} is VALID [2018-11-18 22:48:46,782 INFO L273 TraceCheckUtils]: 46: Hoare triple {15026#(<= main_~i~0 20)} assume true; {15026#(<= main_~i~0 20)} is VALID [2018-11-18 22:48:46,783 INFO L273 TraceCheckUtils]: 47: Hoare triple {15026#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15027#(<= main_~i~0 21)} is VALID [2018-11-18 22:48:46,784 INFO L273 TraceCheckUtils]: 48: Hoare triple {15027#(<= main_~i~0 21)} assume true; {15027#(<= main_~i~0 21)} is VALID [2018-11-18 22:48:46,784 INFO L273 TraceCheckUtils]: 49: Hoare triple {15027#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15028#(<= main_~i~0 22)} is VALID [2018-11-18 22:48:46,785 INFO L273 TraceCheckUtils]: 50: Hoare triple {15028#(<= main_~i~0 22)} assume true; {15028#(<= main_~i~0 22)} is VALID [2018-11-18 22:48:46,786 INFO L273 TraceCheckUtils]: 51: Hoare triple {15028#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15029#(<= main_~i~0 23)} is VALID [2018-11-18 22:48:46,786 INFO L273 TraceCheckUtils]: 52: Hoare triple {15029#(<= main_~i~0 23)} assume true; {15029#(<= main_~i~0 23)} is VALID [2018-11-18 22:48:46,787 INFO L273 TraceCheckUtils]: 53: Hoare triple {15029#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15030#(<= main_~i~0 24)} is VALID [2018-11-18 22:48:46,788 INFO L273 TraceCheckUtils]: 54: Hoare triple {15030#(<= main_~i~0 24)} assume true; {15030#(<= main_~i~0 24)} is VALID [2018-11-18 22:48:46,789 INFO L273 TraceCheckUtils]: 55: Hoare triple {15030#(<= main_~i~0 24)} assume !(~i~0 < 100000); {15005#false} is VALID [2018-11-18 22:48:46,789 INFO L273 TraceCheckUtils]: 56: Hoare triple {15005#false} ~i~0 := 0; {15005#false} is VALID [2018-11-18 22:48:46,789 INFO L273 TraceCheckUtils]: 57: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,789 INFO L273 TraceCheckUtils]: 58: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,789 INFO L273 TraceCheckUtils]: 59: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,790 INFO L273 TraceCheckUtils]: 60: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,790 INFO L273 TraceCheckUtils]: 61: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,790 INFO L273 TraceCheckUtils]: 62: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,790 INFO L273 TraceCheckUtils]: 63: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,790 INFO L273 TraceCheckUtils]: 64: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,791 INFO L273 TraceCheckUtils]: 65: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,791 INFO L273 TraceCheckUtils]: 66: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,791 INFO L273 TraceCheckUtils]: 67: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,791 INFO L273 TraceCheckUtils]: 68: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,791 INFO L273 TraceCheckUtils]: 69: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,792 INFO L273 TraceCheckUtils]: 70: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,792 INFO L273 TraceCheckUtils]: 71: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,792 INFO L273 TraceCheckUtils]: 72: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,792 INFO L273 TraceCheckUtils]: 73: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,792 INFO L273 TraceCheckUtils]: 74: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,792 INFO L273 TraceCheckUtils]: 75: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,793 INFO L273 TraceCheckUtils]: 76: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,793 INFO L273 TraceCheckUtils]: 77: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,793 INFO L273 TraceCheckUtils]: 78: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,793 INFO L273 TraceCheckUtils]: 79: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,793 INFO L273 TraceCheckUtils]: 80: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,793 INFO L273 TraceCheckUtils]: 81: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,793 INFO L273 TraceCheckUtils]: 82: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,793 INFO L273 TraceCheckUtils]: 83: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,793 INFO L273 TraceCheckUtils]: 84: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,794 INFO L273 TraceCheckUtils]: 85: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,794 INFO L273 TraceCheckUtils]: 86: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,794 INFO L273 TraceCheckUtils]: 87: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,794 INFO L273 TraceCheckUtils]: 88: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,794 INFO L273 TraceCheckUtils]: 89: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,794 INFO L273 TraceCheckUtils]: 90: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,794 INFO L273 TraceCheckUtils]: 91: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,794 INFO L273 TraceCheckUtils]: 92: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,794 INFO L273 TraceCheckUtils]: 93: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,795 INFO L273 TraceCheckUtils]: 94: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,795 INFO L273 TraceCheckUtils]: 95: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,795 INFO L273 TraceCheckUtils]: 96: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,795 INFO L273 TraceCheckUtils]: 97: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,795 INFO L273 TraceCheckUtils]: 98: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,795 INFO L273 TraceCheckUtils]: 99: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,795 INFO L273 TraceCheckUtils]: 100: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,795 INFO L273 TraceCheckUtils]: 101: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,795 INFO L273 TraceCheckUtils]: 102: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,796 INFO L273 TraceCheckUtils]: 103: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,796 INFO L273 TraceCheckUtils]: 104: Hoare triple {15005#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15005#false} is VALID [2018-11-18 22:48:46,796 INFO L273 TraceCheckUtils]: 105: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,796 INFO L273 TraceCheckUtils]: 106: Hoare triple {15005#false} assume !(~i~0 < 100000); {15005#false} is VALID [2018-11-18 22:48:46,796 INFO L273 TraceCheckUtils]: 107: Hoare triple {15005#false} havoc ~x~0;~x~0 := 0; {15005#false} is VALID [2018-11-18 22:48:46,796 INFO L273 TraceCheckUtils]: 108: Hoare triple {15005#false} assume true; {15005#false} is VALID [2018-11-18 22:48:46,796 INFO L273 TraceCheckUtils]: 109: Hoare triple {15005#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15005#false} is VALID [2018-11-18 22:48:46,796 INFO L256 TraceCheckUtils]: 110: Hoare triple {15005#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {15005#false} is VALID [2018-11-18 22:48:46,797 INFO L273 TraceCheckUtils]: 111: Hoare triple {15005#false} ~cond := #in~cond; {15005#false} is VALID [2018-11-18 22:48:46,797 INFO L273 TraceCheckUtils]: 112: Hoare triple {15005#false} assume 0 == ~cond; {15005#false} is VALID [2018-11-18 22:48:46,797 INFO L273 TraceCheckUtils]: 113: Hoare triple {15005#false} assume !false; {15005#false} is VALID [2018-11-18 22:48:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-11-18 22:48:46,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:48:46,804 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-18 22:48:46,813 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE