java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init2_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:54:46,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:54:46,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:54:46,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:54:46,930 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:54:46,932 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:54:46,933 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:54:46,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:54:46,940 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:54:46,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:54:46,943 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:54:46,943 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:54:46,946 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:54:46,947 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:54:46,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:54:46,952 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:54:46,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:54:46,956 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:54:46,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:54:46,971 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:54:46,972 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:54:46,973 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:54:46,975 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:54:46,975 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:54:46,975 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:54:46,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:54:46,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:54:46,978 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:54:46,979 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:54:46,980 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:54:46,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:54:46,981 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:54:46,981 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:54:46,981 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:54:46,982 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:54:46,983 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:54:46,983 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:54:47,011 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:54:47,011 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:54:47,014 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:54:47,014 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:54:47,015 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:54:47,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:54:47,015 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:54:47,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:54:47,016 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:54:47,016 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:54:47,016 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:54:47,016 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:54:47,016 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:54:47,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:54:47,018 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:54:47,018 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:54:47,018 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:54:47,019 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:54:47,019 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:54:47,019 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:54:47,019 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:54:47,019 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:54:47,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:54:47,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:54:47,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:54:47,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:54:47,022 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:54:47,022 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:54:47,022 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:54:47,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:54:47,023 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:54:47,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:54:47,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:54:47,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:54:47,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:54:47,122 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:54:47,122 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-23 11:54:47,202 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692aa5bed/c77666797fc34152aa618cc32dcc0800/FLAG2358df537 [2018-11-23 11:54:47,647 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:54:47,648 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init2_false-unreach-call_ground.i [2018-11-23 11:54:47,654 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692aa5bed/c77666797fc34152aa618cc32dcc0800/FLAG2358df537 [2018-11-23 11:54:48,026 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692aa5bed/c77666797fc34152aa618cc32dcc0800 [2018-11-23 11:54:48,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:54:48,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:54:48,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:54:48,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:54:48,042 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:54:48,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d94b8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48, skipping insertion in model container [2018-11-23 11:54:48,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:54:48,081 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:54:48,299 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:54:48,303 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:54:48,328 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:54:48,356 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:54:48,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48 WrapperNode [2018-11-23 11:54:48,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:54:48,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:54:48,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:54:48,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:54:48,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:54:48,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:54:48,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:54:48,391 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:54:48,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:54:48,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:54:48,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:54:48,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:54:48,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:54:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:54:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:54:48,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:54:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:54:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:54:48,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:54:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:54:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:54:48,560 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:54:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:54:48,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:54:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:54:49,062 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:54:49,062 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:54:49,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:54:49 BoogieIcfgContainer [2018-11-23 11:54:49,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:54:49,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:54:49,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:54:49,068 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:54:49,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:54:48" (1/3) ... [2018-11-23 11:54:49,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d1352a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:54:49, skipping insertion in model container [2018-11-23 11:54:49,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48" (2/3) ... [2018-11-23 11:54:49,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d1352a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:54:49, skipping insertion in model container [2018-11-23 11:54:49,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:54:49" (3/3) ... [2018-11-23 11:54:49,072 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init2_false-unreach-call_ground.i [2018-11-23 11:54:49,082 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:54:49,091 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:54:49,111 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:54:49,145 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:54:49,145 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:54:49,146 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:54:49,146 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:54:49,147 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:54:49,147 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:54:49,147 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:54:49,147 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:54:49,148 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:54:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 11:54:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:54:49,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:49,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:49,177 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:49,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:49,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2104113866, now seen corresponding path program 1 times [2018-11-23 11:54:49,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:49,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:49,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:49,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:49,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:49,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 11:54:49,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 11:54:49,332 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 11:54:49,332 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #61#return; {28#true} is VALID [2018-11-23 11:54:49,333 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret2 := main(); {28#true} is VALID [2018-11-23 11:54:49,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {28#true} is VALID [2018-11-23 11:54:49,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 11:54:49,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0; {29#false} is VALID [2018-11-23 11:54:49,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !(~i~0 < 100000); {29#false} is VALID [2018-11-23 11:54:49,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} havoc ~x~0;~x~0 := 0; {29#false} is VALID [2018-11-23 11:54:49,337 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {29#false} is VALID [2018-11-23 11:54:49,338 INFO L256 TraceCheckUtils]: 11: Hoare triple {29#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {29#false} is VALID [2018-11-23 11:54:49,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 11:54:49,338 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2018-11-23 11:54:49,339 INFO L273 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 11:54:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:49,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:54:49,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:54:49,350 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:54:49,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:49,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:54:49,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:49,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:54:49,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:54:49,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:54:49,444 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 11:54:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:49,666 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-23 11:54:49,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:54:49,667 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:54:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:54:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 11:54:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:54:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 11:54:49,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2018-11-23 11:54:49,967 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-23 11:54:49,978 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:54:49,979 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:54:49,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:54:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:54:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:54:50,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:50,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:54:50,133 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:54:50,133 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:54:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:50,137 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:54:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:54:50,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:50,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:50,138 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:54:50,138 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:54:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:50,142 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:54:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:54:50,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:50,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:50,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:50,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:54:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 11:54:50,148 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2018-11-23 11:54:50,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:50,148 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 11:54:50,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:54:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:54:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:54:50,150 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:50,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:50,150 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:50,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:50,151 INFO L82 PathProgramCache]: Analyzing trace with hash 743997126, now seen corresponding path program 1 times [2018-11-23 11:54:50,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:50,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:50,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:50,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:50,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {157#true} call ULTIMATE.init(); {157#true} is VALID [2018-11-23 11:54:50,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {157#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {157#true} is VALID [2018-11-23 11:54:50,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {157#true} assume true; {157#true} is VALID [2018-11-23 11:54:50,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} #61#return; {157#true} is VALID [2018-11-23 11:54:50,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {157#true} call #t~ret2 := main(); {157#true} is VALID [2018-11-23 11:54:50,388 INFO L273 TraceCheckUtils]: 5: Hoare triple {157#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {159#(= main_~i~0 0)} is VALID [2018-11-23 11:54:50,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {159#(= main_~i~0 0)} assume !(~i~0 < 100000); {158#false} is VALID [2018-11-23 11:54:50,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {158#false} ~i~0 := 0; {158#false} is VALID [2018-11-23 11:54:50,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {158#false} assume !(~i~0 < 100000); {158#false} is VALID [2018-11-23 11:54:50,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {158#false} havoc ~x~0;~x~0 := 0; {158#false} is VALID [2018-11-23 11:54:50,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {158#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {158#false} is VALID [2018-11-23 11:54:50,404 INFO L256 TraceCheckUtils]: 11: Hoare triple {158#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {158#false} is VALID [2018-11-23 11:54:50,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {158#false} ~cond := #in~cond; {158#false} is VALID [2018-11-23 11:54:50,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {158#false} assume 0 == ~cond; {158#false} is VALID [2018-11-23 11:54:50,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {158#false} assume !false; {158#false} is VALID [2018-11-23 11:54:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:50,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:54:50,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:54:50,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:54:50,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:50,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:54:50,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:50,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:54:50,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:54:50,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:54:50,532 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 11:54:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:50,683 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 11:54:50,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:54:50,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:54:50,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:54:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-23 11:54:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:54:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-23 11:54:50,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2018-11-23 11:54:50,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:50,791 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:54:50,791 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:54:50,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:54:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:54:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 11:54:50,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:50,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:50,811 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:50,812 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:50,814 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:54:50,814 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:54:50,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:50,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:50,815 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:50,815 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:50,817 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:54:50,817 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:54:50,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:50,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:50,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:50,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:54:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 11:54:50,820 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-23 11:54:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:50,821 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 11:54:50,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:54:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:54:50,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:54:50,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:50,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:50,823 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:50,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:50,823 INFO L82 PathProgramCache]: Analyzing trace with hash 494025381, now seen corresponding path program 1 times [2018-11-23 11:54:50,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:50,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:50,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:50,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:51,127 INFO L256 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2018-11-23 11:54:51,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {289#true} is VALID [2018-11-23 11:54:51,128 INFO L273 TraceCheckUtils]: 2: Hoare triple {289#true} assume true; {289#true} is VALID [2018-11-23 11:54:51,129 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} #61#return; {289#true} is VALID [2018-11-23 11:54:51,129 INFO L256 TraceCheckUtils]: 4: Hoare triple {289#true} call #t~ret2 := main(); {289#true} is VALID [2018-11-23 11:54:51,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {289#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {291#(= main_~i~0 0)} is VALID [2018-11-23 11:54:51,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {291#(= 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; {292#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:51,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#(<= main_~i~0 1)} assume !(~i~0 < 100000); {290#false} is VALID [2018-11-23 11:54:51,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {290#false} ~i~0 := 0; {290#false} is VALID [2018-11-23 11:54:51,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {290#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {290#false} is VALID [2018-11-23 11:54:51,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {290#false} assume !(~i~0 < 100000); {290#false} is VALID [2018-11-23 11:54:51,172 INFO L273 TraceCheckUtils]: 11: Hoare triple {290#false} havoc ~x~0;~x~0 := 0; {290#false} is VALID [2018-11-23 11:54:51,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {290#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {290#false} is VALID [2018-11-23 11:54:51,172 INFO L256 TraceCheckUtils]: 13: Hoare triple {290#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {290#false} is VALID [2018-11-23 11:54:51,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {290#false} ~cond := #in~cond; {290#false} is VALID [2018-11-23 11:54:51,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {290#false} assume 0 == ~cond; {290#false} is VALID [2018-11-23 11:54:51,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {290#false} assume !false; {290#false} is VALID [2018-11-23 11:54:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:54:51,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:51,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:51,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:51,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:51,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2018-11-23 11:54:51,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {289#true} is VALID [2018-11-23 11:54:51,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {289#true} assume true; {289#true} is VALID [2018-11-23 11:54:51,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} #61#return; {289#true} is VALID [2018-11-23 11:54:51,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {289#true} call #t~ret2 := main(); {289#true} is VALID [2018-11-23 11:54:51,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {289#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {311#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:51,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(<= 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; {292#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:51,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#(<= main_~i~0 1)} assume !(~i~0 < 100000); {290#false} is VALID [2018-11-23 11:54:51,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {290#false} ~i~0 := 0; {290#false} is VALID [2018-11-23 11:54:51,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {290#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {290#false} is VALID [2018-11-23 11:54:51,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {290#false} assume !(~i~0 < 100000); {290#false} is VALID [2018-11-23 11:54:51,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {290#false} havoc ~x~0;~x~0 := 0; {290#false} is VALID [2018-11-23 11:54:51,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {290#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {290#false} is VALID [2018-11-23 11:54:51,395 INFO L256 TraceCheckUtils]: 13: Hoare triple {290#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {290#false} is VALID [2018-11-23 11:54:51,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {290#false} ~cond := #in~cond; {290#false} is VALID [2018-11-23 11:54:51,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {290#false} assume 0 == ~cond; {290#false} is VALID [2018-11-23 11:54:51,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {290#false} assume !false; {290#false} is VALID [2018-11-23 11:54:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:54:51,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:51,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:54:51,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:54:51,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:51,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:54:51,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:51,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:54:51,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:54:51,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:54:51,511 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-11-23 11:54:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,885 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 11:54:51,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:54:51,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:54:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:54:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 11:54:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:54:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 11:54:51,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2018-11-23 11:54:51,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:51,984 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:54:51,984 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:54:51,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:54:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:54:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 11:54:52,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:52,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:52,006 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:52,006 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,008 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:54:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:54:52,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,009 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:52,009 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,012 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:54:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:54:52,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:52,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:54:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 11:54:52,015 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2018-11-23 11:54:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:52,016 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 11:54:52,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:54:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:54:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:54:52,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:52,017 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:52,017 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:52,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:52,018 INFO L82 PathProgramCache]: Analyzing trace with hash -254426330, now seen corresponding path program 2 times [2018-11-23 11:54:52,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:52,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:52,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:52,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,149 INFO L256 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2018-11-23 11:54:52,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {485#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {485#true} is VALID [2018-11-23 11:54:52,150 INFO L273 TraceCheckUtils]: 2: Hoare triple {485#true} assume true; {485#true} is VALID [2018-11-23 11:54:52,150 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} #61#return; {485#true} is VALID [2018-11-23 11:54:52,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {485#true} call #t~ret2 := main(); {485#true} is VALID [2018-11-23 11:54:52,153 INFO L273 TraceCheckUtils]: 5: Hoare triple {485#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {487#(= main_~i~0 0)} is VALID [2018-11-23 11:54:52,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {487#(= 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; {488#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:52,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#(<= 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; {489#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:52,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {489#(<= main_~i~0 2)} assume !(~i~0 < 100000); {486#false} is VALID [2018-11-23 11:54:52,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {486#false} ~i~0 := 0; {486#false} is VALID [2018-11-23 11:54:52,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {486#false} is VALID [2018-11-23 11:54:52,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {486#false} is VALID [2018-11-23 11:54:52,159 INFO L273 TraceCheckUtils]: 12: Hoare triple {486#false} assume !(~i~0 < 100000); {486#false} is VALID [2018-11-23 11:54:52,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {486#false} havoc ~x~0;~x~0 := 0; {486#false} is VALID [2018-11-23 11:54:52,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {486#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {486#false} is VALID [2018-11-23 11:54:52,159 INFO L256 TraceCheckUtils]: 15: Hoare triple {486#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {486#false} is VALID [2018-11-23 11:54:52,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {486#false} ~cond := #in~cond; {486#false} is VALID [2018-11-23 11:54:52,160 INFO L273 TraceCheckUtils]: 17: Hoare triple {486#false} assume 0 == ~cond; {486#false} is VALID [2018-11-23 11:54:52,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {486#false} assume !false; {486#false} is VALID [2018-11-23 11:54:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:54:52,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:52,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:52,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:52,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:52,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:52,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2018-11-23 11:54:52,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {485#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {485#true} is VALID [2018-11-23 11:54:52,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {485#true} assume true; {485#true} is VALID [2018-11-23 11:54:52,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} #61#return; {485#true} is VALID [2018-11-23 11:54:52,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {485#true} call #t~ret2 := main(); {485#true} is VALID [2018-11-23 11:54:52,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {485#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {508#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:52,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {508#(<= 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; {488#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:52,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#(<= 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; {489#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:52,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {489#(<= main_~i~0 2)} assume !(~i~0 < 100000); {486#false} is VALID [2018-11-23 11:54:52,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {486#false} ~i~0 := 0; {486#false} is VALID [2018-11-23 11:54:52,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {486#false} is VALID [2018-11-23 11:54:52,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {486#false} is VALID [2018-11-23 11:54:52,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {486#false} assume !(~i~0 < 100000); {486#false} is VALID [2018-11-23 11:54:52,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {486#false} havoc ~x~0;~x~0 := 0; {486#false} is VALID [2018-11-23 11:54:52,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {486#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {486#false} is VALID [2018-11-23 11:54:52,351 INFO L256 TraceCheckUtils]: 15: Hoare triple {486#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {486#false} is VALID [2018-11-23 11:54:52,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {486#false} ~cond := #in~cond; {486#false} is VALID [2018-11-23 11:54:52,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {486#false} assume 0 == ~cond; {486#false} is VALID [2018-11-23 11:54:52,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {486#false} assume !false; {486#false} is VALID [2018-11-23 11:54:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:54:52,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:52,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:54:52,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:54:52,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:52,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:54:52,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:52,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:54:52,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:54:52,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:54:52,484 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2018-11-23 11:54:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,633 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 11:54:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:54:52,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:54:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:54:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2018-11-23 11:54:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:54:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2018-11-23 11:54:52,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2018-11-23 11:54:52,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:52,744 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:54:52,744 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:54:52,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:54:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:54:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 11:54:52,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:52,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 11:54:52,767 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:54:52,767 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:54:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,769 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 11:54:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 11:54:52,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,770 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:54:52,771 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:54:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,773 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 11:54:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 11:54:52,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:52,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:54:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 11:54:52,776 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2018-11-23 11:54:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:52,777 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 11:54:52,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:54:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 11:54:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:54:52,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:52,778 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:52,778 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:52,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:52,779 INFO L82 PathProgramCache]: Analyzing trace with hash -254217403, now seen corresponding path program 3 times [2018-11-23 11:54:52,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:52,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:52,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:52,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2018-11-23 11:54:52,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {702#true} is VALID [2018-11-23 11:54:52,901 INFO L273 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-23 11:54:52,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #61#return; {702#true} is VALID [2018-11-23 11:54:52,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret2 := main(); {702#true} is VALID [2018-11-23 11:54:52,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {702#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {704#(= main_~i~0 0)} is VALID [2018-11-23 11:54:52,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {704#(= 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; {705#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:52,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {705#(<= 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; {706#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:52,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {706#(<= 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; {707#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:52,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {707#(<= main_~i~0 3)} assume !(~i~0 < 100000); {703#false} is VALID [2018-11-23 11:54:52,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {703#false} ~i~0 := 0; {703#false} is VALID [2018-11-23 11:54:52,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {703#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {703#false} is VALID [2018-11-23 11:54:52,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {703#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {703#false} is VALID [2018-11-23 11:54:52,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {703#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {703#false} is VALID [2018-11-23 11:54:52,908 INFO L273 TraceCheckUtils]: 14: Hoare triple {703#false} assume !(~i~0 < 100000); {703#false} is VALID [2018-11-23 11:54:52,909 INFO L273 TraceCheckUtils]: 15: Hoare triple {703#false} havoc ~x~0;~x~0 := 0; {703#false} is VALID [2018-11-23 11:54:52,909 INFO L273 TraceCheckUtils]: 16: Hoare triple {703#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {703#false} is VALID [2018-11-23 11:54:52,909 INFO L256 TraceCheckUtils]: 17: Hoare triple {703#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {703#false} is VALID [2018-11-23 11:54:52,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {703#false} ~cond := #in~cond; {703#false} is VALID [2018-11-23 11:54:52,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {703#false} assume 0 == ~cond; {703#false} is VALID [2018-11-23 11:54:52,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {703#false} assume !false; {703#false} is VALID [2018-11-23 11:54:52,911 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-23 11:54:52,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:52,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:52,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:52,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:54:52,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:53,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2018-11-23 11:54:53,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {702#true} is VALID [2018-11-23 11:54:53,065 INFO L273 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-23 11:54:53,066 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #61#return; {702#true} is VALID [2018-11-23 11:54:53,066 INFO L256 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret2 := main(); {702#true} is VALID [2018-11-23 11:54:53,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {702#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {726#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:53,072 INFO L273 TraceCheckUtils]: 6: Hoare triple {726#(<= 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; {705#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:53,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {705#(<= 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; {706#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:53,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {706#(<= 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; {707#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:53,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {707#(<= main_~i~0 3)} assume !(~i~0 < 100000); {703#false} is VALID [2018-11-23 11:54:53,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {703#false} ~i~0 := 0; {703#false} is VALID [2018-11-23 11:54:53,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {703#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {703#false} is VALID [2018-11-23 11:54:53,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {703#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {703#false} is VALID [2018-11-23 11:54:53,075 INFO L273 TraceCheckUtils]: 13: Hoare triple {703#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {703#false} is VALID [2018-11-23 11:54:53,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {703#false} assume !(~i~0 < 100000); {703#false} is VALID [2018-11-23 11:54:53,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {703#false} havoc ~x~0;~x~0 := 0; {703#false} is VALID [2018-11-23 11:54:53,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {703#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {703#false} is VALID [2018-11-23 11:54:53,075 INFO L256 TraceCheckUtils]: 17: Hoare triple {703#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {703#false} is VALID [2018-11-23 11:54:53,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {703#false} ~cond := #in~cond; {703#false} is VALID [2018-11-23 11:54:53,076 INFO L273 TraceCheckUtils]: 19: Hoare triple {703#false} assume 0 == ~cond; {703#false} is VALID [2018-11-23 11:54:53,076 INFO L273 TraceCheckUtils]: 20: Hoare triple {703#false} assume !false; {703#false} is VALID [2018-11-23 11:54:53,078 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-23 11:54:53,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:53,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:54:53,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:54:53,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:53,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:54:53,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:53,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:54:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:54:53,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:54:53,132 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-11-23 11:54:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,349 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 11:54:53,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:54:53,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:54:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:54:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-23 11:54:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:54:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-23 11:54:53,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2018-11-23 11:54:53,457 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-23 11:54:53,458 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:54:53,459 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:54:53,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:54:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:54:53,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:54:53,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:53,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:53,474 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:53,474 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,476 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 11:54:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 11:54:53,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:53,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:53,477 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:53,477 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,479 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 11:54:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 11:54:53,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:53,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:53,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:53,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:54:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 11:54:53,482 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2018-11-23 11:54:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:53,483 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 11:54:53,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:54:53,483 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 11:54:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:54:53,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:53,485 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:53,485 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:53,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:53,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1902727046, now seen corresponding path program 4 times [2018-11-23 11:54:53,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:53,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:53,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:53,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:53,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {940#true} call ULTIMATE.init(); {940#true} is VALID [2018-11-23 11:54:53,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {940#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {940#true} is VALID [2018-11-23 11:54:53,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {940#true} assume true; {940#true} is VALID [2018-11-23 11:54:53,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} #61#return; {940#true} is VALID [2018-11-23 11:54:53,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {940#true} call #t~ret2 := main(); {940#true} is VALID [2018-11-23 11:54:53,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {940#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {942#(= main_~i~0 0)} is VALID [2018-11-23 11:54:53,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {942#(= 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; {943#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:53,628 INFO L273 TraceCheckUtils]: 7: Hoare triple {943#(<= 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; {944#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:53,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {944#(<= 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; {945#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:53,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {945#(<= 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; {946#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:53,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {946#(<= main_~i~0 4)} assume !(~i~0 < 100000); {941#false} is VALID [2018-11-23 11:54:53,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {941#false} ~i~0 := 0; {941#false} is VALID [2018-11-23 11:54:53,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 11:54:53,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 11:54:53,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 11:54:53,633 INFO L273 TraceCheckUtils]: 15: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 11:54:53,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {941#false} assume !(~i~0 < 100000); {941#false} is VALID [2018-11-23 11:54:53,634 INFO L273 TraceCheckUtils]: 17: Hoare triple {941#false} havoc ~x~0;~x~0 := 0; {941#false} is VALID [2018-11-23 11:54:53,634 INFO L273 TraceCheckUtils]: 18: Hoare triple {941#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {941#false} is VALID [2018-11-23 11:54:53,635 INFO L256 TraceCheckUtils]: 19: Hoare triple {941#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {941#false} is VALID [2018-11-23 11:54:53,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {941#false} ~cond := #in~cond; {941#false} is VALID [2018-11-23 11:54:53,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {941#false} assume 0 == ~cond; {941#false} is VALID [2018-11-23 11:54:53,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {941#false} assume !false; {941#false} is VALID [2018-11-23 11:54:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 11:54:53,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:53,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:53,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:53,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:53,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:53,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:53,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {940#true} call ULTIMATE.init(); {940#true} is VALID [2018-11-23 11:54:53,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {940#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {940#true} is VALID [2018-11-23 11:54:53,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {940#true} assume true; {940#true} is VALID [2018-11-23 11:54:53,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} #61#return; {940#true} is VALID [2018-11-23 11:54:53,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {940#true} call #t~ret2 := main(); {940#true} is VALID [2018-11-23 11:54:53,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {940#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {965#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:53,948 INFO L273 TraceCheckUtils]: 6: Hoare triple {965#(<= 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; {943#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:53,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {943#(<= 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; {944#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:53,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {944#(<= 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; {945#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:53,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {945#(<= 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; {946#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:53,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {946#(<= main_~i~0 4)} assume !(~i~0 < 100000); {941#false} is VALID [2018-11-23 11:54:53,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {941#false} ~i~0 := 0; {941#false} is VALID [2018-11-23 11:54:53,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 11:54:53,952 INFO L273 TraceCheckUtils]: 13: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 11:54:53,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 11:54:53,952 INFO L273 TraceCheckUtils]: 15: Hoare triple {941#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {941#false} is VALID [2018-11-23 11:54:53,953 INFO L273 TraceCheckUtils]: 16: Hoare triple {941#false} assume !(~i~0 < 100000); {941#false} is VALID [2018-11-23 11:54:53,953 INFO L273 TraceCheckUtils]: 17: Hoare triple {941#false} havoc ~x~0;~x~0 := 0; {941#false} is VALID [2018-11-23 11:54:53,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {941#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {941#false} is VALID [2018-11-23 11:54:53,954 INFO L256 TraceCheckUtils]: 19: Hoare triple {941#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {941#false} is VALID [2018-11-23 11:54:53,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {941#false} ~cond := #in~cond; {941#false} is VALID [2018-11-23 11:54:53,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {941#false} assume 0 == ~cond; {941#false} is VALID [2018-11-23 11:54:53,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {941#false} assume !false; {941#false} is VALID [2018-11-23 11:54:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 11:54:53,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:53,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:54:53,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 11:54:53,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:53,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:54:54,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:54,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:54:54,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:54:54,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:54:54,056 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-11-23 11:54:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,210 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-23 11:54:54,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:54:54,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 11:54:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:54,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:54:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-11-23 11:54:54,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:54:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-11-23 11:54:54,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2018-11-23 11:54:54,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:54,284 INFO L225 Difference]: With dead ends: 47 [2018-11-23 11:54:54,284 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 11:54:54,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:54:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 11:54:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 11:54:54,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:54,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 11:54:54,302 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 11:54:54,302 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 11:54:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,304 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 11:54:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 11:54:54,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:54,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:54,305 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 11:54:54,305 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 11:54:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,307 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 11:54:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 11:54:54,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:54,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:54,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:54,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:54:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 11:54:54,310 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2018-11-23 11:54:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:54,310 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 11:54:54,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:54:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 11:54:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:54:54,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:54,312 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:54,312 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:54,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:54,312 INFO L82 PathProgramCache]: Analyzing trace with hash 768730085, now seen corresponding path program 5 times [2018-11-23 11:54:54,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:54,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:54,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:54,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:54,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:54,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {1199#true} call ULTIMATE.init(); {1199#true} is VALID [2018-11-23 11:54:54,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {1199#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1199#true} is VALID [2018-11-23 11:54:54,474 INFO L273 TraceCheckUtils]: 2: Hoare triple {1199#true} assume true; {1199#true} is VALID [2018-11-23 11:54:54,474 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1199#true} {1199#true} #61#return; {1199#true} is VALID [2018-11-23 11:54:54,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {1199#true} call #t~ret2 := main(); {1199#true} is VALID [2018-11-23 11:54:54,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {1199#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1201#(= main_~i~0 0)} is VALID [2018-11-23 11:54:54,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {1201#(= 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; {1202#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:54,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {1202#(<= 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; {1203#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:54,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {1203#(<= 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; {1204#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:54,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {1204#(<= 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; {1205#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:54,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {1205#(<= 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; {1206#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:54,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {1206#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1200#false} is VALID [2018-11-23 11:54:54,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {1200#false} ~i~0 := 0; {1200#false} is VALID [2018-11-23 11:54:54,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 11:54:54,484 INFO L273 TraceCheckUtils]: 14: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 11:54:54,484 INFO L273 TraceCheckUtils]: 15: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 11:54:54,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 11:54:54,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 11:54:54,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {1200#false} assume !(~i~0 < 100000); {1200#false} is VALID [2018-11-23 11:54:54,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {1200#false} havoc ~x~0;~x~0 := 0; {1200#false} is VALID [2018-11-23 11:54:54,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {1200#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1200#false} is VALID [2018-11-23 11:54:54,486 INFO L256 TraceCheckUtils]: 21: Hoare triple {1200#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1200#false} is VALID [2018-11-23 11:54:54,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {1200#false} ~cond := #in~cond; {1200#false} is VALID [2018-11-23 11:54:54,486 INFO L273 TraceCheckUtils]: 23: Hoare triple {1200#false} assume 0 == ~cond; {1200#false} is VALID [2018-11-23 11:54:54,487 INFO L273 TraceCheckUtils]: 24: Hoare triple {1200#false} assume !false; {1200#false} is VALID [2018-11-23 11:54:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 11:54:54,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:54,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:54,498 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:54,564 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 11:54:54,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:54,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:54,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {1199#true} call ULTIMATE.init(); {1199#true} is VALID [2018-11-23 11:54:54,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {1199#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1199#true} is VALID [2018-11-23 11:54:54,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {1199#true} assume true; {1199#true} is VALID [2018-11-23 11:54:54,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1199#true} {1199#true} #61#return; {1199#true} is VALID [2018-11-23 11:54:54,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {1199#true} call #t~ret2 := main(); {1199#true} is VALID [2018-11-23 11:54:54,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {1199#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1225#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:54,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {1225#(<= 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; {1202#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:54,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {1202#(<= 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; {1203#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:54,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {1203#(<= 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; {1204#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:54,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {1204#(<= 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; {1205#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:54,731 INFO L273 TraceCheckUtils]: 10: Hoare triple {1205#(<= 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; {1206#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:54,731 INFO L273 TraceCheckUtils]: 11: Hoare triple {1206#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1200#false} is VALID [2018-11-23 11:54:54,731 INFO L273 TraceCheckUtils]: 12: Hoare triple {1200#false} ~i~0 := 0; {1200#false} is VALID [2018-11-23 11:54:54,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 11:54:54,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 11:54:54,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 11:54:54,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 11:54:54,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {1200#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1200#false} is VALID [2018-11-23 11:54:54,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {1200#false} assume !(~i~0 < 100000); {1200#false} is VALID [2018-11-23 11:54:54,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {1200#false} havoc ~x~0;~x~0 := 0; {1200#false} is VALID [2018-11-23 11:54:54,733 INFO L273 TraceCheckUtils]: 20: Hoare triple {1200#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1200#false} is VALID [2018-11-23 11:54:54,733 INFO L256 TraceCheckUtils]: 21: Hoare triple {1200#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1200#false} is VALID [2018-11-23 11:54:54,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {1200#false} ~cond := #in~cond; {1200#false} is VALID [2018-11-23 11:54:54,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {1200#false} assume 0 == ~cond; {1200#false} is VALID [2018-11-23 11:54:54,734 INFO L273 TraceCheckUtils]: 24: Hoare triple {1200#false} assume !false; {1200#false} is VALID [2018-11-23 11:54:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 11:54:54,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:54,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:54:54,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-23 11:54:54,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:54,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:54:54,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:54,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:54:54,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:54:54,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:54:54,784 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-11-23 11:54:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,054 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-23 11:54:55,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:54:55,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-23 11:54:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:54:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2018-11-23 11:54:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:54:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2018-11-23 11:54:55,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2018-11-23 11:54:55,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:55,117 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:54:55,118 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:54:55,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:54:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:54:55,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 11:54:55,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:55,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 11:54:55,221 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 11:54:55,222 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 11:54:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,224 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 11:54:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 11:54:55,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:55,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:55,224 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 11:54:55,224 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 11:54:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,226 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 11:54:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 11:54:55,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:55,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:55,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:55,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:54:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 11:54:55,229 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2018-11-23 11:54:55,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:55,229 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 11:54:55,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:54:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 11:54:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:54:55,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:55,231 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:55,231 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:55,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash 598811622, now seen corresponding path program 6 times [2018-11-23 11:54:55,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:55,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:55,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:55,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:55,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:55,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {1479#true} call ULTIMATE.init(); {1479#true} is VALID [2018-11-23 11:54:55,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {1479#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1479#true} is VALID [2018-11-23 11:54:55,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {1479#true} assume true; {1479#true} is VALID [2018-11-23 11:54:55,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1479#true} {1479#true} #61#return; {1479#true} is VALID [2018-11-23 11:54:55,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {1479#true} call #t~ret2 := main(); {1479#true} is VALID [2018-11-23 11:54:55,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {1479#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1481#(= main_~i~0 0)} is VALID [2018-11-23 11:54:55,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {1481#(= 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; {1482#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:55,400 INFO L273 TraceCheckUtils]: 7: Hoare triple {1482#(<= 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; {1483#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:55,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {1483#(<= 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; {1484#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:55,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {1484#(<= 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; {1485#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:55,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {1485#(<= 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; {1486#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:55,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {1486#(<= 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; {1487#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:55,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {1487#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1480#false} is VALID [2018-11-23 11:54:55,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {1480#false} ~i~0 := 0; {1480#false} is VALID [2018-11-23 11:54:55,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 11:54:55,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 11:54:55,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 11:54:55,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 11:54:55,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 11:54:55,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 11:54:55,409 INFO L273 TraceCheckUtils]: 20: Hoare triple {1480#false} assume !(~i~0 < 100000); {1480#false} is VALID [2018-11-23 11:54:55,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {1480#false} havoc ~x~0;~x~0 := 0; {1480#false} is VALID [2018-11-23 11:54:55,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {1480#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1480#false} is VALID [2018-11-23 11:54:55,409 INFO L256 TraceCheckUtils]: 23: Hoare triple {1480#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1480#false} is VALID [2018-11-23 11:54:55,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {1480#false} ~cond := #in~cond; {1480#false} is VALID [2018-11-23 11:54:55,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {1480#false} assume 0 == ~cond; {1480#false} is VALID [2018-11-23 11:54:55,410 INFO L273 TraceCheckUtils]: 26: Hoare triple {1480#false} assume !false; {1480#false} is VALID [2018-11-23 11:54:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 11:54:55,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:55,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:55,420 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:55,504 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 11:54:55,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:55,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:55,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {1479#true} call ULTIMATE.init(); {1479#true} is VALID [2018-11-23 11:54:55,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {1479#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1479#true} is VALID [2018-11-23 11:54:55,742 INFO L273 TraceCheckUtils]: 2: Hoare triple {1479#true} assume true; {1479#true} is VALID [2018-11-23 11:54:55,742 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1479#true} {1479#true} #61#return; {1479#true} is VALID [2018-11-23 11:54:55,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {1479#true} call #t~ret2 := main(); {1479#true} is VALID [2018-11-23 11:54:55,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {1479#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1506#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:55,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {1506#(<= 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; {1482#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:55,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {1482#(<= 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; {1483#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:55,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {1483#(<= 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; {1484#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:55,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {1484#(<= 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; {1485#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:55,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {1485#(<= 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; {1486#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:55,748 INFO L273 TraceCheckUtils]: 11: Hoare triple {1486#(<= 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; {1487#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:55,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {1487#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1480#false} is VALID [2018-11-23 11:54:55,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {1480#false} ~i~0 := 0; {1480#false} is VALID [2018-11-23 11:54:55,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 11:54:55,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 11:54:55,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 11:54:55,751 INFO L273 TraceCheckUtils]: 17: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 11:54:55,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 11:54:55,751 INFO L273 TraceCheckUtils]: 19: Hoare triple {1480#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1480#false} is VALID [2018-11-23 11:54:55,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {1480#false} assume !(~i~0 < 100000); {1480#false} is VALID [2018-11-23 11:54:55,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {1480#false} havoc ~x~0;~x~0 := 0; {1480#false} is VALID [2018-11-23 11:54:55,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {1480#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1480#false} is VALID [2018-11-23 11:54:55,753 INFO L256 TraceCheckUtils]: 23: Hoare triple {1480#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1480#false} is VALID [2018-11-23 11:54:55,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {1480#false} ~cond := #in~cond; {1480#false} is VALID [2018-11-23 11:54:55,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {1480#false} assume 0 == ~cond; {1480#false} is VALID [2018-11-23 11:54:55,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {1480#false} assume !false; {1480#false} is VALID [2018-11-23 11:54:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 11:54:55,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:55,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:54:55,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-23 11:54:55,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:55,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:54:55,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:55,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:54:55,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:54:55,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:54:55,820 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 10 states. [2018-11-23 11:54:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,157 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-23 11:54:56,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:54:56,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-23 11:54:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:54:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-11-23 11:54:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:54:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-11-23 11:54:56,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 52 transitions. [2018-11-23 11:54:56,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:56,219 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:54:56,219 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:54:56,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:54:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:54:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 11:54:56,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:56,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 11:54:56,255 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:54:56,255 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:54:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,257 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 11:54:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 11:54:56,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:56,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:56,258 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:54:56,259 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:54:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,260 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 11:54:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 11:54:56,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:56,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:56,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:56,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:54:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 11:54:56,263 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2018-11-23 11:54:56,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:56,264 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 11:54:56,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:54:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 11:54:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:54:56,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:56,265 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:56,265 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:56,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:56,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1765864315, now seen corresponding path program 7 times [2018-11-23 11:54:56,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:56,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:56,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:56,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:56,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:56,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {1780#true} call ULTIMATE.init(); {1780#true} is VALID [2018-11-23 11:54:56,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {1780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1780#true} is VALID [2018-11-23 11:54:56,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-23 11:54:56,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1780#true} {1780#true} #61#return; {1780#true} is VALID [2018-11-23 11:54:56,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {1780#true} call #t~ret2 := main(); {1780#true} is VALID [2018-11-23 11:54:56,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {1780#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1782#(= main_~i~0 0)} is VALID [2018-11-23 11:54:56,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {1782#(= 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; {1783#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:56,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {1783#(<= 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; {1784#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:56,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {1784#(<= 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; {1785#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:56,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {1785#(<= 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; {1786#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:56,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {1786#(<= 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; {1787#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:56,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {1787#(<= 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; {1788#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:56,487 INFO L273 TraceCheckUtils]: 12: Hoare triple {1788#(<= 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; {1789#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:56,488 INFO L273 TraceCheckUtils]: 13: Hoare triple {1789#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1781#false} is VALID [2018-11-23 11:54:56,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {1781#false} ~i~0 := 0; {1781#false} is VALID [2018-11-23 11:54:56,488 INFO L273 TraceCheckUtils]: 15: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:56,489 INFO L273 TraceCheckUtils]: 16: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:56,489 INFO L273 TraceCheckUtils]: 17: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:56,490 INFO L273 TraceCheckUtils]: 18: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:56,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:56,490 INFO L273 TraceCheckUtils]: 20: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:56,491 INFO L273 TraceCheckUtils]: 21: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:56,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {1781#false} assume !(~i~0 < 100000); {1781#false} is VALID [2018-11-23 11:54:56,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {1781#false} havoc ~x~0;~x~0 := 0; {1781#false} is VALID [2018-11-23 11:54:56,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {1781#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1781#false} is VALID [2018-11-23 11:54:56,492 INFO L256 TraceCheckUtils]: 25: Hoare triple {1781#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1781#false} is VALID [2018-11-23 11:54:56,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2018-11-23 11:54:56,492 INFO L273 TraceCheckUtils]: 27: Hoare triple {1781#false} assume 0 == ~cond; {1781#false} is VALID [2018-11-23 11:54:56,492 INFO L273 TraceCheckUtils]: 28: Hoare triple {1781#false} assume !false; {1781#false} is VALID [2018-11-23 11:54:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 11:54:56,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:56,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:56,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:56,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:57,159 INFO L256 TraceCheckUtils]: 0: Hoare triple {1780#true} call ULTIMATE.init(); {1780#true} is VALID [2018-11-23 11:54:57,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {1780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1780#true} is VALID [2018-11-23 11:54:57,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-23 11:54:57,160 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1780#true} {1780#true} #61#return; {1780#true} is VALID [2018-11-23 11:54:57,160 INFO L256 TraceCheckUtils]: 4: Hoare triple {1780#true} call #t~ret2 := main(); {1780#true} is VALID [2018-11-23 11:54:57,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {1780#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1808#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:57,161 INFO L273 TraceCheckUtils]: 6: Hoare triple {1808#(<= 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; {1783#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:57,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {1783#(<= 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; {1784#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:57,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {1784#(<= 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; {1785#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:57,165 INFO L273 TraceCheckUtils]: 9: Hoare triple {1785#(<= 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; {1786#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:57,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {1786#(<= 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; {1787#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:57,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {1787#(<= 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; {1788#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:57,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {1788#(<= 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; {1789#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:57,169 INFO L273 TraceCheckUtils]: 13: Hoare triple {1789#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1781#false} is VALID [2018-11-23 11:54:57,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {1781#false} ~i~0 := 0; {1781#false} is VALID [2018-11-23 11:54:57,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:57,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:57,170 INFO L273 TraceCheckUtils]: 17: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:57,170 INFO L273 TraceCheckUtils]: 18: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:57,170 INFO L273 TraceCheckUtils]: 19: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:57,171 INFO L273 TraceCheckUtils]: 20: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:57,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {1781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1781#false} is VALID [2018-11-23 11:54:57,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {1781#false} assume !(~i~0 < 100000); {1781#false} is VALID [2018-11-23 11:54:57,171 INFO L273 TraceCheckUtils]: 23: Hoare triple {1781#false} havoc ~x~0;~x~0 := 0; {1781#false} is VALID [2018-11-23 11:54:57,176 INFO L273 TraceCheckUtils]: 24: Hoare triple {1781#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1781#false} is VALID [2018-11-23 11:54:57,176 INFO L256 TraceCheckUtils]: 25: Hoare triple {1781#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1781#false} is VALID [2018-11-23 11:54:57,176 INFO L273 TraceCheckUtils]: 26: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2018-11-23 11:54:57,177 INFO L273 TraceCheckUtils]: 27: Hoare triple {1781#false} assume 0 == ~cond; {1781#false} is VALID [2018-11-23 11:54:57,177 INFO L273 TraceCheckUtils]: 28: Hoare triple {1781#false} assume !false; {1781#false} is VALID [2018-11-23 11:54:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 11:54:57,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:57,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:54:57,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-23 11:54:57,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:57,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:54:57,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:57,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:54:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:54:57,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:54:57,363 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 11 states. [2018-11-23 11:54:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:57,785 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-23 11:54:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:54:57,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-23 11:54:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:54:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2018-11-23 11:54:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:54:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2018-11-23 11:54:57,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2018-11-23 11:54:58,074 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-23 11:54:58,075 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:54:58,075 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:54:58,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 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-23 11:54:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:54:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 11:54:58,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:58,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 11:54:58,115 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:54:58,116 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:54:58,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,117 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 11:54:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 11:54:58,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:58,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:58,118 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:54:58,118 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:54:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,120 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 11:54:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 11:54:58,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:58,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:58,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:58,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:54:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 11:54:58,122 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2018-11-23 11:54:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:58,122 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 11:54:58,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:54:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 11:54:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:54:58,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:58,123 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:58,123 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:58,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash 97206342, now seen corresponding path program 8 times [2018-11-23 11:54:58,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:58,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:58,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:58,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:58,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {2102#true} call ULTIMATE.init(); {2102#true} is VALID [2018-11-23 11:54:58,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {2102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2102#true} is VALID [2018-11-23 11:54:58,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {2102#true} assume true; {2102#true} is VALID [2018-11-23 11:54:58,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} #61#return; {2102#true} is VALID [2018-11-23 11:54:58,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {2102#true} call #t~ret2 := main(); {2102#true} is VALID [2018-11-23 11:54:58,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {2102#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2104#(= main_~i~0 0)} is VALID [2018-11-23 11:54:58,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {2104#(= 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; {2105#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:58,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {2105#(<= 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; {2106#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:58,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {2106#(<= 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; {2107#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:58,438 INFO L273 TraceCheckUtils]: 9: Hoare triple {2107#(<= 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; {2108#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:58,439 INFO L273 TraceCheckUtils]: 10: Hoare triple {2108#(<= 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; {2109#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:58,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {2109#(<= 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; {2110#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:58,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {2110#(<= 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; {2111#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:58,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {2111#(<= 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; {2112#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:58,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {2112#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2103#false} is VALID [2018-11-23 11:54:58,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {2103#false} ~i~0 := 0; {2103#false} is VALID [2018-11-23 11:54:58,443 INFO L273 TraceCheckUtils]: 16: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,444 INFO L273 TraceCheckUtils]: 18: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,444 INFO L273 TraceCheckUtils]: 19: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,444 INFO L273 TraceCheckUtils]: 20: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {2103#false} assume !(~i~0 < 100000); {2103#false} is VALID [2018-11-23 11:54:58,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {2103#false} havoc ~x~0;~x~0 := 0; {2103#false} is VALID [2018-11-23 11:54:58,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {2103#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2103#false} is VALID [2018-11-23 11:54:58,446 INFO L256 TraceCheckUtils]: 27: Hoare triple {2103#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2103#false} is VALID [2018-11-23 11:54:58,446 INFO L273 TraceCheckUtils]: 28: Hoare triple {2103#false} ~cond := #in~cond; {2103#false} is VALID [2018-11-23 11:54:58,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {2103#false} assume 0 == ~cond; {2103#false} is VALID [2018-11-23 11:54:58,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {2103#false} assume !false; {2103#false} is VALID [2018-11-23 11:54:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:54:58,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:58,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:58,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:58,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:58,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:58,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {2102#true} call ULTIMATE.init(); {2102#true} is VALID [2018-11-23 11:54:58,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {2102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2102#true} is VALID [2018-11-23 11:54:58,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {2102#true} assume true; {2102#true} is VALID [2018-11-23 11:54:58,699 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} #61#return; {2102#true} is VALID [2018-11-23 11:54:58,700 INFO L256 TraceCheckUtils]: 4: Hoare triple {2102#true} call #t~ret2 := main(); {2102#true} is VALID [2018-11-23 11:54:58,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {2102#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2131#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:58,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {2131#(<= 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; {2105#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:58,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {2105#(<= 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; {2106#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:58,740 INFO L273 TraceCheckUtils]: 8: Hoare triple {2106#(<= 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; {2107#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:58,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {2107#(<= 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; {2108#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:58,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {2108#(<= 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; {2109#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:58,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {2109#(<= 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; {2110#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:58,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {2110#(<= 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; {2111#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:58,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {2111#(<= 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; {2112#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:58,768 INFO L273 TraceCheckUtils]: 14: Hoare triple {2112#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2103#false} is VALID [2018-11-23 11:54:58,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {2103#false} ~i~0 := 0; {2103#false} is VALID [2018-11-23 11:54:58,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,768 INFO L273 TraceCheckUtils]: 18: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,769 INFO L273 TraceCheckUtils]: 19: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {2103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2103#false} is VALID [2018-11-23 11:54:58,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {2103#false} assume !(~i~0 < 100000); {2103#false} is VALID [2018-11-23 11:54:58,769 INFO L273 TraceCheckUtils]: 25: Hoare triple {2103#false} havoc ~x~0;~x~0 := 0; {2103#false} is VALID [2018-11-23 11:54:58,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {2103#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2103#false} is VALID [2018-11-23 11:54:58,770 INFO L256 TraceCheckUtils]: 27: Hoare triple {2103#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2103#false} is VALID [2018-11-23 11:54:58,770 INFO L273 TraceCheckUtils]: 28: Hoare triple {2103#false} ~cond := #in~cond; {2103#false} is VALID [2018-11-23 11:54:58,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {2103#false} assume 0 == ~cond; {2103#false} is VALID [2018-11-23 11:54:58,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {2103#false} assume !false; {2103#false} is VALID [2018-11-23 11:54:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:54:58,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:58,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:54:58,791 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 11:54:58,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:58,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:54:58,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:58,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:54:58,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:54:58,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:54:58,815 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 12 states. [2018-11-23 11:54:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,972 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-11-23 11:54:58,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:54:58,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 11:54:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:54:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2018-11-23 11:54:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:54:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2018-11-23 11:54:58,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2018-11-23 11:54:59,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:59,064 INFO L225 Difference]: With dead ends: 59 [2018-11-23 11:54:59,064 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 11:54:59,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:54:59,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 11:54:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 11:54:59,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:59,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 11:54:59,136 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 11:54:59,136 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 11:54:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,138 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 11:54:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 11:54:59,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:59,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:59,138 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 11:54:59,139 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 11:54:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,140 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 11:54:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 11:54:59,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:59,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:59,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:59,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:54:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 11:54:59,142 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2018-11-23 11:54:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:59,143 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 11:54:59,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:54:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 11:54:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:54:59,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:59,144 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:59,144 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:59,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:59,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1434610981, now seen corresponding path program 9 times [2018-11-23 11:54:59,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:59,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:59,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:59,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:59,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:59,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2018-11-23 11:54:59,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {2445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2445#true} is VALID [2018-11-23 11:54:59,332 INFO L273 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2018-11-23 11:54:59,332 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #61#return; {2445#true} is VALID [2018-11-23 11:54:59,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret2 := main(); {2445#true} is VALID [2018-11-23 11:54:59,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {2445#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2447#(= main_~i~0 0)} is VALID [2018-11-23 11:54:59,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {2447#(= 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; {2448#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:59,335 INFO L273 TraceCheckUtils]: 7: Hoare triple {2448#(<= 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; {2449#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:59,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {2449#(<= 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; {2450#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:59,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {2450#(<= 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; {2451#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:59,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {2451#(<= 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; {2452#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:59,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {2452#(<= 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; {2453#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:59,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {2453#(<= 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; {2454#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:59,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {2454#(<= 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; {2455#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:59,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {2455#(<= 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; {2456#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:59,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {2456#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2446#false} is VALID [2018-11-23 11:54:59,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {2446#false} ~i~0 := 0; {2446#false} is VALID [2018-11-23 11:54:59,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 11:54:59,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 11:54:59,348 INFO L273 TraceCheckUtils]: 19: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 11:54:59,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 11:54:59,348 INFO L273 TraceCheckUtils]: 21: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 11:54:59,349 INFO L273 TraceCheckUtils]: 22: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 11:54:59,349 INFO L273 TraceCheckUtils]: 23: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 11:54:59,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 11:54:59,349 INFO L273 TraceCheckUtils]: 25: Hoare triple {2446#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2446#false} is VALID [2018-11-23 11:54:59,349 INFO L273 TraceCheckUtils]: 26: Hoare triple {2446#false} assume !(~i~0 < 100000); {2446#false} is VALID [2018-11-23 11:54:59,349 INFO L273 TraceCheckUtils]: 27: Hoare triple {2446#false} havoc ~x~0;~x~0 := 0; {2446#false} is VALID [2018-11-23 11:54:59,349 INFO L273 TraceCheckUtils]: 28: Hoare triple {2446#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2446#false} is VALID [2018-11-23 11:54:59,350 INFO L256 TraceCheckUtils]: 29: Hoare triple {2446#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2446#false} is VALID [2018-11-23 11:54:59,350 INFO L273 TraceCheckUtils]: 30: Hoare triple {2446#false} ~cond := #in~cond; {2446#false} is VALID [2018-11-23 11:54:59,350 INFO L273 TraceCheckUtils]: 31: Hoare triple {2446#false} assume 0 == ~cond; {2446#false} is VALID [2018-11-23 11:54:59,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2018-11-23 11:54:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 11:54:59,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:59,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:59,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:59,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:54:59,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:59,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:59,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2018-11-23 11:54:59,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {2445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2445#true} is VALID [2018-11-23 11:54:59,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2018-11-23 11:54:59,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #61#return; {2445#true} is VALID [2018-11-23 11:54:59,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret2 := main(); {2445#true} is VALID [2018-11-23 11:54:59,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {2445#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2445#true} is VALID [2018-11-23 11:54:59,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 11:54:59,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 11:54:59,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 11:54:59,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 11:54:59,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 11:54:59,862 INFO L273 TraceCheckUtils]: 11: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 11:54:59,862 INFO L273 TraceCheckUtils]: 12: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 11:54:59,863 INFO L273 TraceCheckUtils]: 13: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2445#true} is VALID [2018-11-23 11:54:59,868 INFO L273 TraceCheckUtils]: 14: Hoare triple {2445#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2502#(<= main_~i~0 100000)} is VALID [2018-11-23 11:54:59,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {2502#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {2445#true} is VALID [2018-11-23 11:54:59,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {2445#true} ~i~0 := 0; {2509#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:59,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {2509#(<= 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; {2448#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:59,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {2448#(<= 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; {2449#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:59,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {2449#(<= 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; {2450#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:59,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {2450#(<= 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; {2451#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:59,876 INFO L273 TraceCheckUtils]: 21: Hoare triple {2451#(<= 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; {2452#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:59,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {2452#(<= 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; {2453#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:59,878 INFO L273 TraceCheckUtils]: 23: Hoare triple {2453#(<= 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; {2454#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:59,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {2454#(<= 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; {2455#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:59,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {2455#(<= 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; {2456#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:59,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {2456#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2446#false} is VALID [2018-11-23 11:54:59,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {2446#false} havoc ~x~0;~x~0 := 0; {2446#false} is VALID [2018-11-23 11:54:59,881 INFO L273 TraceCheckUtils]: 28: Hoare triple {2446#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2446#false} is VALID [2018-11-23 11:54:59,881 INFO L256 TraceCheckUtils]: 29: Hoare triple {2446#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2446#false} is VALID [2018-11-23 11:54:59,881 INFO L273 TraceCheckUtils]: 30: Hoare triple {2446#false} ~cond := #in~cond; {2446#false} is VALID [2018-11-23 11:54:59,881 INFO L273 TraceCheckUtils]: 31: Hoare triple {2446#false} assume 0 == ~cond; {2446#false} is VALID [2018-11-23 11:54:59,881 INFO L273 TraceCheckUtils]: 32: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2018-11-23 11:54:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:54:59,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:59,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2018-11-23 11:54:59,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 11:54:59,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:59,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:54:59,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:59,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:54:59,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:54:59,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:54:59,955 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 14 states. [2018-11-23 11:55:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,242 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-23 11:55:00,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:55:00,242 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 11:55:00,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2018-11-23 11:55:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2018-11-23 11:55:00,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2018-11-23 11:55:00,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:00,300 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:55:00,300 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:55:00,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:55:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 11:55:00,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:00,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:00,325 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:00,325 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,326 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 11:55:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 11:55:00,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:00,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:00,327 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:00,327 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,328 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 11:55:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 11:55:00,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:00,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:00,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:00,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:55:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-23 11:55:00,329 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2018-11-23 11:55:00,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:00,329 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-23 11:55:00,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:55:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 11:55:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:55:00,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:00,330 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:00,330 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:00,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:00,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2119541926, now seen corresponding path program 10 times [2018-11-23 11:55:00,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:00,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:00,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:00,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:00,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:00,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {2810#true} call ULTIMATE.init(); {2810#true} is VALID [2018-11-23 11:55:00,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {2810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2810#true} is VALID [2018-11-23 11:55:00,695 INFO L273 TraceCheckUtils]: 2: Hoare triple {2810#true} assume true; {2810#true} is VALID [2018-11-23 11:55:00,695 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2810#true} {2810#true} #61#return; {2810#true} is VALID [2018-11-23 11:55:00,695 INFO L256 TraceCheckUtils]: 4: Hoare triple {2810#true} call #t~ret2 := main(); {2810#true} is VALID [2018-11-23 11:55:00,696 INFO L273 TraceCheckUtils]: 5: Hoare triple {2810#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2812#(= main_~i~0 0)} is VALID [2018-11-23 11:55:00,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {2812#(= 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; {2813#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:00,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {2813#(<= 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; {2814#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:00,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {2814#(<= 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; {2815#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:00,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {2815#(<= 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; {2816#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:00,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {2816#(<= 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; {2817#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:00,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {2817#(<= 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; {2818#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:00,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {2818#(<= 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; {2819#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:00,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {2819#(<= 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; {2820#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:00,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {2820#(<= 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; {2821#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:00,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {2821#(<= 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; {2822#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:00,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {2822#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2811#false} is VALID [2018-11-23 11:55:00,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {2811#false} ~i~0 := 0; {2811#false} is VALID [2018-11-23 11:55:00,708 INFO L273 TraceCheckUtils]: 18: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,709 INFO L273 TraceCheckUtils]: 20: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,709 INFO L273 TraceCheckUtils]: 21: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,710 INFO L273 TraceCheckUtils]: 22: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,710 INFO L273 TraceCheckUtils]: 23: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,710 INFO L273 TraceCheckUtils]: 24: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,711 INFO L273 TraceCheckUtils]: 26: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,711 INFO L273 TraceCheckUtils]: 27: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {2811#false} assume !(~i~0 < 100000); {2811#false} is VALID [2018-11-23 11:55:00,712 INFO L273 TraceCheckUtils]: 29: Hoare triple {2811#false} havoc ~x~0;~x~0 := 0; {2811#false} is VALID [2018-11-23 11:55:00,712 INFO L273 TraceCheckUtils]: 30: Hoare triple {2811#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2811#false} is VALID [2018-11-23 11:55:00,712 INFO L256 TraceCheckUtils]: 31: Hoare triple {2811#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2811#false} is VALID [2018-11-23 11:55:00,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {2811#false} ~cond := #in~cond; {2811#false} is VALID [2018-11-23 11:55:00,713 INFO L273 TraceCheckUtils]: 33: Hoare triple {2811#false} assume 0 == ~cond; {2811#false} is VALID [2018-11-23 11:55:00,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {2811#false} assume !false; {2811#false} is VALID [2018-11-23 11:55:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 11:55:00,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:00,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:00,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:00,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:00,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:00,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:00,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {2810#true} call ULTIMATE.init(); {2810#true} is VALID [2018-11-23 11:55:00,891 INFO L273 TraceCheckUtils]: 1: Hoare triple {2810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2810#true} is VALID [2018-11-23 11:55:00,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {2810#true} assume true; {2810#true} is VALID [2018-11-23 11:55:00,892 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2810#true} {2810#true} #61#return; {2810#true} is VALID [2018-11-23 11:55:00,892 INFO L256 TraceCheckUtils]: 4: Hoare triple {2810#true} call #t~ret2 := main(); {2810#true} is VALID [2018-11-23 11:55:00,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {2810#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2841#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:00,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {2841#(<= 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; {2813#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:00,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {2813#(<= 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; {2814#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:00,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {2814#(<= 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; {2815#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:00,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {2815#(<= 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; {2816#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:00,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {2816#(<= 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; {2817#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:00,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {2817#(<= 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; {2818#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:00,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {2818#(<= 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; {2819#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:00,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {2819#(<= 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; {2820#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:00,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {2820#(<= 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; {2821#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:00,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {2821#(<= 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; {2822#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:00,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {2822#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2811#false} is VALID [2018-11-23 11:55:00,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {2811#false} ~i~0 := 0; {2811#false} is VALID [2018-11-23 11:55:00,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,903 INFO L273 TraceCheckUtils]: 20: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,903 INFO L273 TraceCheckUtils]: 21: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,903 INFO L273 TraceCheckUtils]: 22: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,904 INFO L273 TraceCheckUtils]: 23: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,904 INFO L273 TraceCheckUtils]: 25: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,904 INFO L273 TraceCheckUtils]: 26: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,904 INFO L273 TraceCheckUtils]: 27: Hoare triple {2811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2811#false} is VALID [2018-11-23 11:55:00,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {2811#false} assume !(~i~0 < 100000); {2811#false} is VALID [2018-11-23 11:55:00,905 INFO L273 TraceCheckUtils]: 29: Hoare triple {2811#false} havoc ~x~0;~x~0 := 0; {2811#false} is VALID [2018-11-23 11:55:00,905 INFO L273 TraceCheckUtils]: 30: Hoare triple {2811#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2811#false} is VALID [2018-11-23 11:55:00,905 INFO L256 TraceCheckUtils]: 31: Hoare triple {2811#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2811#false} is VALID [2018-11-23 11:55:00,905 INFO L273 TraceCheckUtils]: 32: Hoare triple {2811#false} ~cond := #in~cond; {2811#false} is VALID [2018-11-23 11:55:00,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {2811#false} assume 0 == ~cond; {2811#false} is VALID [2018-11-23 11:55:00,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {2811#false} assume !false; {2811#false} is VALID [2018-11-23 11:55:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 11:55:00,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:00,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:55:00,926 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-23 11:55:00,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:00,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:55:00,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:00,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:55:00,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:55:00,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:00,949 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 14 states. [2018-11-23 11:55:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,173 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-11-23 11:55:01,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:55:01,173 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-23 11:55:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2018-11-23 11:55:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2018-11-23 11:55:01,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2018-11-23 11:55:01,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:01,293 INFO L225 Difference]: With dead ends: 65 [2018-11-23 11:55:01,293 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:55:01,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:55:01,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 11:55:01,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:01,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 11:55:01,318 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 11:55:01,318 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 11:55:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,320 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 11:55:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 11:55:01,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:01,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:01,321 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 11:55:01,321 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 11:55:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,322 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 11:55:01,322 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 11:55:01,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:01,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:01,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:01,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:55:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 11:55:01,324 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 35 [2018-11-23 11:55:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:01,324 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 11:55:01,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:55:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 11:55:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:55:01,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:01,325 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:01,325 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:01,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:01,325 INFO L82 PathProgramCache]: Analyzing trace with hash 461243845, now seen corresponding path program 11 times [2018-11-23 11:55:01,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:01,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:01,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:01,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:01,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:01,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {3195#true} call ULTIMATE.init(); {3195#true} is VALID [2018-11-23 11:55:01,614 INFO L273 TraceCheckUtils]: 1: Hoare triple {3195#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3195#true} is VALID [2018-11-23 11:55:01,614 INFO L273 TraceCheckUtils]: 2: Hoare triple {3195#true} assume true; {3195#true} is VALID [2018-11-23 11:55:01,614 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3195#true} {3195#true} #61#return; {3195#true} is VALID [2018-11-23 11:55:01,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {3195#true} call #t~ret2 := main(); {3195#true} is VALID [2018-11-23 11:55:01,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {3195#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3197#(= main_~i~0 0)} is VALID [2018-11-23 11:55:01,616 INFO L273 TraceCheckUtils]: 6: Hoare triple {3197#(= 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; {3198#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:01,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {3198#(<= 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; {3199#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:01,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {3199#(<= 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; {3200#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:01,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {3200#(<= 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; {3201#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:01,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {3201#(<= 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; {3202#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:01,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {3202#(<= 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; {3203#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:01,619 INFO L273 TraceCheckUtils]: 12: Hoare triple {3203#(<= 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; {3204#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:01,620 INFO L273 TraceCheckUtils]: 13: Hoare triple {3204#(<= 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; {3205#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:01,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {3205#(<= 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; {3206#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:01,622 INFO L273 TraceCheckUtils]: 15: Hoare triple {3206#(<= 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; {3207#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:01,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {3207#(<= 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; {3208#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:01,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {3208#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3196#false} is VALID [2018-11-23 11:55:01,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {3196#false} ~i~0 := 0; {3196#false} is VALID [2018-11-23 11:55:01,624 INFO L273 TraceCheckUtils]: 19: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:01,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:01,625 INFO L273 TraceCheckUtils]: 21: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:01,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:01,625 INFO L273 TraceCheckUtils]: 23: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:01,625 INFO L273 TraceCheckUtils]: 24: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:01,625 INFO L273 TraceCheckUtils]: 25: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:01,626 INFO L273 TraceCheckUtils]: 26: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:01,626 INFO L273 TraceCheckUtils]: 27: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:01,626 INFO L273 TraceCheckUtils]: 28: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:01,626 INFO L273 TraceCheckUtils]: 29: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:01,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {3196#false} assume !(~i~0 < 100000); {3196#false} is VALID [2018-11-23 11:55:01,627 INFO L273 TraceCheckUtils]: 31: Hoare triple {3196#false} havoc ~x~0;~x~0 := 0; {3196#false} is VALID [2018-11-23 11:55:01,627 INFO L273 TraceCheckUtils]: 32: Hoare triple {3196#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3196#false} is VALID [2018-11-23 11:55:01,627 INFO L256 TraceCheckUtils]: 33: Hoare triple {3196#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3196#false} is VALID [2018-11-23 11:55:01,627 INFO L273 TraceCheckUtils]: 34: Hoare triple {3196#false} ~cond := #in~cond; {3196#false} is VALID [2018-11-23 11:55:01,627 INFO L273 TraceCheckUtils]: 35: Hoare triple {3196#false} assume 0 == ~cond; {3196#false} is VALID [2018-11-23 11:55:01,627 INFO L273 TraceCheckUtils]: 36: Hoare triple {3196#false} assume !false; {3196#false} is VALID [2018-11-23 11:55:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 11:55:01,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:01,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:01,638 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:01,958 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 11:55:01,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:01,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:02,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {3195#true} call ULTIMATE.init(); {3195#true} is VALID [2018-11-23 11:55:02,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {3195#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3195#true} is VALID [2018-11-23 11:55:02,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {3195#true} assume true; {3195#true} is VALID [2018-11-23 11:55:02,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3195#true} {3195#true} #61#return; {3195#true} is VALID [2018-11-23 11:55:02,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {3195#true} call #t~ret2 := main(); {3195#true} is VALID [2018-11-23 11:55:02,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {3195#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3227#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:02,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {3227#(<= 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; {3198#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:02,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {3198#(<= 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; {3199#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:02,089 INFO L273 TraceCheckUtils]: 8: Hoare triple {3199#(<= 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; {3200#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:02,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {3200#(<= 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; {3201#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:02,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {3201#(<= 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; {3202#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:02,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {3202#(<= 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; {3203#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:02,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {3203#(<= 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; {3204#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:02,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {3204#(<= 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; {3205#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:02,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {3205#(<= 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; {3206#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:02,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {3206#(<= 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; {3207#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:02,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {3207#(<= 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; {3208#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:02,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {3208#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3196#false} is VALID [2018-11-23 11:55:02,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {3196#false} ~i~0 := 0; {3196#false} is VALID [2018-11-23 11:55:02,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:02,113 INFO L273 TraceCheckUtils]: 20: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:02,113 INFO L273 TraceCheckUtils]: 21: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:02,113 INFO L273 TraceCheckUtils]: 22: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:02,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:02,113 INFO L273 TraceCheckUtils]: 24: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:02,113 INFO L273 TraceCheckUtils]: 25: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:02,113 INFO L273 TraceCheckUtils]: 26: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:02,114 INFO L273 TraceCheckUtils]: 27: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:02,114 INFO L273 TraceCheckUtils]: 28: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:02,114 INFO L273 TraceCheckUtils]: 29: Hoare triple {3196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#false} is VALID [2018-11-23 11:55:02,114 INFO L273 TraceCheckUtils]: 30: Hoare triple {3196#false} assume !(~i~0 < 100000); {3196#false} is VALID [2018-11-23 11:55:02,114 INFO L273 TraceCheckUtils]: 31: Hoare triple {3196#false} havoc ~x~0;~x~0 := 0; {3196#false} is VALID [2018-11-23 11:55:02,114 INFO L273 TraceCheckUtils]: 32: Hoare triple {3196#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3196#false} is VALID [2018-11-23 11:55:02,114 INFO L256 TraceCheckUtils]: 33: Hoare triple {3196#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3196#false} is VALID [2018-11-23 11:55:02,115 INFO L273 TraceCheckUtils]: 34: Hoare triple {3196#false} ~cond := #in~cond; {3196#false} is VALID [2018-11-23 11:55:02,115 INFO L273 TraceCheckUtils]: 35: Hoare triple {3196#false} assume 0 == ~cond; {3196#false} is VALID [2018-11-23 11:55:02,115 INFO L273 TraceCheckUtils]: 36: Hoare triple {3196#false} assume !false; {3196#false} is VALID [2018-11-23 11:55:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 11:55:02,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:02,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:55:02,137 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-23 11:55:02,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:02,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:55:02,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:02,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:55:02,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:55:02,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:55:02,178 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 15 states. [2018-11-23 11:55:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,622 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-11-23 11:55:02,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:55:02,622 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-23 11:55:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2018-11-23 11:55:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2018-11-23 11:55:02,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 62 transitions. [2018-11-23 11:55:02,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:02,714 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:55:02,714 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:55:02,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 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-23 11:55:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:55:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 11:55:02,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:02,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:02,754 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:02,754 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,756 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 11:55:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 11:55:02,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:02,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:02,757 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:02,757 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:02,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,758 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 11:55:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 11:55:02,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:02,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:02,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:02,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:55:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-23 11:55:02,760 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 37 [2018-11-23 11:55:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:02,761 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-23 11:55:02,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:55:02,761 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 11:55:02,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:55:02,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:02,761 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:02,762 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:02,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:02,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1013862662, now seen corresponding path program 12 times [2018-11-23 11:55:02,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:02,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:02,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:03,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {3601#true} call ULTIMATE.init(); {3601#true} is VALID [2018-11-23 11:55:03,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {3601#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3601#true} is VALID [2018-11-23 11:55:03,528 INFO L273 TraceCheckUtils]: 2: Hoare triple {3601#true} assume true; {3601#true} is VALID [2018-11-23 11:55:03,528 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3601#true} {3601#true} #61#return; {3601#true} is VALID [2018-11-23 11:55:03,528 INFO L256 TraceCheckUtils]: 4: Hoare triple {3601#true} call #t~ret2 := main(); {3601#true} is VALID [2018-11-23 11:55:03,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {3601#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3603#(= main_~i~0 0)} is VALID [2018-11-23 11:55:03,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {3603#(= 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; {3604#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:03,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {3604#(<= 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; {3605#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:03,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {3605#(<= 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; {3606#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:03,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {3606#(<= 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; {3607#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:03,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {3607#(<= 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; {3608#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:03,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {3608#(<= 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; {3609#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:03,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {3609#(<= 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; {3610#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:03,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {3610#(<= 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; {3611#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:03,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {3611#(<= 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; {3612#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:03,536 INFO L273 TraceCheckUtils]: 15: Hoare triple {3612#(<= 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; {3613#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:03,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {3613#(<= 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; {3614#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:03,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {3614#(<= 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; {3615#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:03,539 INFO L273 TraceCheckUtils]: 18: Hoare triple {3615#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3602#false} is VALID [2018-11-23 11:55:03,540 INFO L273 TraceCheckUtils]: 19: Hoare triple {3602#false} ~i~0 := 0; {3602#false} is VALID [2018-11-23 11:55:03,540 INFO L273 TraceCheckUtils]: 20: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 11:55:03,540 INFO L273 TraceCheckUtils]: 21: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 11:55:03,540 INFO L273 TraceCheckUtils]: 22: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 11:55:03,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 11:55:03,541 INFO L273 TraceCheckUtils]: 24: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 11:55:03,541 INFO L273 TraceCheckUtils]: 25: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 11:55:03,541 INFO L273 TraceCheckUtils]: 26: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 11:55:03,541 INFO L273 TraceCheckUtils]: 27: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 11:55:03,541 INFO L273 TraceCheckUtils]: 28: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 11:55:03,542 INFO L273 TraceCheckUtils]: 29: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 11:55:03,542 INFO L273 TraceCheckUtils]: 30: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 11:55:03,542 INFO L273 TraceCheckUtils]: 31: Hoare triple {3602#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3602#false} is VALID [2018-11-23 11:55:03,542 INFO L273 TraceCheckUtils]: 32: Hoare triple {3602#false} assume !(~i~0 < 100000); {3602#false} is VALID [2018-11-23 11:55:03,542 INFO L273 TraceCheckUtils]: 33: Hoare triple {3602#false} havoc ~x~0;~x~0 := 0; {3602#false} is VALID [2018-11-23 11:55:03,542 INFO L273 TraceCheckUtils]: 34: Hoare triple {3602#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3602#false} is VALID [2018-11-23 11:55:03,543 INFO L256 TraceCheckUtils]: 35: Hoare triple {3602#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3602#false} is VALID [2018-11-23 11:55:03,543 INFO L273 TraceCheckUtils]: 36: Hoare triple {3602#false} ~cond := #in~cond; {3602#false} is VALID [2018-11-23 11:55:03,543 INFO L273 TraceCheckUtils]: 37: Hoare triple {3602#false} assume 0 == ~cond; {3602#false} is VALID [2018-11-23 11:55:03,543 INFO L273 TraceCheckUtils]: 38: Hoare triple {3602#false} assume !false; {3602#false} is VALID [2018-11-23 11:55:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 11:55:03,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:03,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:03,561 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:04,220 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:55:04,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:04,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:04,369 INFO L256 TraceCheckUtils]: 0: Hoare triple {3601#true} call ULTIMATE.init(); {3601#true} is VALID [2018-11-23 11:55:04,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {3601#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3601#true} is VALID [2018-11-23 11:55:04,370 INFO L273 TraceCheckUtils]: 2: Hoare triple {3601#true} assume true; {3601#true} is VALID [2018-11-23 11:55:04,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3601#true} {3601#true} #61#return; {3601#true} is VALID [2018-11-23 11:55:04,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {3601#true} call #t~ret2 := main(); {3601#true} is VALID [2018-11-23 11:55:04,371 INFO L273 TraceCheckUtils]: 5: Hoare triple {3601#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3601#true} is VALID [2018-11-23 11:55:04,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 11:55:04,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 11:55:04,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 11:55:04,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 11:55:04,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 11:55:04,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 11:55:04,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 11:55:04,373 INFO L273 TraceCheckUtils]: 13: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 11:55:04,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 11:55:04,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 11:55:04,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 11:55:04,373 INFO L273 TraceCheckUtils]: 17: Hoare triple {3601#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3601#true} is VALID [2018-11-23 11:55:04,373 INFO L273 TraceCheckUtils]: 18: Hoare triple {3601#true} assume !(~i~0 < 100000); {3601#true} is VALID [2018-11-23 11:55:04,374 INFO L273 TraceCheckUtils]: 19: Hoare triple {3601#true} ~i~0 := 0; {3676#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:04,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {3676#(<= 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; {3604#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:04,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {3604#(<= 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; {3605#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:04,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {3605#(<= 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; {3606#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:04,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {3606#(<= 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; {3607#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:04,377 INFO L273 TraceCheckUtils]: 24: Hoare triple {3607#(<= 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; {3608#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:04,378 INFO L273 TraceCheckUtils]: 25: Hoare triple {3608#(<= 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; {3609#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:04,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {3609#(<= 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; {3610#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:04,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#(<= 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; {3611#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:04,381 INFO L273 TraceCheckUtils]: 28: Hoare triple {3611#(<= 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; {3612#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:04,382 INFO L273 TraceCheckUtils]: 29: Hoare triple {3612#(<= 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; {3613#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:04,384 INFO L273 TraceCheckUtils]: 30: Hoare triple {3613#(<= 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; {3614#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:04,385 INFO L273 TraceCheckUtils]: 31: Hoare triple {3614#(<= 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; {3615#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:04,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {3615#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3602#false} is VALID [2018-11-23 11:55:04,386 INFO L273 TraceCheckUtils]: 33: Hoare triple {3602#false} havoc ~x~0;~x~0 := 0; {3602#false} is VALID [2018-11-23 11:55:04,386 INFO L273 TraceCheckUtils]: 34: Hoare triple {3602#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3602#false} is VALID [2018-11-23 11:55:04,386 INFO L256 TraceCheckUtils]: 35: Hoare triple {3602#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3602#false} is VALID [2018-11-23 11:55:04,387 INFO L273 TraceCheckUtils]: 36: Hoare triple {3602#false} ~cond := #in~cond; {3602#false} is VALID [2018-11-23 11:55:04,387 INFO L273 TraceCheckUtils]: 37: Hoare triple {3602#false} assume 0 == ~cond; {3602#false} is VALID [2018-11-23 11:55:04,387 INFO L273 TraceCheckUtils]: 38: Hoare triple {3602#false} assume !false; {3602#false} is VALID [2018-11-23 11:55:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 11:55:04,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:04,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 11:55:04,411 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-23 11:55:04,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:04,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:55:04,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:04,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:55:04,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:55:04,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:55:04,481 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 16 states. [2018-11-23 11:55:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:04,838 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-11-23 11:55:04,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:55:04,838 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-23 11:55:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:55:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2018-11-23 11:55:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:55:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2018-11-23 11:55:04,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 64 transitions. [2018-11-23 11:55:04,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:04,919 INFO L225 Difference]: With dead ends: 71 [2018-11-23 11:55:04,919 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:55:04,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:55:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:55:05,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 11:55:05,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:05,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:05,021 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:05,021 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:05,023 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 11:55:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 11:55:05,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:05,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:05,024 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:05,024 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:05,025 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 11:55:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 11:55:05,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:05,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:05,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:05,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:55:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-23 11:55:05,027 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2018-11-23 11:55:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:05,027 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-23 11:55:05,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:55:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 11:55:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:55:05,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:05,028 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:05,029 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:05,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:05,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1100207717, now seen corresponding path program 13 times [2018-11-23 11:55:05,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:05,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:05,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:05,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:05,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:05,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {4028#true} call ULTIMATE.init(); {4028#true} is VALID [2018-11-23 11:55:05,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {4028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4028#true} is VALID [2018-11-23 11:55:05,728 INFO L273 TraceCheckUtils]: 2: Hoare triple {4028#true} assume true; {4028#true} is VALID [2018-11-23 11:55:05,728 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4028#true} {4028#true} #61#return; {4028#true} is VALID [2018-11-23 11:55:05,728 INFO L256 TraceCheckUtils]: 4: Hoare triple {4028#true} call #t~ret2 := main(); {4028#true} is VALID [2018-11-23 11:55:05,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {4028#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4030#(= main_~i~0 0)} is VALID [2018-11-23 11:55:05,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {4030#(= 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; {4031#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:05,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {4031#(<= 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; {4032#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:05,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {4032#(<= 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; {4033#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:05,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {4033#(<= 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; {4034#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:05,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {4034#(<= 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; {4035#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:05,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {4035#(<= 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; {4036#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:05,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {4036#(<= 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; {4037#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:05,735 INFO L273 TraceCheckUtils]: 13: Hoare triple {4037#(<= 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; {4038#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:05,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {4038#(<= 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; {4039#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:05,737 INFO L273 TraceCheckUtils]: 15: Hoare triple {4039#(<= 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; {4040#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:05,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {4040#(<= 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; {4041#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:05,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {4041#(<= 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; {4042#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:05,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {4042#(<= 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; {4043#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:05,741 INFO L273 TraceCheckUtils]: 19: Hoare triple {4043#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4029#false} is VALID [2018-11-23 11:55:05,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {4029#false} ~i~0 := 0; {4029#false} is VALID [2018-11-23 11:55:05,741 INFO L273 TraceCheckUtils]: 21: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,742 INFO L273 TraceCheckUtils]: 23: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,742 INFO L273 TraceCheckUtils]: 26: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,743 INFO L273 TraceCheckUtils]: 27: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,743 INFO L273 TraceCheckUtils]: 28: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,743 INFO L273 TraceCheckUtils]: 29: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,743 INFO L273 TraceCheckUtils]: 30: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,743 INFO L273 TraceCheckUtils]: 31: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,744 INFO L273 TraceCheckUtils]: 32: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,744 INFO L273 TraceCheckUtils]: 33: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,744 INFO L273 TraceCheckUtils]: 34: Hoare triple {4029#false} assume !(~i~0 < 100000); {4029#false} is VALID [2018-11-23 11:55:05,744 INFO L273 TraceCheckUtils]: 35: Hoare triple {4029#false} havoc ~x~0;~x~0 := 0; {4029#false} is VALID [2018-11-23 11:55:05,745 INFO L273 TraceCheckUtils]: 36: Hoare triple {4029#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4029#false} is VALID [2018-11-23 11:55:05,745 INFO L256 TraceCheckUtils]: 37: Hoare triple {4029#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4029#false} is VALID [2018-11-23 11:55:05,745 INFO L273 TraceCheckUtils]: 38: Hoare triple {4029#false} ~cond := #in~cond; {4029#false} is VALID [2018-11-23 11:55:05,745 INFO L273 TraceCheckUtils]: 39: Hoare triple {4029#false} assume 0 == ~cond; {4029#false} is VALID [2018-11-23 11:55:05,745 INFO L273 TraceCheckUtils]: 40: Hoare triple {4029#false} assume !false; {4029#false} is VALID [2018-11-23 11:55:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-23 11:55:05,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:05,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:05,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:05,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:05,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {4028#true} call ULTIMATE.init(); {4028#true} is VALID [2018-11-23 11:55:05,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {4028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4028#true} is VALID [2018-11-23 11:55:05,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {4028#true} assume true; {4028#true} is VALID [2018-11-23 11:55:05,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4028#true} {4028#true} #61#return; {4028#true} is VALID [2018-11-23 11:55:05,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {4028#true} call #t~ret2 := main(); {4028#true} is VALID [2018-11-23 11:55:05,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {4028#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4062#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:05,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {4062#(<= 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; {4031#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:05,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {4031#(<= 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; {4032#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:05,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {4032#(<= 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; {4033#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:05,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {4033#(<= 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; {4034#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:05,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {4034#(<= 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; {4035#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:05,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {4035#(<= 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; {4036#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:05,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {4036#(<= 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; {4037#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:05,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {4037#(<= 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; {4038#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:05,951 INFO L273 TraceCheckUtils]: 14: Hoare triple {4038#(<= 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; {4039#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:05,951 INFO L273 TraceCheckUtils]: 15: Hoare triple {4039#(<= 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; {4040#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:05,952 INFO L273 TraceCheckUtils]: 16: Hoare triple {4040#(<= 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; {4041#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:05,953 INFO L273 TraceCheckUtils]: 17: Hoare triple {4041#(<= 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; {4042#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:05,954 INFO L273 TraceCheckUtils]: 18: Hoare triple {4042#(<= 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; {4043#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:05,954 INFO L273 TraceCheckUtils]: 19: Hoare triple {4043#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4029#false} is VALID [2018-11-23 11:55:05,955 INFO L273 TraceCheckUtils]: 20: Hoare triple {4029#false} ~i~0 := 0; {4029#false} is VALID [2018-11-23 11:55:05,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,955 INFO L273 TraceCheckUtils]: 23: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,956 INFO L273 TraceCheckUtils]: 25: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,956 INFO L273 TraceCheckUtils]: 26: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,956 INFO L273 TraceCheckUtils]: 27: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,956 INFO L273 TraceCheckUtils]: 28: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,957 INFO L273 TraceCheckUtils]: 29: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,957 INFO L273 TraceCheckUtils]: 30: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,957 INFO L273 TraceCheckUtils]: 31: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,957 INFO L273 TraceCheckUtils]: 32: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,957 INFO L273 TraceCheckUtils]: 33: Hoare triple {4029#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#false} is VALID [2018-11-23 11:55:05,957 INFO L273 TraceCheckUtils]: 34: Hoare triple {4029#false} assume !(~i~0 < 100000); {4029#false} is VALID [2018-11-23 11:55:05,958 INFO L273 TraceCheckUtils]: 35: Hoare triple {4029#false} havoc ~x~0;~x~0 := 0; {4029#false} is VALID [2018-11-23 11:55:05,958 INFO L273 TraceCheckUtils]: 36: Hoare triple {4029#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4029#false} is VALID [2018-11-23 11:55:05,958 INFO L256 TraceCheckUtils]: 37: Hoare triple {4029#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4029#false} is VALID [2018-11-23 11:55:05,958 INFO L273 TraceCheckUtils]: 38: Hoare triple {4029#false} ~cond := #in~cond; {4029#false} is VALID [2018-11-23 11:55:05,958 INFO L273 TraceCheckUtils]: 39: Hoare triple {4029#false} assume 0 == ~cond; {4029#false} is VALID [2018-11-23 11:55:05,959 INFO L273 TraceCheckUtils]: 40: Hoare triple {4029#false} assume !false; {4029#false} is VALID [2018-11-23 11:55:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-23 11:55:05,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:05,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:55:05,992 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-23 11:55:05,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:05,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:55:06,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:06,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:55:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:55:06,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:06,062 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 17 states. [2018-11-23 11:55:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:06,393 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-23 11:55:06,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:55:06,394 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-23 11:55:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2018-11-23 11:55:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2018-11-23 11:55:06,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 66 transitions. [2018-11-23 11:55:06,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:06,489 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:55:06,489 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 11:55:06,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 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-23 11:55:06,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 11:55:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 11:55:06,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:06,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:06,527 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:06,527 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:06,529 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 11:55:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-23 11:55:06,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:06,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:06,530 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:06,530 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:06,531 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 11:55:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-23 11:55:06,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:06,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:06,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:06,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:55:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-23 11:55:06,533 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 41 [2018-11-23 11:55:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:06,533 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-23 11:55:06,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:55:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-23 11:55:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:55:06,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:06,534 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:06,534 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:06,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:06,535 INFO L82 PathProgramCache]: Analyzing trace with hash 397624678, now seen corresponding path program 14 times [2018-11-23 11:55:06,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:06,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:06,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:06,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:06,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:07,145 INFO L256 TraceCheckUtils]: 0: Hoare triple {4476#true} call ULTIMATE.init(); {4476#true} is VALID [2018-11-23 11:55:07,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {4476#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4476#true} is VALID [2018-11-23 11:55:07,146 INFO L273 TraceCheckUtils]: 2: Hoare triple {4476#true} assume true; {4476#true} is VALID [2018-11-23 11:55:07,146 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4476#true} {4476#true} #61#return; {4476#true} is VALID [2018-11-23 11:55:07,146 INFO L256 TraceCheckUtils]: 4: Hoare triple {4476#true} call #t~ret2 := main(); {4476#true} is VALID [2018-11-23 11:55:07,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {4476#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4478#(= main_~i~0 0)} is VALID [2018-11-23 11:55:07,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {4478#(= 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; {4479#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:07,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {4479#(<= 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; {4480#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:07,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {4480#(<= 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; {4481#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:07,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {4481#(<= 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; {4482#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:07,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {4482#(<= 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; {4483#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:07,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {4483#(<= 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; {4484#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:07,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {4484#(<= 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; {4485#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:07,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {4485#(<= 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; {4486#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:07,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {4486#(<= 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; {4487#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:07,154 INFO L273 TraceCheckUtils]: 15: Hoare triple {4487#(<= 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; {4488#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:07,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {4488#(<= 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; {4489#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:07,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {4489#(<= 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; {4490#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:07,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {4490#(<= 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; {4491#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:07,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {4491#(<= 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; {4492#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:07,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {4492#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4477#false} is VALID [2018-11-23 11:55:07,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {4477#false} ~i~0 := 0; {4477#false} is VALID [2018-11-23 11:55:07,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,160 INFO L273 TraceCheckUtils]: 25: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,160 INFO L273 TraceCheckUtils]: 26: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,161 INFO L273 TraceCheckUtils]: 27: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,161 INFO L273 TraceCheckUtils]: 28: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,161 INFO L273 TraceCheckUtils]: 29: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,161 INFO L273 TraceCheckUtils]: 30: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,162 INFO L273 TraceCheckUtils]: 33: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,162 INFO L273 TraceCheckUtils]: 34: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,162 INFO L273 TraceCheckUtils]: 35: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,163 INFO L273 TraceCheckUtils]: 36: Hoare triple {4477#false} assume !(~i~0 < 100000); {4477#false} is VALID [2018-11-23 11:55:07,163 INFO L273 TraceCheckUtils]: 37: Hoare triple {4477#false} havoc ~x~0;~x~0 := 0; {4477#false} is VALID [2018-11-23 11:55:07,163 INFO L273 TraceCheckUtils]: 38: Hoare triple {4477#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4477#false} is VALID [2018-11-23 11:55:07,163 INFO L256 TraceCheckUtils]: 39: Hoare triple {4477#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4477#false} is VALID [2018-11-23 11:55:07,163 INFO L273 TraceCheckUtils]: 40: Hoare triple {4477#false} ~cond := #in~cond; {4477#false} is VALID [2018-11-23 11:55:07,163 INFO L273 TraceCheckUtils]: 41: Hoare triple {4477#false} assume 0 == ~cond; {4477#false} is VALID [2018-11-23 11:55:07,164 INFO L273 TraceCheckUtils]: 42: Hoare triple {4477#false} assume !false; {4477#false} is VALID [2018-11-23 11:55:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 11:55:07,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:07,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:07,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:07,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:07,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:07,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:07,452 INFO L256 TraceCheckUtils]: 0: Hoare triple {4476#true} call ULTIMATE.init(); {4476#true} is VALID [2018-11-23 11:55:07,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {4476#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4476#true} is VALID [2018-11-23 11:55:07,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {4476#true} assume true; {4476#true} is VALID [2018-11-23 11:55:07,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4476#true} {4476#true} #61#return; {4476#true} is VALID [2018-11-23 11:55:07,453 INFO L256 TraceCheckUtils]: 4: Hoare triple {4476#true} call #t~ret2 := main(); {4476#true} is VALID [2018-11-23 11:55:07,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {4476#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4511#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:07,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {4511#(<= 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; {4479#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:07,456 INFO L273 TraceCheckUtils]: 7: Hoare triple {4479#(<= 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; {4480#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:07,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {4480#(<= 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; {4481#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:07,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {4481#(<= 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; {4482#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:07,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {4482#(<= 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; {4483#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:07,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {4483#(<= 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; {4484#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:07,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {4484#(<= 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; {4485#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:07,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {4485#(<= 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; {4486#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:07,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {4486#(<= 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; {4487#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:07,464 INFO L273 TraceCheckUtils]: 15: Hoare triple {4487#(<= 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; {4488#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:07,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {4488#(<= 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; {4489#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:07,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {4489#(<= 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; {4490#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:07,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {4490#(<= 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; {4491#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:07,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {4491#(<= 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; {4492#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:07,470 INFO L273 TraceCheckUtils]: 20: Hoare triple {4492#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4477#false} is VALID [2018-11-23 11:55:07,470 INFO L273 TraceCheckUtils]: 21: Hoare triple {4477#false} ~i~0 := 0; {4477#false} is VALID [2018-11-23 11:55:07,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,471 INFO L273 TraceCheckUtils]: 23: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,471 INFO L273 TraceCheckUtils]: 24: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,471 INFO L273 TraceCheckUtils]: 25: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,471 INFO L273 TraceCheckUtils]: 26: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,471 INFO L273 TraceCheckUtils]: 27: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,471 INFO L273 TraceCheckUtils]: 28: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,471 INFO L273 TraceCheckUtils]: 29: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,472 INFO L273 TraceCheckUtils]: 30: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,472 INFO L273 TraceCheckUtils]: 31: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,472 INFO L273 TraceCheckUtils]: 35: Hoare triple {4477#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4477#false} is VALID [2018-11-23 11:55:07,472 INFO L273 TraceCheckUtils]: 36: Hoare triple {4477#false} assume !(~i~0 < 100000); {4477#false} is VALID [2018-11-23 11:55:07,472 INFO L273 TraceCheckUtils]: 37: Hoare triple {4477#false} havoc ~x~0;~x~0 := 0; {4477#false} is VALID [2018-11-23 11:55:07,472 INFO L273 TraceCheckUtils]: 38: Hoare triple {4477#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4477#false} is VALID [2018-11-23 11:55:07,473 INFO L256 TraceCheckUtils]: 39: Hoare triple {4477#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4477#false} is VALID [2018-11-23 11:55:07,473 INFO L273 TraceCheckUtils]: 40: Hoare triple {4477#false} ~cond := #in~cond; {4477#false} is VALID [2018-11-23 11:55:07,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {4477#false} assume 0 == ~cond; {4477#false} is VALID [2018-11-23 11:55:07,473 INFO L273 TraceCheckUtils]: 42: Hoare triple {4477#false} assume !false; {4477#false} is VALID [2018-11-23 11:55:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 11:55:07,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:07,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:55:07,494 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-23 11:55:07,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:07,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:55:07,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:07,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:55:07,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:55:07,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:07,522 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 18 states. [2018-11-23 11:55:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:07,968 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-11-23 11:55:07,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:55:07,969 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-23 11:55:07,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2018-11-23 11:55:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:07,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2018-11-23 11:55:07,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 68 transitions. [2018-11-23 11:55:08,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:08,040 INFO L225 Difference]: With dead ends: 77 [2018-11-23 11:55:08,040 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 11:55:08,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:08,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 11:55:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 11:55:08,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:08,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 11:55:08,081 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 11:55:08,081 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 11:55:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:08,083 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 11:55:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 11:55:08,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:08,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:08,084 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 11:55:08,084 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 11:55:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:08,086 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 11:55:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 11:55:08,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:08,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:08,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:08,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:55:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-11-23 11:55:08,088 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 43 [2018-11-23 11:55:08,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:08,088 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-11-23 11:55:08,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:55:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 11:55:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:55:08,089 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:08,089 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:08,089 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:08,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:08,090 INFO L82 PathProgramCache]: Analyzing trace with hash -400171259, now seen corresponding path program 15 times [2018-11-23 11:55:08,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:08,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:08,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:08,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:08,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:09,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {4945#true} call ULTIMATE.init(); {4945#true} is VALID [2018-11-23 11:55:09,891 INFO L273 TraceCheckUtils]: 1: Hoare triple {4945#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4945#true} is VALID [2018-11-23 11:55:09,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {4945#true} assume true; {4945#true} is VALID [2018-11-23 11:55:09,892 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4945#true} {4945#true} #61#return; {4945#true} is VALID [2018-11-23 11:55:09,892 INFO L256 TraceCheckUtils]: 4: Hoare triple {4945#true} call #t~ret2 := main(); {4945#true} is VALID [2018-11-23 11:55:09,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {4945#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4947#(= main_~i~0 0)} is VALID [2018-11-23 11:55:09,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {4947#(= 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; {4948#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:09,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {4948#(<= 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; {4949#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:09,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {4949#(<= 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; {4950#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:09,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {4950#(<= 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; {4951#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:09,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {4951#(<= 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; {4952#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:09,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {4952#(<= 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; {4953#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:09,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {4953#(<= 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; {4954#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:09,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {4954#(<= 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; {4955#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:09,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {4955#(<= 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; {4956#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:09,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {4956#(<= 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; {4957#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:09,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {4957#(<= 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; {4958#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:09,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {4958#(<= 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; {4959#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:09,903 INFO L273 TraceCheckUtils]: 18: Hoare triple {4959#(<= 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; {4960#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:09,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {4960#(<= 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; {4961#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:09,905 INFO L273 TraceCheckUtils]: 20: Hoare triple {4961#(<= 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; {4962#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:09,906 INFO L273 TraceCheckUtils]: 21: Hoare triple {4962#(<= main_~i~0 15)} assume !(~i~0 < 100000); {4946#false} is VALID [2018-11-23 11:55:09,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {4946#false} ~i~0 := 0; {4946#false} is VALID [2018-11-23 11:55:09,906 INFO L273 TraceCheckUtils]: 23: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,907 INFO L273 TraceCheckUtils]: 24: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,907 INFO L273 TraceCheckUtils]: 25: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,907 INFO L273 TraceCheckUtils]: 26: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,907 INFO L273 TraceCheckUtils]: 27: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,908 INFO L273 TraceCheckUtils]: 28: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,908 INFO L273 TraceCheckUtils]: 29: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,908 INFO L273 TraceCheckUtils]: 30: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,908 INFO L273 TraceCheckUtils]: 31: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,908 INFO L273 TraceCheckUtils]: 32: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,909 INFO L273 TraceCheckUtils]: 33: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,909 INFO L273 TraceCheckUtils]: 34: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,909 INFO L273 TraceCheckUtils]: 35: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,909 INFO L273 TraceCheckUtils]: 36: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,909 INFO L273 TraceCheckUtils]: 37: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:09,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {4946#false} assume !(~i~0 < 100000); {4946#false} is VALID [2018-11-23 11:55:09,910 INFO L273 TraceCheckUtils]: 39: Hoare triple {4946#false} havoc ~x~0;~x~0 := 0; {4946#false} is VALID [2018-11-23 11:55:09,910 INFO L273 TraceCheckUtils]: 40: Hoare triple {4946#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4946#false} is VALID [2018-11-23 11:55:09,910 INFO L256 TraceCheckUtils]: 41: Hoare triple {4946#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4946#false} is VALID [2018-11-23 11:55:09,910 INFO L273 TraceCheckUtils]: 42: Hoare triple {4946#false} ~cond := #in~cond; {4946#false} is VALID [2018-11-23 11:55:09,911 INFO L273 TraceCheckUtils]: 43: Hoare triple {4946#false} assume 0 == ~cond; {4946#false} is VALID [2018-11-23 11:55:09,911 INFO L273 TraceCheckUtils]: 44: Hoare triple {4946#false} assume !false; {4946#false} is VALID [2018-11-23 11:55:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-23 11:55:09,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:09,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:09,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:10,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:55:10,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:10,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:10,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {4945#true} call ULTIMATE.init(); {4945#true} is VALID [2018-11-23 11:55:10,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {4945#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4945#true} is VALID [2018-11-23 11:55:10,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {4945#true} assume true; {4945#true} is VALID [2018-11-23 11:55:10,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4945#true} {4945#true} #61#return; {4945#true} is VALID [2018-11-23 11:55:10,626 INFO L256 TraceCheckUtils]: 4: Hoare triple {4945#true} call #t~ret2 := main(); {4945#true} is VALID [2018-11-23 11:55:10,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {4945#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4981#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:10,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {4981#(<= 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; {4948#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:10,628 INFO L273 TraceCheckUtils]: 7: Hoare triple {4948#(<= 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; {4949#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:10,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {4949#(<= 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; {4950#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:10,629 INFO L273 TraceCheckUtils]: 9: Hoare triple {4950#(<= 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; {4951#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:10,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {4951#(<= 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; {4952#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:10,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {4952#(<= 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; {4953#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:10,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {4953#(<= 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; {4954#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:10,633 INFO L273 TraceCheckUtils]: 13: Hoare triple {4954#(<= 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; {4955#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:10,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {4955#(<= 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; {4956#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:10,635 INFO L273 TraceCheckUtils]: 15: Hoare triple {4956#(<= 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; {4957#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:10,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {4957#(<= 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; {4958#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:10,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {4958#(<= 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; {4959#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:10,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {4959#(<= 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; {4960#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:10,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {4960#(<= 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; {4961#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:10,640 INFO L273 TraceCheckUtils]: 20: Hoare triple {4961#(<= 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; {4962#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:10,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {4962#(<= main_~i~0 15)} assume !(~i~0 < 100000); {4946#false} is VALID [2018-11-23 11:55:10,641 INFO L273 TraceCheckUtils]: 22: Hoare triple {4946#false} ~i~0 := 0; {4946#false} is VALID [2018-11-23 11:55:10,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,642 INFO L273 TraceCheckUtils]: 24: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,642 INFO L273 TraceCheckUtils]: 25: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,642 INFO L273 TraceCheckUtils]: 26: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,642 INFO L273 TraceCheckUtils]: 27: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,643 INFO L273 TraceCheckUtils]: 29: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,643 INFO L273 TraceCheckUtils]: 30: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,643 INFO L273 TraceCheckUtils]: 31: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,643 INFO L273 TraceCheckUtils]: 32: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,644 INFO L273 TraceCheckUtils]: 34: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,644 INFO L273 TraceCheckUtils]: 35: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,644 INFO L273 TraceCheckUtils]: 36: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,644 INFO L273 TraceCheckUtils]: 37: Hoare triple {4946#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4946#false} is VALID [2018-11-23 11:55:10,645 INFO L273 TraceCheckUtils]: 38: Hoare triple {4946#false} assume !(~i~0 < 100000); {4946#false} is VALID [2018-11-23 11:55:10,645 INFO L273 TraceCheckUtils]: 39: Hoare triple {4946#false} havoc ~x~0;~x~0 := 0; {4946#false} is VALID [2018-11-23 11:55:10,645 INFO L273 TraceCheckUtils]: 40: Hoare triple {4946#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4946#false} is VALID [2018-11-23 11:55:10,645 INFO L256 TraceCheckUtils]: 41: Hoare triple {4946#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4946#false} is VALID [2018-11-23 11:55:10,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {4946#false} ~cond := #in~cond; {4946#false} is VALID [2018-11-23 11:55:10,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {4946#false} assume 0 == ~cond; {4946#false} is VALID [2018-11-23 11:55:10,646 INFO L273 TraceCheckUtils]: 44: Hoare triple {4946#false} assume !false; {4946#false} is VALID [2018-11-23 11:55:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-23 11:55:10,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:10,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 11:55:10,667 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-23 11:55:10,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:10,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:55:10,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:10,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:55:10,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:55:10,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:10,701 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 19 states. [2018-11-23 11:55:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:11,131 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-11-23 11:55:11,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:55:11,131 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-23 11:55:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:55:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 70 transitions. [2018-11-23 11:55:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:55:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 70 transitions. [2018-11-23 11:55:11,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 70 transitions. [2018-11-23 11:55:11,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:11,207 INFO L225 Difference]: With dead ends: 80 [2018-11-23 11:55:11,207 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:55:11,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:55:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 11:55:11,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:11,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:11,244 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:11,245 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:11,246 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 11:55:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 11:55:11,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:11,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:11,247 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:11,247 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:11,248 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 11:55:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 11:55:11,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:11,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:11,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:11,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:55:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-11-23 11:55:11,250 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2018-11-23 11:55:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:11,251 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-23 11:55:11,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:55:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 11:55:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:55:11,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:11,252 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:11,252 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:11,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash -264076858, now seen corresponding path program 16 times [2018-11-23 11:55:11,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:11,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:11,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:11,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {5435#true} call ULTIMATE.init(); {5435#true} is VALID [2018-11-23 11:55:11,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {5435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5435#true} is VALID [2018-11-23 11:55:11,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {5435#true} assume true; {5435#true} is VALID [2018-11-23 11:55:11,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5435#true} {5435#true} #61#return; {5435#true} is VALID [2018-11-23 11:55:11,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {5435#true} call #t~ret2 := main(); {5435#true} is VALID [2018-11-23 11:55:11,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {5435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5437#(= main_~i~0 0)} is VALID [2018-11-23 11:55:11,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {5437#(= 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; {5438#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:11,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {5438#(<= 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; {5439#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:11,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {5439#(<= 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; {5440#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:11,980 INFO L273 TraceCheckUtils]: 9: Hoare triple {5440#(<= 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; {5441#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:11,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {5441#(<= 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; {5442#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:11,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {5442#(<= 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; {5443#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:11,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {5443#(<= 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; {5444#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:11,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {5444#(<= 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; {5445#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:11,985 INFO L273 TraceCheckUtils]: 14: Hoare triple {5445#(<= 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; {5446#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:11,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {5446#(<= 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; {5447#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:11,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {5447#(<= 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; {5448#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:11,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {5448#(<= 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; {5449#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:11,988 INFO L273 TraceCheckUtils]: 18: Hoare triple {5449#(<= 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; {5450#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:11,989 INFO L273 TraceCheckUtils]: 19: Hoare triple {5450#(<= 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; {5451#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:11,990 INFO L273 TraceCheckUtils]: 20: Hoare triple {5451#(<= 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; {5452#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:11,991 INFO L273 TraceCheckUtils]: 21: Hoare triple {5452#(<= 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; {5453#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:11,992 INFO L273 TraceCheckUtils]: 22: Hoare triple {5453#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5436#false} is VALID [2018-11-23 11:55:11,992 INFO L273 TraceCheckUtils]: 23: Hoare triple {5436#false} ~i~0 := 0; {5436#false} is VALID [2018-11-23 11:55:11,992 INFO L273 TraceCheckUtils]: 24: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,993 INFO L273 TraceCheckUtils]: 25: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,993 INFO L273 TraceCheckUtils]: 26: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,993 INFO L273 TraceCheckUtils]: 27: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,993 INFO L273 TraceCheckUtils]: 28: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,993 INFO L273 TraceCheckUtils]: 29: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,994 INFO L273 TraceCheckUtils]: 30: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,994 INFO L273 TraceCheckUtils]: 31: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,994 INFO L273 TraceCheckUtils]: 33: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,994 INFO L273 TraceCheckUtils]: 34: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,995 INFO L273 TraceCheckUtils]: 36: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,995 INFO L273 TraceCheckUtils]: 37: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,995 INFO L273 TraceCheckUtils]: 38: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,995 INFO L273 TraceCheckUtils]: 39: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:11,996 INFO L273 TraceCheckUtils]: 40: Hoare triple {5436#false} assume !(~i~0 < 100000); {5436#false} is VALID [2018-11-23 11:55:11,996 INFO L273 TraceCheckUtils]: 41: Hoare triple {5436#false} havoc ~x~0;~x~0 := 0; {5436#false} is VALID [2018-11-23 11:55:11,996 INFO L273 TraceCheckUtils]: 42: Hoare triple {5436#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5436#false} is VALID [2018-11-23 11:55:11,996 INFO L256 TraceCheckUtils]: 43: Hoare triple {5436#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {5436#false} is VALID [2018-11-23 11:55:11,997 INFO L273 TraceCheckUtils]: 44: Hoare triple {5436#false} ~cond := #in~cond; {5436#false} is VALID [2018-11-23 11:55:11,997 INFO L273 TraceCheckUtils]: 45: Hoare triple {5436#false} assume 0 == ~cond; {5436#false} is VALID [2018-11-23 11:55:11,997 INFO L273 TraceCheckUtils]: 46: Hoare triple {5436#false} assume !false; {5436#false} is VALID [2018-11-23 11:55:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 11:55:11,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:11,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:12,007 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:12,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:12,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:12,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:12,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {5435#true} call ULTIMATE.init(); {5435#true} is VALID [2018-11-23 11:55:12,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {5435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5435#true} is VALID [2018-11-23 11:55:12,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {5435#true} assume true; {5435#true} is VALID [2018-11-23 11:55:12,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5435#true} {5435#true} #61#return; {5435#true} is VALID [2018-11-23 11:55:12,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {5435#true} call #t~ret2 := main(); {5435#true} is VALID [2018-11-23 11:55:12,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {5435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5472#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:12,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {5472#(<= 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; {5438#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:12,297 INFO L273 TraceCheckUtils]: 7: Hoare triple {5438#(<= 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; {5439#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:12,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {5439#(<= 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; {5440#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:12,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {5440#(<= 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; {5441#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:12,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {5441#(<= 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; {5442#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:12,300 INFO L273 TraceCheckUtils]: 11: Hoare triple {5442#(<= 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; {5443#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:12,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {5443#(<= 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; {5444#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:12,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {5444#(<= 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; {5445#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:12,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {5445#(<= 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; {5446#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:12,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {5446#(<= 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; {5447#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:12,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {5447#(<= 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; {5448#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:12,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {5448#(<= 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; {5449#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:12,307 INFO L273 TraceCheckUtils]: 18: Hoare triple {5449#(<= 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; {5450#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:12,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {5450#(<= 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; {5451#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:12,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {5451#(<= 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; {5452#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:12,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {5452#(<= 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; {5453#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:12,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {5453#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5436#false} is VALID [2018-11-23 11:55:12,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {5436#false} ~i~0 := 0; {5436#false} is VALID [2018-11-23 11:55:12,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,312 INFO L273 TraceCheckUtils]: 28: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,312 INFO L273 TraceCheckUtils]: 29: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,312 INFO L273 TraceCheckUtils]: 30: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,312 INFO L273 TraceCheckUtils]: 31: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,312 INFO L273 TraceCheckUtils]: 32: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,313 INFO L273 TraceCheckUtils]: 33: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,313 INFO L273 TraceCheckUtils]: 34: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,313 INFO L273 TraceCheckUtils]: 35: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,313 INFO L273 TraceCheckUtils]: 36: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,313 INFO L273 TraceCheckUtils]: 37: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,313 INFO L273 TraceCheckUtils]: 38: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,314 INFO L273 TraceCheckUtils]: 39: Hoare triple {5436#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5436#false} is VALID [2018-11-23 11:55:12,314 INFO L273 TraceCheckUtils]: 40: Hoare triple {5436#false} assume !(~i~0 < 100000); {5436#false} is VALID [2018-11-23 11:55:12,314 INFO L273 TraceCheckUtils]: 41: Hoare triple {5436#false} havoc ~x~0;~x~0 := 0; {5436#false} is VALID [2018-11-23 11:55:12,314 INFO L273 TraceCheckUtils]: 42: Hoare triple {5436#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5436#false} is VALID [2018-11-23 11:55:12,314 INFO L256 TraceCheckUtils]: 43: Hoare triple {5436#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {5436#false} is VALID [2018-11-23 11:55:12,314 INFO L273 TraceCheckUtils]: 44: Hoare triple {5436#false} ~cond := #in~cond; {5436#false} is VALID [2018-11-23 11:55:12,314 INFO L273 TraceCheckUtils]: 45: Hoare triple {5436#false} assume 0 == ~cond; {5436#false} is VALID [2018-11-23 11:55:12,314 INFO L273 TraceCheckUtils]: 46: Hoare triple {5436#false} assume !false; {5436#false} is VALID [2018-11-23 11:55:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-23 11:55:12,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:12,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:55:12,336 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 11:55:12,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:12,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:55:12,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:12,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:55:12,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:55:12,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:55:12,371 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 20 states. [2018-11-23 11:55:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:12,894 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-11-23 11:55:12,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:55:12,894 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 11:55:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:55:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2018-11-23 11:55:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:55:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2018-11-23 11:55:12,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 72 transitions. [2018-11-23 11:55:13,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:13,464 INFO L225 Difference]: With dead ends: 83 [2018-11-23 11:55:13,465 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:55:13,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:55:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:55:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 11:55:13,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:13,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-23 11:55:13,506 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 11:55:13,506 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 11:55:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:13,508 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 11:55:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 11:55:13,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:13,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:13,509 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 11:55:13,509 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 11:55:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:13,511 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 11:55:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 11:55:13,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:13,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:13,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:13,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:55:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-11-23 11:55:13,513 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 47 [2018-11-23 11:55:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:13,514 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-23 11:55:13,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:55:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 11:55:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:55:13,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:13,515 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:13,515 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:13,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:13,515 INFO L82 PathProgramCache]: Analyzing trace with hash 387325861, now seen corresponding path program 17 times [2018-11-23 11:55:13,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:13,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:13,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:13,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:13,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:14,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {5946#true} call ULTIMATE.init(); {5946#true} is VALID [2018-11-23 11:55:14,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {5946#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5946#true} is VALID [2018-11-23 11:55:14,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {5946#true} assume true; {5946#true} is VALID [2018-11-23 11:55:14,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5946#true} {5946#true} #61#return; {5946#true} is VALID [2018-11-23 11:55:14,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {5946#true} call #t~ret2 := main(); {5946#true} is VALID [2018-11-23 11:55:14,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {5946#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5948#(= main_~i~0 0)} is VALID [2018-11-23 11:55:14,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {5948#(= 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; {5949#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:14,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {5949#(<= 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; {5950#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:14,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {5950#(<= 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; {5951#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:14,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {5951#(<= 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; {5952#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:14,632 INFO L273 TraceCheckUtils]: 10: Hoare triple {5952#(<= 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; {5953#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:14,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {5953#(<= 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; {5954#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:14,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {5954#(<= 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; {5955#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:14,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {5955#(<= 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; {5956#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:14,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {5956#(<= 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; {5957#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:14,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {5957#(<= 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; {5958#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:14,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {5958#(<= 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; {5959#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:14,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {5959#(<= 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; {5960#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:14,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {5960#(<= 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; {5961#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:14,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {5961#(<= 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; {5962#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:14,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {5962#(<= 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; {5963#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:14,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {5963#(<= 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; {5964#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:14,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {5964#(<= 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; {5965#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:14,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {5965#(<= main_~i~0 17)} assume !(~i~0 < 100000); {5947#false} is VALID [2018-11-23 11:55:14,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {5947#false} ~i~0 := 0; {5947#false} is VALID [2018-11-23 11:55:14,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,669 INFO L273 TraceCheckUtils]: 26: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,669 INFO L273 TraceCheckUtils]: 27: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,669 INFO L273 TraceCheckUtils]: 28: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,669 INFO L273 TraceCheckUtils]: 29: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,670 INFO L273 TraceCheckUtils]: 34: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,670 INFO L273 TraceCheckUtils]: 35: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,671 INFO L273 TraceCheckUtils]: 39: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,671 INFO L273 TraceCheckUtils]: 40: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,671 INFO L273 TraceCheckUtils]: 41: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:14,671 INFO L273 TraceCheckUtils]: 42: Hoare triple {5947#false} assume !(~i~0 < 100000); {5947#false} is VALID [2018-11-23 11:55:14,672 INFO L273 TraceCheckUtils]: 43: Hoare triple {5947#false} havoc ~x~0;~x~0 := 0; {5947#false} is VALID [2018-11-23 11:55:14,672 INFO L273 TraceCheckUtils]: 44: Hoare triple {5947#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5947#false} is VALID [2018-11-23 11:55:14,672 INFO L256 TraceCheckUtils]: 45: Hoare triple {5947#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {5947#false} is VALID [2018-11-23 11:55:14,672 INFO L273 TraceCheckUtils]: 46: Hoare triple {5947#false} ~cond := #in~cond; {5947#false} is VALID [2018-11-23 11:55:14,672 INFO L273 TraceCheckUtils]: 47: Hoare triple {5947#false} assume 0 == ~cond; {5947#false} is VALID [2018-11-23 11:55:14,672 INFO L273 TraceCheckUtils]: 48: Hoare triple {5947#false} assume !false; {5947#false} is VALID [2018-11-23 11:55:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 11:55:14,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:14,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:14,685 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:27,022 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 11:55:27,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:27,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {5946#true} call ULTIMATE.init(); {5946#true} is VALID [2018-11-23 11:55:27,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {5946#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5946#true} is VALID [2018-11-23 11:55:27,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {5946#true} assume true; {5946#true} is VALID [2018-11-23 11:55:27,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5946#true} {5946#true} #61#return; {5946#true} is VALID [2018-11-23 11:55:27,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {5946#true} call #t~ret2 := main(); {5946#true} is VALID [2018-11-23 11:55:27,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {5946#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5984#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:27,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {5984#(<= 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; {5949#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:27,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {5949#(<= 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; {5950#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:27,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {5950#(<= 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; {5951#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:27,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {5951#(<= 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; {5952#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:27,216 INFO L273 TraceCheckUtils]: 10: Hoare triple {5952#(<= 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; {5953#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:27,217 INFO L273 TraceCheckUtils]: 11: Hoare triple {5953#(<= 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; {5954#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:27,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {5954#(<= 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; {5955#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:27,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {5955#(<= 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; {5956#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:27,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {5956#(<= 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; {5957#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:27,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {5957#(<= 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; {5958#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:27,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {5958#(<= 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; {5959#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:27,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {5959#(<= 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; {5960#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:27,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {5960#(<= 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; {5961#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:27,226 INFO L273 TraceCheckUtils]: 19: Hoare triple {5961#(<= 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; {5962#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:27,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {5962#(<= 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; {5963#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:27,228 INFO L273 TraceCheckUtils]: 21: Hoare triple {5963#(<= 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; {5964#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:27,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {5964#(<= 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; {5965#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:27,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {5965#(<= main_~i~0 17)} assume !(~i~0 < 100000); {5947#false} is VALID [2018-11-23 11:55:27,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {5947#false} ~i~0 := 0; {5947#false} is VALID [2018-11-23 11:55:27,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,232 INFO L273 TraceCheckUtils]: 30: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,232 INFO L273 TraceCheckUtils]: 31: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,233 INFO L273 TraceCheckUtils]: 33: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,234 INFO L273 TraceCheckUtils]: 37: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,234 INFO L273 TraceCheckUtils]: 39: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,235 INFO L273 TraceCheckUtils]: 41: Hoare triple {5947#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5947#false} is VALID [2018-11-23 11:55:27,235 INFO L273 TraceCheckUtils]: 42: Hoare triple {5947#false} assume !(~i~0 < 100000); {5947#false} is VALID [2018-11-23 11:55:27,235 INFO L273 TraceCheckUtils]: 43: Hoare triple {5947#false} havoc ~x~0;~x~0 := 0; {5947#false} is VALID [2018-11-23 11:55:27,235 INFO L273 TraceCheckUtils]: 44: Hoare triple {5947#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5947#false} is VALID [2018-11-23 11:55:27,235 INFO L256 TraceCheckUtils]: 45: Hoare triple {5947#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {5947#false} is VALID [2018-11-23 11:55:27,235 INFO L273 TraceCheckUtils]: 46: Hoare triple {5947#false} ~cond := #in~cond; {5947#false} is VALID [2018-11-23 11:55:27,236 INFO L273 TraceCheckUtils]: 47: Hoare triple {5947#false} assume 0 == ~cond; {5947#false} is VALID [2018-11-23 11:55:27,236 INFO L273 TraceCheckUtils]: 48: Hoare triple {5947#false} assume !false; {5947#false} is VALID [2018-11-23 11:55:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 11:55:27,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:27,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 11:55:27,264 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-23 11:55:27,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:27,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:55:27,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:27,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:55:27,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:55:27,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:55:27,297 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 21 states. [2018-11-23 11:55:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:27,756 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-23 11:55:27,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:55:27,756 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-23 11:55:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:55:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 74 transitions. [2018-11-23 11:55:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:55:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 74 transitions. [2018-11-23 11:55:27,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 74 transitions. [2018-11-23 11:55:28,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:28,238 INFO L225 Difference]: With dead ends: 86 [2018-11-23 11:55:28,239 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:55:28,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:55:28,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:55:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 11:55:28,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:28,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:28,392 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:28,392 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,394 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 11:55:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 11:55:28,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,394 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:28,394 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,395 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 11:55:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 11:55:28,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:28,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:55:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-23 11:55:28,397 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 49 [2018-11-23 11:55:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:28,397 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-23 11:55:28,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:55:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 11:55:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:55:28,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:28,397 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:28,398 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:28,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:28,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1900411354, now seen corresponding path program 18 times [2018-11-23 11:55:28,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:28,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {6478#true} call ULTIMATE.init(); {6478#true} is VALID [2018-11-23 11:55:29,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {6478#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6478#true} is VALID [2018-11-23 11:55:29,092 INFO L273 TraceCheckUtils]: 2: Hoare triple {6478#true} assume true; {6478#true} is VALID [2018-11-23 11:55:29,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6478#true} {6478#true} #61#return; {6478#true} is VALID [2018-11-23 11:55:29,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {6478#true} call #t~ret2 := main(); {6478#true} is VALID [2018-11-23 11:55:29,093 INFO L273 TraceCheckUtils]: 5: Hoare triple {6478#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6480#(= main_~i~0 0)} is VALID [2018-11-23 11:55:29,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {6480#(= 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; {6481#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:29,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {6481#(<= 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; {6482#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:29,096 INFO L273 TraceCheckUtils]: 8: Hoare triple {6482#(<= 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; {6483#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:29,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {6483#(<= 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; {6484#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:29,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {6484#(<= 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; {6485#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:29,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {6485#(<= 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; {6486#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:29,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {6486#(<= 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; {6487#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:29,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {6487#(<= 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; {6488#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:29,102 INFO L273 TraceCheckUtils]: 14: Hoare triple {6488#(<= 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; {6489#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:29,103 INFO L273 TraceCheckUtils]: 15: Hoare triple {6489#(<= 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; {6490#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:29,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {6490#(<= 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; {6491#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:29,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {6491#(<= 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; {6492#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:29,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {6492#(<= 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; {6493#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:29,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {6493#(<= 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; {6494#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:29,108 INFO L273 TraceCheckUtils]: 20: Hoare triple {6494#(<= 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; {6495#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:29,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {6495#(<= 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; {6496#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:29,110 INFO L273 TraceCheckUtils]: 22: Hoare triple {6496#(<= 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; {6497#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:29,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {6497#(<= 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; {6498#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:29,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {6498#(<= main_~i~0 18)} assume !(~i~0 < 100000); {6479#false} is VALID [2018-11-23 11:55:29,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {6479#false} ~i~0 := 0; {6479#false} is VALID [2018-11-23 11:55:29,112 INFO L273 TraceCheckUtils]: 26: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,112 INFO L273 TraceCheckUtils]: 27: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,112 INFO L273 TraceCheckUtils]: 28: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,112 INFO L273 TraceCheckUtils]: 29: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,113 INFO L273 TraceCheckUtils]: 31: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,113 INFO L273 TraceCheckUtils]: 32: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,113 INFO L273 TraceCheckUtils]: 33: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,113 INFO L273 TraceCheckUtils]: 34: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,114 INFO L273 TraceCheckUtils]: 37: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,114 INFO L273 TraceCheckUtils]: 38: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,114 INFO L273 TraceCheckUtils]: 39: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,114 INFO L273 TraceCheckUtils]: 40: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,114 INFO L273 TraceCheckUtils]: 41: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,115 INFO L273 TraceCheckUtils]: 42: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,115 INFO L273 TraceCheckUtils]: 43: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:29,115 INFO L273 TraceCheckUtils]: 44: Hoare triple {6479#false} assume !(~i~0 < 100000); {6479#false} is VALID [2018-11-23 11:55:29,115 INFO L273 TraceCheckUtils]: 45: Hoare triple {6479#false} havoc ~x~0;~x~0 := 0; {6479#false} is VALID [2018-11-23 11:55:29,115 INFO L273 TraceCheckUtils]: 46: Hoare triple {6479#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6479#false} is VALID [2018-11-23 11:55:29,115 INFO L256 TraceCheckUtils]: 47: Hoare triple {6479#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {6479#false} is VALID [2018-11-23 11:55:29,115 INFO L273 TraceCheckUtils]: 48: Hoare triple {6479#false} ~cond := #in~cond; {6479#false} is VALID [2018-11-23 11:55:29,115 INFO L273 TraceCheckUtils]: 49: Hoare triple {6479#false} assume 0 == ~cond; {6479#false} is VALID [2018-11-23 11:55:29,116 INFO L273 TraceCheckUtils]: 50: Hoare triple {6479#false} assume !false; {6479#false} is VALID [2018-11-23 11:55:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-23 11:55:29,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:29,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:29,128 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:33,034 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 11:55:33,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:33,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:33,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {6478#true} call ULTIMATE.init(); {6478#true} is VALID [2018-11-23 11:55:33,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {6478#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6478#true} is VALID [2018-11-23 11:55:33,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {6478#true} assume true; {6478#true} is VALID [2018-11-23 11:55:33,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6478#true} {6478#true} #61#return; {6478#true} is VALID [2018-11-23 11:55:33,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {6478#true} call #t~ret2 := main(); {6478#true} is VALID [2018-11-23 11:55:33,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {6478#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6517#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:33,414 INFO L273 TraceCheckUtils]: 6: Hoare triple {6517#(<= 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; {6481#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:33,414 INFO L273 TraceCheckUtils]: 7: Hoare triple {6481#(<= 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; {6482#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:33,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {6482#(<= 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; {6483#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:33,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {6483#(<= 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; {6484#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:33,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {6484#(<= 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; {6485#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:33,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {6485#(<= 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; {6486#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:33,417 INFO L273 TraceCheckUtils]: 12: Hoare triple {6486#(<= 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; {6487#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:33,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {6487#(<= 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; {6488#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:33,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {6488#(<= 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; {6489#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:33,420 INFO L273 TraceCheckUtils]: 15: Hoare triple {6489#(<= 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; {6490#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:33,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {6490#(<= 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; {6491#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:33,422 INFO L273 TraceCheckUtils]: 17: Hoare triple {6491#(<= 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; {6492#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:33,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {6492#(<= 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; {6493#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:33,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {6493#(<= 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; {6494#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:33,425 INFO L273 TraceCheckUtils]: 20: Hoare triple {6494#(<= 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; {6495#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:33,426 INFO L273 TraceCheckUtils]: 21: Hoare triple {6495#(<= 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; {6496#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:33,427 INFO L273 TraceCheckUtils]: 22: Hoare triple {6496#(<= 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; {6497#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:33,428 INFO L273 TraceCheckUtils]: 23: Hoare triple {6497#(<= 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; {6498#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:33,428 INFO L273 TraceCheckUtils]: 24: Hoare triple {6498#(<= main_~i~0 18)} assume !(~i~0 < 100000); {6479#false} is VALID [2018-11-23 11:55:33,429 INFO L273 TraceCheckUtils]: 25: Hoare triple {6479#false} ~i~0 := 0; {6479#false} is VALID [2018-11-23 11:55:33,429 INFO L273 TraceCheckUtils]: 26: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,429 INFO L273 TraceCheckUtils]: 27: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,429 INFO L273 TraceCheckUtils]: 28: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,429 INFO L273 TraceCheckUtils]: 29: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,430 INFO L273 TraceCheckUtils]: 30: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,430 INFO L273 TraceCheckUtils]: 31: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,430 INFO L273 TraceCheckUtils]: 33: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,430 INFO L273 TraceCheckUtils]: 34: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,431 INFO L273 TraceCheckUtils]: 35: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,431 INFO L273 TraceCheckUtils]: 36: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,431 INFO L273 TraceCheckUtils]: 37: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,431 INFO L273 TraceCheckUtils]: 38: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,431 INFO L273 TraceCheckUtils]: 39: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,432 INFO L273 TraceCheckUtils]: 40: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,432 INFO L273 TraceCheckUtils]: 41: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,432 INFO L273 TraceCheckUtils]: 42: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,432 INFO L273 TraceCheckUtils]: 43: Hoare triple {6479#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#false} is VALID [2018-11-23 11:55:33,432 INFO L273 TraceCheckUtils]: 44: Hoare triple {6479#false} assume !(~i~0 < 100000); {6479#false} is VALID [2018-11-23 11:55:33,433 INFO L273 TraceCheckUtils]: 45: Hoare triple {6479#false} havoc ~x~0;~x~0 := 0; {6479#false} is VALID [2018-11-23 11:55:33,433 INFO L273 TraceCheckUtils]: 46: Hoare triple {6479#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6479#false} is VALID [2018-11-23 11:55:33,433 INFO L256 TraceCheckUtils]: 47: Hoare triple {6479#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {6479#false} is VALID [2018-11-23 11:55:33,433 INFO L273 TraceCheckUtils]: 48: Hoare triple {6479#false} ~cond := #in~cond; {6479#false} is VALID [2018-11-23 11:55:33,433 INFO L273 TraceCheckUtils]: 49: Hoare triple {6479#false} assume 0 == ~cond; {6479#false} is VALID [2018-11-23 11:55:33,433 INFO L273 TraceCheckUtils]: 50: Hoare triple {6479#false} assume !false; {6479#false} is VALID [2018-11-23 11:55:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-23 11:55:33,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:33,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 11:55:33,457 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-23 11:55:33,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:33,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:55:33,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:33,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:55:33,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:55:33,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:55:33,486 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 22 states. [2018-11-23 11:55:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:33,766 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-11-23 11:55:33,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:55:33,766 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-23 11:55:33,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:55:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 76 transitions. [2018-11-23 11:55:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:55:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 76 transitions. [2018-11-23 11:55:33,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 76 transitions. [2018-11-23 11:55:33,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:33,847 INFO L225 Difference]: With dead ends: 89 [2018-11-23 11:55:33,847 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:55:33,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:55:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:55:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 11:55:33,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:33,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:33,898 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:33,898 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:33,900 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 11:55:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 11:55:33,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:33,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:33,900 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:33,901 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:33,902 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 11:55:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 11:55:33,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:33,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:33,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:33,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:55:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-23 11:55:33,903 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 51 [2018-11-23 11:55:33,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:33,904 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-23 11:55:33,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:55:33,904 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 11:55:33,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:55:33,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:33,905 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:33,905 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:33,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:33,905 INFO L82 PathProgramCache]: Analyzing trace with hash -574187451, now seen corresponding path program 19 times [2018-11-23 11:55:33,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:33,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:33,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:34,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {7031#true} call ULTIMATE.init(); {7031#true} is VALID [2018-11-23 11:55:34,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {7031#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7031#true} is VALID [2018-11-23 11:55:34,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {7031#true} assume true; {7031#true} is VALID [2018-11-23 11:55:34,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7031#true} {7031#true} #61#return; {7031#true} is VALID [2018-11-23 11:55:34,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {7031#true} call #t~ret2 := main(); {7031#true} is VALID [2018-11-23 11:55:34,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {7031#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7033#(= main_~i~0 0)} is VALID [2018-11-23 11:55:34,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {7033#(= 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; {7034#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:34,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {7034#(<= 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; {7035#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:34,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {7035#(<= 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; {7036#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:34,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {7036#(<= 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; {7037#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:34,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {7037#(<= 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; {7038#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:34,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {7038#(<= 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; {7039#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:34,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {7039#(<= 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; {7040#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:34,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {7040#(<= 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; {7041#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:34,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {7041#(<= 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; {7042#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:34,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {7042#(<= 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; {7043#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:34,345 INFO L273 TraceCheckUtils]: 16: Hoare triple {7043#(<= 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; {7044#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:34,346 INFO L273 TraceCheckUtils]: 17: Hoare triple {7044#(<= 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; {7045#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:34,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {7045#(<= 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; {7046#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:34,348 INFO L273 TraceCheckUtils]: 19: Hoare triple {7046#(<= 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; {7047#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:34,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {7047#(<= 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; {7048#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:34,349 INFO L273 TraceCheckUtils]: 21: Hoare triple {7048#(<= 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; {7049#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:34,350 INFO L273 TraceCheckUtils]: 22: Hoare triple {7049#(<= 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; {7050#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:34,351 INFO L273 TraceCheckUtils]: 23: Hoare triple {7050#(<= 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; {7051#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:34,352 INFO L273 TraceCheckUtils]: 24: Hoare triple {7051#(<= 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; {7052#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:34,353 INFO L273 TraceCheckUtils]: 25: Hoare triple {7052#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7032#false} is VALID [2018-11-23 11:55:34,353 INFO L273 TraceCheckUtils]: 26: Hoare triple {7032#false} ~i~0 := 0; {7032#false} is VALID [2018-11-23 11:55:34,353 INFO L273 TraceCheckUtils]: 27: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,354 INFO L273 TraceCheckUtils]: 28: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,354 INFO L273 TraceCheckUtils]: 29: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,354 INFO L273 TraceCheckUtils]: 30: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,354 INFO L273 TraceCheckUtils]: 31: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,354 INFO L273 TraceCheckUtils]: 32: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,355 INFO L273 TraceCheckUtils]: 33: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,355 INFO L273 TraceCheckUtils]: 34: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,355 INFO L273 TraceCheckUtils]: 35: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,355 INFO L273 TraceCheckUtils]: 36: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,356 INFO L273 TraceCheckUtils]: 40: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,356 INFO L273 TraceCheckUtils]: 41: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,356 INFO L273 TraceCheckUtils]: 42: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,356 INFO L273 TraceCheckUtils]: 43: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,356 INFO L273 TraceCheckUtils]: 44: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,356 INFO L273 TraceCheckUtils]: 45: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,357 INFO L273 TraceCheckUtils]: 46: Hoare triple {7032#false} assume !(~i~0 < 100000); {7032#false} is VALID [2018-11-23 11:55:34,357 INFO L273 TraceCheckUtils]: 47: Hoare triple {7032#false} havoc ~x~0;~x~0 := 0; {7032#false} is VALID [2018-11-23 11:55:34,357 INFO L273 TraceCheckUtils]: 48: Hoare triple {7032#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7032#false} is VALID [2018-11-23 11:55:34,357 INFO L256 TraceCheckUtils]: 49: Hoare triple {7032#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {7032#false} is VALID [2018-11-23 11:55:34,357 INFO L273 TraceCheckUtils]: 50: Hoare triple {7032#false} ~cond := #in~cond; {7032#false} is VALID [2018-11-23 11:55:34,357 INFO L273 TraceCheckUtils]: 51: Hoare triple {7032#false} assume 0 == ~cond; {7032#false} is VALID [2018-11-23 11:55:34,357 INFO L273 TraceCheckUtils]: 52: Hoare triple {7032#false} assume !false; {7032#false} is VALID [2018-11-23 11:55:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-23 11:55:34,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:34,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:34,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:34,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:34,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {7031#true} call ULTIMATE.init(); {7031#true} is VALID [2018-11-23 11:55:34,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {7031#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7031#true} is VALID [2018-11-23 11:55:34,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {7031#true} assume true; {7031#true} is VALID [2018-11-23 11:55:34,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7031#true} {7031#true} #61#return; {7031#true} is VALID [2018-11-23 11:55:34,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {7031#true} call #t~ret2 := main(); {7031#true} is VALID [2018-11-23 11:55:34,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {7031#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7071#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:34,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {7071#(<= 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; {7034#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:34,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {7034#(<= 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; {7035#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:34,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {7035#(<= 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; {7036#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:34,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {7036#(<= 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; {7037#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:34,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {7037#(<= 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; {7038#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:34,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {7038#(<= 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; {7039#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:34,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {7039#(<= 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; {7040#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:34,569 INFO L273 TraceCheckUtils]: 13: Hoare triple {7040#(<= 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; {7041#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:34,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {7041#(<= 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; {7042#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:34,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {7042#(<= 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; {7043#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:34,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {7043#(<= 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; {7044#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:34,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {7044#(<= 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; {7045#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:34,574 INFO L273 TraceCheckUtils]: 18: Hoare triple {7045#(<= 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; {7046#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:34,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {7046#(<= 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; {7047#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:34,575 INFO L273 TraceCheckUtils]: 20: Hoare triple {7047#(<= 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; {7048#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:34,576 INFO L273 TraceCheckUtils]: 21: Hoare triple {7048#(<= 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; {7049#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:34,577 INFO L273 TraceCheckUtils]: 22: Hoare triple {7049#(<= 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; {7050#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:34,578 INFO L273 TraceCheckUtils]: 23: Hoare triple {7050#(<= 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; {7051#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:34,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {7051#(<= 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; {7052#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:34,580 INFO L273 TraceCheckUtils]: 25: Hoare triple {7052#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7032#false} is VALID [2018-11-23 11:55:34,580 INFO L273 TraceCheckUtils]: 26: Hoare triple {7032#false} ~i~0 := 0; {7032#false} is VALID [2018-11-23 11:55:34,580 INFO L273 TraceCheckUtils]: 27: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,581 INFO L273 TraceCheckUtils]: 28: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,581 INFO L273 TraceCheckUtils]: 29: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,581 INFO L273 TraceCheckUtils]: 30: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,581 INFO L273 TraceCheckUtils]: 31: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,581 INFO L273 TraceCheckUtils]: 32: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,582 INFO L273 TraceCheckUtils]: 33: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,582 INFO L273 TraceCheckUtils]: 34: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,582 INFO L273 TraceCheckUtils]: 35: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,582 INFO L273 TraceCheckUtils]: 36: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,583 INFO L273 TraceCheckUtils]: 37: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,583 INFO L273 TraceCheckUtils]: 38: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,583 INFO L273 TraceCheckUtils]: 39: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,583 INFO L273 TraceCheckUtils]: 40: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,584 INFO L273 TraceCheckUtils]: 41: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,584 INFO L273 TraceCheckUtils]: 42: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,584 INFO L273 TraceCheckUtils]: 43: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,584 INFO L273 TraceCheckUtils]: 44: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,584 INFO L273 TraceCheckUtils]: 45: Hoare triple {7032#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7032#false} is VALID [2018-11-23 11:55:34,584 INFO L273 TraceCheckUtils]: 46: Hoare triple {7032#false} assume !(~i~0 < 100000); {7032#false} is VALID [2018-11-23 11:55:34,585 INFO L273 TraceCheckUtils]: 47: Hoare triple {7032#false} havoc ~x~0;~x~0 := 0; {7032#false} is VALID [2018-11-23 11:55:34,585 INFO L273 TraceCheckUtils]: 48: Hoare triple {7032#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7032#false} is VALID [2018-11-23 11:55:34,585 INFO L256 TraceCheckUtils]: 49: Hoare triple {7032#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {7032#false} is VALID [2018-11-23 11:55:34,585 INFO L273 TraceCheckUtils]: 50: Hoare triple {7032#false} ~cond := #in~cond; {7032#false} is VALID [2018-11-23 11:55:34,585 INFO L273 TraceCheckUtils]: 51: Hoare triple {7032#false} assume 0 == ~cond; {7032#false} is VALID [2018-11-23 11:55:34,585 INFO L273 TraceCheckUtils]: 52: Hoare triple {7032#false} assume !false; {7032#false} is VALID [2018-11-23 11:55:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-23 11:55:34,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:34,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 11:55:34,612 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-11-23 11:55:34,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:34,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:55:34,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:34,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:55:34,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:55:34,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:55:34,643 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 23 states. [2018-11-23 11:55:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:35,712 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-11-23 11:55:35,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:55:35,712 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-11-23 11:55:35,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:55:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 78 transitions. [2018-11-23 11:55:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:55:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 78 transitions. [2018-11-23 11:55:35,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 78 transitions. [2018-11-23 11:55:35,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:35,799 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:55:35,799 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:55:35,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 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-23 11:55:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:55:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 11:55:35,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:35,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-23 11:55:35,931 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 11:55:35,931 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 11:55:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:35,932 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 11:55:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-23 11:55:35,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:35,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:35,933 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 11:55:35,933 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 11:55:35,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:35,934 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 11:55:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-23 11:55:35,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:35,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:35,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:35,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:55:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-23 11:55:35,936 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 53 [2018-11-23 11:55:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:35,936 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-23 11:55:35,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:55:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-23 11:55:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:55:35,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:35,937 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:35,938 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:35,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:35,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2076716410, now seen corresponding path program 20 times [2018-11-23 11:55:35,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:35,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:35,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:35,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:35,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:36,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {7605#true} call ULTIMATE.init(); {7605#true} is VALID [2018-11-23 11:55:36,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {7605#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7605#true} is VALID [2018-11-23 11:55:36,496 INFO L273 TraceCheckUtils]: 2: Hoare triple {7605#true} assume true; {7605#true} is VALID [2018-11-23 11:55:36,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7605#true} {7605#true} #61#return; {7605#true} is VALID [2018-11-23 11:55:36,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {7605#true} call #t~ret2 := main(); {7605#true} is VALID [2018-11-23 11:55:36,497 INFO L273 TraceCheckUtils]: 5: Hoare triple {7605#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7607#(= main_~i~0 0)} is VALID [2018-11-23 11:55:36,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {7607#(= 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; {7608#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:36,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {7608#(<= 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; {7609#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:36,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {7609#(<= 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; {7610#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:36,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {7610#(<= 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; {7611#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:36,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {7611#(<= 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; {7612#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:36,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {7612#(<= 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; {7613#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:36,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {7613#(<= 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; {7614#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:36,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {7614#(<= 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; {7615#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:36,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {7615#(<= 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; {7616#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:36,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {7616#(<= 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; {7617#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:36,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {7617#(<= 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; {7618#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:36,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {7618#(<= 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; {7619#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:36,508 INFO L273 TraceCheckUtils]: 18: Hoare triple {7619#(<= 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; {7620#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:36,509 INFO L273 TraceCheckUtils]: 19: Hoare triple {7620#(<= 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; {7621#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:36,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {7621#(<= 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; {7622#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:36,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {7622#(<= 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; {7623#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:36,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {7623#(<= 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; {7624#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:36,513 INFO L273 TraceCheckUtils]: 23: Hoare triple {7624#(<= 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; {7625#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:36,514 INFO L273 TraceCheckUtils]: 24: Hoare triple {7625#(<= 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; {7626#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:36,515 INFO L273 TraceCheckUtils]: 25: Hoare triple {7626#(<= 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; {7627#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:36,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {7627#(<= main_~i~0 20)} assume !(~i~0 < 100000); {7606#false} is VALID [2018-11-23 11:55:36,516 INFO L273 TraceCheckUtils]: 27: Hoare triple {7606#false} ~i~0 := 0; {7606#false} is VALID [2018-11-23 11:55:36,516 INFO L273 TraceCheckUtils]: 28: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,516 INFO L273 TraceCheckUtils]: 29: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,516 INFO L273 TraceCheckUtils]: 30: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,517 INFO L273 TraceCheckUtils]: 32: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,517 INFO L273 TraceCheckUtils]: 33: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,517 INFO L273 TraceCheckUtils]: 34: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,517 INFO L273 TraceCheckUtils]: 35: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,517 INFO L273 TraceCheckUtils]: 36: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,518 INFO L273 TraceCheckUtils]: 37: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,518 INFO L273 TraceCheckUtils]: 38: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,518 INFO L273 TraceCheckUtils]: 39: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,518 INFO L273 TraceCheckUtils]: 40: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,518 INFO L273 TraceCheckUtils]: 41: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,519 INFO L273 TraceCheckUtils]: 42: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,519 INFO L273 TraceCheckUtils]: 43: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,519 INFO L273 TraceCheckUtils]: 44: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,519 INFO L273 TraceCheckUtils]: 45: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,519 INFO L273 TraceCheckUtils]: 46: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,520 INFO L273 TraceCheckUtils]: 47: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,520 INFO L273 TraceCheckUtils]: 48: Hoare triple {7606#false} assume !(~i~0 < 100000); {7606#false} is VALID [2018-11-23 11:55:36,520 INFO L273 TraceCheckUtils]: 49: Hoare triple {7606#false} havoc ~x~0;~x~0 := 0; {7606#false} is VALID [2018-11-23 11:55:36,520 INFO L273 TraceCheckUtils]: 50: Hoare triple {7606#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7606#false} is VALID [2018-11-23 11:55:36,520 INFO L256 TraceCheckUtils]: 51: Hoare triple {7606#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {7606#false} is VALID [2018-11-23 11:55:36,521 INFO L273 TraceCheckUtils]: 52: Hoare triple {7606#false} ~cond := #in~cond; {7606#false} is VALID [2018-11-23 11:55:36,521 INFO L273 TraceCheckUtils]: 53: Hoare triple {7606#false} assume 0 == ~cond; {7606#false} is VALID [2018-11-23 11:55:36,521 INFO L273 TraceCheckUtils]: 54: Hoare triple {7606#false} assume !false; {7606#false} is VALID [2018-11-23 11:55:36,523 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-23 11:55:36,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:36,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:36,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:36,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:36,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:36,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:36,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {7605#true} call ULTIMATE.init(); {7605#true} is VALID [2018-11-23 11:55:36,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {7605#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7605#true} is VALID [2018-11-23 11:55:36,728 INFO L273 TraceCheckUtils]: 2: Hoare triple {7605#true} assume true; {7605#true} is VALID [2018-11-23 11:55:36,728 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7605#true} {7605#true} #61#return; {7605#true} is VALID [2018-11-23 11:55:36,728 INFO L256 TraceCheckUtils]: 4: Hoare triple {7605#true} call #t~ret2 := main(); {7605#true} is VALID [2018-11-23 11:55:36,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {7605#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7646#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:36,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {7646#(<= 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; {7608#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:36,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {7608#(<= 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; {7609#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:36,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {7609#(<= 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; {7610#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:36,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {7610#(<= 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; {7611#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:36,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {7611#(<= 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; {7612#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:36,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {7612#(<= 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; {7613#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:36,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {7613#(<= 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; {7614#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:36,735 INFO L273 TraceCheckUtils]: 13: Hoare triple {7614#(<= 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; {7615#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:36,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {7615#(<= 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; {7616#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:36,737 INFO L273 TraceCheckUtils]: 15: Hoare triple {7616#(<= 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; {7617#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:36,737 INFO L273 TraceCheckUtils]: 16: Hoare triple {7617#(<= 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; {7618#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:36,738 INFO L273 TraceCheckUtils]: 17: Hoare triple {7618#(<= 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; {7619#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:36,739 INFO L273 TraceCheckUtils]: 18: Hoare triple {7619#(<= 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; {7620#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:36,740 INFO L273 TraceCheckUtils]: 19: Hoare triple {7620#(<= 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; {7621#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:36,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {7621#(<= 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; {7622#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:36,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {7622#(<= 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; {7623#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:36,743 INFO L273 TraceCheckUtils]: 22: Hoare triple {7623#(<= 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; {7624#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:36,744 INFO L273 TraceCheckUtils]: 23: Hoare triple {7624#(<= 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; {7625#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:36,745 INFO L273 TraceCheckUtils]: 24: Hoare triple {7625#(<= 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; {7626#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:36,746 INFO L273 TraceCheckUtils]: 25: Hoare triple {7626#(<= 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; {7627#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:36,747 INFO L273 TraceCheckUtils]: 26: Hoare triple {7627#(<= main_~i~0 20)} assume !(~i~0 < 100000); {7606#false} is VALID [2018-11-23 11:55:36,747 INFO L273 TraceCheckUtils]: 27: Hoare triple {7606#false} ~i~0 := 0; {7606#false} is VALID [2018-11-23 11:55:36,747 INFO L273 TraceCheckUtils]: 28: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,747 INFO L273 TraceCheckUtils]: 29: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,747 INFO L273 TraceCheckUtils]: 30: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,748 INFO L273 TraceCheckUtils]: 31: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,748 INFO L273 TraceCheckUtils]: 32: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,748 INFO L273 TraceCheckUtils]: 33: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,748 INFO L273 TraceCheckUtils]: 34: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,748 INFO L273 TraceCheckUtils]: 35: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,749 INFO L273 TraceCheckUtils]: 36: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,749 INFO L273 TraceCheckUtils]: 37: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,749 INFO L273 TraceCheckUtils]: 38: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,749 INFO L273 TraceCheckUtils]: 39: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,749 INFO L273 TraceCheckUtils]: 41: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,750 INFO L273 TraceCheckUtils]: 42: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,750 INFO L273 TraceCheckUtils]: 43: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,750 INFO L273 TraceCheckUtils]: 44: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,750 INFO L273 TraceCheckUtils]: 45: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,750 INFO L273 TraceCheckUtils]: 46: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,750 INFO L273 TraceCheckUtils]: 47: Hoare triple {7606#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7606#false} is VALID [2018-11-23 11:55:36,750 INFO L273 TraceCheckUtils]: 48: Hoare triple {7606#false} assume !(~i~0 < 100000); {7606#false} is VALID [2018-11-23 11:55:36,750 INFO L273 TraceCheckUtils]: 49: Hoare triple {7606#false} havoc ~x~0;~x~0 := 0; {7606#false} is VALID [2018-11-23 11:55:36,751 INFO L273 TraceCheckUtils]: 50: Hoare triple {7606#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7606#false} is VALID [2018-11-23 11:55:36,751 INFO L256 TraceCheckUtils]: 51: Hoare triple {7606#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {7606#false} is VALID [2018-11-23 11:55:36,751 INFO L273 TraceCheckUtils]: 52: Hoare triple {7606#false} ~cond := #in~cond; {7606#false} is VALID [2018-11-23 11:55:36,751 INFO L273 TraceCheckUtils]: 53: Hoare triple {7606#false} assume 0 == ~cond; {7606#false} is VALID [2018-11-23 11:55:36,751 INFO L273 TraceCheckUtils]: 54: Hoare triple {7606#false} assume !false; {7606#false} is VALID [2018-11-23 11:55:36,753 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-23 11:55:36,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:36,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 11:55:36,772 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-11-23 11:55:36,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:36,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:55:36,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:36,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:55:36,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:55:36,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:55:36,802 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 24 states. [2018-11-23 11:55:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:37,243 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-11-23 11:55:37,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:55:37,243 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-11-23 11:55:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:55:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 80 transitions. [2018-11-23 11:55:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:55:37,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 80 transitions. [2018-11-23 11:55:37,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 80 transitions. [2018-11-23 11:55:37,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:37,327 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:55:37,328 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 11:55:37,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:55:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 11:55:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 11:55:37,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:37,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-23 11:55:37,515 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 11:55:37,515 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 11:55:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:37,516 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 11:55:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 11:55:37,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:37,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:37,517 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 11:55:37,517 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 11:55:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:37,518 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 11:55:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 11:55:37,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:37,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:37,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:37,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:55:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-23 11:55:37,520 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 55 [2018-11-23 11:55:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:37,520 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-23 11:55:37,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:55:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 11:55:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 11:55:37,520 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:37,521 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:37,521 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:37,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1931036901, now seen corresponding path program 21 times [2018-11-23 11:55:37,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:37,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:37,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:37,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:37,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {8200#true} call ULTIMATE.init(); {8200#true} is VALID [2018-11-23 11:55:37,886 INFO L273 TraceCheckUtils]: 1: Hoare triple {8200#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8200#true} is VALID [2018-11-23 11:55:37,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {8200#true} assume true; {8200#true} is VALID [2018-11-23 11:55:37,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8200#true} {8200#true} #61#return; {8200#true} is VALID [2018-11-23 11:55:37,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {8200#true} call #t~ret2 := main(); {8200#true} is VALID [2018-11-23 11:55:37,887 INFO L273 TraceCheckUtils]: 5: Hoare triple {8200#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8202#(= main_~i~0 0)} is VALID [2018-11-23 11:55:37,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {8202#(= 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; {8203#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:37,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {8203#(<= 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; {8204#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:37,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {8204#(<= 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; {8205#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:37,889 INFO L273 TraceCheckUtils]: 9: Hoare triple {8205#(<= 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; {8206#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:37,890 INFO L273 TraceCheckUtils]: 10: Hoare triple {8206#(<= 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; {8207#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:37,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {8207#(<= 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; {8208#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:37,892 INFO L273 TraceCheckUtils]: 12: Hoare triple {8208#(<= 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; {8209#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:37,893 INFO L273 TraceCheckUtils]: 13: Hoare triple {8209#(<= 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; {8210#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:37,894 INFO L273 TraceCheckUtils]: 14: Hoare triple {8210#(<= 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; {8211#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:37,895 INFO L273 TraceCheckUtils]: 15: Hoare triple {8211#(<= 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; {8212#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:37,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {8212#(<= 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; {8213#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:37,897 INFO L273 TraceCheckUtils]: 17: Hoare triple {8213#(<= 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; {8214#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:37,898 INFO L273 TraceCheckUtils]: 18: Hoare triple {8214#(<= 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; {8215#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:37,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {8215#(<= 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; {8216#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:37,900 INFO L273 TraceCheckUtils]: 20: Hoare triple {8216#(<= 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; {8217#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:37,901 INFO L273 TraceCheckUtils]: 21: Hoare triple {8217#(<= 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; {8218#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:37,902 INFO L273 TraceCheckUtils]: 22: Hoare triple {8218#(<= 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; {8219#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:37,903 INFO L273 TraceCheckUtils]: 23: Hoare triple {8219#(<= 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; {8220#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:37,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {8220#(<= 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; {8221#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:37,905 INFO L273 TraceCheckUtils]: 25: Hoare triple {8221#(<= 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; {8222#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:37,906 INFO L273 TraceCheckUtils]: 26: Hoare triple {8222#(<= 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; {8223#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:37,906 INFO L273 TraceCheckUtils]: 27: Hoare triple {8223#(<= main_~i~0 21)} assume !(~i~0 < 100000); {8201#false} is VALID [2018-11-23 11:55:37,907 INFO L273 TraceCheckUtils]: 28: Hoare triple {8201#false} ~i~0 := 0; {8201#false} is VALID [2018-11-23 11:55:37,907 INFO L273 TraceCheckUtils]: 29: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,907 INFO L273 TraceCheckUtils]: 30: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,907 INFO L273 TraceCheckUtils]: 31: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,907 INFO L273 TraceCheckUtils]: 32: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,908 INFO L273 TraceCheckUtils]: 33: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,908 INFO L273 TraceCheckUtils]: 34: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,908 INFO L273 TraceCheckUtils]: 35: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,908 INFO L273 TraceCheckUtils]: 36: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,908 INFO L273 TraceCheckUtils]: 37: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,909 INFO L273 TraceCheckUtils]: 38: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,909 INFO L273 TraceCheckUtils]: 39: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,909 INFO L273 TraceCheckUtils]: 40: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,909 INFO L273 TraceCheckUtils]: 41: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,909 INFO L273 TraceCheckUtils]: 42: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,910 INFO L273 TraceCheckUtils]: 43: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,910 INFO L273 TraceCheckUtils]: 44: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,910 INFO L273 TraceCheckUtils]: 45: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,910 INFO L273 TraceCheckUtils]: 46: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,910 INFO L273 TraceCheckUtils]: 47: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,910 INFO L273 TraceCheckUtils]: 48: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,910 INFO L273 TraceCheckUtils]: 49: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:37,910 INFO L273 TraceCheckUtils]: 50: Hoare triple {8201#false} assume !(~i~0 < 100000); {8201#false} is VALID [2018-11-23 11:55:37,911 INFO L273 TraceCheckUtils]: 51: Hoare triple {8201#false} havoc ~x~0;~x~0 := 0; {8201#false} is VALID [2018-11-23 11:55:37,911 INFO L273 TraceCheckUtils]: 52: Hoare triple {8201#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8201#false} is VALID [2018-11-23 11:55:37,911 INFO L256 TraceCheckUtils]: 53: Hoare triple {8201#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {8201#false} is VALID [2018-11-23 11:55:37,911 INFO L273 TraceCheckUtils]: 54: Hoare triple {8201#false} ~cond := #in~cond; {8201#false} is VALID [2018-11-23 11:55:37,911 INFO L273 TraceCheckUtils]: 55: Hoare triple {8201#false} assume 0 == ~cond; {8201#false} is VALID [2018-11-23 11:55:37,911 INFO L273 TraceCheckUtils]: 56: Hoare triple {8201#false} assume !false; {8201#false} is VALID [2018-11-23 11:55:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-23 11:55:37,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:37,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:37,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:39,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 11:55:39,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:39,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:40,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {8200#true} call ULTIMATE.init(); {8200#true} is VALID [2018-11-23 11:55:40,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {8200#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8200#true} is VALID [2018-11-23 11:55:40,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {8200#true} assume true; {8200#true} is VALID [2018-11-23 11:55:40,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8200#true} {8200#true} #61#return; {8200#true} is VALID [2018-11-23 11:55:40,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {8200#true} call #t~ret2 := main(); {8200#true} is VALID [2018-11-23 11:55:40,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {8200#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8242#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:40,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {8242#(<= 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; {8203#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:40,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {8203#(<= 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; {8204#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:40,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {8204#(<= 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; {8205#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:40,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {8205#(<= 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; {8206#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:40,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {8206#(<= 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; {8207#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:40,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {8207#(<= 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; {8208#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:40,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {8208#(<= 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; {8209#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:40,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {8209#(<= 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; {8210#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:40,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {8210#(<= 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; {8211#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:40,092 INFO L273 TraceCheckUtils]: 15: Hoare triple {8211#(<= 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; {8212#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:40,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {8212#(<= 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; {8213#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:40,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {8213#(<= 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; {8214#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:40,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {8214#(<= 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; {8215#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:40,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {8215#(<= 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; {8216#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:40,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {8216#(<= 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; {8217#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:40,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {8217#(<= 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; {8218#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:40,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {8218#(<= 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; {8219#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:40,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {8219#(<= 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; {8220#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:40,100 INFO L273 TraceCheckUtils]: 24: Hoare triple {8220#(<= 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; {8221#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:40,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {8221#(<= 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; {8222#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:40,102 INFO L273 TraceCheckUtils]: 26: Hoare triple {8222#(<= 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; {8223#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:40,103 INFO L273 TraceCheckUtils]: 27: Hoare triple {8223#(<= main_~i~0 21)} assume !(~i~0 < 100000); {8201#false} is VALID [2018-11-23 11:55:40,103 INFO L273 TraceCheckUtils]: 28: Hoare triple {8201#false} ~i~0 := 0; {8201#false} is VALID [2018-11-23 11:55:40,104 INFO L273 TraceCheckUtils]: 29: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,104 INFO L273 TraceCheckUtils]: 30: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,104 INFO L273 TraceCheckUtils]: 31: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,104 INFO L273 TraceCheckUtils]: 32: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,104 INFO L273 TraceCheckUtils]: 33: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,105 INFO L273 TraceCheckUtils]: 34: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,105 INFO L273 TraceCheckUtils]: 35: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,105 INFO L273 TraceCheckUtils]: 36: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,105 INFO L273 TraceCheckUtils]: 37: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,105 INFO L273 TraceCheckUtils]: 38: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,105 INFO L273 TraceCheckUtils]: 39: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,106 INFO L273 TraceCheckUtils]: 40: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,106 INFO L273 TraceCheckUtils]: 41: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,106 INFO L273 TraceCheckUtils]: 42: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,106 INFO L273 TraceCheckUtils]: 43: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,107 INFO L273 TraceCheckUtils]: 44: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,107 INFO L273 TraceCheckUtils]: 45: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,107 INFO L273 TraceCheckUtils]: 46: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,107 INFO L273 TraceCheckUtils]: 47: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,107 INFO L273 TraceCheckUtils]: 48: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,108 INFO L273 TraceCheckUtils]: 49: Hoare triple {8201#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8201#false} is VALID [2018-11-23 11:55:40,108 INFO L273 TraceCheckUtils]: 50: Hoare triple {8201#false} assume !(~i~0 < 100000); {8201#false} is VALID [2018-11-23 11:55:40,108 INFO L273 TraceCheckUtils]: 51: Hoare triple {8201#false} havoc ~x~0;~x~0 := 0; {8201#false} is VALID [2018-11-23 11:55:40,108 INFO L273 TraceCheckUtils]: 52: Hoare triple {8201#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8201#false} is VALID [2018-11-23 11:55:40,108 INFO L256 TraceCheckUtils]: 53: Hoare triple {8201#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {8201#false} is VALID [2018-11-23 11:55:40,108 INFO L273 TraceCheckUtils]: 54: Hoare triple {8201#false} ~cond := #in~cond; {8201#false} is VALID [2018-11-23 11:55:40,108 INFO L273 TraceCheckUtils]: 55: Hoare triple {8201#false} assume 0 == ~cond; {8201#false} is VALID [2018-11-23 11:55:40,108 INFO L273 TraceCheckUtils]: 56: Hoare triple {8201#false} assume !false; {8201#false} is VALID [2018-11-23 11:55:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-23 11:55:40,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:40,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 11:55:40,133 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-11-23 11:55:40,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:40,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:55:40,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:40,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:55:40,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:55:40,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:55:40,165 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 25 states. [2018-11-23 11:55:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:40,688 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-11-23 11:55:40,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:55:40,688 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-11-23 11:55:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:55:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 82 transitions. [2018-11-23 11:55:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:55:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 82 transitions. [2018-11-23 11:55:40,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 82 transitions. [2018-11-23 11:55:40,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:40,775 INFO L225 Difference]: With dead ends: 98 [2018-11-23 11:55:40,775 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 11:55:40,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:55:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 11:55:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 11:55:40,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:40,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:40,825 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:40,825 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:40,827 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 11:55:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 11:55:40,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:40,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:40,828 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:40,828 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:40,830 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 11:55:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 11:55:40,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:40,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:40,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:40,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:55:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-11-23 11:55:40,832 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2018-11-23 11:55:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:40,832 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-11-23 11:55:40,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:55:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 11:55:40,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 11:55:40,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:40,833 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:40,833 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:40,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:40,834 INFO L82 PathProgramCache]: Analyzing trace with hash 173663974, now seen corresponding path program 22 times [2018-11-23 11:55:40,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:40,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:40,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:40,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:40,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:41,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {8816#true} call ULTIMATE.init(); {8816#true} is VALID [2018-11-23 11:55:41,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {8816#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8816#true} is VALID [2018-11-23 11:55:41,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {8816#true} assume true; {8816#true} is VALID [2018-11-23 11:55:41,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8816#true} {8816#true} #61#return; {8816#true} is VALID [2018-11-23 11:55:41,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {8816#true} call #t~ret2 := main(); {8816#true} is VALID [2018-11-23 11:55:41,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {8816#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8818#(= main_~i~0 0)} is VALID [2018-11-23 11:55:41,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {8818#(= 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; {8819#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:41,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {8819#(<= 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; {8820#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:41,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {8820#(<= 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; {8821#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:41,418 INFO L273 TraceCheckUtils]: 9: Hoare triple {8821#(<= 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; {8822#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:41,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {8822#(<= 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; {8823#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:41,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {8823#(<= 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; {8824#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:41,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {8824#(<= 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; {8825#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:41,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {8825#(<= 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; {8826#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:41,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {8826#(<= 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; {8827#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:41,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {8827#(<= 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; {8828#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:41,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {8828#(<= 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; {8829#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:41,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {8829#(<= 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; {8830#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:41,426 INFO L273 TraceCheckUtils]: 18: Hoare triple {8830#(<= 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; {8831#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:41,427 INFO L273 TraceCheckUtils]: 19: Hoare triple {8831#(<= 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; {8832#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:41,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {8832#(<= 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; {8833#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:41,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {8833#(<= 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; {8834#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:41,430 INFO L273 TraceCheckUtils]: 22: Hoare triple {8834#(<= 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; {8835#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:41,431 INFO L273 TraceCheckUtils]: 23: Hoare triple {8835#(<= 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; {8836#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:41,431 INFO L273 TraceCheckUtils]: 24: Hoare triple {8836#(<= 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; {8837#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:41,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {8837#(<= 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; {8838#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:41,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {8838#(<= 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; {8839#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:41,434 INFO L273 TraceCheckUtils]: 27: Hoare triple {8839#(<= 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; {8840#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:41,435 INFO L273 TraceCheckUtils]: 28: Hoare triple {8840#(<= main_~i~0 22)} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 11:55:41,435 INFO L273 TraceCheckUtils]: 29: Hoare triple {8817#false} ~i~0 := 0; {8817#false} is VALID [2018-11-23 11:55:41,435 INFO L273 TraceCheckUtils]: 30: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,436 INFO L273 TraceCheckUtils]: 31: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,436 INFO L273 TraceCheckUtils]: 32: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,436 INFO L273 TraceCheckUtils]: 33: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,436 INFO L273 TraceCheckUtils]: 34: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,436 INFO L273 TraceCheckUtils]: 35: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,437 INFO L273 TraceCheckUtils]: 36: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,437 INFO L273 TraceCheckUtils]: 37: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,437 INFO L273 TraceCheckUtils]: 38: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,437 INFO L273 TraceCheckUtils]: 39: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,437 INFO L273 TraceCheckUtils]: 40: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,438 INFO L273 TraceCheckUtils]: 41: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,438 INFO L273 TraceCheckUtils]: 42: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,438 INFO L273 TraceCheckUtils]: 43: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,438 INFO L273 TraceCheckUtils]: 44: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,438 INFO L273 TraceCheckUtils]: 45: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,438 INFO L273 TraceCheckUtils]: 46: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,439 INFO L273 TraceCheckUtils]: 47: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,439 INFO L273 TraceCheckUtils]: 48: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,439 INFO L273 TraceCheckUtils]: 49: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,439 INFO L273 TraceCheckUtils]: 50: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,439 INFO L273 TraceCheckUtils]: 51: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,439 INFO L273 TraceCheckUtils]: 52: Hoare triple {8817#false} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 11:55:41,439 INFO L273 TraceCheckUtils]: 53: Hoare triple {8817#false} havoc ~x~0;~x~0 := 0; {8817#false} is VALID [2018-11-23 11:55:41,439 INFO L273 TraceCheckUtils]: 54: Hoare triple {8817#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8817#false} is VALID [2018-11-23 11:55:41,439 INFO L256 TraceCheckUtils]: 55: Hoare triple {8817#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {8817#false} is VALID [2018-11-23 11:55:41,440 INFO L273 TraceCheckUtils]: 56: Hoare triple {8817#false} ~cond := #in~cond; {8817#false} is VALID [2018-11-23 11:55:41,440 INFO L273 TraceCheckUtils]: 57: Hoare triple {8817#false} assume 0 == ~cond; {8817#false} is VALID [2018-11-23 11:55:41,440 INFO L273 TraceCheckUtils]: 58: Hoare triple {8817#false} assume !false; {8817#false} is VALID [2018-11-23 11:55:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 11:55:41,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:41,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:41,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:41,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:41,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:41,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:41,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {8816#true} call ULTIMATE.init(); {8816#true} is VALID [2018-11-23 11:55:41,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {8816#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8816#true} is VALID [2018-11-23 11:55:41,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {8816#true} assume true; {8816#true} is VALID [2018-11-23 11:55:41,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8816#true} {8816#true} #61#return; {8816#true} is VALID [2018-11-23 11:55:41,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {8816#true} call #t~ret2 := main(); {8816#true} is VALID [2018-11-23 11:55:41,775 INFO L273 TraceCheckUtils]: 5: Hoare triple {8816#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8859#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:41,776 INFO L273 TraceCheckUtils]: 6: Hoare triple {8859#(<= 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; {8819#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:41,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {8819#(<= 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; {8820#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:41,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {8820#(<= 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; {8821#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:41,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {8821#(<= 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; {8822#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:41,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {8822#(<= 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; {8823#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:41,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {8823#(<= 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; {8824#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:41,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {8824#(<= 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; {8825#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:41,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {8825#(<= 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; {8826#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:41,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {8826#(<= 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; {8827#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:41,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {8827#(<= 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; {8828#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:41,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {8828#(<= 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; {8829#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:41,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {8829#(<= 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; {8830#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:41,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {8830#(<= 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; {8831#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:41,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {8831#(<= 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; {8832#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:41,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {8832#(<= 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; {8833#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:41,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {8833#(<= 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; {8834#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:41,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {8834#(<= 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; {8835#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:41,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {8835#(<= 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; {8836#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:41,804 INFO L273 TraceCheckUtils]: 24: Hoare triple {8836#(<= 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; {8837#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:41,805 INFO L273 TraceCheckUtils]: 25: Hoare triple {8837#(<= 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; {8838#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:41,806 INFO L273 TraceCheckUtils]: 26: Hoare triple {8838#(<= 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; {8839#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:41,807 INFO L273 TraceCheckUtils]: 27: Hoare triple {8839#(<= 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; {8840#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:41,808 INFO L273 TraceCheckUtils]: 28: Hoare triple {8840#(<= main_~i~0 22)} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 11:55:41,808 INFO L273 TraceCheckUtils]: 29: Hoare triple {8817#false} ~i~0 := 0; {8817#false} is VALID [2018-11-23 11:55:41,808 INFO L273 TraceCheckUtils]: 30: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,808 INFO L273 TraceCheckUtils]: 31: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,808 INFO L273 TraceCheckUtils]: 32: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,809 INFO L273 TraceCheckUtils]: 33: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,809 INFO L273 TraceCheckUtils]: 34: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,809 INFO L273 TraceCheckUtils]: 35: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,809 INFO L273 TraceCheckUtils]: 36: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,809 INFO L273 TraceCheckUtils]: 37: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,810 INFO L273 TraceCheckUtils]: 38: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,810 INFO L273 TraceCheckUtils]: 39: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,810 INFO L273 TraceCheckUtils]: 40: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,810 INFO L273 TraceCheckUtils]: 41: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,810 INFO L273 TraceCheckUtils]: 42: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,811 INFO L273 TraceCheckUtils]: 43: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,811 INFO L273 TraceCheckUtils]: 44: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,811 INFO L273 TraceCheckUtils]: 45: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,811 INFO L273 TraceCheckUtils]: 46: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,811 INFO L273 TraceCheckUtils]: 47: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,812 INFO L273 TraceCheckUtils]: 48: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,812 INFO L273 TraceCheckUtils]: 49: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,812 INFO L273 TraceCheckUtils]: 50: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,812 INFO L273 TraceCheckUtils]: 51: Hoare triple {8817#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8817#false} is VALID [2018-11-23 11:55:41,812 INFO L273 TraceCheckUtils]: 52: Hoare triple {8817#false} assume !(~i~0 < 100000); {8817#false} is VALID [2018-11-23 11:55:41,813 INFO L273 TraceCheckUtils]: 53: Hoare triple {8817#false} havoc ~x~0;~x~0 := 0; {8817#false} is VALID [2018-11-23 11:55:41,813 INFO L273 TraceCheckUtils]: 54: Hoare triple {8817#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8817#false} is VALID [2018-11-23 11:55:41,813 INFO L256 TraceCheckUtils]: 55: Hoare triple {8817#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {8817#false} is VALID [2018-11-23 11:55:41,813 INFO L273 TraceCheckUtils]: 56: Hoare triple {8817#false} ~cond := #in~cond; {8817#false} is VALID [2018-11-23 11:55:41,813 INFO L273 TraceCheckUtils]: 57: Hoare triple {8817#false} assume 0 == ~cond; {8817#false} is VALID [2018-11-23 11:55:41,813 INFO L273 TraceCheckUtils]: 58: Hoare triple {8817#false} assume !false; {8817#false} is VALID [2018-11-23 11:55:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 11:55:41,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:41,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 11:55:41,835 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-23 11:55:41,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:41,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:55:41,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:41,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:55:41,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:55:41,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:55:41,868 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 26 states. [2018-11-23 11:55:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:42,316 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-23 11:55:42,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:55:42,316 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-23 11:55:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:42,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:55:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 84 transitions. [2018-11-23 11:55:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:55:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 84 transitions. [2018-11-23 11:55:42,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 84 transitions. [2018-11-23 11:55:42,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:42,408 INFO L225 Difference]: With dead ends: 101 [2018-11-23 11:55:42,408 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 11:55:42,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:55:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 11:55:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 11:55:42,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:42,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-23 11:55:42,474 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 11:55:42,474 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 11:55:42,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:42,476 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 11:55:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 11:55:42,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:42,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:42,476 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 11:55:42,476 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 11:55:42,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:42,478 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 11:55:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 11:55:42,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:42,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:42,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:42,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:55:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-23 11:55:42,480 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 59 [2018-11-23 11:55:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:42,480 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-23 11:55:42,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:55:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 11:55:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:55:42,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:42,481 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:42,481 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:42,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:42,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1433416069, now seen corresponding path program 23 times [2018-11-23 11:55:42,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:42,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:42,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:42,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:42,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:42,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {9453#true} call ULTIMATE.init(); {9453#true} is VALID [2018-11-23 11:55:42,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {9453#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9453#true} is VALID [2018-11-23 11:55:42,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 11:55:42,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9453#true} {9453#true} #61#return; {9453#true} is VALID [2018-11-23 11:55:42,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {9453#true} call #t~ret2 := main(); {9453#true} is VALID [2018-11-23 11:55:42,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {9453#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9455#(= main_~i~0 0)} is VALID [2018-11-23 11:55:42,895 INFO L273 TraceCheckUtils]: 6: Hoare triple {9455#(= 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; {9456#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:42,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {9456#(<= 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; {9457#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:42,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {9457#(<= 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; {9458#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:42,898 INFO L273 TraceCheckUtils]: 9: Hoare triple {9458#(<= 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; {9459#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:42,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {9459#(<= 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; {9460#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:42,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {9460#(<= 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; {9461#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:42,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {9461#(<= 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; {9462#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:42,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {9462#(<= 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; {9463#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:42,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {9463#(<= 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; {9464#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:42,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {9464#(<= 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; {9465#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:42,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {9465#(<= 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; {9466#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:42,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {9466#(<= 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; {9467#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:42,906 INFO L273 TraceCheckUtils]: 18: Hoare triple {9467#(<= 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; {9468#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:42,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {9468#(<= 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; {9469#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:42,908 INFO L273 TraceCheckUtils]: 20: Hoare triple {9469#(<= 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; {9470#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:42,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {9470#(<= 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; {9471#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:42,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {9471#(<= 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; {9472#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:42,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {9472#(<= 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; {9473#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:42,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {9473#(<= 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; {9474#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:42,912 INFO L273 TraceCheckUtils]: 25: Hoare triple {9474#(<= 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; {9475#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:42,913 INFO L273 TraceCheckUtils]: 26: Hoare triple {9475#(<= 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; {9476#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:42,914 INFO L273 TraceCheckUtils]: 27: Hoare triple {9476#(<= 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; {9477#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:42,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {9477#(<= 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; {9478#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:42,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {9478#(<= main_~i~0 23)} assume !(~i~0 < 100000); {9454#false} is VALID [2018-11-23 11:55:42,916 INFO L273 TraceCheckUtils]: 30: Hoare triple {9454#false} ~i~0 := 0; {9454#false} is VALID [2018-11-23 11:55:42,916 INFO L273 TraceCheckUtils]: 31: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,916 INFO L273 TraceCheckUtils]: 32: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,917 INFO L273 TraceCheckUtils]: 33: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,917 INFO L273 TraceCheckUtils]: 34: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,917 INFO L273 TraceCheckUtils]: 35: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,917 INFO L273 TraceCheckUtils]: 36: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,917 INFO L273 TraceCheckUtils]: 37: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,918 INFO L273 TraceCheckUtils]: 38: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,918 INFO L273 TraceCheckUtils]: 39: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,918 INFO L273 TraceCheckUtils]: 40: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,918 INFO L273 TraceCheckUtils]: 41: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,918 INFO L273 TraceCheckUtils]: 42: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,919 INFO L273 TraceCheckUtils]: 43: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,919 INFO L273 TraceCheckUtils]: 44: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,919 INFO L273 TraceCheckUtils]: 45: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,919 INFO L273 TraceCheckUtils]: 46: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,919 INFO L273 TraceCheckUtils]: 47: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,919 INFO L273 TraceCheckUtils]: 48: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,919 INFO L273 TraceCheckUtils]: 49: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,920 INFO L273 TraceCheckUtils]: 50: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,920 INFO L273 TraceCheckUtils]: 51: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,920 INFO L273 TraceCheckUtils]: 52: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,920 INFO L273 TraceCheckUtils]: 53: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:55:42,920 INFO L273 TraceCheckUtils]: 54: Hoare triple {9454#false} assume !(~i~0 < 100000); {9454#false} is VALID [2018-11-23 11:55:42,920 INFO L273 TraceCheckUtils]: 55: Hoare triple {9454#false} havoc ~x~0;~x~0 := 0; {9454#false} is VALID [2018-11-23 11:55:42,920 INFO L273 TraceCheckUtils]: 56: Hoare triple {9454#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9454#false} is VALID [2018-11-23 11:55:42,920 INFO L256 TraceCheckUtils]: 57: Hoare triple {9454#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {9454#false} is VALID [2018-11-23 11:55:42,920 INFO L273 TraceCheckUtils]: 58: Hoare triple {9454#false} ~cond := #in~cond; {9454#false} is VALID [2018-11-23 11:55:42,921 INFO L273 TraceCheckUtils]: 59: Hoare triple {9454#false} assume 0 == ~cond; {9454#false} is VALID [2018-11-23 11:55:42,921 INFO L273 TraceCheckUtils]: 60: Hoare triple {9454#false} assume !false; {9454#false} is VALID [2018-11-23 11:55:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-23 11:55:42,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:42,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:42,932 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:56:40,007 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 11:56:40,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:40,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:40,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {9453#true} call ULTIMATE.init(); {9453#true} is VALID [2018-11-23 11:56:40,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {9453#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9453#true} is VALID [2018-11-23 11:56:40,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 11:56:40,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9453#true} {9453#true} #61#return; {9453#true} is VALID [2018-11-23 11:56:40,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {9453#true} call #t~ret2 := main(); {9453#true} is VALID [2018-11-23 11:56:40,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {9453#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9497#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:40,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {9497#(<= 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; {9456#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:40,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {9456#(<= 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; {9457#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:40,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {9457#(<= 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; {9458#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:40,251 INFO L273 TraceCheckUtils]: 9: Hoare triple {9458#(<= 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; {9459#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:40,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {9459#(<= 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; {9460#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:40,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {9460#(<= 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; {9461#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:40,253 INFO L273 TraceCheckUtils]: 12: Hoare triple {9461#(<= 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; {9462#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:40,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {9462#(<= 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; {9463#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:40,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {9463#(<= 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; {9464#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:40,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {9464#(<= 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; {9465#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:40,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {9465#(<= 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; {9466#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:40,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {9466#(<= 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; {9467#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:40,259 INFO L273 TraceCheckUtils]: 18: Hoare triple {9467#(<= 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; {9468#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:40,260 INFO L273 TraceCheckUtils]: 19: Hoare triple {9468#(<= 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; {9469#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:40,261 INFO L273 TraceCheckUtils]: 20: Hoare triple {9469#(<= 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; {9470#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:40,262 INFO L273 TraceCheckUtils]: 21: Hoare triple {9470#(<= 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; {9471#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:40,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {9471#(<= 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; {9472#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:40,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {9472#(<= 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; {9473#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:40,265 INFO L273 TraceCheckUtils]: 24: Hoare triple {9473#(<= 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; {9474#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:40,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {9474#(<= 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; {9475#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:40,266 INFO L273 TraceCheckUtils]: 26: Hoare triple {9475#(<= 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; {9476#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:40,267 INFO L273 TraceCheckUtils]: 27: Hoare triple {9476#(<= 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; {9477#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:40,268 INFO L273 TraceCheckUtils]: 28: Hoare triple {9477#(<= 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; {9478#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:40,269 INFO L273 TraceCheckUtils]: 29: Hoare triple {9478#(<= main_~i~0 23)} assume !(~i~0 < 100000); {9454#false} is VALID [2018-11-23 11:56:40,269 INFO L273 TraceCheckUtils]: 30: Hoare triple {9454#false} ~i~0 := 0; {9454#false} is VALID [2018-11-23 11:56:40,269 INFO L273 TraceCheckUtils]: 31: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,270 INFO L273 TraceCheckUtils]: 32: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,270 INFO L273 TraceCheckUtils]: 33: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,270 INFO L273 TraceCheckUtils]: 35: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,270 INFO L273 TraceCheckUtils]: 36: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,271 INFO L273 TraceCheckUtils]: 37: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,271 INFO L273 TraceCheckUtils]: 38: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,271 INFO L273 TraceCheckUtils]: 39: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,271 INFO L273 TraceCheckUtils]: 40: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,271 INFO L273 TraceCheckUtils]: 41: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,272 INFO L273 TraceCheckUtils]: 42: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,272 INFO L273 TraceCheckUtils]: 43: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,272 INFO L273 TraceCheckUtils]: 44: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,272 INFO L273 TraceCheckUtils]: 45: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,272 INFO L273 TraceCheckUtils]: 46: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,273 INFO L273 TraceCheckUtils]: 47: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,273 INFO L273 TraceCheckUtils]: 48: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,273 INFO L273 TraceCheckUtils]: 49: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,273 INFO L273 TraceCheckUtils]: 51: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,274 INFO L273 TraceCheckUtils]: 52: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {9454#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9454#false} is VALID [2018-11-23 11:56:40,274 INFO L273 TraceCheckUtils]: 54: Hoare triple {9454#false} assume !(~i~0 < 100000); {9454#false} is VALID [2018-11-23 11:56:40,274 INFO L273 TraceCheckUtils]: 55: Hoare triple {9454#false} havoc ~x~0;~x~0 := 0; {9454#false} is VALID [2018-11-23 11:56:40,274 INFO L273 TraceCheckUtils]: 56: Hoare triple {9454#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9454#false} is VALID [2018-11-23 11:56:40,274 INFO L256 TraceCheckUtils]: 57: Hoare triple {9454#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {9454#false} is VALID [2018-11-23 11:56:40,274 INFO L273 TraceCheckUtils]: 58: Hoare triple {9454#false} ~cond := #in~cond; {9454#false} is VALID [2018-11-23 11:56:40,274 INFO L273 TraceCheckUtils]: 59: Hoare triple {9454#false} assume 0 == ~cond; {9454#false} is VALID [2018-11-23 11:56:40,274 INFO L273 TraceCheckUtils]: 60: Hoare triple {9454#false} assume !false; {9454#false} is VALID [2018-11-23 11:56:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-23 11:56:40,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:40,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 11:56:40,304 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-11-23 11:56:40,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:40,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:56:40,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:40,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:56:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:56:40,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:56:40,338 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 27 states. [2018-11-23 11:56:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:40,933 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-11-23 11:56:40,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:56:40,934 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-11-23 11:56:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:56:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 86 transitions. [2018-11-23 11:56:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:56:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 86 transitions. [2018-11-23 11:56:40,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 86 transitions. [2018-11-23 11:56:41,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:41,113 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:56:41,113 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 11:56:41,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:56:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 11:56:41,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 11:56:41,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:41,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-23 11:56:41,164 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-23 11:56:41,164 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-23 11:56:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:41,166 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-23 11:56:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-23 11:56:41,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:41,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:41,167 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-23 11:56:41,167 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-23 11:56:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:41,168 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-23 11:56:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-23 11:56:41,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:41,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:41,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:41,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 11:56:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-23 11:56:41,170 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 61 [2018-11-23 11:56:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:41,171 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-23 11:56:41,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:56:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-23 11:56:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 11:56:41,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:41,172 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:41,172 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:41,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:41,172 INFO L82 PathProgramCache]: Analyzing trace with hash -482458810, now seen corresponding path program 24 times [2018-11-23 11:56:41,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:41,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:41,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:41,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:41,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:42,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {10111#true} call ULTIMATE.init(); {10111#true} is VALID [2018-11-23 11:56:42,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {10111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10111#true} is VALID [2018-11-23 11:56:42,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {10111#true} assume true; {10111#true} is VALID [2018-11-23 11:56:42,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10111#true} {10111#true} #61#return; {10111#true} is VALID [2018-11-23 11:56:42,344 INFO L256 TraceCheckUtils]: 4: Hoare triple {10111#true} call #t~ret2 := main(); {10111#true} is VALID [2018-11-23 11:56:42,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {10111#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10113#(= main_~i~0 0)} is VALID [2018-11-23 11:56:42,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {10113#(= 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; {10114#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:42,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {10114#(<= 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; {10115#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:42,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {10115#(<= 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; {10116#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:42,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {10116#(<= 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; {10117#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:42,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {10117#(<= 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; {10118#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:42,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {10118#(<= 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; {10119#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:42,348 INFO L273 TraceCheckUtils]: 12: Hoare triple {10119#(<= 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; {10120#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:42,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {10120#(<= 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; {10121#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:42,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {10121#(<= 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; {10122#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:42,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {10122#(<= 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; {10123#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:42,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {10123#(<= 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; {10124#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:42,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {10124#(<= 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; {10125#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:42,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {10125#(<= 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; {10126#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:42,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {10126#(<= 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; {10127#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:42,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {10127#(<= 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; {10128#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:42,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {10128#(<= 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; {10129#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:42,358 INFO L273 TraceCheckUtils]: 22: Hoare triple {10129#(<= 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; {10130#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:42,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {10130#(<= 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; {10131#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:42,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {10131#(<= 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; {10132#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:42,360 INFO L273 TraceCheckUtils]: 25: Hoare triple {10132#(<= 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; {10133#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:42,361 INFO L273 TraceCheckUtils]: 26: Hoare triple {10133#(<= 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; {10134#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:42,362 INFO L273 TraceCheckUtils]: 27: Hoare triple {10134#(<= 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; {10135#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:42,363 INFO L273 TraceCheckUtils]: 28: Hoare triple {10135#(<= 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; {10136#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:42,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {10136#(<= 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; {10137#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:42,365 INFO L273 TraceCheckUtils]: 30: Hoare triple {10137#(<= main_~i~0 24)} assume !(~i~0 < 100000); {10112#false} is VALID [2018-11-23 11:56:42,365 INFO L273 TraceCheckUtils]: 31: Hoare triple {10112#false} ~i~0 := 0; {10112#false} is VALID [2018-11-23 11:56:42,365 INFO L273 TraceCheckUtils]: 32: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,365 INFO L273 TraceCheckUtils]: 33: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,366 INFO L273 TraceCheckUtils]: 34: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,366 INFO L273 TraceCheckUtils]: 35: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,366 INFO L273 TraceCheckUtils]: 36: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,366 INFO L273 TraceCheckUtils]: 37: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,366 INFO L273 TraceCheckUtils]: 38: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,367 INFO L273 TraceCheckUtils]: 39: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,367 INFO L273 TraceCheckUtils]: 40: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,367 INFO L273 TraceCheckUtils]: 41: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,367 INFO L273 TraceCheckUtils]: 42: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,367 INFO L273 TraceCheckUtils]: 43: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,368 INFO L273 TraceCheckUtils]: 44: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,368 INFO L273 TraceCheckUtils]: 45: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,368 INFO L273 TraceCheckUtils]: 46: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,368 INFO L273 TraceCheckUtils]: 47: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,368 INFO L273 TraceCheckUtils]: 48: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,368 INFO L273 TraceCheckUtils]: 49: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,368 INFO L273 TraceCheckUtils]: 50: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,368 INFO L273 TraceCheckUtils]: 51: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,368 INFO L273 TraceCheckUtils]: 52: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,369 INFO L273 TraceCheckUtils]: 53: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,369 INFO L273 TraceCheckUtils]: 54: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,369 INFO L273 TraceCheckUtils]: 55: Hoare triple {10112#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10112#false} is VALID [2018-11-23 11:56:42,369 INFO L273 TraceCheckUtils]: 56: Hoare triple {10112#false} assume !(~i~0 < 100000); {10112#false} is VALID [2018-11-23 11:56:42,369 INFO L273 TraceCheckUtils]: 57: Hoare triple {10112#false} havoc ~x~0;~x~0 := 0; {10112#false} is VALID [2018-11-23 11:56:42,369 INFO L273 TraceCheckUtils]: 58: Hoare triple {10112#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10112#false} is VALID [2018-11-23 11:56:42,369 INFO L256 TraceCheckUtils]: 59: Hoare triple {10112#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {10112#false} is VALID [2018-11-23 11:56:42,369 INFO L273 TraceCheckUtils]: 60: Hoare triple {10112#false} ~cond := #in~cond; {10112#false} is VALID [2018-11-23 11:56:42,369 INFO L273 TraceCheckUtils]: 61: Hoare triple {10112#false} assume 0 == ~cond; {10112#false} is VALID [2018-11-23 11:56:42,370 INFO L273 TraceCheckUtils]: 62: Hoare triple {10112#false} assume !false; {10112#false} is VALID [2018-11-23 11:56:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 11:56:42,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:42,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:42,381 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:56:53,975 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:56:53,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:54,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:54,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {10111#true} call ULTIMATE.init(); {10111#true} is VALID [2018-11-23 11:56:54,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {10111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10111#true} is VALID [2018-11-23 11:56:54,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {10111#true} assume true; {10111#true} is VALID [2018-11-23 11:56:54,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10111#true} {10111#true} #61#return; {10111#true} is VALID [2018-11-23 11:56:54,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {10111#true} call #t~ret2 := main(); {10111#true} is VALID [2018-11-23 11:56:54,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {10111#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10111#true} is VALID [2018-11-23 11:56:54,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,214 INFO L273 TraceCheckUtils]: 9: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,216 INFO L273 TraceCheckUtils]: 19: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,216 INFO L273 TraceCheckUtils]: 20: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,216 INFO L273 TraceCheckUtils]: 21: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,216 INFO L273 TraceCheckUtils]: 22: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,217 INFO L273 TraceCheckUtils]: 23: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,217 INFO L273 TraceCheckUtils]: 24: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,217 INFO L273 TraceCheckUtils]: 26: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,217 INFO L273 TraceCheckUtils]: 27: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,217 INFO L273 TraceCheckUtils]: 28: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,217 INFO L273 TraceCheckUtils]: 29: Hoare triple {10111#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10111#true} is VALID [2018-11-23 11:56:54,217 INFO L273 TraceCheckUtils]: 30: Hoare triple {10111#true} assume !(~i~0 < 100000); {10111#true} is VALID [2018-11-23 11:56:54,218 INFO L273 TraceCheckUtils]: 31: Hoare triple {10111#true} ~i~0 := 0; {10234#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:54,218 INFO L273 TraceCheckUtils]: 32: Hoare triple {10234#(<= 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; {10114#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:54,219 INFO L273 TraceCheckUtils]: 33: Hoare triple {10114#(<= 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; {10115#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:54,220 INFO L273 TraceCheckUtils]: 34: Hoare triple {10115#(<= 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; {10116#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:54,220 INFO L273 TraceCheckUtils]: 35: Hoare triple {10116#(<= 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; {10117#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:54,221 INFO L273 TraceCheckUtils]: 36: Hoare triple {10117#(<= 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; {10118#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:54,222 INFO L273 TraceCheckUtils]: 37: Hoare triple {10118#(<= 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; {10119#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:54,222 INFO L273 TraceCheckUtils]: 38: Hoare triple {10119#(<= 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; {10120#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:54,223 INFO L273 TraceCheckUtils]: 39: Hoare triple {10120#(<= 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; {10121#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:54,224 INFO L273 TraceCheckUtils]: 40: Hoare triple {10121#(<= 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; {10122#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:54,225 INFO L273 TraceCheckUtils]: 41: Hoare triple {10122#(<= 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; {10123#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:54,226 INFO L273 TraceCheckUtils]: 42: Hoare triple {10123#(<= 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; {10124#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:54,227 INFO L273 TraceCheckUtils]: 43: Hoare triple {10124#(<= 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; {10125#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:54,228 INFO L273 TraceCheckUtils]: 44: Hoare triple {10125#(<= 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; {10126#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:54,229 INFO L273 TraceCheckUtils]: 45: Hoare triple {10126#(<= 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; {10127#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:54,230 INFO L273 TraceCheckUtils]: 46: Hoare triple {10127#(<= 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; {10128#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:54,231 INFO L273 TraceCheckUtils]: 47: Hoare triple {10128#(<= 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; {10129#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:54,232 INFO L273 TraceCheckUtils]: 48: Hoare triple {10129#(<= 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; {10130#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:54,233 INFO L273 TraceCheckUtils]: 49: Hoare triple {10130#(<= 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; {10131#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:54,234 INFO L273 TraceCheckUtils]: 50: Hoare triple {10131#(<= 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; {10132#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:54,234 INFO L273 TraceCheckUtils]: 51: Hoare triple {10132#(<= 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; {10133#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:54,235 INFO L273 TraceCheckUtils]: 52: Hoare triple {10133#(<= 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; {10134#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:54,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {10134#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10135#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:54,237 INFO L273 TraceCheckUtils]: 54: Hoare triple {10135#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10136#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:54,238 INFO L273 TraceCheckUtils]: 55: Hoare triple {10136#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10137#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:54,239 INFO L273 TraceCheckUtils]: 56: Hoare triple {10137#(<= main_~i~0 24)} assume !(~i~0 < 100000); {10112#false} is VALID [2018-11-23 11:56:54,239 INFO L273 TraceCheckUtils]: 57: Hoare triple {10112#false} havoc ~x~0;~x~0 := 0; {10112#false} is VALID [2018-11-23 11:56:54,239 INFO L273 TraceCheckUtils]: 58: Hoare triple {10112#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10112#false} is VALID [2018-11-23 11:56:54,240 INFO L256 TraceCheckUtils]: 59: Hoare triple {10112#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {10112#false} is VALID [2018-11-23 11:56:54,240 INFO L273 TraceCheckUtils]: 60: Hoare triple {10112#false} ~cond := #in~cond; {10112#false} is VALID [2018-11-23 11:56:54,240 INFO L273 TraceCheckUtils]: 61: Hoare triple {10112#false} assume 0 == ~cond; {10112#false} is VALID [2018-11-23 11:56:54,240 INFO L273 TraceCheckUtils]: 62: Hoare triple {10112#false} assume !false; {10112#false} is VALID [2018-11-23 11:56:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 11:56:54,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:54,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 11:56:54,269 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-11-23 11:56:54,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:54,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:56:54,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:54,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:56:54,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:56:54,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:56:54,349 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 28 states. [2018-11-23 11:56:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:54,998 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-23 11:56:54,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:56:54,998 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-11-23 11:56:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:54,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:56:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 88 transitions. [2018-11-23 11:56:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:56:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 88 transitions. [2018-11-23 11:56:55,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 88 transitions. [2018-11-23 11:56:55,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:55,128 INFO L225 Difference]: With dead ends: 107 [2018-11-23 11:56:55,128 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 11:56:55,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:56:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 11:56:55,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-23 11:56:55,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:55,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-23 11:56:55,206 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 11:56:55,206 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 11:56:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:55,208 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 11:56:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-23 11:56:55,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:55,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:55,209 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 11:56:55,209 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 11:56:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:55,210 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 11:56:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-23 11:56:55,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:55,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:55,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:55,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:56:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-11-23 11:56:55,212 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2018-11-23 11:56:55,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:55,212 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-23 11:56:55,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:56:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-23 11:56:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:56:55,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:55,213 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:55,213 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:55,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:55,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1789743653, now seen corresponding path program 25 times [2018-11-23 11:56:55,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:55,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:55,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:55,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:55,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:56,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {10790#true} call ULTIMATE.init(); {10790#true} is VALID [2018-11-23 11:56:56,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {10790#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10790#true} is VALID [2018-11-23 11:56:56,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {10790#true} assume true; {10790#true} is VALID [2018-11-23 11:56:56,291 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10790#true} {10790#true} #61#return; {10790#true} is VALID [2018-11-23 11:56:56,291 INFO L256 TraceCheckUtils]: 4: Hoare triple {10790#true} call #t~ret2 := main(); {10790#true} is VALID [2018-11-23 11:56:56,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {10790#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10792#(= main_~i~0 0)} is VALID [2018-11-23 11:56:56,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {10792#(= 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; {10793#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:56,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {10793#(<= 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; {10794#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:56,294 INFO L273 TraceCheckUtils]: 8: Hoare triple {10794#(<= 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; {10795#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:56,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {10795#(<= 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; {10796#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:56,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {10796#(<= 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; {10797#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:56,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {10797#(<= 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; {10798#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:56,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {10798#(<= 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; {10799#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:56,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {10799#(<= 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; {10800#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:56,299 INFO L273 TraceCheckUtils]: 14: Hoare triple {10800#(<= 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; {10801#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:56,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {10801#(<= 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; {10802#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:56,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {10802#(<= 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; {10803#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:56,302 INFO L273 TraceCheckUtils]: 17: Hoare triple {10803#(<= 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; {10804#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:56,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {10804#(<= 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; {10805#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:56,303 INFO L273 TraceCheckUtils]: 19: Hoare triple {10805#(<= 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; {10806#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:56,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {10806#(<= 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; {10807#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:56,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {10807#(<= 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; {10808#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:56,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {10808#(<= 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; {10809#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:56,307 INFO L273 TraceCheckUtils]: 23: Hoare triple {10809#(<= 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; {10810#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:56,308 INFO L273 TraceCheckUtils]: 24: Hoare triple {10810#(<= 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; {10811#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:56,309 INFO L273 TraceCheckUtils]: 25: Hoare triple {10811#(<= 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; {10812#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:56,310 INFO L273 TraceCheckUtils]: 26: Hoare triple {10812#(<= 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; {10813#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:56,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {10813#(<= 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; {10814#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:56,312 INFO L273 TraceCheckUtils]: 28: Hoare triple {10814#(<= 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; {10815#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:56,313 INFO L273 TraceCheckUtils]: 29: Hoare triple {10815#(<= 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; {10816#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:56,314 INFO L273 TraceCheckUtils]: 30: Hoare triple {10816#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10817#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:56,314 INFO L273 TraceCheckUtils]: 31: Hoare triple {10817#(<= main_~i~0 25)} assume !(~i~0 < 100000); {10791#false} is VALID [2018-11-23 11:56:56,315 INFO L273 TraceCheckUtils]: 32: Hoare triple {10791#false} ~i~0 := 0; {10791#false} is VALID [2018-11-23 11:56:56,315 INFO L273 TraceCheckUtils]: 33: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,315 INFO L273 TraceCheckUtils]: 36: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,316 INFO L273 TraceCheckUtils]: 37: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,316 INFO L273 TraceCheckUtils]: 38: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,316 INFO L273 TraceCheckUtils]: 39: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,316 INFO L273 TraceCheckUtils]: 40: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,316 INFO L273 TraceCheckUtils]: 41: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,317 INFO L273 TraceCheckUtils]: 42: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,317 INFO L273 TraceCheckUtils]: 43: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,317 INFO L273 TraceCheckUtils]: 44: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,317 INFO L273 TraceCheckUtils]: 45: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,317 INFO L273 TraceCheckUtils]: 46: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,317 INFO L273 TraceCheckUtils]: 47: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,318 INFO L273 TraceCheckUtils]: 48: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,318 INFO L273 TraceCheckUtils]: 49: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,318 INFO L273 TraceCheckUtils]: 50: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,318 INFO L273 TraceCheckUtils]: 51: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,319 INFO L273 TraceCheckUtils]: 52: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,319 INFO L273 TraceCheckUtils]: 53: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,319 INFO L273 TraceCheckUtils]: 54: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,319 INFO L273 TraceCheckUtils]: 55: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,319 INFO L273 TraceCheckUtils]: 56: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,319 INFO L273 TraceCheckUtils]: 57: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,319 INFO L273 TraceCheckUtils]: 58: Hoare triple {10791#false} assume !(~i~0 < 100000); {10791#false} is VALID [2018-11-23 11:56:56,319 INFO L273 TraceCheckUtils]: 59: Hoare triple {10791#false} havoc ~x~0;~x~0 := 0; {10791#false} is VALID [2018-11-23 11:56:56,320 INFO L273 TraceCheckUtils]: 60: Hoare triple {10791#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10791#false} is VALID [2018-11-23 11:56:56,320 INFO L256 TraceCheckUtils]: 61: Hoare triple {10791#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {10791#false} is VALID [2018-11-23 11:56:56,320 INFO L273 TraceCheckUtils]: 62: Hoare triple {10791#false} ~cond := #in~cond; {10791#false} is VALID [2018-11-23 11:56:56,320 INFO L273 TraceCheckUtils]: 63: Hoare triple {10791#false} assume 0 == ~cond; {10791#false} is VALID [2018-11-23 11:56:56,320 INFO L273 TraceCheckUtils]: 64: Hoare triple {10791#false} assume !false; {10791#false} is VALID [2018-11-23 11:56:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-23 11:56:56,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:56,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:56,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:56,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:56,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {10790#true} call ULTIMATE.init(); {10790#true} is VALID [2018-11-23 11:56:56,564 INFO L273 TraceCheckUtils]: 1: Hoare triple {10790#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10790#true} is VALID [2018-11-23 11:56:56,564 INFO L273 TraceCheckUtils]: 2: Hoare triple {10790#true} assume true; {10790#true} is VALID [2018-11-23 11:56:56,564 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10790#true} {10790#true} #61#return; {10790#true} is VALID [2018-11-23 11:56:56,564 INFO L256 TraceCheckUtils]: 4: Hoare triple {10790#true} call #t~ret2 := main(); {10790#true} is VALID [2018-11-23 11:56:56,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {10790#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10836#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:56,566 INFO L273 TraceCheckUtils]: 6: Hoare triple {10836#(<= 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; {10793#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:56,566 INFO L273 TraceCheckUtils]: 7: Hoare triple {10793#(<= 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; {10794#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:56,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {10794#(<= 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; {10795#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:56,567 INFO L273 TraceCheckUtils]: 9: Hoare triple {10795#(<= 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; {10796#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:56,568 INFO L273 TraceCheckUtils]: 10: Hoare triple {10796#(<= 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; {10797#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:56,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {10797#(<= 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; {10798#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:56,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {10798#(<= 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; {10799#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:56,571 INFO L273 TraceCheckUtils]: 13: Hoare triple {10799#(<= 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; {10800#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:56,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {10800#(<= 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; {10801#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:56,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {10801#(<= 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; {10802#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:56,573 INFO L273 TraceCheckUtils]: 16: Hoare triple {10802#(<= 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; {10803#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:56,574 INFO L273 TraceCheckUtils]: 17: Hoare triple {10803#(<= 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; {10804#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:56,575 INFO L273 TraceCheckUtils]: 18: Hoare triple {10804#(<= 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; {10805#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:56,576 INFO L273 TraceCheckUtils]: 19: Hoare triple {10805#(<= 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; {10806#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:56,577 INFO L273 TraceCheckUtils]: 20: Hoare triple {10806#(<= 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; {10807#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:56,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {10807#(<= 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; {10808#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:56,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {10808#(<= 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; {10809#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:56,580 INFO L273 TraceCheckUtils]: 23: Hoare triple {10809#(<= 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; {10810#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:56,581 INFO L273 TraceCheckUtils]: 24: Hoare triple {10810#(<= 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; {10811#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:56,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {10811#(<= 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; {10812#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:56,583 INFO L273 TraceCheckUtils]: 26: Hoare triple {10812#(<= 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; {10813#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:56,584 INFO L273 TraceCheckUtils]: 27: Hoare triple {10813#(<= 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; {10814#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:56,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {10814#(<= 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; {10815#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:56,585 INFO L273 TraceCheckUtils]: 29: Hoare triple {10815#(<= 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; {10816#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:56,586 INFO L273 TraceCheckUtils]: 30: Hoare triple {10816#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10817#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:56,587 INFO L273 TraceCheckUtils]: 31: Hoare triple {10817#(<= main_~i~0 25)} assume !(~i~0 < 100000); {10791#false} is VALID [2018-11-23 11:56:56,587 INFO L273 TraceCheckUtils]: 32: Hoare triple {10791#false} ~i~0 := 0; {10791#false} is VALID [2018-11-23 11:56:56,588 INFO L273 TraceCheckUtils]: 33: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,588 INFO L273 TraceCheckUtils]: 34: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,588 INFO L273 TraceCheckUtils]: 35: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,588 INFO L273 TraceCheckUtils]: 36: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,589 INFO L273 TraceCheckUtils]: 38: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,589 INFO L273 TraceCheckUtils]: 40: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,589 INFO L273 TraceCheckUtils]: 41: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,589 INFO L273 TraceCheckUtils]: 42: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,589 INFO L273 TraceCheckUtils]: 43: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,590 INFO L273 TraceCheckUtils]: 44: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,590 INFO L273 TraceCheckUtils]: 45: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,590 INFO L273 TraceCheckUtils]: 46: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,590 INFO L273 TraceCheckUtils]: 47: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,590 INFO L273 TraceCheckUtils]: 48: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,591 INFO L273 TraceCheckUtils]: 49: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,591 INFO L273 TraceCheckUtils]: 50: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,591 INFO L273 TraceCheckUtils]: 51: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,591 INFO L273 TraceCheckUtils]: 52: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,591 INFO L273 TraceCheckUtils]: 53: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,592 INFO L273 TraceCheckUtils]: 54: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,592 INFO L273 TraceCheckUtils]: 55: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,592 INFO L273 TraceCheckUtils]: 56: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,592 INFO L273 TraceCheckUtils]: 57: Hoare triple {10791#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10791#false} is VALID [2018-11-23 11:56:56,592 INFO L273 TraceCheckUtils]: 58: Hoare triple {10791#false} assume !(~i~0 < 100000); {10791#false} is VALID [2018-11-23 11:56:56,592 INFO L273 TraceCheckUtils]: 59: Hoare triple {10791#false} havoc ~x~0;~x~0 := 0; {10791#false} is VALID [2018-11-23 11:56:56,592 INFO L273 TraceCheckUtils]: 60: Hoare triple {10791#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10791#false} is VALID [2018-11-23 11:56:56,592 INFO L256 TraceCheckUtils]: 61: Hoare triple {10791#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {10791#false} is VALID [2018-11-23 11:56:56,592 INFO L273 TraceCheckUtils]: 62: Hoare triple {10791#false} ~cond := #in~cond; {10791#false} is VALID [2018-11-23 11:56:56,593 INFO L273 TraceCheckUtils]: 63: Hoare triple {10791#false} assume 0 == ~cond; {10791#false} is VALID [2018-11-23 11:56:56,593 INFO L273 TraceCheckUtils]: 64: Hoare triple {10791#false} assume !false; {10791#false} is VALID [2018-11-23 11:56:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-23 11:56:56,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:56,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 11:56:56,616 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-11-23 11:56:56,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:56,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:56:56,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:56,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:56:56,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:56:56,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:56:56,650 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 29 states. [2018-11-23 11:56:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:56,994 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-11-23 11:56:56,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:56:56,994 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-11-23 11:56:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:56:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 90 transitions. [2018-11-23 11:56:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:56:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 90 transitions. [2018-11-23 11:56:56,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 90 transitions. [2018-11-23 11:56:57,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:57,089 INFO L225 Difference]: With dead ends: 110 [2018-11-23 11:56:57,090 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:56:57,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:56:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:56:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 11:56:57,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:57,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-23 11:56:57,154 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 11:56:57,154 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 11:56:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:57,155 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 11:56:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 11:56:57,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:57,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:57,156 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 11:56:57,156 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 11:56:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:57,157 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 11:56:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 11:56:57,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:57,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:57,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:57,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:56:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-11-23 11:56:57,159 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 65 [2018-11-23 11:56:57,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:57,159 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-11-23 11:56:57,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:56:57,160 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 11:56:57,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:56:57,160 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:57,161 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:57,161 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:57,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:57,161 INFO L82 PathProgramCache]: Analyzing trace with hash 964880294, now seen corresponding path program 26 times [2018-11-23 11:56:57,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:57,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:57,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:57,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:57,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:00,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {11490#true} call ULTIMATE.init(); {11490#true} is VALID [2018-11-23 11:57:00,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {11490#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11490#true} is VALID [2018-11-23 11:57:00,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {11490#true} assume true; {11490#true} is VALID [2018-11-23 11:57:00,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11490#true} {11490#true} #61#return; {11490#true} is VALID [2018-11-23 11:57:00,298 INFO L256 TraceCheckUtils]: 4: Hoare triple {11490#true} call #t~ret2 := main(); {11490#true} is VALID [2018-11-23 11:57:00,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {11490#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11492#(= main_~i~0 0)} is VALID [2018-11-23 11:57:00,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {11492#(= 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; {11493#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:00,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {11493#(<= 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; {11494#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:00,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {11494#(<= 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; {11495#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:00,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {11495#(<= 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; {11496#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:00,303 INFO L273 TraceCheckUtils]: 10: Hoare triple {11496#(<= 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; {11497#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:00,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {11497#(<= 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; {11498#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:00,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {11498#(<= 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; {11499#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:00,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {11499#(<= 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; {11500#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:00,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {11500#(<= 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; {11501#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:00,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {11501#(<= 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; {11502#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:00,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {11502#(<= 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; {11503#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:00,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {11503#(<= 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; {11504#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:00,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {11504#(<= 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; {11505#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:00,312 INFO L273 TraceCheckUtils]: 19: Hoare triple {11505#(<= 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; {11506#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:00,313 INFO L273 TraceCheckUtils]: 20: Hoare triple {11506#(<= 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; {11507#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:00,314 INFO L273 TraceCheckUtils]: 21: Hoare triple {11507#(<= 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; {11508#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:00,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {11508#(<= 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; {11509#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:00,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {11509#(<= 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; {11510#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:00,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {11510#(<= 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; {11511#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:00,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {11511#(<= 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; {11512#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:00,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {11512#(<= 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; {11513#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:00,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {11513#(<= 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; {11514#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:00,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {11514#(<= 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; {11515#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:00,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {11515#(<= 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; {11516#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:00,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {11516#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11517#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:00,323 INFO L273 TraceCheckUtils]: 31: Hoare triple {11517#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11518#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:00,324 INFO L273 TraceCheckUtils]: 32: Hoare triple {11518#(<= main_~i~0 26)} assume !(~i~0 < 100000); {11491#false} is VALID [2018-11-23 11:57:00,324 INFO L273 TraceCheckUtils]: 33: Hoare triple {11491#false} ~i~0 := 0; {11491#false} is VALID [2018-11-23 11:57:00,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,324 INFO L273 TraceCheckUtils]: 35: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,324 INFO L273 TraceCheckUtils]: 36: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,325 INFO L273 TraceCheckUtils]: 38: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,325 INFO L273 TraceCheckUtils]: 39: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,325 INFO L273 TraceCheckUtils]: 40: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,325 INFO L273 TraceCheckUtils]: 41: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,326 INFO L273 TraceCheckUtils]: 42: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,326 INFO L273 TraceCheckUtils]: 43: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,326 INFO L273 TraceCheckUtils]: 44: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,326 INFO L273 TraceCheckUtils]: 45: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,326 INFO L273 TraceCheckUtils]: 46: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,327 INFO L273 TraceCheckUtils]: 47: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,327 INFO L273 TraceCheckUtils]: 48: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,327 INFO L273 TraceCheckUtils]: 49: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,327 INFO L273 TraceCheckUtils]: 50: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,327 INFO L273 TraceCheckUtils]: 51: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,327 INFO L273 TraceCheckUtils]: 52: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,327 INFO L273 TraceCheckUtils]: 53: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,327 INFO L273 TraceCheckUtils]: 54: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,327 INFO L273 TraceCheckUtils]: 55: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,328 INFO L273 TraceCheckUtils]: 56: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,328 INFO L273 TraceCheckUtils]: 57: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,328 INFO L273 TraceCheckUtils]: 58: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,328 INFO L273 TraceCheckUtils]: 59: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,328 INFO L273 TraceCheckUtils]: 60: Hoare triple {11491#false} assume !(~i~0 < 100000); {11491#false} is VALID [2018-11-23 11:57:00,328 INFO L273 TraceCheckUtils]: 61: Hoare triple {11491#false} havoc ~x~0;~x~0 := 0; {11491#false} is VALID [2018-11-23 11:57:00,328 INFO L273 TraceCheckUtils]: 62: Hoare triple {11491#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11491#false} is VALID [2018-11-23 11:57:00,328 INFO L256 TraceCheckUtils]: 63: Hoare triple {11491#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {11491#false} is VALID [2018-11-23 11:57:00,329 INFO L273 TraceCheckUtils]: 64: Hoare triple {11491#false} ~cond := #in~cond; {11491#false} is VALID [2018-11-23 11:57:00,329 INFO L273 TraceCheckUtils]: 65: Hoare triple {11491#false} assume 0 == ~cond; {11491#false} is VALID [2018-11-23 11:57:00,329 INFO L273 TraceCheckUtils]: 66: Hoare triple {11491#false} assume !false; {11491#false} is VALID [2018-11-23 11:57:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-23 11:57:00,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:00,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:00,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:57:00,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:57:00,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:00,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:00,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {11490#true} call ULTIMATE.init(); {11490#true} is VALID [2018-11-23 11:57:00,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {11490#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11490#true} is VALID [2018-11-23 11:57:00,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {11490#true} assume true; {11490#true} is VALID [2018-11-23 11:57:00,602 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11490#true} {11490#true} #61#return; {11490#true} is VALID [2018-11-23 11:57:00,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {11490#true} call #t~ret2 := main(); {11490#true} is VALID [2018-11-23 11:57:00,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {11490#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11537#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:00,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {11537#(<= 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; {11493#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:00,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {11493#(<= 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; {11494#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:00,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {11494#(<= 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; {11495#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:00,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {11495#(<= 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; {11496#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:00,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {11496#(<= 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; {11497#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:00,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {11497#(<= 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; {11498#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:00,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {11498#(<= 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; {11499#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:00,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {11499#(<= 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; {11500#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:00,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {11500#(<= 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; {11501#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:00,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {11501#(<= 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; {11502#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:00,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {11502#(<= 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; {11503#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:00,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {11503#(<= 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; {11504#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:00,613 INFO L273 TraceCheckUtils]: 18: Hoare triple {11504#(<= 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; {11505#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:00,614 INFO L273 TraceCheckUtils]: 19: Hoare triple {11505#(<= 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; {11506#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:00,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {11506#(<= 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; {11507#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:00,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {11507#(<= 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; {11508#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:00,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {11508#(<= 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; {11509#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:00,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {11509#(<= 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; {11510#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:00,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {11510#(<= 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; {11511#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:00,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {11511#(<= 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; {11512#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:00,621 INFO L273 TraceCheckUtils]: 26: Hoare triple {11512#(<= 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; {11513#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:00,622 INFO L273 TraceCheckUtils]: 27: Hoare triple {11513#(<= 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; {11514#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:00,623 INFO L273 TraceCheckUtils]: 28: Hoare triple {11514#(<= 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; {11515#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:00,623 INFO L273 TraceCheckUtils]: 29: Hoare triple {11515#(<= 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; {11516#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:00,624 INFO L273 TraceCheckUtils]: 30: Hoare triple {11516#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11517#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:00,625 INFO L273 TraceCheckUtils]: 31: Hoare triple {11517#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11518#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:00,626 INFO L273 TraceCheckUtils]: 32: Hoare triple {11518#(<= main_~i~0 26)} assume !(~i~0 < 100000); {11491#false} is VALID [2018-11-23 11:57:00,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {11491#false} ~i~0 := 0; {11491#false} is VALID [2018-11-23 11:57:00,626 INFO L273 TraceCheckUtils]: 34: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,627 INFO L273 TraceCheckUtils]: 35: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,627 INFO L273 TraceCheckUtils]: 36: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,627 INFO L273 TraceCheckUtils]: 37: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,627 INFO L273 TraceCheckUtils]: 38: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,627 INFO L273 TraceCheckUtils]: 39: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,628 INFO L273 TraceCheckUtils]: 40: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,628 INFO L273 TraceCheckUtils]: 41: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,628 INFO L273 TraceCheckUtils]: 42: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,628 INFO L273 TraceCheckUtils]: 43: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,628 INFO L273 TraceCheckUtils]: 44: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,629 INFO L273 TraceCheckUtils]: 45: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,629 INFO L273 TraceCheckUtils]: 46: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,629 INFO L273 TraceCheckUtils]: 47: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,629 INFO L273 TraceCheckUtils]: 48: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,629 INFO L273 TraceCheckUtils]: 49: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,629 INFO L273 TraceCheckUtils]: 50: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,629 INFO L273 TraceCheckUtils]: 51: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,630 INFO L273 TraceCheckUtils]: 52: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,630 INFO L273 TraceCheckUtils]: 53: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,630 INFO L273 TraceCheckUtils]: 54: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,630 INFO L273 TraceCheckUtils]: 55: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,630 INFO L273 TraceCheckUtils]: 56: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,630 INFO L273 TraceCheckUtils]: 57: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,630 INFO L273 TraceCheckUtils]: 58: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,630 INFO L273 TraceCheckUtils]: 59: Hoare triple {11491#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11491#false} is VALID [2018-11-23 11:57:00,630 INFO L273 TraceCheckUtils]: 60: Hoare triple {11491#false} assume !(~i~0 < 100000); {11491#false} is VALID [2018-11-23 11:57:00,631 INFO L273 TraceCheckUtils]: 61: Hoare triple {11491#false} havoc ~x~0;~x~0 := 0; {11491#false} is VALID [2018-11-23 11:57:00,631 INFO L273 TraceCheckUtils]: 62: Hoare triple {11491#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11491#false} is VALID [2018-11-23 11:57:00,631 INFO L256 TraceCheckUtils]: 63: Hoare triple {11491#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {11491#false} is VALID [2018-11-23 11:57:00,631 INFO L273 TraceCheckUtils]: 64: Hoare triple {11491#false} ~cond := #in~cond; {11491#false} is VALID [2018-11-23 11:57:00,631 INFO L273 TraceCheckUtils]: 65: Hoare triple {11491#false} assume 0 == ~cond; {11491#false} is VALID [2018-11-23 11:57:00,631 INFO L273 TraceCheckUtils]: 66: Hoare triple {11491#false} assume !false; {11491#false} is VALID [2018-11-23 11:57:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-23 11:57:00,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:00,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 11:57:00,655 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-11-23 11:57:00,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:00,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:57:00,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:00,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:57:00,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:57:00,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:57:00,691 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 30 states. [2018-11-23 11:57:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:01,314 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-11-23 11:57:01,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:57:01,314 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-11-23 11:57:01,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:57:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2018-11-23 11:57:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:57:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2018-11-23 11:57:01,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 92 transitions. [2018-11-23 11:57:01,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:01,415 INFO L225 Difference]: With dead ends: 113 [2018-11-23 11:57:01,415 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 11:57:01,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:57:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 11:57:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-23 11:57:01,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:01,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2018-11-23 11:57:01,472 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-23 11:57:01,472 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-23 11:57:01,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:01,473 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-23 11:57:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-23 11:57:01,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:01,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:01,474 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-23 11:57:01,474 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-23 11:57:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:01,475 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-23 11:57:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-23 11:57:01,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:01,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:01,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:01,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 11:57:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-11-23 11:57:01,478 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 67 [2018-11-23 11:57:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:01,478 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-11-23 11:57:01,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:57:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-23 11:57:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 11:57:01,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:01,479 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:01,479 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:01,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:01,480 INFO L82 PathProgramCache]: Analyzing trace with hash 540191429, now seen corresponding path program 27 times [2018-11-23 11:57:01,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:01,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:01,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:01,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:01,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:01,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {12211#true} call ULTIMATE.init(); {12211#true} is VALID [2018-11-23 11:57:01,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {12211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12211#true} is VALID [2018-11-23 11:57:01,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {12211#true} assume true; {12211#true} is VALID [2018-11-23 11:57:01,988 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12211#true} {12211#true} #61#return; {12211#true} is VALID [2018-11-23 11:57:01,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {12211#true} call #t~ret2 := main(); {12211#true} is VALID [2018-11-23 11:57:01,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {12211#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12213#(= main_~i~0 0)} is VALID [2018-11-23 11:57:01,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {12213#(= 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; {12214#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:01,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {12214#(<= 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; {12215#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:01,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {12215#(<= 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; {12216#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:01,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {12216#(<= 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; {12217#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:01,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {12217#(<= 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; {12218#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:01,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {12218#(<= 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; {12219#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:01,993 INFO L273 TraceCheckUtils]: 12: Hoare triple {12219#(<= 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; {12220#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:01,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {12220#(<= 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; {12221#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:01,995 INFO L273 TraceCheckUtils]: 14: Hoare triple {12221#(<= 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; {12222#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:01,996 INFO L273 TraceCheckUtils]: 15: Hoare triple {12222#(<= 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; {12223#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:01,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {12223#(<= 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; {12224#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:01,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {12224#(<= 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; {12225#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:01,999 INFO L273 TraceCheckUtils]: 18: Hoare triple {12225#(<= 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; {12226#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:02,000 INFO L273 TraceCheckUtils]: 19: Hoare triple {12226#(<= 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; {12227#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:02,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {12227#(<= 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; {12228#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:02,001 INFO L273 TraceCheckUtils]: 21: Hoare triple {12228#(<= 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; {12229#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:02,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {12229#(<= 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; {12230#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:02,003 INFO L273 TraceCheckUtils]: 23: Hoare triple {12230#(<= 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; {12231#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:02,004 INFO L273 TraceCheckUtils]: 24: Hoare triple {12231#(<= 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; {12232#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:02,005 INFO L273 TraceCheckUtils]: 25: Hoare triple {12232#(<= 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; {12233#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:02,006 INFO L273 TraceCheckUtils]: 26: Hoare triple {12233#(<= 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; {12234#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:02,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {12234#(<= 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; {12235#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:02,008 INFO L273 TraceCheckUtils]: 28: Hoare triple {12235#(<= 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; {12236#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:02,009 INFO L273 TraceCheckUtils]: 29: Hoare triple {12236#(<= 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; {12237#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:02,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {12237#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12238#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:02,011 INFO L273 TraceCheckUtils]: 31: Hoare triple {12238#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12239#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:02,012 INFO L273 TraceCheckUtils]: 32: Hoare triple {12239#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12240#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:02,012 INFO L273 TraceCheckUtils]: 33: Hoare triple {12240#(<= main_~i~0 27)} assume !(~i~0 < 100000); {12212#false} is VALID [2018-11-23 11:57:02,013 INFO L273 TraceCheckUtils]: 34: Hoare triple {12212#false} ~i~0 := 0; {12212#false} is VALID [2018-11-23 11:57:02,013 INFO L273 TraceCheckUtils]: 35: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,013 INFO L273 TraceCheckUtils]: 36: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,013 INFO L273 TraceCheckUtils]: 37: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,013 INFO L273 TraceCheckUtils]: 38: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,014 INFO L273 TraceCheckUtils]: 39: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,014 INFO L273 TraceCheckUtils]: 40: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,014 INFO L273 TraceCheckUtils]: 41: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,014 INFO L273 TraceCheckUtils]: 42: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,014 INFO L273 TraceCheckUtils]: 43: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,015 INFO L273 TraceCheckUtils]: 44: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,015 INFO L273 TraceCheckUtils]: 45: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,015 INFO L273 TraceCheckUtils]: 46: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,015 INFO L273 TraceCheckUtils]: 47: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,015 INFO L273 TraceCheckUtils]: 48: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,016 INFO L273 TraceCheckUtils]: 49: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,016 INFO L273 TraceCheckUtils]: 50: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,016 INFO L273 TraceCheckUtils]: 51: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,016 INFO L273 TraceCheckUtils]: 52: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,016 INFO L273 TraceCheckUtils]: 53: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,017 INFO L273 TraceCheckUtils]: 54: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,017 INFO L273 TraceCheckUtils]: 55: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,017 INFO L273 TraceCheckUtils]: 56: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,017 INFO L273 TraceCheckUtils]: 57: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,017 INFO L273 TraceCheckUtils]: 58: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,017 INFO L273 TraceCheckUtils]: 59: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,017 INFO L273 TraceCheckUtils]: 60: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,017 INFO L273 TraceCheckUtils]: 61: Hoare triple {12212#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12212#false} is VALID [2018-11-23 11:57:02,018 INFO L273 TraceCheckUtils]: 62: Hoare triple {12212#false} assume !(~i~0 < 100000); {12212#false} is VALID [2018-11-23 11:57:02,018 INFO L273 TraceCheckUtils]: 63: Hoare triple {12212#false} havoc ~x~0;~x~0 := 0; {12212#false} is VALID [2018-11-23 11:57:02,018 INFO L273 TraceCheckUtils]: 64: Hoare triple {12212#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12212#false} is VALID [2018-11-23 11:57:02,018 INFO L256 TraceCheckUtils]: 65: Hoare triple {12212#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {12212#false} is VALID [2018-11-23 11:57:02,018 INFO L273 TraceCheckUtils]: 66: Hoare triple {12212#false} ~cond := #in~cond; {12212#false} is VALID [2018-11-23 11:57:02,018 INFO L273 TraceCheckUtils]: 67: Hoare triple {12212#false} assume 0 == ~cond; {12212#false} is VALID [2018-11-23 11:57:02,018 INFO L273 TraceCheckUtils]: 68: Hoare triple {12212#false} assume !false; {12212#false} is VALID [2018-11-23 11:57:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-23 11:57:02,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:02,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:02,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:57:16,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 11:57:16,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:16,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:16,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {12211#true} call ULTIMATE.init(); {12211#true} is VALID [2018-11-23 11:57:16,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {12211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12211#true} is VALID [2018-11-23 11:57:16,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {12211#true} assume true; {12211#true} is VALID [2018-11-23 11:57:16,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12211#true} {12211#true} #61#return; {12211#true} is VALID [2018-11-23 11:57:16,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {12211#true} call #t~ret2 := main(); {12211#true} is VALID [2018-11-23 11:57:16,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {12211#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12211#true} is VALID [2018-11-23 11:57:16,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,619 INFO L273 TraceCheckUtils]: 15: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,620 INFO L273 TraceCheckUtils]: 19: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,620 INFO L273 TraceCheckUtils]: 20: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,620 INFO L273 TraceCheckUtils]: 21: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,620 INFO L273 TraceCheckUtils]: 22: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,621 INFO L273 TraceCheckUtils]: 28: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,621 INFO L273 TraceCheckUtils]: 29: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,621 INFO L273 TraceCheckUtils]: 30: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,621 INFO L273 TraceCheckUtils]: 31: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12211#true} is VALID [2018-11-23 11:57:16,622 INFO L273 TraceCheckUtils]: 32: Hoare triple {12211#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12340#(<= main_~i~0 100000)} is VALID [2018-11-23 11:57:16,622 INFO L273 TraceCheckUtils]: 33: Hoare triple {12340#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {12211#true} is VALID [2018-11-23 11:57:16,622 INFO L273 TraceCheckUtils]: 34: Hoare triple {12211#true} ~i~0 := 0; {12347#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:16,623 INFO L273 TraceCheckUtils]: 35: Hoare triple {12347#(<= 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; {12214#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:16,623 INFO L273 TraceCheckUtils]: 36: Hoare triple {12214#(<= 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; {12215#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:16,624 INFO L273 TraceCheckUtils]: 37: Hoare triple {12215#(<= 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; {12216#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:16,624 INFO L273 TraceCheckUtils]: 38: Hoare triple {12216#(<= 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; {12217#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:16,625 INFO L273 TraceCheckUtils]: 39: Hoare triple {12217#(<= 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; {12218#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:16,626 INFO L273 TraceCheckUtils]: 40: Hoare triple {12218#(<= 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; {12219#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:16,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {12219#(<= 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; {12220#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:16,628 INFO L273 TraceCheckUtils]: 42: Hoare triple {12220#(<= 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; {12221#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:16,629 INFO L273 TraceCheckUtils]: 43: Hoare triple {12221#(<= 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; {12222#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:16,630 INFO L273 TraceCheckUtils]: 44: Hoare triple {12222#(<= 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; {12223#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:16,631 INFO L273 TraceCheckUtils]: 45: Hoare triple {12223#(<= 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; {12224#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:16,632 INFO L273 TraceCheckUtils]: 46: Hoare triple {12224#(<= 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; {12225#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:16,633 INFO L273 TraceCheckUtils]: 47: Hoare triple {12225#(<= 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; {12226#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:16,634 INFO L273 TraceCheckUtils]: 48: Hoare triple {12226#(<= 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; {12227#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:16,635 INFO L273 TraceCheckUtils]: 49: Hoare triple {12227#(<= 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; {12228#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:16,635 INFO L273 TraceCheckUtils]: 50: Hoare triple {12228#(<= 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; {12229#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:16,636 INFO L273 TraceCheckUtils]: 51: Hoare triple {12229#(<= 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; {12230#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:16,637 INFO L273 TraceCheckUtils]: 52: Hoare triple {12230#(<= 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; {12231#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:16,638 INFO L273 TraceCheckUtils]: 53: Hoare triple {12231#(<= 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; {12232#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:16,639 INFO L273 TraceCheckUtils]: 54: Hoare triple {12232#(<= 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; {12233#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:16,640 INFO L273 TraceCheckUtils]: 55: Hoare triple {12233#(<= 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; {12234#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:16,641 INFO L273 TraceCheckUtils]: 56: Hoare triple {12234#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12235#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:16,642 INFO L273 TraceCheckUtils]: 57: Hoare triple {12235#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12236#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:16,643 INFO L273 TraceCheckUtils]: 58: Hoare triple {12236#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12237#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:16,644 INFO L273 TraceCheckUtils]: 59: Hoare triple {12237#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12238#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:16,645 INFO L273 TraceCheckUtils]: 60: Hoare triple {12238#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12239#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:16,646 INFO L273 TraceCheckUtils]: 61: Hoare triple {12239#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12240#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:16,646 INFO L273 TraceCheckUtils]: 62: Hoare triple {12240#(<= main_~i~0 27)} assume !(~i~0 < 100000); {12212#false} is VALID [2018-11-23 11:57:16,647 INFO L273 TraceCheckUtils]: 63: Hoare triple {12212#false} havoc ~x~0;~x~0 := 0; {12212#false} is VALID [2018-11-23 11:57:16,647 INFO L273 TraceCheckUtils]: 64: Hoare triple {12212#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12212#false} is VALID [2018-11-23 11:57:16,647 INFO L256 TraceCheckUtils]: 65: Hoare triple {12212#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {12212#false} is VALID [2018-11-23 11:57:16,647 INFO L273 TraceCheckUtils]: 66: Hoare triple {12212#false} ~cond := #in~cond; {12212#false} is VALID [2018-11-23 11:57:16,647 INFO L273 TraceCheckUtils]: 67: Hoare triple {12212#false} assume 0 == ~cond; {12212#false} is VALID [2018-11-23 11:57:16,648 INFO L273 TraceCheckUtils]: 68: Hoare triple {12212#false} assume !false; {12212#false} is VALID [2018-11-23 11:57:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 27 proven. 378 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-23 11:57:16,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:16,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 32 [2018-11-23 11:57:16,677 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-11-23 11:57:16,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:16,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:57:16,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:16,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:57:16,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:57:16,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:57:16,778 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 32 states. [2018-11-23 11:57:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:17,375 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-23 11:57:17,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:57:17,375 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-11-23 11:57:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:57:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 94 transitions. [2018-11-23 11:57:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:57:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 94 transitions. [2018-11-23 11:57:17,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 94 transitions. [2018-11-23 11:57:17,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:17,478 INFO L225 Difference]: With dead ends: 116 [2018-11-23 11:57:17,478 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 11:57:17,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:57:17,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 11:57:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 11:57:17,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:17,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-23 11:57:17,554 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 11:57:17,554 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 11:57:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:17,555 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-23 11:57:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 11:57:17,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:17,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:17,556 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 11:57:17,556 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 11:57:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:17,557 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-23 11:57:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 11:57:17,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:17,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:17,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:17,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:57:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-11-23 11:57:17,559 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 69 [2018-11-23 11:57:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:17,559 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-23 11:57:17,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:57:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 11:57:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 11:57:17,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:17,560 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:17,561 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:17,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2142907386, now seen corresponding path program 28 times [2018-11-23 11:57:17,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:17,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:17,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:17,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:17,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:18,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {12954#true} call ULTIMATE.init(); {12954#true} is VALID [2018-11-23 11:57:18,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {12954#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12954#true} is VALID [2018-11-23 11:57:18,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {12954#true} assume true; {12954#true} is VALID [2018-11-23 11:57:18,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12954#true} {12954#true} #61#return; {12954#true} is VALID [2018-11-23 11:57:18,098 INFO L256 TraceCheckUtils]: 4: Hoare triple {12954#true} call #t~ret2 := main(); {12954#true} is VALID [2018-11-23 11:57:18,098 INFO L273 TraceCheckUtils]: 5: Hoare triple {12954#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12956#(= main_~i~0 0)} is VALID [2018-11-23 11:57:18,099 INFO L273 TraceCheckUtils]: 6: Hoare triple {12956#(= 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; {12957#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:18,100 INFO L273 TraceCheckUtils]: 7: Hoare triple {12957#(<= 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; {12958#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:18,100 INFO L273 TraceCheckUtils]: 8: Hoare triple {12958#(<= 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; {12959#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:18,101 INFO L273 TraceCheckUtils]: 9: Hoare triple {12959#(<= 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; {12960#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:18,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {12960#(<= 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; {12961#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:18,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {12961#(<= 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; {12962#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:18,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {12962#(<= 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; {12963#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:18,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {12963#(<= 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; {12964#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:18,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {12964#(<= 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; {12965#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:18,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {12965#(<= 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; {12966#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:18,107 INFO L273 TraceCheckUtils]: 16: Hoare triple {12966#(<= 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; {12967#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:18,108 INFO L273 TraceCheckUtils]: 17: Hoare triple {12967#(<= 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; {12968#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:18,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {12968#(<= 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; {12969#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:18,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {12969#(<= 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; {12970#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:18,110 INFO L273 TraceCheckUtils]: 20: Hoare triple {12970#(<= 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; {12971#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:18,111 INFO L273 TraceCheckUtils]: 21: Hoare triple {12971#(<= 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; {12972#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:18,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {12972#(<= 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; {12973#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:18,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {12973#(<= 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; {12974#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:18,114 INFO L273 TraceCheckUtils]: 24: Hoare triple {12974#(<= 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; {12975#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:18,115 INFO L273 TraceCheckUtils]: 25: Hoare triple {12975#(<= 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; {12976#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:18,116 INFO L273 TraceCheckUtils]: 26: Hoare triple {12976#(<= 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; {12977#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:18,117 INFO L273 TraceCheckUtils]: 27: Hoare triple {12977#(<= 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; {12978#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:18,118 INFO L273 TraceCheckUtils]: 28: Hoare triple {12978#(<= 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; {12979#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:18,119 INFO L273 TraceCheckUtils]: 29: Hoare triple {12979#(<= 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; {12980#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:18,120 INFO L273 TraceCheckUtils]: 30: Hoare triple {12980#(<= main_~i~0 24)} 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 25)} is VALID [2018-11-23 11:57:18,121 INFO L273 TraceCheckUtils]: 31: Hoare triple {12981#(<= main_~i~0 25)} 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 26)} is VALID [2018-11-23 11:57:18,122 INFO L273 TraceCheckUtils]: 32: Hoare triple {12982#(<= main_~i~0 26)} 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 27)} is VALID [2018-11-23 11:57:18,123 INFO L273 TraceCheckUtils]: 33: Hoare triple {12983#(<= main_~i~0 27)} 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 28)} is VALID [2018-11-23 11:57:18,123 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#(<= main_~i~0 28)} assume !(~i~0 < 100000); {12955#false} is VALID [2018-11-23 11:57:18,124 INFO L273 TraceCheckUtils]: 35: Hoare triple {12955#false} ~i~0 := 0; {12955#false} is VALID [2018-11-23 11:57:18,124 INFO L273 TraceCheckUtils]: 36: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,124 INFO L273 TraceCheckUtils]: 37: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,124 INFO L273 TraceCheckUtils]: 38: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,124 INFO L273 TraceCheckUtils]: 39: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,125 INFO L273 TraceCheckUtils]: 40: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,125 INFO L273 TraceCheckUtils]: 41: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,125 INFO L273 TraceCheckUtils]: 42: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,125 INFO L273 TraceCheckUtils]: 43: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,125 INFO L273 TraceCheckUtils]: 44: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,126 INFO L273 TraceCheckUtils]: 45: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,126 INFO L273 TraceCheckUtils]: 46: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,126 INFO L273 TraceCheckUtils]: 47: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,126 INFO L273 TraceCheckUtils]: 48: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,126 INFO L273 TraceCheckUtils]: 49: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,126 INFO L273 TraceCheckUtils]: 50: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,126 INFO L273 TraceCheckUtils]: 51: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,127 INFO L273 TraceCheckUtils]: 52: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,127 INFO L273 TraceCheckUtils]: 53: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,127 INFO L273 TraceCheckUtils]: 54: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,127 INFO L273 TraceCheckUtils]: 55: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,127 INFO L273 TraceCheckUtils]: 56: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,127 INFO L273 TraceCheckUtils]: 57: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,127 INFO L273 TraceCheckUtils]: 58: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,127 INFO L273 TraceCheckUtils]: 59: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,127 INFO L273 TraceCheckUtils]: 60: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,128 INFO L273 TraceCheckUtils]: 61: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,128 INFO L273 TraceCheckUtils]: 62: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,128 INFO L273 TraceCheckUtils]: 63: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,128 INFO L273 TraceCheckUtils]: 64: Hoare triple {12955#false} assume !(~i~0 < 100000); {12955#false} is VALID [2018-11-23 11:57:18,128 INFO L273 TraceCheckUtils]: 65: Hoare triple {12955#false} havoc ~x~0;~x~0 := 0; {12955#false} is VALID [2018-11-23 11:57:18,128 INFO L273 TraceCheckUtils]: 66: Hoare triple {12955#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12955#false} is VALID [2018-11-23 11:57:18,128 INFO L256 TraceCheckUtils]: 67: Hoare triple {12955#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {12955#false} is VALID [2018-11-23 11:57:18,128 INFO L273 TraceCheckUtils]: 68: Hoare triple {12955#false} ~cond := #in~cond; {12955#false} is VALID [2018-11-23 11:57:18,128 INFO L273 TraceCheckUtils]: 69: Hoare triple {12955#false} assume 0 == ~cond; {12955#false} is VALID [2018-11-23 11:57:18,129 INFO L273 TraceCheckUtils]: 70: Hoare triple {12955#false} assume !false; {12955#false} is VALID [2018-11-23 11:57:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-11-23 11:57:18,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:18,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:18,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:57:18,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:57:18,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:18,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:18,416 INFO L256 TraceCheckUtils]: 0: Hoare triple {12954#true} call ULTIMATE.init(); {12954#true} is VALID [2018-11-23 11:57:18,416 INFO L273 TraceCheckUtils]: 1: Hoare triple {12954#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12954#true} is VALID [2018-11-23 11:57:18,416 INFO L273 TraceCheckUtils]: 2: Hoare triple {12954#true} assume true; {12954#true} is VALID [2018-11-23 11:57:18,417 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12954#true} {12954#true} #61#return; {12954#true} is VALID [2018-11-23 11:57:18,417 INFO L256 TraceCheckUtils]: 4: Hoare triple {12954#true} call #t~ret2 := main(); {12954#true} is VALID [2018-11-23 11:57:18,418 INFO L273 TraceCheckUtils]: 5: Hoare triple {12954#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13003#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:18,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {13003#(<= 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; {12957#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:18,419 INFO L273 TraceCheckUtils]: 7: Hoare triple {12957#(<= 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; {12958#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:18,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {12958#(<= 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; {12959#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:18,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {12959#(<= 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; {12960#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:18,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {12960#(<= 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; {12961#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:18,422 INFO L273 TraceCheckUtils]: 11: Hoare triple {12961#(<= 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; {12962#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:18,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {12962#(<= 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; {12963#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:18,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {12963#(<= 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; {12964#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:18,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {12964#(<= 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; {12965#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:18,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {12965#(<= 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; {12966#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:18,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {12966#(<= 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; {12967#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:18,427 INFO L273 TraceCheckUtils]: 17: Hoare triple {12967#(<= 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; {12968#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:18,428 INFO L273 TraceCheckUtils]: 18: Hoare triple {12968#(<= 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; {12969#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:18,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {12969#(<= 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; {12970#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:18,430 INFO L273 TraceCheckUtils]: 20: Hoare triple {12970#(<= 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; {12971#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:18,431 INFO L273 TraceCheckUtils]: 21: Hoare triple {12971#(<= 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; {12972#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:18,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {12972#(<= 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; {12973#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:18,433 INFO L273 TraceCheckUtils]: 23: Hoare triple {12973#(<= 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; {12974#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:18,434 INFO L273 TraceCheckUtils]: 24: Hoare triple {12974#(<= 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; {12975#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:18,435 INFO L273 TraceCheckUtils]: 25: Hoare triple {12975#(<= 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; {12976#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:18,436 INFO L273 TraceCheckUtils]: 26: Hoare triple {12976#(<= 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; {12977#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:18,437 INFO L273 TraceCheckUtils]: 27: Hoare triple {12977#(<= 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; {12978#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:18,438 INFO L273 TraceCheckUtils]: 28: Hoare triple {12978#(<= 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; {12979#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:18,438 INFO L273 TraceCheckUtils]: 29: Hoare triple {12979#(<= 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; {12980#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:18,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {12980#(<= main_~i~0 24)} 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 25)} is VALID [2018-11-23 11:57:18,440 INFO L273 TraceCheckUtils]: 31: Hoare triple {12981#(<= main_~i~0 25)} 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 26)} is VALID [2018-11-23 11:57:18,441 INFO L273 TraceCheckUtils]: 32: Hoare triple {12982#(<= main_~i~0 26)} 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 27)} is VALID [2018-11-23 11:57:18,442 INFO L273 TraceCheckUtils]: 33: Hoare triple {12983#(<= main_~i~0 27)} 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 28)} is VALID [2018-11-23 11:57:18,443 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#(<= main_~i~0 28)} assume !(~i~0 < 100000); {12955#false} is VALID [2018-11-23 11:57:18,443 INFO L273 TraceCheckUtils]: 35: Hoare triple {12955#false} ~i~0 := 0; {12955#false} is VALID [2018-11-23 11:57:18,443 INFO L273 TraceCheckUtils]: 36: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,444 INFO L273 TraceCheckUtils]: 37: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,444 INFO L273 TraceCheckUtils]: 38: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,444 INFO L273 TraceCheckUtils]: 39: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,444 INFO L273 TraceCheckUtils]: 40: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,445 INFO L273 TraceCheckUtils]: 43: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,445 INFO L273 TraceCheckUtils]: 44: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,445 INFO L273 TraceCheckUtils]: 45: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,445 INFO L273 TraceCheckUtils]: 46: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,445 INFO L273 TraceCheckUtils]: 47: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,446 INFO L273 TraceCheckUtils]: 48: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,446 INFO L273 TraceCheckUtils]: 49: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,446 INFO L273 TraceCheckUtils]: 50: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,446 INFO L273 TraceCheckUtils]: 51: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,446 INFO L273 TraceCheckUtils]: 52: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,446 INFO L273 TraceCheckUtils]: 53: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,446 INFO L273 TraceCheckUtils]: 54: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,446 INFO L273 TraceCheckUtils]: 55: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,447 INFO L273 TraceCheckUtils]: 56: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,447 INFO L273 TraceCheckUtils]: 57: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,447 INFO L273 TraceCheckUtils]: 58: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,447 INFO L273 TraceCheckUtils]: 59: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,447 INFO L273 TraceCheckUtils]: 60: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,447 INFO L273 TraceCheckUtils]: 61: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,447 INFO L273 TraceCheckUtils]: 62: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,447 INFO L273 TraceCheckUtils]: 63: Hoare triple {12955#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12955#false} is VALID [2018-11-23 11:57:18,447 INFO L273 TraceCheckUtils]: 64: Hoare triple {12955#false} assume !(~i~0 < 100000); {12955#false} is VALID [2018-11-23 11:57:18,448 INFO L273 TraceCheckUtils]: 65: Hoare triple {12955#false} havoc ~x~0;~x~0 := 0; {12955#false} is VALID [2018-11-23 11:57:18,448 INFO L273 TraceCheckUtils]: 66: Hoare triple {12955#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12955#false} is VALID [2018-11-23 11:57:18,448 INFO L256 TraceCheckUtils]: 67: Hoare triple {12955#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {12955#false} is VALID [2018-11-23 11:57:18,448 INFO L273 TraceCheckUtils]: 68: Hoare triple {12955#false} ~cond := #in~cond; {12955#false} is VALID [2018-11-23 11:57:18,448 INFO L273 TraceCheckUtils]: 69: Hoare triple {12955#false} assume 0 == ~cond; {12955#false} is VALID [2018-11-23 11:57:18,448 INFO L273 TraceCheckUtils]: 70: Hoare triple {12955#false} assume !false; {12955#false} is VALID [2018-11-23 11:57:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-11-23 11:57:18,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:18,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 11:57:18,471 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-11-23 11:57:18,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:18,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:57:18,505 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-23 11:57:18,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:57:18,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:57:18,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:57:18,506 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 32 states. [2018-11-23 11:57:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:19,190 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-11-23 11:57:19,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:57:19,191 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-11-23 11:57:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:57:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 96 transitions. [2018-11-23 11:57:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:57:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 96 transitions. [2018-11-23 11:57:19,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 96 transitions. [2018-11-23 11:57:19,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:19,295 INFO L225 Difference]: With dead ends: 119 [2018-11-23 11:57:19,295 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 11:57:19,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:57:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 11:57:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-23 11:57:19,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:19,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2018-11-23 11:57:19,401 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-23 11:57:19,401 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-23 11:57:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:19,402 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-23 11:57:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-23 11:57:19,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:19,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:19,403 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-23 11:57:19,403 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-23 11:57:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:19,404 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-23 11:57:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-23 11:57:19,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:19,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:19,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:19,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 11:57:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-11-23 11:57:19,405 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 71 [2018-11-23 11:57:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:19,405 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-11-23 11:57:19,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:57:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-23 11:57:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 11:57:19,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:19,406 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:19,407 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:19,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1964885147, now seen corresponding path program 29 times [2018-11-23 11:57:19,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:19,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:19,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:19,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:19,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:21,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {13717#true} call ULTIMATE.init(); {13717#true} is VALID [2018-11-23 11:57:21,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {13717#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13717#true} is VALID [2018-11-23 11:57:21,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {13717#true} assume true; {13717#true} is VALID [2018-11-23 11:57:21,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13717#true} {13717#true} #61#return; {13717#true} is VALID [2018-11-23 11:57:21,933 INFO L256 TraceCheckUtils]: 4: Hoare triple {13717#true} call #t~ret2 := main(); {13717#true} is VALID [2018-11-23 11:57:21,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {13717#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13719#(= main_~i~0 0)} is VALID [2018-11-23 11:57:21,935 INFO L273 TraceCheckUtils]: 6: Hoare triple {13719#(= 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; {13720#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:21,936 INFO L273 TraceCheckUtils]: 7: Hoare triple {13720#(<= 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; {13721#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:21,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {13721#(<= 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; {13722#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:21,937 INFO L273 TraceCheckUtils]: 9: Hoare triple {13722#(<= 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; {13723#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:21,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {13723#(<= 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; {13724#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:21,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {13724#(<= 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; {13725#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:21,939 INFO L273 TraceCheckUtils]: 12: Hoare triple {13725#(<= 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; {13726#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:21,940 INFO L273 TraceCheckUtils]: 13: Hoare triple {13726#(<= 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; {13727#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:21,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {13727#(<= 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; {13728#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:21,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {13728#(<= 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; {13729#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:21,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {13729#(<= 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; {13730#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:21,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {13730#(<= 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; {13731#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:21,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {13731#(<= 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; {13732#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:21,945 INFO L273 TraceCheckUtils]: 19: Hoare triple {13732#(<= 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; {13733#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:21,946 INFO L273 TraceCheckUtils]: 20: Hoare triple {13733#(<= 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; {13734#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:21,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {13734#(<= 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; {13735#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:21,948 INFO L273 TraceCheckUtils]: 22: Hoare triple {13735#(<= 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; {13736#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:21,949 INFO L273 TraceCheckUtils]: 23: Hoare triple {13736#(<= 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; {13737#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:21,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {13737#(<= 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; {13738#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:21,951 INFO L273 TraceCheckUtils]: 25: Hoare triple {13738#(<= 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; {13739#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:21,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {13739#(<= 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; {13740#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:21,953 INFO L273 TraceCheckUtils]: 27: Hoare triple {13740#(<= 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; {13741#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:21,954 INFO L273 TraceCheckUtils]: 28: Hoare triple {13741#(<= 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; {13742#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:21,955 INFO L273 TraceCheckUtils]: 29: Hoare triple {13742#(<= 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; {13743#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:21,956 INFO L273 TraceCheckUtils]: 30: Hoare triple {13743#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13744#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:21,957 INFO L273 TraceCheckUtils]: 31: Hoare triple {13744#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13745#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:21,957 INFO L273 TraceCheckUtils]: 32: Hoare triple {13745#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13746#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:21,958 INFO L273 TraceCheckUtils]: 33: Hoare triple {13746#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13747#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:21,959 INFO L273 TraceCheckUtils]: 34: Hoare triple {13747#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13748#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:21,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {13748#(<= main_~i~0 29)} assume !(~i~0 < 100000); {13718#false} is VALID [2018-11-23 11:57:21,960 INFO L273 TraceCheckUtils]: 36: Hoare triple {13718#false} ~i~0 := 0; {13718#false} is VALID [2018-11-23 11:57:21,961 INFO L273 TraceCheckUtils]: 37: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,961 INFO L273 TraceCheckUtils]: 38: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,961 INFO L273 TraceCheckUtils]: 39: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,961 INFO L273 TraceCheckUtils]: 40: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,961 INFO L273 TraceCheckUtils]: 41: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,961 INFO L273 TraceCheckUtils]: 42: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,962 INFO L273 TraceCheckUtils]: 43: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,962 INFO L273 TraceCheckUtils]: 44: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,962 INFO L273 TraceCheckUtils]: 45: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,962 INFO L273 TraceCheckUtils]: 46: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,962 INFO L273 TraceCheckUtils]: 47: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,963 INFO L273 TraceCheckUtils]: 48: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,963 INFO L273 TraceCheckUtils]: 49: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,963 INFO L273 TraceCheckUtils]: 50: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,963 INFO L273 TraceCheckUtils]: 51: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,963 INFO L273 TraceCheckUtils]: 52: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,964 INFO L273 TraceCheckUtils]: 53: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,964 INFO L273 TraceCheckUtils]: 54: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,964 INFO L273 TraceCheckUtils]: 55: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,964 INFO L273 TraceCheckUtils]: 56: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,964 INFO L273 TraceCheckUtils]: 57: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,965 INFO L273 TraceCheckUtils]: 58: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,965 INFO L273 TraceCheckUtils]: 59: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,965 INFO L273 TraceCheckUtils]: 60: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,965 INFO L273 TraceCheckUtils]: 61: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,965 INFO L273 TraceCheckUtils]: 62: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,965 INFO L273 TraceCheckUtils]: 63: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,965 INFO L273 TraceCheckUtils]: 64: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,965 INFO L273 TraceCheckUtils]: 65: Hoare triple {13718#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13718#false} is VALID [2018-11-23 11:57:21,965 INFO L273 TraceCheckUtils]: 66: Hoare triple {13718#false} assume !(~i~0 < 100000); {13718#false} is VALID [2018-11-23 11:57:21,966 INFO L273 TraceCheckUtils]: 67: Hoare triple {13718#false} havoc ~x~0;~x~0 := 0; {13718#false} is VALID [2018-11-23 11:57:21,966 INFO L273 TraceCheckUtils]: 68: Hoare triple {13718#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13718#false} is VALID [2018-11-23 11:57:21,966 INFO L256 TraceCheckUtils]: 69: Hoare triple {13718#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {13718#false} is VALID [2018-11-23 11:57:21,966 INFO L273 TraceCheckUtils]: 70: Hoare triple {13718#false} ~cond := #in~cond; {13718#false} is VALID [2018-11-23 11:57:21,966 INFO L273 TraceCheckUtils]: 71: Hoare triple {13718#false} assume 0 == ~cond; {13718#false} is VALID [2018-11-23 11:57:21,966 INFO L273 TraceCheckUtils]: 72: Hoare triple {13718#false} assume !false; {13718#false} is VALID [2018-11-23 11:57:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-23 11:57:21,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:21,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:21,978 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1